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

  /src/external/gpl3/gcc/dist/libgfortran/intrinsics/
mvbits.c 44 TYPE oldbits, newbits, lenmask; local
47 newbits = (((UTYPE)(*from) >> *frompos) & lenmask) << *topos;
50 *to = newbits | oldbits;
  /src/external/gpl3/gcc.old/dist/libgfortran/intrinsics/
mvbits.c 44 TYPE oldbits, newbits, lenmask; local
47 newbits = (((UTYPE)(*from) >> *frompos) & lenmask) << *topos;
50 *to = newbits | oldbits;
  /src/sys/arch/evbarm/g42xxeb/
g42xxeb_kmkbd.c 497 u_int newbits; local
501 newbits = kmkbd_read_matrix(sc);
503 if (newbits != sc->last_bits){
504 sc->last_bits = newbits;
508 new_state = newbits == 0 ? ST_ALL_UP : ST_KEY_PRESSED;
511 kmkbd_report_raw(sc, newbits);
514 kmkbd_report(sc, newbits);
527 u_int newbits; local
530 newbits = kmkbd_read_matrix(sc);
532 if (newbits != sc->last_bits)
    [all...]
  /src/external/mpl/bind/dist/lib/isc/
ht.c 90 hashtable_rehash(isc_ht_t *ht, uint32_t newbits);
127 uint32_t newbits = ht->hashbits[ht->hindex]; local
129 while (newcount >= HASHSIZE(newbits) && newbits <= HT_MAX_BITS) {
130 newbits += 1;
133 return newbits;
140 hashtable_rehash(isc_ht_t *ht, uint32_t newbits) {
149 REQUIRE(newbits <= HT_MAX_BITS);
153 REQUIRE(newbits > oldbits);
155 hashtable_new(ht, newindex, newbits);
198 uint32_t newbits = rehash_bits(ht, newcount); local
    [all...]
hashmap.c 392 uint32_t newbits = hashmap->tables[hashmap->hindex].hashbits + 1; local
393 size_t newsize = HASHSIZE(newbits);
396 newbits += 1;
397 newsize = HASHSIZE(newbits);
399 if (newbits > HASHMAP_MAX_BITS) {
400 newbits = HASHMAP_MAX_BITS;
403 return newbits;
408 uint32_t newbits = hashmap->tables[hashmap->hindex].hashbits - 1; local
410 if (newbits <= HASHMAP_MIN_BITS) {
411 newbits = HASHMAP_MIN_BITS
419 uint32_t newbits; local
436 uint32_t newbits; local
    [all...]
  /src/external/mpl/dhcp/bind/dist/lib/isc/
ht.c 89 hashtable_rehash(isc_ht_t *ht, uint32_t newbits);
167 uint32_t newbits = ht->hashbits[ht->hindex]; local
169 while (newcount >= HASHSIZE(newbits) && newbits <= HT_MAX_BITS) {
170 newbits += 1;
173 return (newbits);
180 hashtable_rehash(isc_ht_t *ht, uint32_t newbits) {
189 REQUIRE(newbits <= HT_MAX_BITS);
193 REQUIRE(newbits > oldbits);
195 hashtable_new(ht, newindex, newbits);
238 uint32_t newbits = rehash_bits(ht, newcount); local
    [all...]
  /src/external/mpl/bind/dist/lib/dns/
rbt.c 193 hashtable_rehash(dns_rbt_t *rbt, uint32_t newbits);
1480 uint32_t newbits = rbt->hashbits[rbt->hindex]; local
1482 while (newcount >= ISC_HASHSIZE(newbits) && newbits < ISC_HASH_MAX_BITS)
1484 newbits += 1;
1487 return newbits;
1494 hashtable_rehash(dns_rbt_t *rbt, uint32_t newbits) {
1503 REQUIRE(newbits <= ISC_HASH_MAX_BITS);
1507 REQUIRE(newbits > oldbits);
1509 hashtable_new(rbt, newindex, newbits);
1554 uint32_t newbits = rehash_bits(rbt, newcount); local
    [all...]
  /src/external/mpl/dhcp/bind/dist/lib/dns/
rbt.c 424 rehash(dns_rbt_t *rbt, uint32_t newbits);
2387 uint32_t newbits = rbt->hashbits; local
2389 while (newcount >= HASHSIZE(newbits) && newbits < RBT_HASH_MAX_BITS) {
2390 newbits += 1;
2393 return (newbits);
2400 rehash(dns_rbt_t *rbt, uint32_t newbits) {
2407 REQUIRE(newbits <= rbt->maxhashbits);
2413 rbt->hashbits = newbits;
2435 uint32_t newbits = rehash_bits(rbt, newcount) local
    [all...]
rbtdb.c 10121 uint32_t newbits = oldbits; local
10123 while (newcount >= HASHSIZE(newbits) &&
10124 newbits <= RBTDB_GLUE_TABLE_MAX_BITS)
10126 newbits += 1;
10129 return (newbits);
10137 uint32_t oldbits, newbits; local
10145 newbits = rehash_bits(version, version->glue_table_nodecount);
10146 newsize = HASHSIZE(newbits) * sizeof(version->glue_table[0]);
10149 version->glue_table_bits = newbits;
10160 uint32_t idx = hash_32(hash, newbits);
    [all...]
zone.c 18474 uint32_t newbits = bits; local
18475 while (count >= HASHSIZE(newbits) && newbits < KEYMGMT_BITS_MAX) {
18476 newbits++;
18478 return (newbits);
18483 uint32_t newbits = bits; local
18484 while (count <= HASHSIZE(newbits) && newbits > KEYMGMT_BITS_MIN) {
18485 newbits--;
18487 return (newbits);
18534 uint32_t bits, newbits, count, size, newsize; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/fortran/
trans-intrinsic.cc 12185 tree lenmask, oldbits, newbits, bitsize; local
12305 /* newbits = (((UTYPE)(FROM) >> FROMPOS) & lenmask) << TOPOS.
12309 newbits = fold_build2_loc (input_location, RSHIFT_EXPR, utype,
12311 newbits = fold_build2_loc (input_location, BIT_AND_EXPR, type,
12312 fold_convert (type, newbits), lenmask);
12313 newbits = fold_build2_loc (input_location, LSHIFT_EXPR, type,
12314 newbits, topos);
12322 /* TO = newbits | oldbits. */
12324 oldbits, newbits);
  /src/external/gpl3/gcc/dist/gcc/fortran/
trans-intrinsic.cc 12483 tree lenmask, oldbits, newbits, bitsize; local
12603 /* newbits = (((UTYPE)(FROM) >> FROMPOS) & lenmask) << TOPOS.
12607 newbits = fold_build2_loc (input_location, RSHIFT_EXPR, utype,
12609 newbits = fold_build2_loc (input_location, BIT_AND_EXPR, type,
12610 fold_convert (type, newbits), lenmask);
12611 newbits = fold_build2_loc (input_location, LSHIFT_EXPR, type,
12612 newbits, topos);
12620 /* TO = newbits | oldbits. */
12622 oldbits, newbits);

Completed in 87 milliseconds