93     ts->stack = ts->static_items;  in raxStackInit()
102         if (ts->stack == ts->static_items) {  in raxStackPush()
103             ts->stack = rax_malloc(sizeof(void*)*ts->maxitems*2);  in raxStackPush()
104             if (ts->stack == NULL) {  in raxStackPush()
105                 ts->stack = ts->static_items;  in raxStackPush()
110             memcpy(ts->stack,ts->static_items,sizeof(void*)*ts->maxitems);  in raxStackPush()
112             void **newalloc = rax_realloc(ts->stack,sizeof(void*)*ts->maxitems*2);  in raxStackPush()
118             ts->stack = newalloc;  in raxStackPush()
122     ts->stack[ts->items] = ptr;  in raxStackPush()
132     return ts->stack[ts->items];  in raxStackPop()
139     return ts->stack[ts->items-1];  in raxStackPeek()
144     if (ts->stack != ts->static_items) rax_free(ts->stack);  in raxStackFree()
1264     raxStackInit(&it->stack);  in raxStart()
1322     size_t orig_stack_items = it->stack.items;  in raxIteratorNextStep()
1332             if (!raxStackPush(&it->stack,it->node)) return 0;  in raxIteratorNextStep()
1359                     it->stack.items = orig_stack_items;  in raxIteratorNextStep()
1368                     it->node = raxStackPop(&it->stack);  in raxIteratorNextStep()
1391                         if (!raxStackPush(&it->stack,it->node)) return 0;  in raxIteratorNextStep()
1422         if (!raxStackPush(&it->stack,it->node)) return 0;  in raxSeekGreatest()
1442     size_t orig_stack_items = it->stack.items;  in raxIteratorPrevStep()
1451             it->stack.items = orig_stack_items;  in raxIteratorPrevStep()
1459             it->node = raxStackPop(&it->stack);  in raxIteratorPrevStep()
1487                 if (!raxStackPush(&it->stack,it->node)) return 0;  in raxIteratorPrevStep()
1511     it->stack.items = 0; /* Just resetting. Intialized by raxStart(). */  in raxSeek()
1562     size_t i = raxLowWalk(it->rt,ele,len,&it->node,NULL,&splitpos,&it->stack);  in raxSeek()
1565     if (it->stack.oom) return 0;  in raxSeek()
1580         if (!raxStackPush(&it->stack,it->node)) return 0;  in raxSeek()
1581         for (size_t j = 1; j < it->stack.items; j++) {  in raxSeek()
1582             raxNode *parent = it->stack.stack[j-1];  in raxSeek()
1583             raxNode *child = it->stack.stack[j];  in raxSeek()
1600         raxStackPop(&it->stack);  in raxSeek()
1751             n = raxStackPop(&it->stack);  in raxRandomWalk()
1762             if (!raxStackPush(&it->stack,n)) return 0;  in raxRandomWalk()
1804     raxStackFree(&it->stack);  in raxStop()