/civetweb-2.7.6/src/third_party/lua-5.1.5/src/ |
D | print.c | 26 size_t i,n=ts->tsv.len; in PrintString() 37 case '\f': printf("\\f"); break; in PrintString() 51 static void PrintConstant(const Proto* f, int i) in PrintConstant() argument 53 const TValue* o=&f->k[i]; in PrintConstant() 74 static void PrintCode(const Proto* f) in PrintCode() argument 76 const Instruction* code=f->code; in PrintCode() 77 int pc,n=f->sizecode; in PrintCode() 87 int line=getline(f,pc); in PrintCode() 89 if (line>0) printf("[%d]\t",line); else printf("[-]\t"); in PrintCode() 90 printf("%-9s\t",luaP_opnames[o]); in PrintCode() [all …]
|
D | lundump.c | 38 luaO_pushfstring(S->L,"%s: %s in precompiled chunk",S->name,why); in error() 39 luaD_throw(S->L,LUA_ERRSYNTAX); in error() 50 size_t r=luaZ_read(S->Z,b,size); in LoadBlock() 84 char* s=luaZ_openspace(S->L,S->b,size); in LoadString() 86 return luaS_newlstr(S->L,s,size-1); /* remove trailing '\0' */ in LoadString() 90 static void LoadCode(LoadState* S, Proto* f) in LoadCode() argument 93 f->code=luaM_newvector(S->L,n,Instruction); in LoadCode() 94 f->sizecode=n; in LoadCode() 95 LoadVector(S,f->code,n,sizeof(Instruction)); in LoadCode() 100 static void LoadConstants(LoadState* S, Proto* f) in LoadConstants() argument [all …]
|
D | lfunc.c | 26 c->c.isC = 1; in luaF_newCclosure() 27 c->c.env = e; in luaF_newCclosure() 28 c->c.nupvalues = cast_byte(nelems); in luaF_newCclosure() 36 c->l.isC = 0; in luaF_newLclosure() 37 c->l.env = e; in luaF_newLclosure() 38 c->l.nupvalues = cast_byte(nelems); in luaF_newLclosure() 39 while (nelems--) c->l.upvals[nelems] = NULL; in luaF_newLclosure() 47 uv->v = &uv->u.value; in luaF_newupval() 48 setnilvalue(uv->v); in luaF_newupval() 55 GCObject **pp = &L->openupval; in luaF_findupval() [all …]
|
D | ldump.c | 31 if (D->status==0) in DumpBlock() 33 lua_unlock(D->L); in DumpBlock() 34 D->status=(*D->writer)(D->L,b,size,D->data); in DumpBlock() 35 lua_lock(D->L); in DumpBlock() 70 size_t size=s->tsv.len+1; /* include trailing '\0' */ in DumpString() 76 #define DumpCode(f,D) DumpVector(f->code,f->sizecode,sizeof(Instruction),D) argument 78 static void DumpFunction(const Proto* f, const TString* p, DumpState* D); 80 static void DumpConstants(const Proto* f, DumpState* D) in DumpConstants() argument 82 int i,n=f->sizek; in DumpConstants() 86 const TValue* o=&f->k[i]; in DumpConstants() [all …]
|
D | lparser.c | 32 #define getlocvar(fs, i) ((fs)->f->locvars[(fs)->actvar[i]]) 51 ** prototypes for recursive non-terminal functions 58 if (ls->t.token == TK_NAME || ls->t.token == TK_STRING) { in anchor_token() 59 TString *ts = ls->t.seminfo.ts; in anchor_token() 60 luaX_newstring(ls, getstr(ts), ts->tsv.len); in anchor_token() 67 luaO_pushfstring(ls->L, LUA_QS " expected", luaX_token2str(ls, token))); in error_expected() 72 const char *msg = (fs->f->linedefined == 0) ? in errorlimit() 73 luaO_pushfstring(fs->L, "main function has more than %d %s", limit, what) : in errorlimit() 74 luaO_pushfstring(fs->L, "function at line %d has more than %d %s", in errorlimit() 75 fs->f->linedefined, limit, what); in errorlimit() [all …]
|
D | liolib.c | 50 luaL_argerror(L, arg, lua_tostring(L, -1)); in fileerror() 62 if (ud == NULL || !lua_getmetatable(L, 1) || !lua_rawequal(L, -2, -1)) in io_type() 73 FILE **f = tofilep(L); in tofile() local 74 if (*f == NULL) in tofile() 76 return *f; in tofile() 90 lua_setmetatable(L, -2); in newfile() 129 lua_getfield(L, -1, "__close"); in aux_close() 130 return (lua_tocfunction(L, -1))(L); in aux_close() 143 FILE *f = *tofilep(L); in io_gc() local 145 if (f != NULL) in io_gc() [all …]
|
D | lcode.c | 27 #define hasjumps(e) ((e)->t != (e)->f) 31 return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP); in isnumeral() 37 if (fs->pc > fs->lasttarget) { /* no jumps to current position? */ in luaK_nil() 38 if (fs->pc == 0) { /* function start? */ in luaK_nil() 39 if (from >= fs->nactvar) in luaK_nil() 43 previous = &fs->f->code[fs->pc-1]; in luaK_nil() 48 if (from+n-1 > pto) in luaK_nil() 49 SETARG_B(*previous, from+n-1); in luaK_nil() 55 luaK_codeABC(fs, OP_LOADNIL, from, from+n-1, 0); /* else no optimization */ in luaK_nil() 60 int jpc = fs->jpc; /* save list of jumps to here */ in luaK_jump() [all …]
|
D | luac.c | 50 if (*message=='-') in usage() 57 " - process stdin\n" in usage() 58 " -l list\n" in usage() 59 " -o name output to file " LUA_QL("name") " (default is \"%s\")\n" in usage() 60 " -p parse only\n" in usage() 61 " -s strip debug information\n" in usage() 62 " -v show version information\n" in usage() 63 " -- stop handling options\n", in usage() 77 if (*argv[i]!='-') /* end of options; keep it */ in doargs() 79 else if (IS("--")) /* end of options; skip it */ in doargs() [all …]
|
/civetweb-2.7.6/src/third_party/lua-5.3.5/src/ |
D | lfunc.c | 28 c->nupvalues = cast_byte(n); in luaF_newCclosure() 36 c->p = NULL; in luaF_newLclosure() 37 c->nupvalues = cast_byte(n); in luaF_newLclosure() 38 while (n--) c->upvals[n] = NULL; in luaF_newLclosure() 47 for (i = 0; i < cl->nupvalues; i++) { in luaF_initupvals() 49 uv->refcount = 1; in luaF_initupvals() 50 uv->v = &uv->u.value; /* make it closed */ in luaF_initupvals() 51 setnilvalue(uv->v); in luaF_initupvals() 52 cl->upvals[i] = uv; in luaF_initupvals() 58 UpVal **pp = &L->openupval; in luaF_findupval() [all …]
|
D | lundump.c | 28 #define luai_verifycode(L,b,f) /* empty */ argument 40 luaO_pushfstring(S->L, "%s: %s precompiled chunk", S->name, why); in error() 41 luaD_throw(S->L, LUA_ERRSYNTAX); in error() 46 ** All high-level loads go through LoadVector; you can change it to 52 if (luaZ_read(S->Z, b, size) != 0) in LoadBlock() 94 else if (--size <= LUAI_MAXSHORTLEN) { /* short string? */ in LoadString() 97 return luaS_newlstr(S->L, buff, size); in LoadString() 100 TString *ts = luaS_createlngstrobj(S->L, size); in LoadString() 107 static void LoadCode (LoadState *S, Proto *f) { in LoadCode() argument 109 f->code = luaM_newvector(S->L, n, Instruction); in LoadCode() [all …]
|
D | luac.c | 25 static void PrintFunction(const Proto* f, int full); 52 if (*message=='-') in usage() 59 " -l list (use -l -l for full listing)\n" in usage() 60 " -o name output to file 'name' (default is \"%s\")\n" in usage() 61 " -p parse only\n" in usage() 62 " -s strip debug information\n" in usage() 63 " -v show version information\n" in usage() 64 " -- stop handling options\n" in usage() 65 " - stop handling options and process stdin\n" in usage() 79 if (*argv[i]!='-') /* end of options; keep it */ in doargs() [all …]
|
D | ldump.c | 32 ** All high-level dumps go through DumpVector; you can change it to 37 #define DumpLiteral(s,D) DumpBlock(s, sizeof(s) - sizeof(char), D) 41 if (D->status == 0 && size > 0) { in DumpBlock() 42 lua_unlock(D->L); in DumpBlock() 43 D->status = (*D->writer)(D->L, b, size, D->data); in DumpBlock() 44 lua_lock(D->L); in DumpBlock() 85 DumpVector(str, size - 1, D); /* no need to save '\0' */ in DumpString() 90 static void DumpCode (const Proto *f, DumpState *D) { in DumpCode() argument 91 DumpInt(f->sizecode, D); in DumpCode() 92 DumpVector(f->code, f->sizecode, D); in DumpCode() [all …]
|
D | liolib.c | 74 #define l_pclose(L,file) ((void)L, (void)file, -1) 86 #define l_getc(f) getc_unlocked(f) argument 87 #define l_lockfile(f) flockfile(f) argument 88 #define l_unlockfile(f) funlockfile(f) argument 90 #define l_getc(f) getc(f) argument 91 #define l_lockfile(f) ((void)0) argument 92 #define l_unlockfile(f) ((void)0) argument 110 #define l_fseek(f,o,w) fseeko(f,o,w) argument 111 #define l_ftell(f) ftello(f) argument 118 #define l_fseek(f,o,w) _fseeki64(f,o,w) argument [all …]
|
D | lparser.c | 60 ** prototypes for recursive non-terminal functions 68 ls->t.token = 0; /* remove "near <token>" from final message */ in semerror() 75 luaO_pushfstring(ls->L, "%s expected", luaX_token2str(ls, token))); in error_expected() 80 lua_State *L = fs->ls->L; in errorlimit() 82 int line = fs->f->linedefined; in errorlimit() 88 luaX_syntaxerror(fs->ls, msg); in errorlimit() 98 if (ls->t.token == c) { in testnext() 107 if (ls->t.token != c) in check() 124 if (where == ls->linenumber) in check_match() 127 luaX_syntaxerror(ls, luaO_pushfstring(ls->L, in check_match() [all …]
|
D | lcode.c | 36 #define hasjumps(e) ((e)->t != (e)->f) 46 switch (e->k) { in tonumeral() 48 if (v) setivalue(v, e->u.ival); in tonumeral() 51 if (v) setfltvalue(v, e->u.nval); in tonumeral() 66 int l = from + n - 1; /* last register to set nil */ in luaK_nil() 67 if (fs->pc > fs->lasttarget) { /* no jumps to current position? */ in luaK_nil() 68 previous = &fs->f->code[fs->pc-1]; in luaK_nil() 77 SETARG_B(*previous, l - from); in luaK_nil() 82 luaK_codeABC(fs, OP_LOADNIL, from, n - 1, 0); /* else no optimization */ in luaK_nil() 91 int offset = GETARG_sBx(fs->f->code[pc]); in getjump() [all …]
|
/civetweb-2.7.6/src/third_party/lua-5.2.4/src/ |
D | luac.c | 22 static void PrintFunction(const Proto* f, int full); 49 if (*message=='-') in usage() 56 " -l list (use -l -l for full listing)\n" in usage() 57 " -o name output to file " LUA_QL("name") " (default is \"%s\")\n" in usage() 58 " -p parse only\n" in usage() 59 " -s strip debug information\n" in usage() 60 " -v show version information\n" in usage() 61 " -- stop handling options\n" in usage() 62 " - stop handling options and process stdin\n" in usage() 76 if (*argv[i]!='-') /* end of options; keep it */ in doargs() [all …]
|
D | lfunc.c | 24 Closure *c = &luaC_newobj(L, LUA_TCCL, sizeCclosure(n), NULL, 0)->cl; in luaF_newCclosure() 25 c->c.nupvalues = cast_byte(n); in luaF_newCclosure() 31 Closure *c = &luaC_newobj(L, LUA_TLCL, sizeLclosure(n), NULL, 0)->cl; in luaF_newLclosure() 32 c->l.p = NULL; in luaF_newLclosure() 33 c->l.nupvalues = cast_byte(n); in luaF_newLclosure() 34 while (n--) c->l.upvals[n] = NULL; in luaF_newLclosure() 40 UpVal *uv = &luaC_newobj(L, LUA_TUPVAL, sizeof(UpVal), NULL, 0)->uv; in luaF_newupval() 41 uv->v = &uv->u.value; in luaF_newupval() 42 setnilvalue(uv->v); in luaF_newupval() 49 GCObject **pp = &L->openupval; in luaF_findupval() [all …]
|
D | lundump.c | 32 luaO_pushfstring(S->L,"%s: %s precompiled chunk",S->name,why); in error() 33 luaD_throw(S->L,LUA_ERRSYNTAX); in error() 42 #define luai_verifycode(L,b,f) /* empty */ argument 47 if (luaZ_read(S->Z,b,size)!=0) error(S,"truncated"); in LoadBlock() 80 char* s=luaZ_openspace(S->L,S->b,size); in LoadString() 82 return luaS_newlstr(S->L,s,size-1); /* remove trailing '\0' */ in LoadString() 86 static void LoadCode(LoadState* S, Proto* f) in LoadCode() argument 89 f->code=luaM_newvector(S->L,n,Instruction); in LoadCode() 90 f->sizecode=n; in LoadCode() 91 LoadVector(S,f->code,n,sizeof(Instruction)); in LoadCode() [all …]
|
D | ldump.c | 31 if (D->status==0) in DumpBlock() 33 lua_unlock(D->L); in DumpBlock() 34 D->status=(*D->writer)(D->L,b,size,D->data); in DumpBlock() 35 lua_lock(D->L); in DumpBlock() 70 size_t size=s->tsv.len+1; /* include trailing '\0' */ in DumpString() 76 #define DumpCode(f,D) DumpVector(f->code,f->sizecode,sizeof(Instruction),D) argument 78 static void DumpFunction(const Proto* f, DumpState* D); 80 static void DumpConstants(const Proto* f, DumpState* D) in DumpConstants() argument 82 int i,n=f->sizek; in DumpConstants() 86 const TValue* o=&f->k[i]; in DumpConstants() [all …]
|
D | liolib.c | 10 ** should not affect non-POSIX systems 71 #define lua_pclose(L,file) ((void)((void)L, file), -1) 91 #define l_fseek(f,o,w) fseeko(f,o,w) argument 92 #define l_ftell(f) ftello(f) argument 99 #define l_fseek(f,o,w) _fseeki64(f,o,w) argument 100 #define l_ftell(f) _ftelli64(f) argument 109 #define l_fseek(f,o,w) fseek(f,o,w) argument 110 #define l_ftell(f) ftell(f) argument 127 #define isclosed(p) ((p)->closef == NULL) 149 lua_pushfstring(L, "file (%p)", p->f); in f_tostring() [all …]
|
D | lparser.c | 54 ** prototypes for recursive non-terminal functions 62 lua_assert(ls->fs != NULL || ls->t.token == TK_EOS); in anchor_token() 63 if (ls->t.token == TK_NAME || ls->t.token == TK_STRING) { in anchor_token() 64 TString *ts = ls->t.seminfo.ts; in anchor_token() 65 luaX_newstring(ls, getstr(ts), ts->tsv.len); in anchor_token() 72 ls->t.token = 0; /* remove 'near to' from final message */ in semerror() 79 luaO_pushfstring(ls->L, "%s expected", luaX_token2str(ls, token))); in error_expected() 84 lua_State *L = fs->ls->L; in errorlimit() 86 int line = fs->f->linedefined; in errorlimit() 92 luaX_syntaxerror(fs->ls, msg); in errorlimit() [all …]
|
D | lcode.c | 29 #define hasjumps(e) ((e)->t != (e)->f) 33 return (e->k == VKNUM && e->t == NO_JUMP && e->f == NO_JUMP); in isnumeral() 39 int l = from + n - 1; /* last register to set nil */ in luaK_nil() 40 if (fs->pc > fs->lasttarget) { /* no jumps to current position? */ in luaK_nil() 41 previous = &fs->f->code[fs->pc-1]; in luaK_nil() 50 SETARG_B(*previous, l - from); in luaK_nil() 55 luaK_codeABC(fs, OP_LOADNIL, from, n - 1, 0); /* else no optimization */ in luaK_nil() 60 int jpc = fs->jpc; /* save list of jumps to here */ in luaK_jump() 62 fs->jpc = NO_JUMP; in luaK_jump() 81 Instruction *jmp = &fs->f->code[pc]; in fixjump() [all …]
|
/civetweb-2.7.6/examples/_obsolete/docroot/ |
D | jquery.js | 14 * Date: Sat Feb 13 22:33:48 2010 -0500 16 …d,f,e,j){var i=a.length;if(typeof b==="object"){for(var o in b)X(a,o,b[o],f,e,d);return a}if(d!==w… argument 17 …f=[],e=arguments,j,i,o,k,n,r;i=c.data(this,"events");if(!(a.liveFired===this||!i||!i.live||a.butto… 18 …lector){o=j[n].elem;f=null;if(i.preType==="mouseenter"||i.preType==="mouseleave")f=c(a.relatedTarg… 19 …f=c.data(a[d++]),e=c.data(this,f);if(f=f&&f.events){delete e.handle;e.events={};for(var j in f)for… variable 20 …f=j}if(!f){f=b.createDocumentFragment();c.clean(a,b,f,d)}if(e)c.fragments[a[0]]=j?f:1;return{fragm… 21 …slice,ya=Array.prototype.indexOf;c.fn=c.prototype={init:function(a,b){var d,f;if(!a)return this;if… variable 22 …f=b?b.ownerDocument||b:s;if(a=Xa.exec(a))if(c.isPlainObject(b)){a=[s.createElement(a[1])];c.fn.att… 23 …)[0]:this[a]},pushStack:function(a,b,d){var f=c();c.isArray(a)?ba.apply(f,a):c.merge(f,a);f.prevOb… variable 24 …f.selector=this.selector+(this.selector?" ":"")+d;else if(b)f.selector=this.selector+"."+b+"("+d+"… [all …]
|
/civetweb-2.7.6/src/third_party/lua-5.1.5/test/ |
D | bisect.lua | 1 -- bisection method for solving non-linear equations 3 delta=1e-6 -- tolerance 5 function bisect(f,a,b,fa,fb) 8 if c==a or c==b or math.abs(a-b)<delta then return c,b-a end 10 local fc=f(c) 11 if fa*fc<0 then return bisect(f,a,c,fa,fc) else return bisect(f,c,b,fc,fb) end 14 -- find root of f in the inverval [a,b]. needs f(a)*f(b)<0 15 function solve(f,a,b) 17 local z,e=bisect(f,a,b,f(a),f(b)) 18 io.write(string.format("after %d steps, root is %.17g with error %.1e, f=%.1e\n",n,z,e,f(z))) [all …]
|
D | factorial.lua | 1 -- function closures are powerful 3 -- traditional fixed-point operator from functional programming 5 local a = function (f) return f(f) end 6 return a(function (f) 8 local c=f(f) 15 -- factorial without recursion 16 F = function (f) function 19 else return n*f(n-1) end 23 factorial = Y(F) -- factorial is the fixed point of F 25 -- now test it
|