Searched refs:ids (Results 1 - 6 of 6) sorted by relevance

/ast/src/lib/libast/misc/
H A Dconformance.c27 static char** ids; variable
96 return ids = p;
116 if (!(p = ids) || serial != ast.env_serial)
119 if (ids)
121 if (ids != (char**)dflt)
122 free(ids);
123 ids = 0;
/ast/src/lib/libpz/
H A Dpzsplit.c57 Dt_t* ids; member in struct:Deflate_s
65 Dt_t* ids; member in struct:Inflate_s
160 for (ip = (Id_t*)dtfirst(dp->ids); ip; ip = (Id_t*)dtnext(dp->ids, ip))
331 if (!(def.ids = dtopen(&iddisc, Dtoset)) || !(def.sqs = dtopen(&sqdisc, Dtoset)))
384 if (!(ip = (Id_t*)dtmatch(def.ids, &rp->id)))
403 dtinsert(def.ids, ip);
454 for (ip = (Id_t*)dtfirst(def.ids); ip; ip = (Id_t*)dtnext(def.ids, ip))
468 if (def.ids)
496 Dt_t* ids; local
719 Dt_t* ids; local
[all...]
/ast/src/lib/libtk/unix/
H A DtkUnixXId.c6 * allocator is that it never re-uses ids, which causes long-lived
41 XID ids[IDS_PER_STACK]; /* Array of free identifiers. */ member in struct:TkIdStack
43 * in ids are currently in use. */
44 TkDisplay *dispPtr; /* Display to which ids belong. */
138 return stackPtr->ids[stackPtr->numUsed];
142 * No free ids in the stack: just get one from the default
202 stackPtr->ids[stackPtr->numUsed] = xid;
212 * This procedure is invoked instead of TkFreeXId for window ids.
223 * Freeing window ids is very tricky because there could still be
249 * the window ids unti
[all...]
/ast/src/lib/libast/port/
H A Dastlicense.c199 int ids; member in struct:Notice_s
548 notice.ids = 0;
680 for (i = 0; i < notice.ids; i++)
691 if (notice.ids <= i)
692 notice.ids = i + 1;
1237 for (i = 0; i < notice.ids; i++)
/ast/src/cmd/INIT/
H A Dproto.c1568 int ids; member in struct:Notice_s
1902 notice.ids = 0;
2034 for (i = 0; i < notice.ids; i++)
2045 if (notice.ids <= i)
2046 notice.ids = i + 1;
2591 for (i = 0; i < notice.ids; i++)
/ast/src/cmd/nmake/
H A DMakerules.mk3175 * evaluate a logical expression of package ids

Completed in 64 milliseconds