| /ast/src/lib/libvcodex/Vchuff/ |
| H A D | vchbits.c | 27 /* sort by code lengths */
53 ssize_t **sort; local
56 if(!(sort = (ssize_t**)malloc(nsym*sizeof(ssize_t*))) )
62 sort[notz++] = size+i;
64 vcqsort(sort, notz, sizeof(ssize_t*), sizecmp, 0);
67 { s = *sort[i];
68 for(k = i; k < notz && *sort[k] == s; ++k)
69 bits[sort[k]-size] = (b++) << (VC_BITSIZE - s);
71 b <<= (*sort[k] - s);
75 s = notz <= 0 ? 0 : *sort[not
[all...] |
| H A D | vchsize.c | 40 /* sort by frequencies */
70 Vchtree_t *tree, **sort; local
74 !(sort = (Vchtree_t**)malloc(nsym*sizeof(Vchtree_t*))) )
92 sort[notz++] = f;
99 *runb = (int)(sort[0]-tree);
101 free(sort);
108 sort[k]->freq = (sort[k]->freq - min)*(VCH_MAXWEIGHT/max) + 1;
111 vcqsort(sort, notz, sizeof(Vchtree_t*), huffcmp, 0);
112 for(f = sort[
[all...] |
| H A D | vchtrie.c | 43 Node_t* root, ssize_t len, Vcbit_t** sort, ssize_t ns, ssize_t lev)
45 static int bldtrie(trie, clen, bits, root, len, sort, ns, lev)
51 Vcbit_t** sort; /* list of codes sharing prefix */
52 ssize_t ns; /* # of elts in sort[] */
62 if((s = clen[sort[k]-bits]) > m)
98 s = (*sort[k] >> (VC_BITSIZE-len)) & msk;
100 z = clen[m = sort[k]-bits];
110 { if(len >= clen[sort[m]-bits])
112 if(s != ((*sort[m] >> (VC_BITSIZE-len)) & msk) )
117 if(bldtrie(trie,clen,bits,&nd,len,sort
42 bldtrie(Vchtrie_t* trie, ssize_t* clen, Vcbit_t* bits, Node_t* root, ssize_t len, Vcbit_t** sort, ssize_t ns, ssize_t lev) argument
159 Vcbit_t **sort; local
[all...] |
| H A D | vchuffgroup.c | 57 ssize_t* sort; /* for sorting part positions */ member in struct:_group_s
162 grp->sort = grp->ppos + npts+1;
186 /* sort by code lengths */
241 ssize_t npts = grp->npts, *ppos = grp->ppos, *sort = grp->sort; local
250 { /* sort parts so that similar prefixes group together */
252 sort[k] = k;
253 vcqsort(sort, npts, sizeof(ssize_t), partcmp, grp);
260 { k = sort[p];
|
| /ast/src/cmd/ss/ |
| H A D | ss.c | 33 " to the standard output. The option order determines the listing sort"
49 "[r:reverse?Reverse the sort order.]"
130 * sys sort
134 sort(const char* pa, const char* pb) function
243 strsort((char**)state.base, n, sort);
|
| /ast/src/lib/libcmd/ |
| H A D | cksum.c | 134 int (*sort)(FTSENT* const*, FTSENT* const*); member in struct:State_s
496 state.sort = order;
592 else if (!(fts = fts_open(argv, flags, state.sort)))
|
| /ast/src/cmd/dsslib/sort/ |
| H A D | sort.c | 24 "[+DESCRIPTION?The sort query writes the sorted input records to the"
26 " next query, if any. The sort keys are the \afield\a operands,"
54 Rs_t* sort; member in struct:State_s
164 if (!(state->sort = rsnew(state->sortkey->disc)))
267 (*disc->errorf)(cx, disc, ERROR_SYSTEM|2, "sort key error");
280 if (rsinit(state->sort, state->sortkey->meth, state->sortkey->procsize, state->sortkey->type, state->sortkey))
283 (*disc->errorf)(cx, disc, ERROR_SYSTEM|2, "sort initialization error");
291 if (state->sort)
292 rsclose(state->sort);
324 if (rsprocess(state->sort,
[all...] |
| /ast/src/cmd/cs/vcs_src/ |
| H A D | vcs_search.c | 107 int sort = 0; local
133 if (!sort)
136 sort++;
143 if (!sort)
146 sort++;
|
| /ast/src/cmd/sortlib/sync/ |
| H A D | ss.h | 160 Ssfield_t* sort; /* optional sort fields */ member in struct:Ss_s
178 unsigned char copy; /* copy (no sort) */
180 unsigned char merge; /* merge (no sort) */
182 unsigned char stable; /* stable sort: 'Y'|'N'|default */
|
| /ast/src/cmd/tw/ |
| H A D | tw.h | 179 int icase; /* ignore case in sort */
190 int reverse; /* reverse sort sense */
194 int (*sort)(Ftw_t*, Ftw_t*); /* sorter */ member in struct:__anon239
195 Exnode_t* sortkey; /* sort key list */
|
| H A D | find.c | 462 "Reverse the \b-sort\b sense.",
469 "sort", SORT, Str, 0, "option", 0,
470 "Search each directory in \a-option\a sort order, e.g., \b-name\b"
1186 error(2, "%s: invalid sort key", b);
1694 error(1, "invalid sort key -- name assumed");
1714 find(State_t* state, char** paths, int flags, Sort_f sort) argument
1721 if (fts = fts_open(paths, flags, sort))
1743 Sort_f sort; local
1760 sort = 0;
1814 error(1, "-sort ignore
[all...] |
| /ast/src/cmd/pzip/ |
| H A D | pin.c | 85 "[o:sort?Sort the window data by row before inducing the partition.]"
218 int sort; member in struct:__anon193
352 return memcmp(va, vb, state.sort);
614 if (state.sort)
1514 state.sort = 1;
1690 if (state.sort)
1692 state.sort = row;
1789 if (state.sort)
|
| /ast/src/cmd/sort/ |
| H A D | main.c | 25 * sort main
40 "[-n?\n@(#)$Id: sort (AT&T Research) 2010-08-11 $\n]"
42 "[+NAME?sort - sort and/or merge files]"
46 "[+?The default sort key is an entire line. Default ordering is "
53 "[k:key?Restrict the sort key to a string beginning at \apos1\a and "
114 "[J:shuffle|jumble?Do a random shuffle of the sort keys. \aseed\a "
130 "is out of sort then write one diagnostic line on the standard error "
133 "[j:processes|nproc|jobs?Use up to \ajobs\a separate processes to sort "
139 "[s:stable?Stable sort
1672 Sort_t sort; local
[all...] |
| /ast/src/cmd/nmake/ |
| H A D | expand.c | 155 * return sort comparison function for SORT_* flags
207 * $(s:H[>]) sort [hi to lo]
753 * sort and fill the output buffer
880 * sort and fill the output buffer
942 * sort list s into xp
948 sort(Sfio_t* xp, register char* s, int flags) function
4143 sort(xp, x, n);
|