| /ast/src/lib/libpz/ |
| H A D | pzdeflate.c | 43 Dt_t* order; local
121 if (!pz->sort.order)
128 if (!(elt = (Pzelt_t*)vmnewof(pz->vm, 0, char, pp->col * m, 0)) || !(pz->sort.order = dtnew(pz->vm, &pz->sort.orderdisc, Dtobag)) || !(pz->sort.free = dtnew(pz->vm, &pz->sort.freedisc, Dtlist)))
139 order = pz->sort.order;
156 if (order)
163 dtinsert(order, elt);
165 for (i = dtsize(order); i < pp->col; i++)
174 dtinsert(order, elt);
176 elt = (Pzelt_t*)dtfirst(order);
[all...] |
| /ast/src/cmd/INIT/ |
| H A D | package.sh | 226 \aattribute\a order. The attributes are:]
440 \bVPATH\b viewing order is from left to right. Each \b$PACKAGEROOT\b
446 inter-component build order. The \bINIT\b component, which contains
448 components named \bINIT\b*, then the component order determined by the
482 chronological order (newer entries at the top of the file.) \bpackage
799 underlying makefiles handle inter-component build order. The ${bB}INIT${eB} component,
801 components named ${bB}INIT${eB}*, then the order determined by the closure of component
834 text, in reverse chronological order (newer entries at the top of the
1050 order. The attributes are:
3743 order() # [ packag function
[all...] |
| H A D | ratz.c | 865 * original form in order to free it, use zcfree().
1487 /* In order to simplify the code, particularly on 16 bit machines, match
1752 symbols by length from short to long, and retaining the symbol order
1768 sorted table, and then entering the symbols in order in the sorted
1818 /* sort symbols by length, by symbol order within each length */
2728 PULLBYTE() directly in order to pull just enough bytes to decode the next
2755 during that inflate() call in order to return the proper return code.
2793 static const unsigned short order[19] = /* permutation of code lengths */ local
3077 state->lens[order[state->have++]] = (unsigned short)BITS(3);
3081 state->lens[order[stat
[all...] |
| /ast/src/lib/libz/ |
| H A D | infback.c | 260 static const unsigned short order[19] = /* permutation of code lengths */ local
371 state->lens[order[state->have++]] = (unsigned short)BITS(3);
375 state->lens[order[state->have++]] = 0;
|
| H A D | inflate.c | 509 PULLBYTE() directly in order to pull just enough bytes to decode the next
536 during that inflate() call in order to return the proper return code.
574 static const unsigned short order[19] = /* permutation of code lengths */ local
858 state->lens[order[state->have++]] = (unsigned short)BITS(3);
862 state->lens[order[state->have++]] = 0;
1231 found in order so far, in 0..3. On return *have is updated to the new
|
| /ast/src/lib/libcmd/ |
| H A D | cksum.c | 38 " \batt\b method is a true sum, all others are order dependent.]"
420 * order child entries
424 order(FTSENT* const* f1, FTSENT* const* f2) function
496 state.sort = order;
|
| /ast/src/cmd/dsslib/merge/ |
| H A D | merge.c | 28 "[k:key?\afield\a is a sort key in normal order.]:[field]"
29 "[r:reverse?\afield\a is a sort key in reverse order.]:[field]"
59 Dt_t* order; member in struct:State_s
114 dtdelete(state->order, file);
123 dtinsert(state->order, file);
232 if (!(state->order = dtnew(vm, &state->orderdisc, Dtoset)))
267 while (file = (File_t*)dtfirst(state->order))
|
| /ast/src/cmd/cs/ |
| H A D | cs.c | 167 * order by name
171 order(register Ftw_t* f1, register Ftw_t* f2) function
646 ftwalk((char*)av, list, FTW_MULTIPLE|FTW_PHYSICAL, order);
|
| /ast/src/lib/libtksh/tcl/ |
| H A D | tclCmdIL.c | 49 static int sortIncreasing; /* 0 means sort in decreasing order,
50 * 1 means increasing order. */
983 int order;
987 order = 0;
994 return order;
997 order = strcmp(firstString, secondString);
1006 return order;
1009 order = 1;
1011 order = -1;
1021 return order;
971 int order; local
[all...] |
| /ast/src/cmd/tw/ |
| H A D | tw.c | 66 "\b--directory\b directories are traversed in order from left to right. "
70 "traversal. Multiple \b--expr\b expressions are parsed in order from "
85 "default directories are visited pre-order.]"
178 "If any identifier is preceded by \b!\b then the sort order is "
236 "[+NOPOST?cancel any post order visit to this file]"
327 "[+NOTES?In order to access the \bslocate\b(1) database the \btw\b "
597 * order child entries
601 order(register Ftw_t* f1, register Ftw_t* f2) function
666 message((-2, "order(%s,%s) = %d [n1=%ld n2=%ld]", f1->name, f2->name, v, n1, n2));
918 state.sort = order;
[all...] |
| H A D | find.c | 83 "[+NOTES?In order to access the \bslocate\b(1) database the \bfind\b executable"
115 * retain the order
470 "Search each directory in \a-option\a sort order, e.g., \b-name\b"
1662 * order child entries
1666 order(FTSENT* const* p1, FTSENT* const* p2) function
1850 sort = order;
|
| /ast/src/cmd/mailx/port/ |
| H A D | mime.c | 149 order(Dt_t* dt, void* a, void* b, Dtdisc_t* disc) function
754 mp->dict.comparf = order;
|
| /ast/src/lib/libast/misc/ |
| H A D | fts.c | 685 * order fts->todo if fts->comparf != 0
689 order(FTS* fts) function
872 order(fts);
1202 * perform post-order processing
1485 order(fts);
|
| H A D | mime.c | 97 order(Dt_t* dt, void* a, void* b, Dtdisc_t* disc) function
811 mp->dict.comparf = order;
|
| /ast/src/lib/librecsort/ |
| H A D | recsort.h | 72 { unsigned long order; /* for fast compare or ordinal */ member in struct:_rsobj_s
73 Rsobj_t* left; /* left/last link or out of order */
94 unsigned char rflag; /* reverse order */
154 #define RS_VERIFY 0000100 /* objects out of order */
174 #define RS_REVERSE 000002 /* reverse sort order */
220 extern Rsmethod_t* Rscopy; /* copy original order */
224 extern Rsmethod_t* Rsverify; /* verify order */
|
| /ast/src/cmd/html/ |
| H A D | htmlrefs.c | 35 "[+?The top level references are determined in this order (the \b--index\b,"
36 " \b--root\b and \b--user\b options influence the order):]{"
418 * order directory stream by name
422 order(FTSENT* const* a, FTSENT* const* b) function
607 fts = fts_open((char**)p, FTS_ONEPATH|FTS_META|FTS_PHYSICAL|FTS_NOPOSTORDER, order);
1175 if (!(fts = fts_open((char**)state->copy.data, FTS_ONEPATH|FTS_META|FTS_PHYSICAL|FTS_NOPREORDER, order)))
1205 if (!(fts = fts_open(dirs, FTS_META|FTS_PHYSICAL|FTS_NOPREORDER, order)))
|
| /ast/src/cmd/at/ |
| H A D | atd.c | 1145 * order job by <start,name>
1149 order(Dt_t* dt, void* a, void* b, Dtdisc_t* disc) function
1400 state->table.job.discipline.comparf = order;
|
| /ast/src/cmd/nmake/ |
| H A D | expand.c | 1134 * order_recurse() partial order traversal support
1367 * order strsort comparison function
1397 Rule_t* order; local
1413 order = targets ? (Rule_t*)0 : getrule(external.order);
1485 if (i == ':' && strneq(s, "order", 5))
1487 if (!order)
1488 order = makerule(external.order);
1489 order
[all...] |
| H A D | make.h | 675 char* skip; /* order directory skip pattern */
696 char* order; /* :W=[OPR]: favorites */ member in struct:External_s
|
| /ast/src/cmd/std/ |
| H A D | ls.c | 66 " the name found in each slot in the physical directory order. Turns"
149 "[r:reverse?Reverse order while sorting.]"
232 #define LS_ACROSS (LS_USER<<0) /* multi-column row order */
235 #define LS_COLUMNS (LS_USER<<3) /* multi-column column order */
354 Order_f order; /* sort comparison function */ member in struct:__anon232
834 * pr() ftw directory child list in column order
1040 * order() helpers
1142 * order child entries
1146 order(register Ftw_t* f1, register Ftw_t* f2) function
1160 n = (*state.order)(f
[all...] |