Searched refs:inuse (Results 1 – 12 of 12) sorted by relevance
63 } inuse; member102 return timer && timer->inuse == TIMER_INUSE; in timer_valid()
60 timer->inuse = TIMER_DELETED; in timer_delete()
180 __timer_array[i].inuse = TIMER_FREE; in init_module()551 timer->inuse = TIMER_INUSE; in __timer_alloc()567 timer->inuse = TIMER_FREE; in __timer_dealloc()
63 } inuse; member110 return timer && timer->inuse == TIMER_INUSE; in timer_valid()
60 timer->inuse = TIMER_DELETED;
179 __timer_array[i].inuse = TIMER_FREE; in init_module()546 timer->inuse = TIMER_INUSE; in __timer_alloc()562 timer->inuse = TIMER_FREE; in __timer_dealloc()
116 assert(!inuse(p)); in __do_check_free_chunk()128 assert (next == av->top || inuse(next)); in __do_check_free_chunk()149 assert(inuse(p)); in __do_check_inuse_chunk()168 else if (!inuse(next)) in __do_check_inuse_chunk()309 (q != av->top && inuse(q) && in __do_check_malloc_state()
90 !inuse(next) && in realloc()
561 #define inuse(p)\ macro
275 int inuse = stackinuse(L); in luaD_shrinkstack() local276 int nsize = inuse * 2; /* proposed new size */ in luaD_shrinkstack()277 int max = inuse * 3; /* maximum "reasonable" size */ in luaD_shrinkstack()285 if (inuse <= LUAI_MAXSTACK && stacksize(L) > max) in luaD_shrinkstack()
108 int inuse = cast_int(L->top - L->stack) + EXTRA_STACK; in lua_checkstack() local109 if (inuse > LUAI_MAXSTACK - n) /* can grow without overflow? */ in lua_checkstack()
572 #define inuse(p)\ macro
Completed in 26 milliseconds