NIL
s->strstart - (IPos)MAX_DIST(s) : NIL;
s->head[s->hash_size - 1] = NIL; \
hash_head = NIL;
if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
*p = (Pos)(m >= wsize ? m - wsize : NIL);
hash_head = NIL;
if (hash_head != NIL && s->prev_length < s->max_lazy_match &&
*p = (Pos)(m >= wsize ? m - wsize : NIL);
if (talon != NIL && (talon->visible == FALSE)) {
for (ptr = talon; ptr != NIL; ptr = ptr->next) {
for (ptr = hand; ptr != NIL; ptr = ptr->next) {
for (ptr = stock, row = stockrow; ptr != NIL; ptr = ptr->next, row++) {
if (stock == NIL) {
if (tableau[des] == NIL)
bottom[sour] = NIL;
if (bottom[des] == NIL)
tableau[sour] = NIL;
if (found[tempbase] != NIL)
if (talon == NIL && hand != NIL)
ptr != NIL;
ptr != NIL;
cards[i].next = NIL;
if (cp == NIL)
if (*cp != NIL)
if (*cp != NIL) {
deck[0]->next = NIL;
deck[13]->next = NIL;
found[i] = NIL;
deck[i]->next = NIL;
deck[decksize-1]->next = NIL;
talon = NIL;
if (cp == NIL) {
if ((cp == stock) && (tableau[des] == NIL))
else if (tableau[des] == NIL)
if (stock == NIL &&
else if (talon != NIL) {
while (talon != NIL) {
ptr != NIL;
ptr != NIL;
for (ptr = table; ptr != NIL; ptr = ptr->next) {
if (ptr == NIL) {
if (ptr->next != NIL)
ptr->last = NIL;
for (ptr = table; ptr != NIL; ptr = ptr->next) {
if (ptr != NIL) {
else if (ptr->last != NIL)
if (ptr->next != NIL)
TABLE_ENTRY *table = NIL;
for (ptr = table; ptr != NIL; ptr = ptr->next) {
s->strstart - (IPos)MAX_DIST(s) : NIL;
*p = (Pos)(m >= wsize ? m-wsize : NIL);
*p = (Pos)(m >= wsize ? m-wsize : NIL);
IPos hash_head = NIL; /* head of the hash chain */
if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
IPos hash_head = NIL; /* head of hash chain */
if (hash_head != NIL && s->prev_length < s->max_lazy_match &&
s->head[s->hash_size-1] = NIL; \