xnu/libkern/mkext.c

107     int lchild[N + 1], rchild[N + 257], parent[N + 1];
175  * For i = 0 to N - 1, rchild[i] and lchild[i] will be the right and left
211     sp->rchild[r] = sp->lchild[r] = NIL;
223             if (sp->lchild[p] != NIL)
224                 p = sp->lchild[p];
226                 sp->lchild[p] = r;
242     sp->lchild[r] = sp->lchild[p];
244     sp->parent[sp->lchild[p]] = r;
249         sp->lchild[sp->parent[p]] = r;
261         q = sp->lchild[p];
262     else if (sp->lchild[p] == NIL)
265         q = sp->lchild[p];
270             sp->rchild[sp->parent[q]] = sp->lchild[q];
271             sp->parent[sp->lchild[q]] = sp->parent[q];
272             sp->lchild[q] = sp->lchild[p];
273             sp->parent[sp->lchild[p]] = q;
282         sp->lchild[sp->parent[p]] = q;