Searched refs:NIL (Results 1 – 2 of 2) sorted by relevance
88 #define NIL N /* index for root of binary search trees */ macro198 sp->rchild[i] = NIL; in init_state()201 sp->parent[i] = NIL; in init_state()222 sp->rchild[r] = sp->lchild[r] = NIL; in insert_node()226 if (sp->rchild[p] != NIL) { in insert_node()234 if (sp->lchild[p] != NIL) { in insert_node()264 sp->parent[p] = NIL; /* remove p */ in insert_node()273 if (sp->parent[p] == NIL) { in delete_node()276 if (sp->rchild[p] == NIL) { in delete_node()278 } else if (sp->lchild[p] == NIL) { in delete_node()[all …]
132 #define NIL 0 macro227 s->head[s->hash_size-1] = NIL; \1063 s->strstart - (IPos)MAX_DIST(s) : NIL; in longest_match()1336 *p = (Pos)(m >= wsize ? m-wsize : NIL); in fill_window()1344 *p = (Pos)(m >= wsize ? m-wsize : NIL); in fill_window()1475 IPos hash_head = NIL; /* head of the hash chain */ in deflate_fast()1502 if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) { in deflate_fast()1580 IPos hash_head = NIL; /* head of hash chain */ in deflate_slow()1611 if (hash_head != NIL && s->prev_length < s->max_lazy_match && in deflate_slow()