pike.git / src / rbtree.c

version» Context lines:

pike.git/src/rbtree.c:81: Inside #if defined(RB_STATS)
   ptr = ptr->up;   #ifdef RB_STATS    ptr->maxdepth = old->maxdepth;   #endif    xfree (old);    } while (ptr->up);    rbstack->slice = ptr;    rbstack->ssp = 0;   }    + void rbstack_do_free (struct rbstack_ptr *rbstack_ptr) + { +  RBSTACK_FREE (*rbstack_ptr); + } +    /* Inserts the given node at *pos and advances *pos. *top is the top    * of the stack, which also is advanced to keep track of the top. */   void rbstack_insert (struct rbstack_ptr *top, struct rbstack_ptr *pos,    struct rb_node_hdr *node)   {    struct rbstack_ptr rbp1 = *top, rbp2 = *top, rbpos = *pos;    RBSTACK_PUSH (rbp2, NULL);    *top = rbp2;       while (rbp1.ssp != rbpos.ssp || rbp1.slice != rbpos.slice) {