Searched refs:min (Results 1 - 25 of 54) sorted by relevance

123

/ast/src/cmd/sort/
H A Dgen.c48 unsigned long min; member in struct:__anon217
66 if (state.part >= state.range['d'].min)
86 state.range['d'].min = sizeof(state.seed) * CHAR_BIT;
87 state.range['r'].min = 0x00001000;
88 state.range['s'].min = 0x00100000;
136 state.range[c].min = strton(opt_info.arg, &e, NiL, 0);
147 if (state.range['l'].min)
148 ROUND(state.range['s'].min, state.range['l'].min);
152 state.range['r'].min
[all...]
/ast/src/cmd/dsslib/ip_t/
H A Dptopen.c42 if (a->max < b->min)
44 if (a->min > b->max)
56 b->min = a->min;
111 * insert prefix range min..max into tab
116 ptinsert(Pt_t* tab, Ptaddr_t min, Ptaddr_t max) argument
123 key.min = key.max = min ? (min - 1) : min;
157 ptdelete(Pt_t* tab, Ptaddr_t min, Ptaddr_t max) argument
[all...]
H A Dptdump.c35 sfprintf(sp, "%0*I*x %0*I*x %-16s %-16s\n", sizeof(p->min) * 2, sizeof(p->min), p->min, sizeof(p->max) * 2, sizeof(p->max), p->max, fmtip4(p->min, -1), fmtip4(p->max, -1));
H A Dptvopen.c50 if (fvcmp(p->size, a->max, b->min) < 0)
52 if (fvcmp(p->size, a->min, b->max) > 0)
65 fvcpy(p->size, b->min = (unsigned char*)(b + 1), a->min);
66 fvcpy(p->size, b->max = b->min + p->size, a->max);
130 * insert prefix range min..max into tab
135 ptvinsert(Ptv_t* tab, Ptvaddr_t min, Ptvaddr_t max) argument
143 if (fvcmp(tab->size, min, tab->r[2]) >= 0)
145 fvsub(tab->size, tab->r[3], min, tab->r[2]);
146 key.min
190 ptvdelete(Ptv_t* tab, Ptvaddr_t min, Ptvaddr_t max) argument
[all...]
H A Dptdifference.c44 if (!bp || ap->max < bp->min)
46 if (!ptinsert(t, ap->min, ap->max))
50 else if (ap->min > bp->max)
54 if (ap->min < bp->min && !ptinsert(t, ap->min, bp->min - 1))
68 if (!(bp = (Ptprefix_t*)dtnext(b->dict, bp)) || bp->min > ap->max)
74 if (bp->min > m && !ptinsert(t, m, bp->min
[all...]
H A Dptcover.c43 if (ap->min > bp->max)
47 if (ap->max >= bp->min && !ptinsert(t, ap->min, ap->max))
H A Dptmatch.c34 key.min = key.max = addr;
H A Dptvmatch.c34 key.min = key.max = addr;
H A Dptvdump.c35 sfprintf(sp, "%s %s %-24s %-24s\n", fmtfv(a->size, p->min, 16, 0, 0), fmtfv(a->size, p->max, 16, 0, 0), fmtip6(p->min, -1), fmtip6(p->max, -1));
H A Dptintersect.c42 if (ap->max < bp->min)
44 else if (ap->min > bp->max)
48 if (!ptinsert(t, (ap->min > bp->min) ? ap->min : bp->min, (ap->max < bp->max) ? ap->max : bp->max))
H A Dptvintersect.c42 if (fvcmp(a->size, ap->max, bp->min) < 0)
44 else if (fvcmp(a->size, ap->min, bp->max) > 0)
48 if (!ptvinsert(t, fvcmp(a->size, ap->min, bp->min) > 0 ? ap->min : bp->min, fvcmp(a->size, ap->max, bp->max) < 0 ? ap->max : bp->max))
H A Dptvdifference.c43 if (!bp || fvcmp(a->size, ap->max, bp->min) < 0)
45 if (!ptvinsert(t, ap->min, ap->max))
49 else if (fvcmp(a->size, ap->min, bp->max) > 0)
53 if (fvcmp(a->size, ap->min, bp->min) < 0)
56 fvsub(a->size, a->r[1], bp->min, a->r[0]);
57 if (!ptvinsert(t, ap->min, a->r[1]))
73 if (!(bp = (Ptvprefix_t*)dtnext(b->dict, bp)) || fvcmp(a->size, bp->min, ap->max) > 0)
79 if (fvcmp(a->size, bp->min, a->r[1]) > 0)
81 fvsub(a->size, a->r[2], bp->min,
[all...]
H A Dptsubset.c39 if (!bp || ap->max < bp->min || ap->min < bp->min)
H A Dptvcover.c43 if (fvcmp(a->size, ap->min, bp->max) > 0)
47 if (fvcmp(a->size, ap->max, bp->min) >= 0 && !ptvinsert(t, ap->min, ap->max))
H A Dptvsubset.c39 if (!bp || fvcmp(a->size, ap->max, bp->min) < 0 || fvcmp(a->size, ap->min, bp->min) < 0)
H A Dptequal.c41 if (ap->min != bp->min)
H A Dptinvert.c41 if (m < ap->min && !ptinsert(t, m, ap->min - 1))
H A Dptvequal.c41 if (fvcmp(a->size, ap->min, bp->min))
H A Dptaddresses.c37 n += (Ptcount_t)(ap->max - ap->min) + 1;
H A Dptunion.c37 if (!ptinsert(a, bp->min, bp->max))
H A Dptvunion.c37 if (!ptvinsert(a, bp->min, bp->max))
H A Dptrebit.c37 if (!ptinsert(b, PTMIN(ap->min, m), PTMAX(ap->max, m)))
/ast/src/lib/libast/string/
H A Dfmtre.c38 short min; member in struct:Stack_s
118 if (p->min = *s == '-')
151 p->min = 0;
158 if (p->min = *s == '-')
187 p->min = 0;
198 if (p->min)
/ast/src/lib/libz/
H A Dinftrees.c48 unsigned min, max; /* minimum and maximum code lengths */ local
132 for (min = 1; min <= MAXBITS; min++)
133 if (count[min] != 0) break;
134 if (root < min) root = min;
209 len = min; /* starting code length */
241 min = fill; /* save offset to next table */
272 next += min; /* her
[all...]
/ast/src/lib/libvcodex/
H A Dvcsfxsort.c114 Vcsfxint_t *min = idx+lo, *max = idx+hi; local
117 for(i = min; i <= max; ++i)
119 min = min == sfx->idx ? min+1 : min;
121 for(; min <= max; ++min)
122 DEBUG_ASSERT(cmpsfx(sfx, min[-1], min[
170 sfxswap(Vcsfxint_t* min, Vcsfxint_t* mid, Vcsfxint_t* max) argument
187 sfxqsort(Vcsfx_t* sfx, Vcsfxint_t* min, Vcsfxint_t* max, Vcsfxint_t hdr, int period) argument
[all...]

Completed in 304 milliseconds

123