drefops.c: *  If *pp is not NIL, decrement refcount of **pp.
drefops.c: *  Stick v into *pp, and inc refcount of *v if not NIL.
drefops.c:    /* If old value for *pp is not NIL, decrement refcount and free if zero. */
drefops.c:        if ( *rpp != NIL) {
drefops.c:    /* Put new value into field and if v is not NIL etc., inc *v's refcount. */
drefops.c: *  Stick v into *pp, then if v is not NIL, inc *v's refcount.
drefops.c: * p is a node. If p is not NIL, increment its ref count.
drefops.c:    if ( rp != NIL ) {
drefops.c:    if ( rp != NIL ) {
dststructs.mh.rb~:#define NIL 0
dststructs.mh.rb~:/* parameter.  NIL indicates no call */
dststructs.mh.rb~:#   define mp_type_modifier MPrimary . MPrimary_mp_type_modifier  /* NIL if this represents a coercion */
dststructs.mh.rb~:#define is_good(l) ((l) == NIL || \
dststructs.mh.rb~:#define is_list(l) ((l) != NIL && \
dststructs.mh.rb~:#define is_empty(l) ((l)->lh_first == NIL)
dststructs.mh.rb~:#define emptylist() mknode(LISTHEADER,NIL,NIL)
dststructs.mh.rb~:    v = (mL__0O == NIL? NIL: (NODE *) cn_head(mL__0O))
dststructs.mh.rb~:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
dststructs.mh.rb~:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
dststructs.mh.rb~:#define LAST_ITER (cn_tail(mL__0O) == NIL)
dststructs.mh.rb~:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
dststructs.mh.rb~:if (mL__0OP == NIL) { \
dststructs.mh.rb~:if (mL__0O == NIL) mL__0OL -> lh_last = mL__0OP;
dststructs.mh.rb~:    if (mL__0O == NIL) { \
dststructs.mh.rb~:	dbgmsg("Attempt to delete NIL\n"); \
dststructs.mh.rb~:    if (mL__0OP == NIL) { \
dststructs.mh.rb~:    if (mL__0OP == NIL) { \
dststructs.mh.rb~:/* with a NIL loop variable  */
dststructs.mh.rb~:    ConsNode * mL__0OP = NIL; \
dststructs.mh.rb~:	if (mL__0O != NIL) v = (NODE *) cn_head(mL__0O); else v = NIL; \
dststructs.mh.rb~:	if (mL__0O != NIL) mL__0O = cn_tail(mL__0O); \
dststructs.mh.rb~:    } while (mL__0OP != NIL); \
dststructs.mh.rb~:		mL__1O != NIL && mL__2O != NIL;\
dststructs.mh.rb~:		mL__1O != NIL && mL__2O != NIL;\
listops.c: * if e is NIL do nothing
listops.c:    if (e == NIL) return(l);
listops.c:        p = cn_cons(lock(e),NIL);
listops.c: * If e is NIL do nothing.
listops.c:    if ( e == NIL ) return(l);
listops.c:    p = cn_cons(lock(e), NIL);
listops.c: * If ei is NIL, it is ignored.
listops.c:        (l2 -> lh_last) = (l2 -> lh_first) = NIL;
listops.c~: * if e is NIL do nothing
listops.c~:    if (e == NIL) return(l);
listops.c~:        p = cn_cons(lock(e),NIL);
listops.c~: * If e is NIL do nothing.
listops.c~:    if ( e == NIL ) return(l);
listops.c~:    p = cn_cons(lock(e), NIL);
listops.c~: * If ei is NIL, it is ignored.
listops.c~:        (l2 -> lh_last) = (l2 -> lh_first) = NIL;
#listops.rb#: * if e is NIL do nothing
#listops.rb#:    if (e == NIL) return(l);
#listops.rb#:        p = cn_cons(lock(e),NIL);
#listops.rb#: * If e is NIL do nothing.
#listops.rb#:    if ( e == NIL ) return(l);
#listops.rb#:    p = cn_cons(lock(e), NIL);
#listops.rb#: * If ei is NIL, it is ignored.
#listops.rb#:# * If e is NIL do nothing.
#listops.rb#:    if ( e == NIL ) return(l)
#listops.rb#:    p = cn_cons(lock(e), NIL)
#listops.rb#:        (l2 -> lh_last) = (l2 -> lh_first) = NIL;
listops.rb: * if e is NIL do nothing
listops.rb:    if (e == NIL) return(l);
listops.rb:        p = cn_cons(lock(e),NIL);
listops.rb: * If e is NIL do nothing.
listops.rb:    if ( e == NIL ) return(l);
listops.rb:    p = cn_cons(lock(e), NIL);
listops.rb: * If ei is NIL, it is ignored.
listops.rb:# * If e is NIL do nothing.
listops.rb:    if ( e == NIL ) then
listops.rb:    p = cn_cons(lock(e), NIL)
listops.rb:        (l2 -> lh_last) = (l2 -> lh_first) = NIL;
listops.rb~: * if e is NIL do nothing
listops.rb~:    if (e == NIL) return(l);
listops.rb~:        p = cn_cons(lock(e),NIL);
listops.rb~: * If e is NIL do nothing.
listops.rb~:    if ( e == NIL ) return(l);
listops.rb~:    p = cn_cons(lock(e), NIL);
listops.rb~: * If ei is NIL, it is ignored.
listops.rb~:# * If e is NIL do nothing.
listops.rb~:    if ( e == NIL ) then
listops.rb~:    p = cn_cons(lock(e), NIL)
listops.rb~:        (l2 -> lh_last) = (l2 -> lh_first) = NIL;
listops.tmp.rb:#  * if e is NIL do nothing
listops.tmp.rb:#     if (e == NIL) return(l);
listops.tmp.rb:#         p = cn_cons(lock(e),NIL);
listops.tmp.rb:#  * If e is NIL do nothing.
listops.tmp.rb:#     if ( e == NIL ) return(l);
listops.tmp.rb:#     p = cn_cons(lock(e), NIL);
listops.tmp.rb:#  * If ei is NIL, it is ignored.
listops.tmp.rb:# * If e is NIL do nothing.
listops.tmp.rb:    if ( e == NIL ) then
listops.tmp.rb:    p = cn_cons(lock(e), NIL)
listops.tmp.rb:#         (l2 -> lh_last) = (l2 -> lh_first) = NIL;
#mknode.c#: * Other fields are initialized to NIL.
#mknode.c#:            *p = NIL;
#mknode.c#:            *p = NIL;
#mknode.c#:    if ( p == NIL ) return;
#mknode.c#:                        for ( c = p -> lh_first; c != NIL; c = cn_del_hd(c) );
#mknode.c#:    p = q = NIL;
#mknode.c#:                    p = q = cn_cons(lock(v),NIL);
#mknode.c#:                    cn_settail(q, cn_cons(lock(v), NIL));
#mknode.c#:    if (l != NIL) {
mknode.c: * Other fields are initialized to NIL.
mknode.c:            *p = NIL;
mknode.c:            *p = NIL;
mknode.c:            *p = NIL;
mknode.c:    if ( p == NIL ) return;
mknode.c:                        for ( c = p -> lh_first; c != NIL; c = cn_del_hd(c) );
mknode.c:    p = q = NIL;
mknode.c:                    p = q = cn_cons(lock(v),NIL);
mknode.c:                    cn_settail(q, cn_cons(lock(v), NIL));
mknode.c:    if (l != NIL) {
mknode.c~: * Other fields are initialized to NIL.
mknode.c~:            *p = NIL;
mknode.c~:    if ( p == NIL ) return;
mknode.c~:                        for ( c = p -> lh_first; c != NIL; c = cn_del_hd(c) );
mknode.c~:    p = q = NIL;
mknode.c~:                    p = q = cn_cons(lock(v),NIL);
mknode.c~:                    cn_settail(q, cn_cons(lock(v), NIL));
mknode.c~:    if (l != NIL) {
mknode.rb:#  * Other fields are initialized to NIL.
mknode.rb:        *p = NIL;
mknode.rb:#             *p = NIL;
mknode.rb:#     if ( p == NIL ) return;
mknode.rb:#                         for ( c = p -> lh_first; c != NIL; c = cn_del_hd(c) );
mknode.rb:#     p = q = NIL;
mknode.rb:#                     p = q = cn_cons(lock(v),NIL);
mknode.rb:#                     cn_settail(q, cn_cons(lock(v), NIL));
mknode.rb:#     if (l != NIL) {
mknode.rb~:#  * Other fields are initialized to NIL.
mknode.rb~:        *p = NIL;
mknode.rb~:#             *p = NIL;
mknode.rb~:#     if ( p == NIL ) return;
mknode.rb~:#                         for ( c = p -> lh_first; c != NIL; c = cn_del_hd(c) );
mknode.rb~:#     p = q = NIL;
mknode.rb~:#                     p = q = cn_cons(lock(v),NIL);
mknode.rb~:#                     cn_settail(q, cn_cons(lock(v), NIL));
mknode.rb~:#     if (l != NIL) {
mknode.tmp.rb:# #  * Other fields are initialized to NIL.
mknode.tmp.rb:        *p = NIL;
mknode.tmp.rb:# #             *p = NIL;
mknode.tmp.rb:# #     if ( p == NIL ) return;
mknode.tmp.rb:# #                         for ( c = p -> lh_first; c != NIL; c = cn_del_hd(c) );
mknode.tmp.rb:# #     p = q = NIL;
mknode.tmp.rb:# #                     p = q = cn_cons(lock(v),NIL);
mknode.tmp.rb:# #                     cn_settail(q, cn_cons(lock(v), NIL));
mknode.tmp.rb:# #     if (l != NIL) {
mknode.tmp.rb~:# #  * Other fields are initialized to NIL.
mknode.tmp.rb~:#         *p = NIL;
mknode.tmp.rb~:# #             *p = NIL;
mknode.tmp.rb~:# #     if ( p == NIL ) return;
mknode.tmp.rb~:# #                         for ( c = p -> lh_first; c != NIL; c = cn_del_hd(c) );
mknode.tmp.rb~:# #     p = q = NIL;
mknode.tmp.rb~:# #                     p = q = cn_cons(lock(v),NIL);
mknode.tmp.rb~:# #                     cn_settail(q, cn_cons(lock(v), NIL));
mknode.tmp.rb~:# #     if (l != NIL) {
prstree.c:    if (p == NIL) {
prstree.c:        printf("NIL");
prstree.c:            &&arg -> sel_type != NIL) {
prstree.c:                    if (*p == NIL) {
Binary file prstree.o matches
stmkfields.mh:/* parameter.  NIL indicates no call */
stmkfields.mh:   +(1<<22)  /* NIL if this represents a coercion */
stmkfields.mh.rb:# # parameter.  NIL indicates no call */
stmkfields.mh.rb:    +(1<<22)  # NIL if this represents a coercion */
stmkfields.mh.rb~:# # parameter.  NIL indicates no call */
stmkfields.mh.rb~:    +(1<<22)  # NIL if this represents a coercion */
stmkfields.mh.tmp.rb:# # # parameter.  NIL indicates no call */
stmkfields.mh.tmp.rb:#     +(1<<22)  # NIL if this represents a coercion */
stmkfields.mod.h:/* parameter.  NIL indicates no call */
stmkfields.mod.h:   +(1<<22)  /* NIL if this represents a coercion */
stmkfields.mod.h~:/* parameter.  NIL indicates no call */
stmkfields.mod.h~:   +(1<<22)  /* NIL if this represents a coercion */
stplinks.mh:/* parameter.  NIL indicates no call */
stplinks.mh:   +(1<<22)  /* NIL if this represents a coercion */
stptrs.mh:/* parameter.  NIL indicates no call */
stptrs.mh:   +(1<<22)  /* NIL if this represents a coercion */
stptrs.mh.rb:# # parameter.  NIL indicates no call */
stptrs.mh.rb:    +(1<<22)  # NIL if this represents a coercion */
stptrs.mh.rb~:# # parameter.  NIL indicates no call */
stptrs.mh.rb~:    +(1<<22)  # NIL if this represents a coercion */
stptrs.mh.tmp.rb:# # # parameter.  NIL indicates no call */
stptrs.mh.tmp.rb:#     +(1<<22)  # NIL if this represents a coercion */
stptrs.mod.h:/* parameter.  NIL indicates no call */
stptrs.mod.h:   +(1<<22)  /* NIL if this represents a coercion */
stptrs.mod.h~:/* parameter.  NIL indicates no call */
stptrs.mod.h~:   +(1<<22)  /* NIL if this represents a coercion */
streedefs.h:				/* parameter.  NIL indicates no call */
streedefs.h:  NODESTAR(mp_type_modifier)    /* NIL if this represents a coercion */
Binary file stree.o matches
stsigs.mh:/* parameter.  NIL indicates no call */
stsigs.mh:    /* NIL if this represents a coercion */
stsizes.mh:/* parameter.  NIL indicates no call */
stsizes.mh:    /* NIL if this represents a coercion */
#stsizes.mh.rb#:#/* parameter.  NIL indicates no call */
#stsizes.mh.rb#:#     /* NIL if this represents a coercion */
stsizes.mh.rb:#/* parameter.  NIL indicates no call */
stsizes.mh.rb:#     /* NIL if this represents a coercion */
stsizes.mh.rb~:#/* parameter.  NIL indicates no call */
stsizes.mh.rb~:#     /* NIL if this represents a coercion */
stsizes.mh.tmp.rb:#/* parameter.  NIL indicates no call */
stsizes.mh.tmp.rb:#     /* NIL if this represents a coercion */
ststructs.m:@define NIL 0
ststructs.m:@define is_good(l) ((l) == NIL || \
ststructs.m:@define is_list(l) ((l) != NIL && \
ststructs.m:@define is_empty(l) ((l)->lh_first == NIL)      /* is l an empty list? */
ststructs.m:@define emptylist() mknode(LISTHEADER,NIL,NIL)  /* make an empty list */
ststructs.m:    v = (mL__0O == NIL? NIL: (NODE *) cn_head(mL__0O))
ststructs.m:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.m:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.m:@define LAST_ITER (cn_tail(mL__0O) == NIL)
ststructs.m:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.m:if (mL__0OP == NIL) { \
ststructs.m:if (mL__0O == NIL) mL__0OL -> lh_last = mL__0OP;
ststructs.m:    if (mL__0O == NIL) { \
ststructs.m:	dbgmsg("Attempt to delete NIL\n"); \
ststructs.m:    if (mL__0OP == NIL) { \
ststructs.m:    if (mL__0OP == NIL) { \
ststructs.m:						/* with a NIL loop variable  */
ststructs.m:    ConsNode * mL__0OP = NIL; \
ststructs.m:	if (mL__0O != NIL) v = (NODE *) cn_head(mL__0O); else v = NIL; \
ststructs.m:	if (mL__0O != NIL) mL__0O = cn_tail(mL__0O); \
ststructs.m:    } while (mL__0OP != NIL); \
ststructs.m:		mL__1O != NIL && mL__2O != NIL;\
ststructs.m:		mL__1O != NIL && mL__2O != NIL;\
ststructs.mh:#define NIL 0
ststructs.mh:/* parameter.  NIL indicates no call */
ststructs.mh:#   define mp_type_modifier MPrimary . MPrimary_mp_type_modifier  /* NIL if this represents a coercion */
ststructs.mh:#define is_good(l) ((l) == NIL || \
ststructs.mh:#define is_list(l) ((l) != NIL && \
ststructs.mh:#define is_empty(l) ((l)->lh_first == NIL)
ststructs.mh:#define emptylist() mknode(LISTHEADER,NIL,NIL)
ststructs.mh:    v = (mL__0O == NIL? NIL: (NODE *) cn_head(mL__0O))
ststructs.mh:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh:#define LAST_ITER (cn_tail(mL__0O) == NIL)
ststructs.mh:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh:if (mL__0OP == NIL) { \
ststructs.mh:if (mL__0O == NIL) mL__0OL -> lh_last = mL__0OP;
ststructs.mh:    if (mL__0O == NIL) { \
ststructs.mh:	dbgmsg("Attempt to delete NIL\n"); \
ststructs.mh:    if (mL__0OP == NIL) { \
ststructs.mh:    if (mL__0OP == NIL) { \
ststructs.mh:/* with a NIL loop variable  */
ststructs.mh:    ConsNode * mL__0OP = NIL; \
ststructs.mh:	if (mL__0O != NIL) v = (NODE *) cn_head(mL__0O); else v = NIL; \
ststructs.mh:	if (mL__0O != NIL) mL__0O = cn_tail(mL__0O); \
ststructs.mh:    } while (mL__0OP != NIL); \
ststructs.mh:		mL__1O != NIL && mL__2O != NIL;\
ststructs.mh:		mL__1O != NIL && mL__2O != NIL;\
ststructs.mh~:#define NIL 0
ststructs.mh~:/* parameter.  NIL indicates no call */
ststructs.mh~:#   define mp_type_modifier MPrimary . MPrimary_mp_type_modifier  /* NIL if this represents a coercion */
ststructs.mh~:#define is_good(l) ((l) == NIL || \
ststructs.mh~:#define is_list(l) ((l) != NIL && \
ststructs.mh~:#define is_empty(l) ((l)->lh_first == NIL)
ststructs.mh~:#define emptylist() mknode(LISTHEADER,NIL,NIL)
ststructs.mh~:    v = (mL__0O == NIL? NIL: (NODE *) cn_head(mL__0O))
ststructs.mh~:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh~:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh~:#define LAST_ITER (cn_tail(mL__0O) == NIL)
ststructs.mh~:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh~:if (mL__0OP == NIL) { \
ststructs.mh~:if (mL__0O == NIL) mL__0OL -> lh_last = mL__0OP;
ststructs.mh~:    if (mL__0O == NIL) { \
ststructs.mh~:	dbgmsg("Attempt to delete NIL\n"); \
ststructs.mh~:    if (mL__0OP == NIL) { \
ststructs.mh~:    if (mL__0OP == NIL) { \
ststructs.mh~:/* with a NIL loop variable  */
ststructs.mh~:    ConsNode * mL__0OP = NIL; \
ststructs.mh~:	if (mL__0O != NIL) v = (NODE *) cn_head(mL__0O); else v = NIL; \
ststructs.mh~:	if (mL__0O != NIL) mL__0O = cn_tail(mL__0O); \
ststructs.mh~:    } while (mL__0OP != NIL); \
ststructs.mh~:		mL__1O != NIL && mL__2O != NIL;\
ststructs.mh~:		mL__1O != NIL && mL__2O != NIL;\
#ststructs.mh.rb#:# NIL = 0
#ststructs.mh.rb#:  return(mknode(LISTHEADER,NIL,NIL))
#ststructs.mh.rb#:  if ((l) != NIL && l[0].kind == LISTHEADER)
#ststructs.mh.rb#:#define NIL 0
#ststructs.mh.rb#:/* parameter.  NIL indicates no call */
#ststructs.mh.rb#:#   define mp_type_modifier MPrimary . MPrimary_mp_type_modifier  /* NIL if this represents a coercion */
#ststructs.mh.rb#:#define is_good(l) ((l) == NIL || \
#ststructs.mh.rb#:#define is_list(l) ((l) != NIL && \
#ststructs.mh.rb#:#define is_empty(l) ((l)->lh_first == NIL)
#ststructs.mh.rb#:#define emptylist() mknode(LISTHEADER,NIL,NIL)
#ststructs.mh.rb#:    v = (mL__0O == NIL? NIL: (NODE *) cn_head(mL__0O))
#ststructs.mh.rb#:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
#ststructs.mh.rb#:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
#ststructs.mh.rb#:#define LAST_ITER (cn_tail(mL__0O) == NIL)
#ststructs.mh.rb#:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
#ststructs.mh.rb#:if (mL__0OP == NIL) { \
#ststructs.mh.rb#:if (mL__0O == NIL) mL__0OL -> lh_last = mL__0OP;
#ststructs.mh.rb#:    if (mL__0O == NIL) { \
#ststructs.mh.rb#:	dbgmsg("Attempt to delete NIL\n"); \
#ststructs.mh.rb#:    if (mL__0OP == NIL) { \
#ststructs.mh.rb#:    if (mL__0OP == NIL) { \
#ststructs.mh.rb#:/* with a NIL loop variable  */
#ststructs.mh.rb#:    ConsNode * mL__0OP = NIL; \
#ststructs.mh.rb#:	if (mL__0O != NIL) v = (NODE *) cn_head(mL__0O); else v = NIL; \
#ststructs.mh.rb#:	if (mL__0O != NIL) mL__0O = cn_tail(mL__0O); \
#ststructs.mh.rb#:    } while (mL__0OP != NIL); \
#ststructs.mh.rb#:		mL__1O != NIL && mL__2O != NIL;\
#ststructs.mh.rb#:		mL__1O != NIL && mL__2O != NIL;\
ststructs.mh.rb:# NIL = 0
ststructs.mh.rb:  return(mknode(LISTHEADER,NIL,NIL))
ststructs.mh.rb:  if ((l) != NIL && l[0].kind == LISTHEADER)
ststructs.mh.rb:  if (l[0].lh_first == NIL) then
ststructs.mh.rb:#define NIL 0
ststructs.mh.rb:/* parameter.  NIL indicates no call */
ststructs.mh.rb:#   define mp_type_modifier MPrimary . MPrimary_mp_type_modifier  /* NIL if this represents a coercion */
ststructs.mh.rb:#define is_good(l) ((l) == NIL || \
ststructs.mh.rb:#define is_list(l) ((l) != NIL && \
ststructs.mh.rb:#define is_empty(l) ((l)->lh_first == NIL)
ststructs.mh.rb:#define emptylist() mknode(LISTHEADER,NIL,NIL)
ststructs.mh.rb:    v = (mL__0O == NIL? NIL: (NODE *) cn_head(mL__0O))
ststructs.mh.rb:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh.rb:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh.rb:#define LAST_ITER (cn_tail(mL__0O) == NIL)
ststructs.mh.rb:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh.rb:if (mL__0OP == NIL) { \
ststructs.mh.rb:if (mL__0O == NIL) mL__0OL -> lh_last = mL__0OP;
ststructs.mh.rb:    if (mL__0O == NIL) { \
ststructs.mh.rb:	dbgmsg("Attempt to delete NIL\n"); \
ststructs.mh.rb:    if (mL__0OP == NIL) { \
ststructs.mh.rb:    if (mL__0OP == NIL) { \
ststructs.mh.rb:/* with a NIL loop variable  */
ststructs.mh.rb:    ConsNode * mL__0OP = NIL; \
ststructs.mh.rb:	if (mL__0O != NIL) v = (NODE *) cn_head(mL__0O); else v = NIL; \
ststructs.mh.rb:	if (mL__0O != NIL) mL__0O = cn_tail(mL__0O); \
ststructs.mh.rb:    } while (mL__0OP != NIL); \
ststructs.mh.rb:		mL__1O != NIL && mL__2O != NIL;\
ststructs.mh.rb:		mL__1O != NIL && mL__2O != NIL;\
ststructs.mh.rb~:# NIL = 0
ststructs.mh.rb~:  return(mknode(LISTHEADER,NIL,NIL))
ststructs.mh.rb~:  if ((l) != NIL && l[0].kind == LISTHEADER)
ststructs.mh.rb~:  if (l.lh_first == NIL) then
ststructs.mh.rb~:#define NIL 0
ststructs.mh.rb~:/* parameter.  NIL indicates no call */
ststructs.mh.rb~:#   define mp_type_modifier MPrimary . MPrimary_mp_type_modifier  /* NIL if this represents a coercion */
ststructs.mh.rb~:#define is_good(l) ((l) == NIL || \
ststructs.mh.rb~:#define is_list(l) ((l) != NIL && \
ststructs.mh.rb~:#define is_empty(l) ((l)->lh_first == NIL)
ststructs.mh.rb~:#define emptylist() mknode(LISTHEADER,NIL,NIL)
ststructs.mh.rb~:    v = (mL__0O == NIL? NIL: (NODE *) cn_head(mL__0O))
ststructs.mh.rb~:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh.rb~:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh.rb~:#define LAST_ITER (cn_tail(mL__0O) == NIL)
ststructs.mh.rb~:    for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh.rb~:if (mL__0OP == NIL) { \
ststructs.mh.rb~:if (mL__0O == NIL) mL__0OL -> lh_last = mL__0OP;
ststructs.mh.rb~:    if (mL__0O == NIL) { \
ststructs.mh.rb~:	dbgmsg("Attempt to delete NIL\n"); \
ststructs.mh.rb~:    if (mL__0OP == NIL) { \
ststructs.mh.rb~:    if (mL__0OP == NIL) { \
ststructs.mh.rb~:/* with a NIL loop variable  */
ststructs.mh.rb~:    ConsNode * mL__0OP = NIL; \
ststructs.mh.rb~:	if (mL__0O != NIL) v = (NODE *) cn_head(mL__0O); else v = NIL; \
ststructs.mh.rb~:	if (mL__0O != NIL) mL__0O = cn_tail(mL__0O); \
ststructs.mh.rb~:    } while (mL__0OP != NIL); \
ststructs.mh.rb~:		mL__1O != NIL && mL__2O != NIL;\
ststructs.mh.rb~:		mL__1O != NIL && mL__2O != NIL;\
ststructs.mh.tmp.rb:# NIL = 0
ststructs.mh.tmp.rb:  return(mknode(LISTHEADER,NIL,NIL))
ststructs.mh.tmp.rb:  if ((l) != NIL && l[0].kind == LISTHEADER)
ststructs.mh.tmp.rb:  if (l[0].lh_first == NIL) then
ststructs.mh.tmp.rb:# #define NIL 0
ststructs.mh.tmp.rb:# /* parameter.  NIL indicates no call */
ststructs.mh.tmp.rb:# #   define mp_type_modifier MPrimary . MPrimary_mp_type_modifier  /* NIL if this represents a coercion */
ststructs.mh.tmp.rb:# #define is_good(l) ((l) == NIL || \
ststructs.mh.tmp.rb:# #define is_list(l) ((l) != NIL && \
ststructs.mh.tmp.rb:# #define is_empty(l) ((l)->lh_first == NIL)
ststructs.mh.tmp.rb:# #define emptylist() mknode(LISTHEADER,NIL,NIL)
ststructs.mh.tmp.rb:#     v = (mL__0O == NIL? NIL: (NODE *) cn_head(mL__0O))
ststructs.mh.tmp.rb:#     for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh.tmp.rb:#     for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh.tmp.rb:# #define LAST_ITER (cn_tail(mL__0O) == NIL)
ststructs.mh.tmp.rb:#     for(mL__0O = ((l) -> lh_first); mL__0O != NIL; mL__0O = cn_tail(mL__0O) ) {\
ststructs.mh.tmp.rb:# if (mL__0OP == NIL) { \
ststructs.mh.tmp.rb:# if (mL__0O == NIL) mL__0OL -> lh_last = mL__0OP;
ststructs.mh.tmp.rb:#     if (mL__0O == NIL) { \
ststructs.mh.tmp.rb:# 	dbgmsg("Attempt to delete NIL\n"); \
ststructs.mh.tmp.rb:#     if (mL__0OP == NIL) { \
ststructs.mh.tmp.rb:#     if (mL__0OP == NIL) { \
ststructs.mh.tmp.rb:# /* with a NIL loop variable  */
ststructs.mh.tmp.rb:#     ConsNode * mL__0OP = NIL; \
ststructs.mh.tmp.rb:# 	if (mL__0O != NIL) v = (NODE *) cn_head(mL__0O); else v = NIL; \
ststructs.mh.tmp.rb:# 	if (mL__0O != NIL) mL__0O = cn_tail(mL__0O); \
ststructs.mh.tmp.rb:#     } while (mL__0OP != NIL); \
ststructs.mh.tmp.rb:# 		mL__1O != NIL && mL__2O != NIL;\
ststructs.mh.tmp.rb:# 		mL__1O != NIL && mL__2O != NIL;\
testvertex.c:    p =lock(  mknode(NUMID,1234, NIL)  );
unparse.c:    if (p == NIL) return;
unparse.c:                if (p -> bld_declaration_list == NIL
unparse.c:		    if (p -> bld_den_seq == NIL) {
unparse.c:                if (p -> mp_type_modifier != NIL) {
