| /dragonfly/contrib/gcc-4.7/gcc/ |
| H A D | bitmap.h | 250 bi->bits = bi->elt1->bits[bi->word_no]; in bmp_iter_set_init()
310 bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no]; in bmp_iter_and_init()
355 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
364 bi->bits = bi->elt1->bits[bi->word_no]; in bmp_iter_and_compl_init()
365 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
366 bi->bits &= ~bi->elt2->bits[bi->word_no]; in bmp_iter_and_compl_init()
436 bi->bits = bi->elt1->bits[bi->word_no]; in bmp_iter_set()
479 bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no]; in bmp_iter_and()
542 bi->bits = bi->elt1->bits[bi->word_no]; in bmp_iter_and_compl()
543 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| H A D | tree-complex.c | 861 tree ar, tree ai, tree br, tree bi, in expand_complex_addition() argument
879 ri = bi; in expand_complex_addition()
909 ri = bi; in expand_complex_addition()
994 ri = ai, ai = bi, bi = ri; in expand_complex_multiplication()
1047 if (ar == br && ai == bi) in expand_complex_multiplication()
1079 t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, bi, bi); in expand_complex_div_straight()
1102 tree ar, tree ai, tree br, tree bi, in expand_complex_div_wide() argument
1255 tree ar, tree ai, tree br, tree bi, in expand_complex_division() argument
1441 tree ac, ar, ai, bc, br, bi; in expand_complex_operations_1() local
1532 br = ar, bi = ai; in expand_complex_operations_1()
[all …]
|
| H A D | regstat.c | 129 bitmap_iterator bi; in regstat_bb_compute_ri() local
137 EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi) in regstat_bb_compute_ri()
164 bitmap_iterator bi; in regstat_bb_compute_ri() local
174 EXECUTE_IF_SET_IN_BITMAP (local_live, 0, regno, bi) in regstat_bb_compute_ri()
195 EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi) in regstat_bb_compute_ri()
332 EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi) in regstat_bb_compute_ri()
351 bitmap_iterator bi; in regstat_compute_ri() local
374 EXECUTE_IF_SET_IN_BITMAP (setjmp_crosses, FIRST_PSEUDO_REGISTER, regno, bi) in regstat_compute_ri()
461 bitmap_iterator bi; in regstat_bb_compute_calls_crossed() local
462 EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi) in regstat_bb_compute_calls_crossed()
|
| H A D | df-problems.c | 219 bitmap_iterator bi; in df_rd_alloc() local
434 bitmap_iterator bi; in df_rd_local_compute() local
473 bitmap_iterator bi; in df_rd_init_solution() local
532 bitmap_iterator bi; in df_rd_transfer_function() local
740 bitmap_iterator bi; in df_lr_alloc() local
785 bitmap_iterator bi; in df_lr_reset() local
897 bitmap_iterator bi; in df_lr_local_compute() local
951 bitmap_iterator bi; in df_lr_init() local
1359 bitmap_iterator bi; in df_live_alloc() local
1405 bitmap_iterator bi; in df_live_reset() local
[all …]
|
| /dragonfly/contrib/gcc-8.0/gcc/ |
| H A D | bitmap.h | 420 bi->bits = bi->elt1->bits[bi->word_no]; in bmp_iter_set_init()
480 bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no]; in bmp_iter_and_init()
526 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx) in bmp_iter_and_compl_init()
535 bi->bits = bi->elt1->bits[bi->word_no]; in bmp_iter_and_compl_init()
536 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx) in bmp_iter_and_compl_init()
537 bi->bits &= ~bi->elt2->bits[bi->word_no]; in bmp_iter_and_compl_init()
607 bi->bits = bi->elt1->bits[bi->word_no]; in bmp_iter_set()
653 bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no]; in bmp_iter_and()
722 bi->bits = bi->elt1->bits[bi->word_no]; in bmp_iter_and_compl()
723 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx) in bmp_iter_and_compl()
[all …]
|
| H A D | tree-complex.c | 911 tree ar, tree ai, tree br, tree bi, in expand_complex_addition() argument
929 ri = bi; in expand_complex_addition()
959 ri = bi; in expand_complex_addition()
1045 ri = ai, ai = bi, bi = ri; in expand_complex_multiplication()
1098 if (ar == br && ai == bi) in expand_complex_multiplication()
1130 t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, bi, bi); in expand_complex_div_straight()
1153 tree ar, tree ai, tree br, tree bi, in expand_complex_div_wide() argument
1314 tree ar, tree ai, tree br, tree bi, in expand_complex_division() argument
1509 tree ac, ar, ai, bc, br, bi; in expand_complex_operations_1() local
1600 br = ar, bi = ai; in expand_complex_operations_1()
[all …]
|
| H A D | df-problems.c | 183 bitmap_iterator bi; in df_rd_alloc() local
390 bitmap_iterator bi; in df_rd_local_compute() local
433 bitmap_iterator bi; in df_rd_init_solution() local
489 bitmap_iterator bi; in df_rd_transfer_function() local
618 bitmap_iterator bi; in df_rd_dump_defs_set() local
754 bitmap_iterator bi; in df_lr_alloc() local
799 bitmap_iterator bi; in df_lr_reset() local
891 bitmap_iterator bi; in df_lr_local_compute() local
949 bitmap_iterator bi; in df_lr_init() local
1360 bitmap_iterator bi; in df_live_alloc() local
[all …]
|
| H A D | lra-assigns.c | 491 bitmap_iterator bi; in find_hard_regno_for_1() local
515 0, k, bi) in find_hard_regno_for_1()
836 bitmap_iterator bi; in setup_try_hard_regno_pseudos() local
939 bitmap_iterator bi; in spill_for() local
1156 bitmap_iterator bi; in setup_live_pseudos_and_spill_after_risky_transforms() local
1252 bitmap_iterator bi; in improve_inheritance() local
1322 bitmap_iterator bi; in find_all_spills_for() local
1367 bitmap_iterator bi; in assign_by_spills() local
1588 bitmap_iterator bi; in lra_assign() local
1681 bitmap_iterator bi; in find_reload_regno_insns() local
[all …]
|
| H A D | regstat.c | 115 bitmap_iterator bi; in regstat_bb_compute_ri() local
122 EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi) in regstat_bb_compute_ri()
141 bitmap_iterator bi; in regstat_bb_compute_ri() local
159 EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi) in regstat_bb_compute_ri()
239 bitmap_iterator bi; in regstat_compute_ri() local
259 EXECUTE_IF_SET_IN_BITMAP (setjmp_crosses, FIRST_PSEUDO_REGISTER, regno, bi) in regstat_compute_ri()
336 bitmap_iterator bi; in regstat_bb_compute_calls_crossed() local
337 EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi) in regstat_bb_compute_calls_crossed()
|
| /dragonfly/contrib/gmp/mpz/ |
| H A D | rrandomb.c | 54 mp_bitcnt_t bi; in gmp_rrandomb() local
69 bi = nbits; in gmp_rrandomb()
75 bi = (bi < chunksize) ? 0 : bi - chunksize; in gmp_rrandomb()
77 if (bi == 0) in gmp_rrandomb()
80 rp[bi / GMP_NUMB_BITS] ^= CNST_LIMB (1) << bi % GMP_NUMB_BITS; in gmp_rrandomb()
84 bi = (bi < chunksize) ? 0 : bi - chunksize; in gmp_rrandomb()
86 mpn_incr_u (rp + bi / GMP_NUMB_BITS, CNST_LIMB (1) << bi % GMP_NUMB_BITS); in gmp_rrandomb()
88 if (bi == 0) in gmp_rrandomb()
|
| /dragonfly/contrib/gmp/mpn/generic/ |
| H A D | random2.c | 59 mp_bitcnt_t bi; in gmp_rrandomb() local
74 bi = nbits; in gmp_rrandomb()
80 bi = (bi < chunksize) ? 0 : bi - chunksize; in gmp_rrandomb()
82 if (bi == 0) in gmp_rrandomb()
85 rp[bi / GMP_NUMB_BITS] ^= CNST_LIMB (1) << bi % GMP_NUMB_BITS; in gmp_rrandomb()
89 bi = (bi < chunksize) ? 0 : bi - chunksize; in gmp_rrandomb()
91 mpn_incr_u (rp + bi / GMP_NUMB_BITS, CNST_LIMB (1) << bi % GMP_NUMB_BITS); in gmp_rrandomb()
93 if (bi == 0) in gmp_rrandomb()
|
| H A D | mod_1_2.c | 35 mp_limb_t bi; in mpn_mod_1s_2p_cps() local
44 invert_limb (bi, b); in mpn_mod_1s_2p_cps()
48 udiv_rnd_preinv (B2modb, B1modb, b, bi); in mpn_mod_1s_2p_cps()
49 udiv_rnd_preinv (B3modb, B2modb, b, bi); in mpn_mod_1s_2p_cps()
51 cps[0] = bi; in mpn_mod_1s_2p_cps()
73 mp_limb_t rh, rl, bi, q, ph, pl, ch, cl, r; in mpn_mod_1s_2p() local
89 bi = cps[0]; in mpn_mod_1s_2p()
92 rl << cnt, b, bi); in mpn_mod_1s_2p()
125 bi = cps[0]; in mpn_mod_1s_2p()
134 (rh << cnt) | (rl >> (GMP_LIMB_BITS - cnt)), b, bi); in mpn_mod_1s_2p()
[all …]
|
| H A D | powlo.c | 26 #define getbit(p,bi) \ argument
27 ((p[(bi - 1) / GMP_LIMB_BITS] >> (bi - 1) % GMP_LIMB_BITS) & 1)
30 getbits (const mp_limb_t *p, mp_bitcnt_t bi, int nbits) in getbits() argument
36 if (bi < nbits) in getbits()
38 return p[0] & (((mp_limb_t) 1 << bi) - 1); in getbits()
42 bi -= nbits; /* bit index of low bit to extract */ in getbits()
43 i = bi / GMP_NUMB_BITS; /* word index of low bit to extract */ in getbits()
44 bi %= GMP_NUMB_BITS; /* bit index in low word */ in getbits()
45 r = p[i] >> bi; /* extract (low) bits */ in getbits()
46 nbits_in_r = GMP_NUMB_BITS - bi; /* number of bits now in r */ in getbits()
|
| H A D | mod_1_4.c | 35 mp_limb_t bi; in mpn_mod_1s_4p_cps() local
44 invert_limb (bi, b); in mpn_mod_1s_4p_cps()
48 udiv_rnd_preinv (B2modb, B1modb, b, bi); in mpn_mod_1s_4p_cps()
49 udiv_rnd_preinv (B3modb, B2modb, b, bi); in mpn_mod_1s_4p_cps()
50 udiv_rnd_preinv (B4modb, B3modb, b, bi); in mpn_mod_1s_4p_cps()
51 udiv_rnd_preinv (B5modb, B4modb, b, bi); in mpn_mod_1s_4p_cps()
53 cps[0] = bi; in mpn_mod_1s_4p_cps()
77 mp_limb_t rh, rl, bi, q, ph, pl, ch, cl, r; in mpn_mod_1s_4p() local
145 bi = cps[0]; in mpn_mod_1s_4p()
154 (rh << cnt) | (rl >> (GMP_LIMB_BITS - cnt)), b, bi); in mpn_mod_1s_4p()
[all …]
|
| H A D | mod_1_3.c | 35 mp_limb_t bi; in mpn_mod_1s_3p_cps() local
44 invert_limb (bi, b); in mpn_mod_1s_3p_cps()
46 B1modb = -b * ((bi >> (GMP_LIMB_BITS-cnt)) | (CNST_LIMB(1) << cnt)); in mpn_mod_1s_3p_cps()
48 udiv_rnd_preinv (B2modb, B1modb, b, bi); in mpn_mod_1s_3p_cps()
49 udiv_rnd_preinv (B3modb, B2modb, b, bi); in mpn_mod_1s_3p_cps()
50 udiv_rnd_preinv (B4modb, B3modb, b, bi); in mpn_mod_1s_3p_cps()
52 cps[0] = bi; in mpn_mod_1s_3p_cps()
75 mp_limb_t rh, rl, bi, q, ph, pl, ch, cl, r; in mpn_mod_1s_3p() local
132 bi = cps[0]; in mpn_mod_1s_3p()
141 (rh << cnt) | (rl >> (GMP_LIMB_BITS - cnt)), b, bi); in mpn_mod_1s_3p()
[all …]
|
| H A D | mod_1_1.c | 35 mp_limb_t bi; in mpn_mod_1_1p_cps() local
42 invert_limb (bi, b); in mpn_mod_1_1p_cps()
47 B1modb = -b * ((bi >> (GMP_LIMB_BITS-cnt)) | (CNST_LIMB(1) << cnt)); in mpn_mod_1_1p_cps()
49 udiv_rnd_preinv (B2modb, B1modb, b, bi); in mpn_mod_1_1p_cps()
51 cps[0] = bi; in mpn_mod_1_1p_cps()
60 mp_limb_t rh, rl, bi, q, ph, pl, r; in mpn_mod_1_1p() local
87 bi = bmodb[0]; in mpn_mod_1_1p()
96 udiv_qrnnd_preinv (q, r, rh, rl << cnt, b, bi); in mpn_mod_1_1p()
|
| H A D | powm_sec.c | 160 #define getbit(p,bi) \ argument
161 ((p[(bi - 1) / GMP_LIMB_BITS] >> (bi - 1) % GMP_LIMB_BITS) & 1)
164 getbits (const mp_limb_t *p, mp_bitcnt_t bi, int nbits) in getbits() argument
170 if (bi < nbits) in getbits()
172 return p[0] & (((mp_limb_t) 1 << bi) - 1); in getbits()
176 bi -= nbits; /* bit index of low bit to extract */ in getbits()
177 i = bi / GMP_LIMB_BITS; /* word index of low bit to extract */ in getbits()
178 bi %= GMP_LIMB_BITS; /* bit index in low word */ in getbits()
179 r = p[i] >> bi; /* extract (low) bits */ in getbits()
180 nbits_in_r = GMP_LIMB_BITS - bi; /* number of bits now in r */ in getbits()
|
| /dragonfly/stand/boot/pc32/libi386/ |
| H A D | bootinfo32.c | 38 static struct bootinfo bi; variable
249 bi.bi_version = BOOTINFO_VERSION; in bi_load32()
255 bi.bi_size = sizeof(bi); in bi_load32()
256 bi.bi_memsizes_valid = 1; in bi_load32()
257 bi.bi_basemem = bios_basemem / 1024; in bi_load32()
258 bi.bi_extmem = bios_extmem / 1024; in bi_load32()
259 bi.bi_envp = envp; in bi_load32()
260 bi.bi_modulep = *modulep; in bi_load32()
261 bi.bi_kernend = kernend; in bi_load32()
264 bi.bi_esymtab = esym; in bi_load32()
[all …]
|
| /dragonfly/sys/dev/acpica/ |
| H A D | acpi_battery.c | 125 struct acpi_battinfo *bi; in acpi_battery_get_battinfo() local
143 bi = kmalloc(devcount * sizeof(*bi), M_TEMP, M_WAITOK | M_ZERO); in acpi_battery_get_battinfo()
155 acpi_reset_battinfo(&bi[i]); in acpi_battery_get_battinfo()
192 bi[i].state = bst[i].state; in acpi_battery_get_battinfo()
222 if (bi[i].cap > 100) in acpi_battery_get_battinfo()
223 bi[i].cap = 100; in acpi_battery_get_battinfo()
265 bi[i].min = 0; in acpi_battery_get_battinfo()
266 total_min += bi[i].min; in acpi_battery_get_battinfo()
269 if (bi[i].cap != -1) in acpi_battery_get_battinfo()
302 if (bi) in acpi_battery_get_battinfo()
[all …]
|
| /dragonfly/usr.bin/dsynth/ |
| H A D | build.c | 3132 ++bi; in childHookRun()
3136 ++bi; in childHookRun()
3140 ++bi; in childHookRun()
3144 ++bi; in childHookRun()
3148 ++bi; in childHookRun()
3152 ++bi; in childHookRun()
3156 ++bi; in childHookRun()
3160 ++bi; in childHookRun()
3166 ++bi; in childHookRun()
3171 ++bi; in childHookRun()
[all …]
|
| /dragonfly/lib/libc/db/btree/ |
| H A D | bt_debug.c | 147 BINTERNAL *bi; in __bt_dpage() local
182 bi = GETBINTERNAL(h, cur); in __bt_dpage()
184 "size %03d pgno %03d", bi->ksize, bi->pgno); in __bt_dpage()
185 if (bi->flags & P_BIGKEY) in __bt_dpage()
187 else if (bi->ksize) in __bt_dpage()
189 " {%.*s}", (int)bi->ksize, bi->bytes); in __bt_dpage()
|
| H A D | bt_utils.c | 143 BINTERNAL *bi; in __bt_cmp() local
170 bi = GETBINTERNAL(h, e->index); in __bt_cmp()
171 if (bi->flags & P_BIGKEY) in __bt_cmp()
172 bigkey = bi->bytes; in __bt_cmp()
174 k2.data = bi->bytes; in __bt_cmp()
175 k2.size = bi->ksize; in __bt_cmp()
|
| H A D | bt_split.c | 78 BINTERNAL *bi; in __bt_split() local
172 bi = GETBINTERNAL(rchild, 0); in __bt_split()
173 nbytes = NBINTERNAL(bi->ksize); in __bt_split()
227 memmove(dest, bi, nbytes); in __bt_split()
513 BINTERNAL *bi; in bt_broot() local
549 bi = GETBINTERNAL(r, 0); in bt_broot()
550 nbytes = NBINTERNAL(bi->ksize); in bt_broot()
553 memmove(dest, bi, nbytes); in bt_broot()
588 BINTERNAL *bi; in bt_psplit() local
617 nbytes = NBINTERNAL(bi->ksize); in bt_psplit()
[all …]
|
| /dragonfly/crypto/libressl/crypto/bio/ |
| H A D | bss_null.c | 94 null_new(BIO *bi) in null_new() argument
96 bi->init = 1; in null_new()
97 bi->num = 0; in null_new()
98 bi->ptr = (NULL); in null_new()
|
| H A D | bss_sock.c | 108 sock_new(BIO *bi) in sock_new() argument
110 bi->init = 0; in sock_new()
111 bi->num = 0; in sock_new()
112 bi->ptr = NULL; in sock_new()
113 bi->flags = 0; in sock_new()
|