aboutsummaryrefslogtreecommitdiff
path: root/lcode.c
diff options
context:
space:
mode:
authorRoberto Ierusalimschy <roberto@inf.puc-rio.br>2000-05-24 10:54:49 -0300
committerRoberto Ierusalimschy <roberto@inf.puc-rio.br>2000-05-24 10:54:49 -0300
commitef62b340e0a6b7b18931000dcbb19c4703bfe0e8 (patch)
treed9d995116a8a686b798d1b625b06ead26f28ba58 /lcode.c
parent5c2dd7a9e0a5b871a71ba66c4683cd88fe4f5aa4 (diff)
downloadlua-ef62b340e0a6b7b18931000dcbb19c4703bfe0e8.tar.gz
lua-ef62b340e0a6b7b18931000dcbb19c4703bfe0e8.tar.bz2
lua-ef62b340e0a6b7b18931000dcbb19c4703bfe0e8.zip
code cleaner for 16 bits.
Diffstat (limited to 'lcode.c')
-rw-r--r--lcode.c8
1 files changed, 5 insertions, 3 deletions
diff --git a/lcode.c b/lcode.c
index 8ca482ec..8577824b 100644
--- a/lcode.c
+++ b/lcode.c
@@ -1,5 +1,5 @@
1/* 1/*
2** $Id: lcode.c,v 1.30 2000/05/15 19:48:04 roberto Exp roberto $ 2** $Id: lcode.c,v 1.31 2000/05/22 18:44:46 roberto Exp roberto $
3** Code generator for Lua 3** Code generator for Lua
4** See Copyright Notice in lua.h 4** See Copyright Notice in lua.h
5*/ 5*/
@@ -107,7 +107,8 @@ static int real_constant (FuncState *fs, Number r) {
107 while (--c >= lim) 107 while (--c >= lim)
108 if (f->knum[c] == r) return c; 108 if (f->knum[c] == r) return c;
109 /* not found; create a new entry */ 109 /* not found; create a new entry */
110 luaM_growvector(fs->L, f->knum, f->nknum, 1, Number, constantEM, MAXARG_U); 110 luaM_growvector(fs->L, f->knum, f->nknum, 1, Number,
111 "constant table overflow", MAXARG_U);
111 c = f->nknum++; 112 c = f->nknum++;
112 f->knum[c] = r; 113 f->knum[c] = r;
113 return c; 114 return c;
@@ -567,7 +568,8 @@ int luaK_code2 (FuncState *fs, OpCode o, int arg1, int arg2) {
567 case iAB: i = CREATE_AB(o, arg1, arg2); break; 568 case iAB: i = CREATE_AB(o, arg1, arg2); break;
568 } 569 }
569 /* actually create the new instruction */ 570 /* actually create the new instruction */
570 luaM_growvector(fs->L, fs->f->code, fs->pc, 1, Instruction, codeEM, MAX_INT); 571 luaM_growvector(fs->L, fs->f->code, fs->pc, 1, Instruction,
572 "code size overflow", MAX_INT);
571 fs->f->code[fs->pc] = i; 573 fs->f->code[fs->pc] = i;
572 return fs->pc++; 574 return fs->pc++;
573} 575}