HomeSort by: relevance | last modified time | path
    Searched defs:i1 (Results 1 - 21 of 21) sorted by relevancy

  /src/lib/libm/src/
s_trunc.c 43 int32_t i0,i1,jj0; local in function:trunc
45 EXTRACT_WORDS(i0,i1,x);
51 i1 = 0;
55 if(((i0&i)|i1)==0) return x; /* x is integral */
57 i0 &= (~i); i1=0;
65 if((i1&i)==0) return x; /* x is integral */
67 i1 &= (~i);
69 INSERT_WORDS(x,i0,i1);
s_ceil.c 40 int32_t i0,i1,jj0; local in function:__strong_alias
42 EXTRACT_WORDS(i0,i1,x);
47 if(i0<0) {i0=0x80000000;i1=0;}
48 else if((i0|i1)!=0) { i0=0x3ff00000;i1=0;}
52 if(((i0&i)|i1)==0) return x; /* x is integral */
55 i0 &= (~i); i1=0;
63 if((i1&i)==0) return x; /* x is integral */
68 j = i1 + (1<<(52-jj0));
69 if(j<(u_int32_t)i1) i0+=1; /* got a carry *
    [all...]
s_floor.c 40 int32_t i0,i1,jj0; local in function:floor
42 EXTRACT_WORDS(i0,i1,x);
47 if(i0>=0) {i0=i1=0;}
48 else if(((i0&0x7fffffff)|i1)!=0)
49 { i0=0xbff00000;i1=0;}
53 if(((i0&i)|i1)==0) return x; /* x is integral */
56 i0 &= (~i); i1=0;
64 if((i1&i)==0) return x; /* x is integral */
69 j = i1+(1<<(52-jj0));
70 if(j<(u_int32_t)i1) i0 +=1 ; /* got a carry *
    [all...]
s_modf.c 41 int32_t i0,i1,jj0; local in function:__strong_alias
43 EXTRACT_WORDS(i0,i1,x);
51 if(((i0&i)|i1)==0) { /* x is integral */
72 if((i1&i)==0) { /* x is integral */
79 INSERT_WORDS(*iptr,i0,i1&(~i));
s_rint.c 41 u_int32_t i,i1; local in function:rint
43 EXTRACT_WORDS(i0,i1,x);
48 if(((i0&0x7fffffff)|i1)==0) return x;
49 i1 |= (i0&0x0fffff);
51 i0 |= ((i1|-i1)>>12)&0x80000;
60 if(((i0&i)|i1)==0) return x; /* x is integral */
62 if(((i0&i)|i1)!=0) {
63 if(jj0==19) i1 = 0x40000000; else
72 if((i1&i)==0) return x; /* x is integral *
    [all...]
s_rintf.c 34 u_int32_t i,i1; local in function:rintf
46 i1 = (i0&0x07fffff);
48 i0 |= ((i1|-i1)>>9)&0x400000;
  /src/tests/usr.bin/indent/
opt_cs.c 13 int i1 = (int) 3.0; variable in typeref:typename:int
19 int i1 = (int) 3.0; variable in typeref:typename:int
25 int i1 = (int)3.0; variable in typeref:typename:int
  /src/games/hack/
hack.rip.c 108 int i1; local in function:outrip
109 if ((i1 = strlen(buf)) > 16) {
111 i0 = i1 = 0;
114 i0 = i, i1 = i + 1;
116 i0 = i1 = 16;
117 buf[i1 + 16] = 0;
121 center(10, buf + i1);
  /src/tests/usr.bin/xlint/lint1/
msg_329.c 9 int i1; member in union:u
init_c99.c 269 int i1; member in struct:ten
675 typedef enum I1 {
677 } I1;
683 I1 i1; member in struct:init_nested_struct::Inner1
704 I1 i1; member in struct:init_nested_struct::Inner2
  /src/lib/libc/gdtoa/test/
dtest.c 67 int i, i1, ndig = 0, r = 1; local in function:main
101 i1 = strtopd(ibuf, &se, &f1);
102 if (i != i1 || u.f != f1 || se != se1)
ftest.c 65 int dItry, i, i1, ndig = 0, r = 1; local in function:main
96 if (u.f != (i1 = strtopf(ibuf, &se1, &f1), f1)
97 || se != se1 || i != i1) {
101 if (i != i1)
102 printf("\ti = %d but i1 = %d\n", i, i1);
  /src/sys/arch/mac68k/dev/
if_ae.c 41 int i1, i2, i3, i4, i8; local in function:ae_size_card_memory
47 i1 = (8192 * 0);
58 bus_space_write_2(bst, bsh, ofs + i1, 0x1111);
69 if (bus_space_read_2(bst, bsh, ofs + i1) == 0x1111 &&
76 if (bus_space_read_2(bst, bsh, ofs + i1) == 0x1111 &&
82 if ((bus_space_read_2(bst, bsh, ofs + i1) == 0x1111 &&
84 (bus_space_read_2(bst, bsh, ofs + i1) == 0x3333 &&
88 if (bus_space_read_2(bst, bsh, ofs + i1) == 0x1111 ||
89 bus_space_read_2(bst, bsh, ofs + i1) == 0x4444)
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
sanitizer_stackdepot_test.cc 23 u32 i1 = StackDepotPut(s1); local in function:__sanitizer::TEST
24 StackTrace stack = StackDepotGet(i1);
36 u32 i1 = StackDepotPut(StackTrace()); local in function:__sanitizer::TEST
37 StackTrace stack = StackDepotGet(i1);
49 u32 i1 = StackDepotPut(s1); local in function:__sanitizer::TEST
51 EXPECT_EQ(i1, i2);
52 StackTrace stack = StackDepotGet(i1);
61 u32 i1 = StackDepotPut(s1); local in function:__sanitizer::TEST
65 EXPECT_NE(i1, i2);
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_bitvector.h 131 for (uptr i1 = 0; i1 < BV::kSize; i1++) local in function:__sanitizer::TwoLevelBitVector::setAll
132 l2_[i0][i1].setAll();
147 uptr i1 = idx1(idx); local in function:__sanitizer::TwoLevelBitVector::setBit
149 if (!l1_[i0].getBit(i1)) {
150 l1_[i0].setBit(i1);
151 l2_[i0][i1].clear();
153 bool res = l2_[i0][i1].setBit(i2);
155 // idx, i0, i1, i2, res)
162 uptr i1 = idx1(idx); local in function:__sanitizer::TwoLevelBitVector::clearBit
176 uptr i1 = idx1(idx); local in function:__sanitizer::TwoLevelBitVector::getBit
185 uptr i1 = l1_[i0].getAndClearFirstOne(); local in function:__sanitizer::TwoLevelBitVector::getAndClearFirstOne
203 uptr i1 = t.getAndClearFirstOne(); local in function:__sanitizer::TwoLevelBitVector::setUnion
222 uptr i1 = t.getAndClearFirstOne(); local in function:__sanitizer::TwoLevelBitVector::setIntersection
240 uptr i1 = t.getAndClearFirstOne(); local in function:__sanitizer::TwoLevelBitVector::setDifference
261 uptr i1 = t.getAndClearFirstOne(); local in function:__sanitizer::TwoLevelBitVector::intersectsWith
    [all...]
  /src/usr.bin/infocmp/
infocmp.c 353 size_t i1, i2; local in function:compare_ents
357 i1 = i2 = 0;
362 while (i1 != n1 || i2 != n2) {
363 if (i1 == n1)
368 c = strcmp(ents1[i1].id, ents2[i2].id);
370 e1 = &ents1[i1++];
373 e1 = &ents1[i1++];
387 printf("\t%s\n", ents1[i1].id);
397 ents1[i1].id, ents1[i1].num)
    [all...]
  /src/sys/arch/hppa/spmath/
fpudispatch.c 666 struct { unsigned i1; unsigned i2; } ints; member in struct:decode_06::__anon9edda888010a::__anon9edda8880208
716 fpregs[tm] = mtmp.ints.i1;
718 fpregs[ta] = atmp.ints.i1;
769 fpregs[tm] = mtmp.ints.i1;
770 fpregs[ta] = atmp.ints.i1;
790 struct { unsigned i1; unsigned i2; } ints; member in struct:decode_26::__anon9edda888030a::__anon9edda8880408
823 fpregs[tm] = mtmp.ints.i1;
825 fpregs[ta] = atmp.ints.i1;
861 fpregs[tm] = mtmp.ints.i1;
862 fpregs[ta] = atmp.ints.i1;
    [all...]
  /src/usr.bin/mail/
mime_codecs.c 412 unsigned char i1, i2; local in function:_qp_cfromhex
415 if ((i1 = (unsigned char)hex[0] - '0') >= __arraycount(atoi16) ||
418 i1 = atoi16[i1];
420 if ((i1 | i2) & 0xF0)
422 r = i1;
  /src/sys/arch/xen/xen/
privcmd.c 841 long i1, i2, i3; local in function:privcmd_ioctl
847 : "=a" (error), "=D" (i1),
  /src/lib/libcrypt/
crypt.c 149 * representation is "union"ed with 32 bit values "i0" and "i1", and, on
161 * 64-bit datatype since the relative order of i0 and i1 are unknown. It
233 int32_t i1; member in struct:__anonc87fd5ce010a::__anonc87fd5ce0208
257 #define LOAD(d,d0,d1,bl) d0 = (bl).b32.i0, d1 = (bl).b32.i1
259 #define OR(d,d0,d1,bl) d0 |= (bl).b32.i0, d1 |= (bl).b32.i1
260 #define STORE(s,s0,s1,bl) (bl).b32.i0 = s0, (bl).b32.i1 = s1
814 B.b32.i1 = k ^ q1 ^ kp->b32.i1; \
  /src/sys/dev/ic/
advlib.h 623 ASC_SCSIQ_1 i1; member in struct:asc_risc_q

Completed in 21 milliseconds