| /ast/src/lib/libast/features/ |
| H A D | sig.sh | 68 i1= j1=
73 $e) i1= j1=; break 2 ;;
75 case $i1 in
76 "") i1=$i j1=$j ;;
80 case $i1 in
81 ?*) i=$i1 j=$j1 ;;
|
| /ast/src/cmd/vczip/tests/ |
| H A D | tvcqsort.c | 28 int i1 = *((int*)one), i2 = *((int*)two); local
29 return i1 - i2;
|
| /ast/src/lib/libbz/ |
| H A D | blocksort.c | 68 discussion above) that i1 and i2 have a max
79 Int32 i1,
87 AssertD ( i1 != i2, "fullGtU(1)" );
89 c1 = block[i1];
92 i1++; i2++;
94 c1 = block[i1];
97 i1++; i2++;
99 c1 = block[i1];
102 i1++; i2++;
104 c1 = block[i1];
75 fullGtU( UChar* block, UInt16* quadrant, UInt32 nblock, Int32* workDone, Int32 i1, Int32 i2 ) argument
[all...] |
| /ast/src/cmd/dsslib/ip_t/ |
| H A D | iv-nested.c | 83 Itvl_t* i1; local
89 if ((i1 = (Itvl_t*)o1) == (i2 = (Itvl_t*)o2))
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 */
95 h = fvcmp(size, i1->hi, i2->hi);
96 l = fvcmp(size, i1->lo, i2->lo);
99 if (h >= 0) /* i1 contains i2 */
102 return 0; /* i1 crossin
[all...] |
| /ast/src/lib/libdss/ |
| H A D | cxcomp.c | 624 Cxinstruction_t* i1; local
659 i1 = i2 = (Cxinstruction_t*)(sfstrseek(cc->xp, 0, SEEK_CUR) - 1 * sizeof(Cxinstruction_t));
660 v1 = v2 = i1->data.variable;
662 type1 = type2 = i1->type;
666 i1 = (Cxinstruction_t*)(sfstrseek(cc->xp, 0, SEEK_CUR) - 2 * sizeof(Cxinstruction_t));
667 i2 = i1 + 1;
668 if ((i1->op == CX_GET || i1->op == CX_CAST && (i1 - 1)->op == CX_GET) && (f = cxrecode(cx, op, type1, type2, cx->disc)))
672 if ((*f)(cx, expr, &x, i1, i
[all...] |
| /ast/src/lib/libast/uwin/ |
| H A D | crypt.c | 163 * representation is "union"ed with 32 bit values "i0" and "i1", and, on
175 * 64-bit datatype since the relative order of i0 and i1 are unknown. It
249 long i1; member in struct:__anon315::__anon316
252 long i1: 32;
277 #define LOAD(d,d0,d1,bl) d0 = (bl).b32.i0, d1 = (bl).b32.i1
279 #define OR(d,d0,d1,bl) d0 |= (bl).b32.i0, d1 |= (bl).b32.i1
280 #define STORE(s,s0,s1,bl) (bl).b32.i0 = s0, (bl).b32.i1 = s1
755 B.b32.i1 = k ^ q1 ^ kp->b32.i1; \
|
| /ast/src/lib/libcmd/ |
| H A D | join.c | 545 static int i1,i2,i3; variable
546 #define outfield(p,i,n,f) (sfprintf(sfstdout, "[F%d#%d:%d,%d]", __LINE__, i1=i, i2=n, i3=f), outfield(p, i1, i2, i3))
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))
|
| /ast/src/lib/libpp/ |
| H A D | ppcontrol.c | 286 static int i1; local
359 if (ppexpr(&i1))
527 if (!(i1 = regexec(&map->re, p, elementsof(match), match, 0)))
535 else if (i1 != REG_NOMATCH)
536 regfatal(&map->re, 4, i1);
1058 i1 = *s;
1079 *s = i1;
1437 n1 = ppexpr(&i1);
1438 if (i1) c = sfsprintf(pp.tmpbuf, MAXTOKEN, "%luU", n1);
1661 if (((i1
[all...] |