Searched defs:merge (Results 1 - 9 of 9) sorted by relevance

/illumos-gate/usr/src/common/crypto/arcfour/sun4v/
H A Darcfour_crypt.c65 unsigned long long in0, merge = 0, merge0 = 0, merge1, mask = 0; local
202 merge =
205 merge =
230 merge |= (unsigned long long)
252 merge |=
273 merge |= (unsigned long long)(base[tmp1]) << 40;
283 merge |= (unsigned long long)(base[tmp0]) << 32;
293 merge |= (unsigned long long)(base[tmp0]) << 24;
303 merge |= (unsigned long long)(base[tmp0]) << 16;
317 merge |
[all...]
/illumos-gate/usr/src/cmd/mdb/intel/modules/sata/
H A Dsata.c137 char merge[1024]; local
149 (void) mdb_snprintf(merge, sizeof (merge),
159 (void) mdb_snprintf(merge, sizeof (merge),
177 (void) mdb_snprintf(merge, sizeof (merge),
186 mdb_printf("%s\n", merge);
/illumos-gate/usr/src/cmd/mdb/common/modules/emlxs/
H A Demlxs.c91 char merge[1024]; local
253 mdb_snprintf(merge, sizeof (merge),
265 mdb_snprintf(merge, sizeof (merge),
278 mdb_snprintf(merge, sizeof (merge),
290 mdb_snprintf(merge, sizeof (merge),
303 mdb_printf("%s", merge);
[all...]
/illumos-gate/usr/src/lib/libeti/form/common/
H A Dform.c138 /* merge - xmax/ymax is the minimum window size to hold field f */
140 merge(FIELD *f, FORM *form) /* adjust form dimensions to include field f */ function
212 merge(x[i], f);
/illumos-gate/usr/src/cmd/sort/common/
H A Dmerge.c29 #include "merge.h"
32 * External merge sort
34 * The following code implements the merge phase of sort(1) using a heap-based
40 * The N-way fan-out of the merge phase can lead to compromising memory
42 * the memory footprint during the merge phase:
44 * 1. Single use memory advice. Since we proceed through each merge file in
52 * 2. Number of merge files. The number of merge files is constrained based
55 * The number of merge files is calculated based on the average resident
63 * Once the merge sor
426 merge(sort_t *S) function
[all...]
/illumos-gate/usr/src/cmd/diff3/
H A Ddiff3prog.c106 static void merge(int m1, int m2);
170 merge(m, n);
276 merge(int m1, int m2) function
319 * merge overlapping changes in first file
329 /* merge overlapping changes in second */
/illumos-gate/usr/src/cmd/mdb/common/modules/fctl/
H A Dfctl.c971 char merge[1024]; local
1009 (void) mdb_snprintf(merge, sizeof (merge),
1015 mdb_printf("%s", merge);
1034 char merge[1024]; local
1071 (void) mdb_snprintf(merge, sizeof (merge),
1073 mdb_printf("%s", merge);
/illumos-gate/usr/src/uts/intel/io/dktp/drvobj/
H A Dstrategy.c1296 int alloc_mergebp, merge; local
1302 bp_merge = bp = qmerge_nextbp(qfp, NULL, &merge);
1304 while (merge && (next_bp = qmerge_nextbp(qfp, bp_merge, &merge))) {
/illumos-gate/usr/src/lib/libsqlite/tool/
H A Dlemon.c1449 ** A generic merge-sort program.
1491 static char *merge(a,b,cmp,offset) function
1559 ep = merge(ep,set[i],cmp,offset);
1565 for(i=0; i<LISTSIZE; i++) if( set[i] ) ep = merge(ep,set[i],cmp,offset);

Completed in 373 milliseconds