Home
last modified time | relevance | path

Searched refs:top (Results 1 – 25 of 258) sorted by relevance

1234567891011

/l4re-core-master/lua/lib/contrib/src/
A Dlapi.c114 if (res && ci->top < L->top + n) in lua_checkstack()
115 ci->top = L->top + n; /* adjust frame top */ in lua_checkstack()
127 api_check(from, to->ci->top - to->top >= n, "stack overflow"); in lua_xmove()
130 setobjs2s(to, to->top, from->top + i); in lua_xmove()
335 setobjs2s(L, L->top, L->top - 1); in lua_arith()
339 luaO_arith(L, op, s2v(L->top - 2), s2v(L->top - 1), L->top - 2); in lua_arith()
898 L->top -= n; in aux_rawset()
922 L->top--; in lua_rawseti()
961 L->top--; in lua_setmetatable()
981 L->top--; in lua_setiuservalue()
[all …]
A Dltm.c105 StkId func = L->top; in luaT_callTM()
110 L->top = func + 4; in luaT_callTM()
122 StkId func = L->top; in luaT_callTMres()
126 L->top += 3; in luaT_callTMres()
168 StkId top = L->top; in luaT_tryconcatTM() local
169 if (l_unlikely(!callbinTM(L, s2v(top - 2), s2v(top - 1), top - 2, in luaT_tryconcatTM()
171 luaG_concaterror(L, s2v(top - 2), s2v(top - 1)); in luaT_tryconcatTM()
204 return !l_isfalse(s2v(L->top)); in luaT_callorderTM()
246 setobjs2s(L, L->top++, ci->func); in luaT_adjustvarargs()
253 ci->top += actual + 1; in luaT_adjustvarargs()
[all …]
A Dlapi.h16 #define api_incr_top(L) {L->top++; api_check(L, L->top <= L->ci->top, \
26 { if ((nres) <= LUA_MULTRET && L->ci->top < L->top) L->ci->top = L->top; }
30 #define api_checknelems(L,n) api_check(L, (n) < (L->top - L->ci->func), \
A Dldo.c163 L->top = (L->top - oldstack) + newstack; in correctstack()
168 ci->top = (ci->top - oldstack) + newstack; in correctstack()
255 if (lim < ci->top) lim = ci->top; in stackinuse()
295 L->top++; in luaD_inctop()
323 if (isLua(ci) && L->top < ci->top) in luaD_hook()
324 L->top = ci->top; /* protect entire activation register */ in luaD_hook()
326 if (ci->top < L->top + LUA_MINSTACK) in luaD_hook()
327 ci->top = L->top + LUA_MINSTACK; in luaD_hook()
336 L->top = restorestack(L, top); in luaD_hook()
524 ci->top = L->top + LUA_MINSTACK; in luaD_precall()
[all …]
A Dlvm.c642 StkId top = L->top; in luaV_concat() local
644 if (!(ttisstring(s2v(top - 2)) || cvt2str(s2v(top - 2))) || in luaV_concat()
650 setobjs2s(L, top - 2, top - 1); /* result is second op. */ in luaV_concat()
829 L->top--; in luaV_finishOp()
845 setobjs2s(L, top - 2, top); /* put TM result in proper position */ in luaV_finishOp()
846 L->top = top - 1; /* top is one after last element (at top-2) */ in luaV_finishOp()
1089 #define savestate(L,ci) (savepc(L), L->top = ci->top)
1162 lua_assert(base <= L->top && L->top < L->stack_last); in luaV_execute()
1673 if (L->top < ci->top) in luaV_execute()
1674 L->top = ci->top; in luaV_execute()
[all …]
A Dlfunc.c109 StkId top = L->top; in callclosemethod() local
111 setobj2s(L, top, tm); /* will call metamethod... */ in callclosemethod()
112 setobj2s(L, top + 1, obj); /* with 'self' as the 1st argument */ in callclosemethod()
113 setobj2s(L, top + 2, err); /* and error msg. as 2nd argument */ in callclosemethod()
114 L->top = top + 3; /* add function and arguments */ in callclosemethod()
116 luaD_call(L, top, 0); in callclosemethod()
118 luaD_callnoyield(L, top, 0); in callclosemethod()
199 lua_assert(uplevel(uv) < L->top); in luaF_closeupval()
A Dldebug.c233 setobjs2s(L, L->top, pos); in lua_getlocal()
248 setobjs2s(L, pos, L->top - 1); in lua_setlocal()
249 L->top--; /* pop value */ in lua_setlocal()
292 setnilvalue(s2v(L->top)); in collectvalidlines()
390 func = s2v(L->top - 1); in lua_getinfo()
393 L->top--; /* pop function */ in lua_getinfo()
403 setobj2s(L, L->top, func); in lua_getinfo()
651 for (pos = ci->func + 1; pos < ci->top; pos++) { in isinstack()
769 setobjs2s(L, L->top, L->top - 1); /* move argument */ in luaG_errormsg()
771 L->top++; /* assume EXTRA_STACK */ in luaG_errormsg()
[all …]
A Dlstate.c187 L1->top = L1->stack; in stack_init()
193 ci->func = L1->top; in stack_init()
196 setnilvalue(s2v(L1->top)); /* 'function' entry for this 'ci' */ in stack_init()
197 L1->top++; in stack_init()
198 ci->top = L1->top + LUA_MINSTACK; in stack_init()
299 setthvalue2s(L, L->top, L1); in lua_newthread()
337 L->top = L->stack + 1; in luaE_resetthread()
338 ci->top = L->top + LUA_MINSTACK; in luaE_resetthread()
340 luaD_reallocstack(L, cast_int(ci->top - L->stack), 0); in luaE_resetthread()
428 TValue *errobj = s2v(L->top - 1); /* error object */ in luaE_warnerror()
/l4re-core-master/uclibc/lib/contrib/uclibc/libc/stdlib/malloc-standard/
A Dfree.c38 top_size = chunksize(av->top); in __malloc_trim()
50 if (current_brk == (char*)(av->top) + top_size) { in __malloc_trim()
71 set_head(av->top, (top_size - released) | PREV_INUSE); in __malloc_trim()
146 av->top = initial_top(av); in malloc_init_state()
228 if (nextchunk != av->top) { in __malloc_consolidate()
250 av->top = p; in __malloc_consolidate()
301 && (chunk_at_offset(p, size) != av->top) in free()
329 if (nextchunk != av->top) { in free()
367 av->top = p; in free()
388 if ((unsigned long)(chunksize(av->top)) >= in free()
A Dmalloc.c70 char* max_address = (char*)(av->top) + chunksize(av->top); in __do_check_chunk()
78 if (p != av->top) { in __do_check_chunk()
164 if (next == av->top) { in __do_check_inuse_chunk()
242 if (av->top == 0 || av->top == initial_top(av)) in __do_check_malloc_state()
309 (q != av->top && inuse(q) && in __do_check_malloc_state()
317 __do_check_chunk(av->top); in __do_check_malloc_state()
452 old_top = av->top; in __malloc_alloc()
730 p = av->top; in __malloc_alloc()
737 av->top = remainder; in __malloc_alloc()
1145 victim = av->top; in malloc()
[all …]
A Dmallinfo.c37 if (av->top == 0) { in mallinfo()
44 avail = chunksize(av->top); in mallinfo()
77 mi.keepcost = chunksize(av->top); in mallinfo()
A Drealloc.c78 if (next == av->top && in realloc()
82 av->top = chunk_at_offset(oldp, nb); in realloc()
83 set_head(av->top, (newsize - nb) | PREV_INUSE); in realloc()
89 else if (next != av->top && in realloc()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/src/filesystem/
A Dstd-dir.cc196 if (ecptr ? sp->top().advance(*ecptr) : sp->top().advance()) in recursive_directory_iterator()
230 return _M_dirs->top().entry; in operator *()
266 auto& top = _M_dirs->top(); in increment() local
268 if (std::exchange(_M_pending, true) && top.should_recurse(follow, ec)) in increment()
270 _Dir dir(top.entry.path(), skip_permission_denied, ec); in increment()
280 while (!_M_dirs->top().advance(skip_permission_denied, ec) && !ec) in increment()
312 } while (!_M_dirs->top().advance(skip_permission_denied, ec)); in pop()
A Ddir.cc193 if (ecptr ? sp->top().advance(*ecptr) : sp->top().advance()) in recursive_directory_iterator()
227 return _M_dirs->top().entry; in operator *()
263 auto& top = _M_dirs->top(); in increment() local
265 if (std::exchange(_M_pending, true) && top.should_recurse(follow, ec)) in increment()
267 _Dir dir(top.entry.path(), skip_permission_denied, ec); in increment()
277 while (!_M_dirs->top().advance(skip_permission_denied, ec) && !ec) in increment()
309 } while (!_M_dirs->top().advance(skip_permission_denied, ec)); in pop()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/src/filesystem/
A Ddir.cc199 if (ecptr ? sp->top().advance(*ecptr) : sp->top().advance()) in recursive_directory_iterator()
233 return _M_dirs->top().entry; in operator *()
269 auto& top = _M_dirs->top(); in increment() local
271 if (std::exchange(_M_pending, true) && top.should_recurse(follow, ec)) in increment()
273 _Dir dir(top.entry.path(), skip_permission_denied, ec); in increment()
283 while (!_M_dirs->top().advance(skip_permission_denied, ec) && !ec) in increment()
315 } while (!_M_dirs->top().advance(skip_permission_denied, ec)); in pop()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/src/filesystem/
A Ddir.cc199 if (ecptr ? sp->top().advance(*ecptr) : sp->top().advance()) in recursive_directory_iterator()
233 return _M_dirs->top().entry; in operator *()
269 auto& top = _M_dirs->top(); in increment() local
271 if (std::exchange(_M_pending, true) && top.should_recurse(follow, ec)) in increment()
273 _Dir dir(top.entry.path(), skip_permission_denied, ec); in increment()
283 while (!_M_dirs->top().advance(skip_permission_denied, ec) && !ec) in increment()
315 } while (!_M_dirs->top().advance(skip_permission_denied, ec)); in pop()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/src/filesystem/
A Ddir.cc199 if (ecptr ? sp->top().advance(*ecptr) : sp->top().advance()) in recursive_directory_iterator()
233 return _M_dirs->top().entry; in operator *()
269 auto& top = _M_dirs->top(); in increment() local
271 if (std::exchange(_M_pending, true) && top.should_recurse(follow, ec)) in increment()
273 _Dir dir(top.entry.path(), skip_permission_denied, ec); in increment()
283 while (!_M_dirs->top().advance(skip_permission_denied, ec) && !ec) in increment()
315 } while (!_M_dirs->top().advance(skip_permission_denied, ec)); in pop()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/src/c++17/
A Dfs_dir.cc204 if (ecptr ? sp->top().advance(*ecptr) : sp->top().advance()) in recursive_directory_iterator()
250 return _M_dirs->top().entry; in operator *()
286 auto& top = _M_dirs->top(); in increment() local
288 if (std::exchange(_M_dirs->pending, true) && top.should_recurse(follow, ec)) in increment()
290 _Dir dir(top.entry.path(), skip_permission_denied, ec); in increment()
300 while (!_M_dirs->top().advance(skip_permission_denied, ec) && !ec) in increment()
332 } while (!_M_dirs->top().advance(skip_permission_denied, ec)); in pop()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/src/c++17/
A Dfs_dir.cc204 if (ecptr ? sp->top().advance(*ecptr) : sp->top().advance()) in recursive_directory_iterator()
250 return _M_dirs->top().entry; in operator *()
286 auto& top = _M_dirs->top(); in increment() local
288 if (std::exchange(_M_dirs->pending, true) && top.should_recurse(follow, ec)) in increment()
290 _Dir dir(top.entry.path(), skip_permission_denied, ec); in increment()
300 while (!_M_dirs->top().advance(skip_permission_denied, ec) && !ec) in increment()
332 } while (!_M_dirs->top().advance(skip_permission_denied, ec)); in pop()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/src/c++17/
A Dfs_dir.cc204 if (ecptr ? sp->top().advance(*ecptr) : sp->top().advance()) in recursive_directory_iterator()
250 return _M_dirs->top().entry; in operator *()
286 auto& top = _M_dirs->top(); in increment() local
288 if (std::exchange(_M_dirs->pending, true) && top.should_recurse(follow, ec)) in increment()
290 _Dir dir(top.entry.path(), skip_permission_denied, ec); in increment()
300 while (!_M_dirs->top().advance(skip_permission_denied, ec) && !ec) in increment()
332 } while (!_M_dirs->top().advance(skip_permission_denied, ec)); in pop()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/src/filesystem/
A Ddir.cc246 if (sp->top().advance(ec)) in recursive_directory_iterator()
280 return _M_dirs->top().entry; in operator *()
340 auto& top = _M_dirs->top(); in increment() local
342 if (std::exchange(_M_pending, true) && recurse(top, _M_options, ec)) in increment()
344 _Dir dir = open_dir(top.entry.path(), _M_options, &ec); in increment()
354 while (!_M_dirs->top().advance(&ec, _M_options) && !ec) in increment()
383 } while (!_M_dirs->top().advance(&ec, _M_options)); in pop()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/src/filesystem/
A Ddir.cc246 if (sp->top().advance(ec)) in recursive_directory_iterator()
280 return _M_dirs->top().entry; in operator *()
340 auto& top = _M_dirs->top(); in increment() local
342 if (std::exchange(_M_pending, true) && recurse(top, _M_options, ec)) in increment()
344 _Dir dir = open_dir(top.entry.path(), _M_options, &ec); in increment()
354 while (!_M_dirs->top().advance(&ec, _M_options) && !ec) in increment()
383 } while (!_M_dirs->top().advance(&ec, _M_options)); in pop()
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/src/filesystem/
A Ddir.cc246 if (sp->top().advance(ec)) in recursive_directory_iterator()
280 return _M_dirs->top().entry; in operator *()
340 auto& top = _M_dirs->top(); in increment() local
342 if (std::exchange(_M_pending, true) && recurse(top, _M_options, ec)) in increment()
344 _Dir dir = open_dir(top.entry.path(), _M_options, &ec); in increment()
354 while (!_M_dirs->top().advance(&ec, _M_options) && !ec) in increment()
383 } while (!_M_dirs->top().advance(&ec, _M_options)); in pop()
/l4re-core-master/uclibc/lib/contrib/uclibc/libc/sysdeps/linux/powerpc/
A Dcrt1.S89 lis r6,_init@ha # load top 16 bits
91 lis r7,_fini@ha # load top 16 bits
93 lis r3,main@ha # load top 16 bits
/l4re-core-master/uclibc/lib/contrib/uclibc/libc/unistd/
A Dgetopt.c203 int top = d->optind; in exchange() local
219 char *new_str = malloc (top + 1); in exchange()
226 '\0', top + 1 - d->__nonoption_flags_max_len); in exchange()
227 d->__nonoption_flags_max_len = top + 1; in exchange()
233 while (top > middle && middle > bottom) in exchange()
235 if (top - middle > middle - bottom) in exchange()
245 argv[bottom + i] = argv[top - (middle - bottom) + i]; in exchange()
246 argv[top - (middle - bottom) + i] = tem; in exchange()
247 SWAP_FLAGS (bottom + i, top - (middle - bottom) + i); in exchange()
250 top -= len; in exchange()
[all …]

Completed in 39 milliseconds

1234567891011