i1
int i1;
if ((i1 = strlen(buf)) > 16) {
i0 = i1 = 0;
i0 = i, i1 = i + 1;
i0 = i1 = 16;
buf[i1 + 16] = 0;
center(10, buf + i1);
#define authsys_create(c,i1,i2,i3,ip) authunix_create((c),(i1),(i2),(i3),(ip))
i1 = strtopd(ibuf, &se, &f1);
if (i != i1 || u.f != f1 || se != se1)
int i, i1, ndig = 0, r = 1;
if (i != i1)
printf("\ti = %d but i1 = %d\n", i, i1);
int dItry, i, i1, ndig = 0, r = 1;
if (u.f != (i1 = strtopf(ibuf, &se1, &f1), f1)
|| se != se1 || i != i1) {
int32_t i1;
#define LOAD(d,d0,d1,bl) d0 = (bl).b32.i0, d1 = (bl).b32.i1
#define OR(d,d0,d1,bl) d0 |= (bl).b32.i0, d1 |= (bl).b32.i1
#define STORE(s,s0,s1,bl) (bl).b32.i0 = s0, (bl).b32.i1 = s1
B.b32.i1 = k ^ q1 ^ kp->b32.i1; \
_fn_qsort_string_compare(const void *i1, const void *i2)
const char *s1 = ((const char * const *)i1)[0];
int32_t i0,i1,jj0;
EXTRACT_WORDS(i0,i1,x);
if(i0<0) {i0=0x80000000;i1=0;}
else if((i0|i1)!=0) { i0=0x3ff00000;i1=0;}
if(((i0&i)|i1)==0) return x; /* x is integral */
i0 &= (~i); i1=0;
if((i1&i)==0) return x; /* x is integral */
j = i1 + (1<<(52-jj0));
if(j<(u_int32_t)i1) i0+=1; /* got a carry */
i1 = j;
i1 &= (~i);
INSERT_WORDS(x,i0,i1);
int32_t i0,i1,jj0;
EXTRACT_WORDS(i0,i1,x);
if(i0>=0) {i0=i1=0;}
else if(((i0&0x7fffffff)|i1)!=0)
{ i0=0xbff00000;i1=0;}
if(((i0&i)|i1)==0) return x; /* x is integral */
i0 &= (~i); i1=0;
if((i1&i)==0) return x; /* x is integral */
j = i1+(1<<(52-jj0));
if(j<(u_int32_t)i1) i0 +=1 ; /* got a carry */
i1=j;
i1 &= (~i);
INSERT_WORDS(x,i0,i1);
int32_t i0,i1,jj0;
EXTRACT_WORDS(i0,i1,x);
if(((i0&i)|i1)==0) { /* x is integral */
if((i1&i)==0) { /* x is integral */
INSERT_WORDS(*iptr,i0,i1&(~i));
u_int32_t i,i1;
EXTRACT_WORDS(i0,i1,x);
if(((i0&0x7fffffff)|i1)==0) return x;
i1 |= (i0&0x0fffff);
i0 |= ((i1|-i1)>>12)&0x80000;
if(((i0&i)|i1)==0) return x; /* x is integral */
if(((i0&i)|i1)!=0) {
if(jj0==19) i1 = 0x40000000; else
if((i1&i)==0) return x; /* x is integral */
if((i1&i)!=0) i1 = (i1&(~i))|((0x40000000)>>(jj0-20));
INSERT_WORDS(x,i0,i1);
u_int32_t i,i1;
i1 = (i0&0x07fffff);
i0 |= ((i1|-i1)>>9)&0x400000;
int32_t i0,i1,jj0;
EXTRACT_WORDS(i0,i1,x);
i1 = 0;
if(((i0&i)|i1)==0) return x; /* x is integral */
i0 &= (~i); i1=0;
if((i1&i)==0) return x; /* x is integral */
i1 &= (~i);
INSERT_WORDS(x,i0,i1);
struct { unsigned i1; unsigned i2; } ints;
fpregs[tm] = mtmp.ints.i1;
fpregs[ta] = atmp.ints.i1;
fpregs[tm] = mtmp.ints.i1;
fpregs[ta] = atmp.ints.i1;
struct { unsigned i1; unsigned i2; } ints;
fpregs[tm] = mtmp.ints.i1;
fpregs[ta] = atmp.ints.i1;
fpregs[tm] = mtmp.ints.i1;
fpregs[ta] = atmp.ints.i1;
int i1, i2, i3, i4, i8;
i1 = (8192 * 0);
bus_space_write_2(bst, bsh, ofs + i1, 0x1111);
if (bus_space_read_2(bst, bsh, ofs + i1) == 0x1111 &&
if (bus_space_read_2(bst, bsh, ofs + i1) == 0x1111 &&
if ((bus_space_read_2(bst, bsh, ofs + i1) == 0x1111 &&
(bus_space_read_2(bst, bsh, ofs + i1) == 0x3333 &&
if (bus_space_read_2(bst, bsh, ofs + i1) == 0x1111 ||
bus_space_read_2(bst, bsh, ofs + i1) == 0x4444)
long i1, i2, i3;
: "=a" (error), "=D" (i1),
find_entry(struct inotify_dir_entries *i1, struct inotify_dir_entries *i2)
if (i2->ide_entries[i].fileno != i1->ide_entries[i].fileno)
ASC_SCSIQ_1 i1;
unsigned long i1, i2, result;
i1 = strtoul(n1, NULL, 10);
result = i1 | i2;
i1, n1, i2, n2, result, ret);
int i1 = (int) 3.0;
int i1 = (int) 3.0;
int i1 = (int)3.0;
i1 = 10000, i2, i3
int i1;
I1 i1;
I1 i1;
function(_Bool cond, struct incomplete *i1, struct incomplete *i2)
struct incomplete local = i1;
*i1 = *i2;
return cond ? *i1 : *i2;
int i1;
sameas(struct devi *i1, struct devi *i2)
if (i1->i_pspec != i2->i_pspec)
if (i1->i_cfflags != i2->i_cfflags)
for (p1 = i1->i_locs, p2 = i2->i_locs; *p1 == *p2; p2++)
int i, j, m, i0, i1, j0, j1, nc;
for (i0 = 1; i0 <= m; i0 = i1 + 1) {
i1 = i0 - 1;
while (i1 < m && J[i1 + 1] == 0)
i1++;
j1 = J[i1 + 1] - 1;
J[i1] = j1;
for (i = i0, j = j0; i <= i1 && j <= j1; i++, j++)
while (i <= i1) {
change(file1, f1, file2, f2, i0, i1, j0, j1, &flags);
for (i0 = m; i0 >= 1; i0 = i1 - 1) {
i1 = i0 + 1;
while (i1 > 1 && J[i1 - 1] == 0)
i1--;
j1 = J[i1 - 1] + 1;
J[i1] = j1;
change(file1, f1, file2, f2, i1, i0, j1, j0, &flags);
size_t i1, i2;
i1 = i2 = 0;
while (i1 != n1 || i2 != n2) {
if (i1 == n1)
c = strcmp(ents1[i1].id, ents2[i2].id);
e1 = &ents1[i1++];
e1 = &ents1[i1++];
printf("\t%s\n", ents1[i1].id);
ents1[i1].id, ents1[i1].num);
printf("\t%s=", ents1[i1].id);
outstr(stdout, ents1[i1].str);
add_bigram(u_char i1, u_char i2)
if (i1 != '\n' && i2 != '\n')
bigrams[(i1<<8)+i2].count++;
unsigned char i1, i2;
if ((i1 = (unsigned char)hex[0] - '0') >= __arraycount(atoi16) ||
i1 = atoi16[i1];
if ((i1 | i2) & 0xF0)
r = i1;