| /illumos-gate/usr/src/tools/pmodes/ |
| H A D | binsearch.c | 44 int sorted; member in struct:itemlist
55 x->sorted = 1;
78 l->sorted = l->nused <= 1;
88 l->sorted = 0;
133 if (!l->sorted) {
135 l->sorted = 1;
|
| /illumos-gate/usr/src/cmd/prtvtoc/ |
| H A D | prtvtoc.c | 155 struct extpartition *sorted[V_NUMPAR + 1]; local
164 list = sorted;
169 qsort((char *)sorted, (uint_t)(list - sorted),
170 sizeof (*sorted), partcmp);
173 for (list = sorted; (part = *list) != NULL; ++list)
198 struct dk_part **sorted; local
201 sorted = calloc(sizeof (struct dk_part), efi->efi_nparts + 1);
203 list = sorted;
210 qsort((char *)sorted, (uint_
[all...] |
| /illumos-gate/usr/src/cmd/hal/hald/ |
| H A D | ids.c | 553 * Keep this sorted!
977 static gboolean sorted = FALSE; local
980 if (!sorted) {
984 sorted = TRUE;
|
| /illumos-gate/usr/src/lib/libuutil/common/ |
| H A D | uu_list.c | 318 int sorted = lp->ul_sorted; local
339 if (sorted && cmp > 0) {
|
| /illumos-gate/usr/src/cmd/rpcsvc/ |
| H A D | rusers.c | 77 static int sorted; variable
124 sorted++;
130 sorted++;
136 sorted++;
163 if (sorted)
169 if (sorted) {
187 if (sorted)
304 if (!sorted) {
430 if (!sorted) {
|
| /illumos-gate/usr/src/cmd/kvmstat/ |
| H A D | kvmstat.c | 125 kstat_instance_t **sorted, *ksi, *next; local
190 sorted = (void *)alloca(ninstances * sizeof (kstat_instance_t *));
199 sorted[ninstances++] = ksi;
208 qsort(sorted, ninstances, sizeof (kstat_instance_t *),
211 *head = sorted[0];
214 ksi = sorted[i];
215 ksi->ksi_next = i < ninstances - 1 ? sorted[i + 1] : NULL;
|
| /illumos-gate/usr/src/cmd/lvm/metassist/layout/ |
| H A D | layout_mirror.c | 565 dlist_t *sorted = NULL; local
575 sorted = dlist_insert_ordered(iter,
576 sorted, ASCENDING, compare_devconfig_sizes);
580 subs = sorted;
|
| /illumos-gate/usr/src/cmd/sgs/gprof/common/ |
| H A D | printgprof.c | 551 arctype sorted; local
556 * then insertion sort back on to sorted's children.
558 * *detachedp the rest of the arcs to be sorted.
559 * sorted arc list onto which you insertion sort.
562 sorted.arc_childlist = 0;
571 * insert it into sorted
573 for (prevp = &sorted; prevp->arc_childlist;
584 * reattach sorted children to parent
586 parentp->children = sorted.arc_childlist;
594 arctype sorted; local
[all...] |
| /illumos-gate/usr/src/cmd/mdb/common/modules/genunix/ |
| H A D | leaky.c | 692 leak_bufctl_t **sorted; local
698 sorted = lk_types[i].lt_sorted;
702 lkb = *sorted++;
731 sorted = lk_types[i].lt_sorted;
734 lkb = *sorted++;
835 * validate the mtab table now that it is sorted
|
| /illumos-gate/usr/src/lib/libdtrace/common/ |
| H A D | dt_aggregate.c | 1530 dt_ahashent_t *h, **sorted; local
1554 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *));
1556 if (sorted == NULL)
1560 sorted[i++] = h;
1565 dt_aggregate_qsort(dtp, sorted, nentries,
1573 qsort(sorted, nentries, sizeof (dt_ahashent_t *), sfunc);
1579 h = sorted[i];
1593 dt_free(dtp, sorted);
1673 dt_ahashent_t *h, **sorted = NULL, ***bundle, **nbundle; local
1953 * allocate our sorted arra
[all...] |
| /illumos-gate/usr/src/lib/libnsl/nss/ |
| H A D | netdir_inet.c | 1672 struct in_addr **sorted; local
1693 sorted = (struct in_addr **)sortbuf;
1758 * element for that class in the sorted address list. 'rc' is
1763 classnext[i] = &sorted[rc];
1773 /* Copy the sorted list to inaddrlist */
1774 (void) memcpy(inaddrlist, sorted,
2067 * in haddrlist, which have already been sorted by order_haddrlist_inet()
3054 * to determine if the addresses need to be sorted.
|
| /illumos-gate/usr/src/cmd/ps/ |
| H A D | ps.c | 1063 struct def_field *df, *sorted[NFIELDS]; local
1090 sorted[i++] = df;
1092 (void) qsort(sorted, NFIELDS, sizeof (void *), field_cmp);
1095 if (pos + strlen((df = sorted[i])->fname) + 1 >= 80) {
|
| /illumos-gate/usr/src/uts/i86pc/os/ |
| H A D | lgrpplat.c | 2296 * assumes and expects memnodes to be sorted in ascending order by physical
2308 boolean_t sorted; local
2318 sorted = B_TRUE;
2344 * Not sorted if starting address of current entry is bigger
2348 sorted = B_FALSE;
2354 * Don't need to sort if sorted already
2356 if (sorted == B_TRUE)
2986 * assumes and expects memnodes to be sorted in ascending order by
|
| /illumos-gate/usr/src/lib/libsqlite/tool/ |
| H A D | lemon.c | 233 struct state **sorted; /* Table of states sorted by state number */ member in struct:lemon
729 /* Extract the sorted basis of the new state. The basis was constructed
828 stp = lemp->sorted[i];
837 stp = lemp->sorted[i];
862 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){
870 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){
903 stp = lemp->sorted[i];
927 Action_add(&lemp->sorted[0]->ap,ACCEPT,sp,0);
933 stp = lemp->sorted[
[all...] |
| /illumos-gate/usr/src/uts/sun4u/sunfire/sys/ |
| H A D | fhc.h | 804 int sorted; member in struct:resizable_bd_list
|