/ast/src/lib/libcs/ |
H A D | msgindex.c | 35 register const char** lo; local 43 lo = msg_info.name; 45 while (lo <= hi) 47 mid = lo + (hi - lo) / 2; 60 lo = mid + 1;
|
/ast/src/lib/libast/string/ |
H A D | strpsearch.c | 55 register char* lo = (char*)tab; local 56 register char* hi = lo + (num - 1) * siz; 71 while (lo <= hi) 73 mid = lo + (sequential ? 0 : (((hi - lo) / siz) / 2) * siz); 99 while ((mid -= siz) >= lo && (s = *((unsigned char**)mid)) && ((c == MAP(m, *s)) || *s == '[' && c == MAP(m, *(s + 1)))); 120 lo = mid + siz;
|
H A D | strsearch.c | 42 register char* lo = (char*)tab; local 43 register char* hi = lo + (num - 1) * siz; 47 while (lo <= hi) 49 mid = lo + (((hi - lo) / siz) / 2) * siz; 53 lo = mid + siz;
|
/ast/src/lib/libast/uwin/ |
H A D | expm1.c | 116 double z,hi,lo,c; local 134 z=hi-(lo=k*ln2lo); 135 c=(hi-z)-lo;
|
H A D | exp.c | 126 double z,hi,lo,c; local 139 /* express x-k*ln2 as hi-lo and let x=hi-lo rounded */ 142 x=hi-(lo=k*ln2lo); 147 return scalb(1.0+(hi-(lo-(x*c)/(2.0-c))),k); 173 double z,hi,lo; local 186 /* express (x+c)-k*ln2 as hi-lo and let x=hi-lo rounded */ 189 x= hi - (lo = k*ln2lo-c); 195 return scalb(1.+(hi-(lo [all...] |
H A D | lgamma.c | 212 double y, z, t, r = 0, p, q, hi, lo; local 250 lo = a1_hi - hi; lo += p; lo += a1_lo; 251 r = lo*y + z*hi; /* q + r = y*(a0+p/q) */
|
/ast/src/lib/librecsort/ |
H A D | rs-radix.c | 64 reg Rsobj_t **bin, *t, *empty, *list, *endl, *next, **lo, **maxpart; local 71 for(lo = part, maxpart = part + UCHAR_MAX+1; lo < maxpart; ++lo) 72 *lo = NIL(Rsobj_t*); 83 lo = maxpart; n = 0; 89 if(lo > bin) 90 lo = bin; 96 endl = list ? (endl->right = *lo) : (list = *lo); [all...] |
H A D | rs-rasp.c | 208 reg Rsobj_t **bin, *t, *endl, *next, **lo, **maxpart; local 212 for(lo = part, maxpart = part + UCHAR_MAX+1; lo < maxpart; ++lo) 213 *lo = NIL(Rsobj_t*); 222 lo = maxpart; n = 0; 228 if(lo > bin) 229 lo = bin; 236 endl = (endl->right = *lo); 237 else endl = (list = *lo); [all...] |
/ast/src/cmd/dsslib/ip_t/ |
H A D | testiv.c | 79 unsigned char* lo; local 147 lo = fvplo(iv->size, prefix[iv->size], iv->r1, prefix); 150 sfprintf(sfstdout, "set %-42s %-42s %-42s %s\n", ivfmt(iv, lo, prefix[size]), ivfmt(iv, lo, -1), ivfmt(iv, hi, -1), v); 151 if (ivset(iv, lo, hi, hop))
|
H A D | iv-flat.c | 60 fvcpy(size, sg->seg.lo = (unsigned char*)(sg + 1), ((Ivseg_t*)obj)->lo); 61 fvcpy(size, sg->seg.hi = sg->seg.lo + size, ((Ivseg_t*)obj)->hi); 75 /* during build, segments are sorted by "lo" values only */ 81 return fvcmp(size, ((Ivseg_t*)o1)->lo, ((Ivseg_t*)o2)->lo); 93 if (fvcmp(size, ((Ivseg_t*)o1)->hi, ((Ivseg_t*)o2)->lo) < 0) 95 else if (fvcmp(size, ((Ivseg_t*)o1)->lo, ((Ivseg_t*)o2)->hi) > 0) 102 flatset(Iv_t* iv, unsigned char* lo, unsigned char* hi, void* data) argument 120 seg.lo 201 flatdel(Iv_t* iv, unsigned char* lo, unsigned char* hi) argument [all...] |
H A D | iv-nested.c | 34 /* a segment [lo,hi] and associated "data". */ 38 unsigned char* lo; /* low point */ member in struct:Itvl_s 64 fvcpy(size, np->lo = (unsigned char*)(np + 1), op->lo); 65 fvcpy(size, np->hi = np->lo + size, op->hi); 91 if (fvcmp(size, i1->hi, i2->lo) < 0) /* i1 is to the left of i2 */ 93 if (fvcmp(size, i1->lo, i2->hi) > 0) /* i1 is to the right of i2 */ 96 l = fvcmp(size, i1->lo, i2->lo); 122 static int nestset(Iv_t* iv, unsigned char* lo, unsigne argument 151 nestdel(Iv_t* iv, unsigned char* lo, unsigned char* hi) argument [all...] |
H A D | iv.h | 28 ** ivset(iv, lo, hi, data): specifies an interval [lo,hi] 31 ** ivdel(iv, lo, hi): deletes the specified interval [lo,hi]. 54 unsigned char* lo; member in struct:Ivseg_s 95 #define ivset(iv,lo,hi,dt) (*(iv)->meth->setf)((iv),(lo),(hi),(dt)) 97 #define ivdel(iv,lo,hi) (*(iv)->meth->delf)((iv),(lo),(hi))
|
H A D | ire.c | 59 int lo; member in struct:Re_s 77 ((Re_t*)r)->lo = ((Re_t*)r)->hi = 1; 215 if (re->lo) 244 sfprintf(sfstderr, " id=%05u n=%d invert=%d lo=%d hi=%d\n", re->id[0], re->n, re->invert, re->lo, re->hi); 335 re->lo = 0; 344 re->lo = (int)irenum(s, &e); 352 re->hi = re->lo; 353 if (*s != '}' || re->lo > re->hi && re->hi) 369 ire->must += re->lo; [all...] |
/ast/src/cmd/INIT/ |
H A D | release.c | 93 fprintf(stderr, "Usage: release [-V] [-h hi-date] [-l lo-date] [-r count] [ file ...]\n"); 203 unsigned long lo; local 210 lo = hi = 0; 218 if (!(lo = date(opt_info.arg, &e)) || *e) 283 lo = t; 336 if (t < lo)
|
/ast/src/lib/libast/tm/ |
H A D | tmxscan.c | 180 int lo; local 218 lo = TM_DAY_ABBREV; 222 lo = pedantic ? TM_DAY : TM_DAY_ABBREV; 225 if ((n = tmlex(s, &u, tm_info.format + lo, hi - lo, NiL, 0)) < 0) 233 lo = TM_MONTH_ABBREV; 237 lo = pedantic ? TM_MONTH : TM_MONTH_ABBREV; 240 if ((n = tmlex(s, &u, tm_info.format + lo, hi - lo, NiL, 0)) < 0)
|
H A D | tmxdate.c | 73 range(register char* s, char** e, char* set, int lo, int hi) argument 91 if (s == t || n < lo || n > hi)
|
/ast/src/cmd/3d/ |
H A D | lib.c | 343 register Map_t* lo; local 354 lo = tab->table; 355 end = lo + tab->size; 360 while (lo < hi) 363 tp = lo->key; 364 te = tp + lo->keysize; 365 message((-12, "T_PREFIX: %-*s: key=%-*s mid=%-*s", keysize, key, lo->keysize, lo->key, mid ? mid->keysize : 1, mid ? mid->key : "-")); 370 if ((sp >= se || *sp == '/') && (!val || !(*((long*)val) & (1 << (lo - tab->table))))) 372 mid = lo; [all...] |
/ast/src/lib/libbz/ |
H A D | blocksort.c | 177 static void simpleSort ( EState* s, Int32 lo, Int32 hi, Int32 d ) argument 190 bigN = hi - lo + 1; 199 i = lo + h; 210 if (j <= (lo + h - 1)) break; 223 if (j <= (lo + h - 1)) break; 236 if (j <= (lo + h - 1)) break; 310 Int32 sp, lo, hi, d; local 326 pop ( lo, hi, d ); 328 if (hi - lo < SMALL_THRESH || d > DEPTH_THRESH) { 329 simpleSort ( s, lo, h 517 Int32 lo = ftab[sb] & CLEARMASK; local 544 Int32 lo = ftab[sbn] & CLEARMASK; local [all...] |
/ast/src/lib/libpz/ |
H A D | pzlib.h | 56 size_t lo; /* rem lo frequency reps in pat */ member in struct:Pzrs_s 62 unsigned char* vp; /* lo freq code val ptr */ 63 unsigned char* ve; /* lo freq code val end */ 69 size_t rep; /* lo freq repeat count */ 70 size_t row; /* lo freq row count */
|
/ast/src/cmd/dsslib/num_t/ |
H A D | num_t.c | 769 register unsigned int lo; local 796 lo = 0; 798 while (lo != hi + 1) 800 ex = lo + ((hi - lo) >> 1); 802 lo = ex + 1; 867 lo = 0; 869 while (lo != hi + 1) 871 ex = lo + ((hi - lo) >> [all...] |
/ast/src/cmd/mailx/ |
H A D | local.c | 732 register char* lo = (char*)tab; local 733 register char* hi = lo + (num - 1) * siz; 742 while (lo <= hi) { 743 mid = lo + (sequential ? 0 : (((hi - lo) / siz) / 2) * siz); 762 while ((mid -= siz) >= lo && (c == *(s = *((unsigned char**)mid)) || *s == '[' && c == *(s + 1))); 781 lo = mid + siz; 803 register char* lo = (char*)tab; local 804 register char* hi = lo + (num - 1) * siz; 808 while (lo < [all...] |
/ast/src/lib/libcmd/ |
H A D | join.c | 626 #define outrec(p,n) (sfprintf(sfstdout, "[R#%d,%d,%lld,%lld:%-.*s{%d}:%-.*s{%d}]", __LINE__, i1=n, lo, hi, jp->file[0].fieldlen, cp1, jp->file[0].hit, jp->file[1].fieldlen, cp2, jp->file[1].hit), outrec(p, i1)) 640 Sfoff_t lo = -1; local 654 sfprintf(sfstdout, "[C#%d:%d(%c-%c),%d,%lld,%lld%s]", __LINE__, cmp, *cp1, *cp2, same, lo, hi, (jp->outmode & C_COMMON) ? ",COMMON" : ""); 678 else if (lo < 0 && (jp->outmode & C_COMMON)) 680 if ((lo = sfseek(jp->file[1].iop, (Sfoff_t)0, SEEK_CUR)) < 0) 685 lo -= jp->file[1].reclen; 687 if (cp2 = getrec(jp, 1, lo < 0)) 693 sfprintf(sfstdout, "[2#%d:0,%lld,%lld]", __LINE__, lo, hi); 730 lo = -1; 737 sfprintf(sfstdout, "[2#%d:0,%lld,%lld]", __LINE__, lo, h [all...] |
/ast/src/lib/libvcodex/ |
H A D | vcsfxsort.c | 55 static int chktodo(Vcsfx_t* sfx, Vcsfxint_t lo, Vcsfxint_t hi) argument 61 if(lo > hi) 66 return (lo == 0 && hi == sfx->nstr-1) ? 1 : 0; 74 static int chkdata(Vcsfx_t* sfx, Vcsfxint_t lo, Vcsfxint_t hi) argument 79 if(lo > hi || !chktodo(sfx,lo,hi)) 82 if(!(ary = (Vcsfxint_t*)malloc((hi-lo+1)*sizeof(Vcsfxint_t))) ) 84 for(k = 0, i = lo; i <= hi; ++i, ++k) 91 for(i = lo; i <= hi; i = k) /* check inversion relations */ 112 static int chksorted(Vcsfx_t* sfx, Vcsfxint_t lo, Vcsfxint_ argument [all...] |
/ast/src/lib/libast/port/ |
H A D | astconf.c | 868 register Conf_t* lo = mid; local 929 while (lo <= hi) 931 mid = lo + (hi - lo) / 2; 938 lo = (Conf_t*)conf; 945 } while (mid-- > lo && streq(mid->name, look->name)); 947 hi = lo + conf_elements - 1; 958 lo = mid + 1;
|
/ast/src/lib/libast/regex/ |
H A D | regcomp.c | 145 node(Cenv_t* env, int type, int lo, int hi, size_t extra) argument 149 DEBUG_TEST(0x0800,(sfprintf(sfstdout, "%s:%d node(%d,%d,%d,%u)\n", file, line, type, lo, hi, sizeof(Rex_t) + extra)),(0)); 155 e->lo = lo; 333 unsigned int m = e->lo + f->lo; 346 e->lo = m; 432 if ((env->stats.m += e->lo) < n) 440 if (e->lo != e->hi) 579 if (e->lo < [all...] |