Searched defs:one (Results 1 - 23 of 23) sorted by relevance

/ast/src/cmd/vczip/tests/
H A Dtvcqsort.c26 int intcmp(Void_t* one, Void_t* two, Void_t* disc) argument
28 int i1 = *((int*)one), i2 = *((int*)two);
/ast/src/lib/libast/uwin/
H A Dasinh.c93 one =1.0 ; local
98 if((t=copysign(x,one))>small)
100 s=one/t; return(copysign(log1p(t+t/(s+sqrt(one+s*s))),x)); }
H A Dexpm1.c115 const static double one=1.0, half=1.0/2.0; local
147 { x=one-scalb(one,-k); z += __exp__E(z,c);}
149 { x = __exp__E(z,c)-scalb(one,-k); x+=z; z=one;}
151 { x = __exp__E(z,c)+z; z=one;}
161 { ln2hi+ln2lo; return(-one);}
164 else return(-one);
170 return( finite(x) ? scalb(one,5000) : x);
H A Dlog1p.c121 const static double zero=0.0, negone= -1.0, one=1.0, local
134 if(copysign(x,one)<small) return(x);
135 k=(int)logb(one+x); z=scalb(x,-k); t=scalb(one,-k);
H A Dexp__E.c117 const static double zero=0.0, one=1.0, half=1.0/2.0, small=1.0E-19; local
119 if(copysign(x,one)>small) {
131 c += x*((xh*w-(q-(p+xp)))/(one-w)+c);
137 if(x!=zero) one+small; /* raise the inexact flag */
H A Dlog.c87 #define endian (((*(int *) &one)) ? 1 : 0)
382 double F, f, g, q, u, u2, v, zero = 0.0, one = 1.0; local
388 return (-one/zero);
459 double F, f, g, q, u, v, u2, one = 1.0; local
H A Dgamma.c131 static const double zero = 0., one = 1.0, tiny = 1e-300; variable
150 endian = (*(int *) &one) ? 1 : 0;
154 return(one/zero);
164 else return (one/x);
165 one+1e-20; /* Raise inexact flag. */
166 return (one/x);
185 z = one/(x*x);
190 u.a -= one;
213 y = x - one;
214 ym1 = y - one;
[all...]
H A Dlgamma.c71 * Two approximations are used, one centered at the
72 * minimum to ensure monotonicity; one centered at 2
95 static double zero = 0.0, one = 1.0; variable
155 endian = ((*(int *) &one)) ? 1 : 0;
279 double y, z, one = 1.0, zero = 0.0; local
287 return(one/zero);
298 return (one/zero);
H A Derf.c87 * is close to one. The interval is chosen because the fixed
90 * guarantee the error is less than one ulp for erf.
170 one = 1.0, variable
276 return (x > 0 ? one : -one); /* erf(+/-inf)= +/-1 */
292 s = fabs(x)-one;
294 Q = one+s*(qa1+s*(qa2+s*(qa3+s*(qa4+s*(qa5+s*qa6)))));
302 return (one-tiny);
304 return (tiny-one);
308 s = -one/
[all...]
/ast/src/cmd/tests/sfio/
H A Dtseek.c47 Sfoff_t one, two; local
83 one = sfseek(f,(Sfoff_t)0,2);
85 if(one != two)
/ast/src/lib/libvcodex/Vchuff/
H A Dvchbits.c29 static int sizecmp(Void_t* one, Void_t* two, Void_t* disc) argument
31 static int sizecmp(one,two,disc)
32 Void_t* one;
38 ssize_t *o = *((ssize_t**)one), *t = *((ssize_t**)two);
H A Dvchsize.c42 static int huffcmp(Void_t* one, Void_t* two, Void_t* disc) argument
44 static int huffcmp(one, two, disc)
45 Void_t* one;
51 Vchtree_t *o = *((Vchtree_t**)one);
H A Dvchtrie.c137 static int bitscmp(Void_t* one, Void_t* two, Void_t* disc) argument
139 static int bitscmp(one, two, disc)
140 Void_t* one;
145 Vcbit_t *o = *((Vcbit_t**)one), *t = *((Vcbit_t**)two);
H A Dvchuffgroup.c110 static int objcmp(Void_t* one, Void_t* two, Void_t* hdl) argument
112 static int objcmp(one, two, hdl)
113 Void_t* one;
119 Obj_t *o1 = (Obj_t*)one;
196 static int partcmp(Void_t* one, Void_t* two, Void_t* disc) argument
198 static int partcmp(one, two, disc)
199 Void_t* one;
207 p = *((size_t*)one); m = grp->ppos[p+1] - grp->ppos[p]; p = grp->ppos[p];
376 z += (tbl[k].cost = 2*8); /* one 0-byte and the run byte */
/ast/src/lib/libast/comp/
H A Dtsearch.c25 * implementation? that's what happens when one slimes their
77 static int treecompare(Dt_t* dt, char* one, char* two, Dtdisc_t* disc) argument
79 static int treecompare(dt, one, two, disc)
81 char* one;
86 return (*((Treedisc_t*)disc)->comparf)((Void_t*)one,(Void_t*)two);
159 ** in the tree if there is one. Since we are using a splay tree, a deleted
/ast/src/lib/libvgraph/
H A Dgraph.c9 static int nodecmp(Dt_t* nodes, Void_t* one, Void_t* two, Dtdisc_t* disc) argument
11 Grnode_t *n1 = (Grnode_t*)one;
38 static int edgecmp(Dt_t* edges, Void_t* one, Void_t* two, Dtdisc_t* disc) argument
40 Gredge_t *e1 = (Gredge_t*)one;
/ast/src/lib/librecsort/
H A Drs-rasp.c42 #define SPLAYCMP(one,two,o,t,endo,mp,cr) \
43 { if(one->order != two->order) \
44 cr = one->order < two->order ? -1 : 1; \
46 { if((mp = (cr = one->keylen) - two->keylen) > 0) cr -= mp; \
47 o = one->key+PREFIX; t = two->key+PREFIX; \
48 for(endo = one->key+cr;; ) \
307 static Rsobj_t* listmerge(reg Rsobj_t* one, reg Rsobj_t* two, reg int n) argument
309 static Rsobj_t* listmerge(one, two, n)
310 reg Rsobj_t* one;
319 endone = one
[all...]
H A Drsmerge.c446 #define MGCOMPARE(rs,one,two,reverse) \
447 ((one)->order == (two)->order ? mgcompare(rs,one,two,reverse) : \
448 (one)->order < (two)->order ? (reverse ? 1 : -1) : (reverse ? -1 : 1) )
465 static int mgcompare(Rs_t* rs, Rsobj_t* one, Rsobj_t* two, int reverse) argument
467 static int mgcompare(rs, one, two, reverse)
469 reg Rsobj_t* one;
478 o = one->key+SIZEOF_LONG; t = two->key+SIZEOF_LONG;
479 if((d = (l = one->keylen) - two->keylen) > 0)
487 { o = one
[all...]
/ast/src/lib/libvcodex/Vcwindow/
H A Dvcwfile.c48 static int sigcmp(Void_t* one, Void_t* two, Void_t* disc) argument
50 static int sigcmp(one, two, disc)
51 Void_t* one;
55 { Grint_t **o = (Grint_t**)one;
62 static int votecmp(Void_t* one, Void_t* two, Void_t* disc) argument
64 static int votecmp(one, two, disc)
65 Void_t* one;
69 { Cand_t *o = (Cand_t*)one;
76 static int idxcmp(Void_t* one, Void_t* two, Void_t* disc) argument
78 static int sigcmp(one, tw
[all...]
/ast/src/lib/libast/vmalloc/
H A Dvmprofile.c256 reg Pfobj_t *one, *two, *next; local
263 one = two = NIL(Pfobj_t*);
266 pf->next = one;
267 one = pf;
278 one = pfsort(one);
282 if(PFLINE(one) == 0 && PFLINE(two) == 0)
283 cmp = PFVM(one) > PFVM(two) ? 1 : -1;
284 else if(PFLINE(one) == 0)
288 else if((cmp = strcmp(PFFILE(one),PFFIL
[all...]
/ast/src/lib/libvcodex/
H A Dvcsfxsort.c70 static int intcmp(void* one, void* two, void* disc) argument
71 { return (int)(*((Vcsfxint_t*)one) - *((Vcsfxint_t*)two));
/ast/src/cmd/3d/
H A D3d.h429 char one[2]; member in struct:__anon7
/ast/src/lib/libast/misc/
H A Doptget.c28 * its a monster but its all in one place
657 * return is one past matching ')'
2395 Optpass_t one; local
2471 o = &one;
4695 * so one more pass to
4714 * one more pass for C

Completed in 144 milliseconds