HomeSort by relevance Sort by last modified time
    Searched defs:bit (Results 201 - 225 of 525) sorted by null

1 2 3 4 5 6 7 891011>>

  /hardware/qcom/media/msm8974/mm-video-v4l2/vidc/common/src/
extra_data_handler.cpp 89 OMX_U32 symbol, bit; local
92 bit = d_u(1);
94 } while (!bit);
157 DEBUG_PRINT_ERROR("ERROR: In %s() Non-zero forbidden bit", __func__);
229 DEBUG_PRINT_ERROR("ERROR: In %s() Marker Bit Error in SEI",
  /hardware/qcom/media/msm8996/mm-video-v4l2/vidc/common/src/
extra_data_handler.cpp 89 OMX_U32 symbol, bit; local
92 bit = d_u(1);
94 } while (!bit);
157 DEBUG_PRINT_ERROR("ERROR: In %s() Non-zero forbidden bit", __func__);
229 DEBUG_PRINT_ERROR("ERROR: In %s() Marker Bit Error in SEI",
  /hardware/qcom/media/msm8998/mm-video-v4l2/vidc/common/src/
extra_data_handler.cpp 93 OMX_U32 symbol, bit; local
96 bit = d_u(1);
98 } while (!bit);
161 DEBUG_PRINT_ERROR("ERROR: In %s() Non-zero forbidden bit", __func__);
233 DEBUG_PRINT_ERROR("ERROR: In %s() Marker Bit Error in SEI",
  /prebuilts/go/darwin-x86/src/math/big/
nat.go 778 panic("set bit is not 0 or 1")
781 // bit returns the value of the i'th bit, with lsb == bit 0.
782 func (x nat) bit(i uint) uint { func
791 // sticky returns 1 if there's a 1 bit within the
898 // possible. n is the bit length of limit.
967 // 4-bit, windowed exponentiation. This involves precomputing 14 values
969 // third. Even for a 32-bit exponent, this reduces the number of
986 // see a bit, we square, thus doubling the power. If the bit is a one
    [all...]
  /prebuilts/go/linux-x86/src/math/big/
nat.go 778 panic("set bit is not 0 or 1")
781 // bit returns the value of the i'th bit, with lsb == bit 0.
782 func (x nat) bit(i uint) uint { func
791 // sticky returns 1 if there's a 1 bit within the
898 // possible. n is the bit length of limit.
967 // 4-bit, windowed exponentiation. This involves precomputing 14 values
969 // third. Even for a 32-bit exponent, this reduces the number of
986 // see a bit, we square, thus doubling the power. If the bit is a one
    [all...]
  /system/bt/stack/btm/
btm_ble_privacy.cc 141 uint8_t bit; local
145 bit = index % 8;
146 btm_cb.ble_ctr_cb.irk_list_mask[byte] &= (~(1 << bit));
162 uint8_t bit; local
166 bit = i % 8;
168 if ((btm_cb.ble_ctr_cb.irk_list_mask[byte] & (1 << bit)) == 0) {
169 btm_cb.ble_ctr_cb.irk_list_mask[byte] |= (1 << bit);
  /system/sepolicy/tests/
sepol_wrap.cpp 95 unsigned int bit; member in struct:type_iter
111 out->bit = 0;
130 out->bit = ebitmap_start(&db->attr_type_map[out->d->s.value - 1], &out->n);
133 out->bit = ebitmap_start(&db->type_attr_map[out->d->s.value - 1], &out->n);
161 for (; i->bit < i->length; i->bit = ebitmap_next(&i->n, i->bit)) {
162 if (!ebitmap_node_get_bit(i->n, i->bit)) {
168 while (i->bit < i->length &&
170 && db->type_val_to_struct[i->bit]->flavor != TYPE_ATTRIB
    [all...]
  /toolchain/binutils/binutils-2.27/binutils/
sysdump.c 210 int bit = *idx % 8; local
217 return (ptr[byte] >> (8 - bit - size)) & ((1 << size) - 1);
  /toolchain/binutils/binutils-2.27/opcodes/
v850-dis.c 477 unsigned int bit; local
480 for (bit = 0; bit < 32; bit++)
481 if (mask & (1 << bit))
483 unsigned long int first = bit;
493 for (bit++; bit < 32; bit++)
494 if ((mask & (1 << bit)) == 0
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/
imageop.c 216 /* Note: this routine can use a bit of optimizing */
277 int i, bit; local
291 bit = 0x80;
295 ovalue |= bit;
296 bit >>= 1;
297 if ( bit == 0 ) {
299 bit = 0x80;
303 if ( bit != 0x80 )
389 int i, bit; local
403 bit = 0x80;
471 int i, bit; local
    [all...]
  /device/linaro/bootloader/edk2/QuarkSocPkg/QuarkNorthCluster/MemoryInit/Pei/
meminit_utils.c 1059 // It will return an encoded DWORD in which each bit corresponds to the sampled value on the byte lane.
1095 // and set that value in the corresponding "ret_val" bit
1127 // This function will return a 32 bit address in the desired channel and rank.
1420 uint32_t bit; local
    [all...]
  /external/ImageMagick/coders/
icon.c 271 bit,
500 for (bit=0; bit < 8; bit++)
502 SetPixelIndex(image,((byte & (0x80 >> bit)) != 0 ? 0x01 :
510 for (bit=0; bit < (image->columns % 8); bit++)
512 SetPixelIndex(image,((byte & (0x80 >> bit)) != 0 ? 0x01 :
534 Read 4-bit Icon scanline
266 bit, local
891 bit, local
1111 bit, local
    [all...]
pdb.c 452 bit;
455 Read 1-bit PDB image.
464 for (bit=0; bit < 8; bit++)
466 index=(Quantum) (*p & (0x80 >> bit) ? 0x00 : 0x01);
485 Read 2-bit PDB image.
521 Read 4-bit PDB image.
815 case 2: pdb_image.type=(unsigned char) 0x00; break; /* 2 bit gray */
816 default: pdb_image.type=(unsigned char) 0x02; /* 4 bit gray *
447 bit; local
    [all...]
ps3.c 332 bit;
362 bit=(unsigned char) 0x00;
364 bit=(unsigned char) (GetPixelLuma(image,p) == TransparentAlpha ?
366 code=(code << 1)+bit;
326 bit; local
    [all...]
  /external/antlr/antlr-3.4/runtime/C/src/
antlr3baserecognizer.c 1229 ANTLR3_UINT32 bit; local
    [all...]
  /external/boringssl/src/crypto/bytestring/
bytestring_test.cc 823 {0x07, 0x80}, // 1 bit
836 // BIT STRINGs always have a leading byte.
838 // It's not possible to take an unused bit off the empty string.
858 unsigned bit; member in struct:__anon14270
882 SCOPED_TRACE(test.bit);
886 CBS_asn1_bitstring_has_bit(&cbs, test.bit));
    [all...]
  /external/emma/core/java12/com/vladium/jcd/lib/
Types.java 52 final int bit = IAccessFlags.ALL_ACC [f]; local
54 if ((flags & bit) != 0)
61 if (bit == IAccessFlags.ACC_SUPER)
72 final int bit = IAccessFlags.ALL_ACC [f]; local
74 if ((flags & bit) != 0)
  /external/libchrome/crypto/
p224.cc 31 // Using 28-bit limbs means that there's only 4 bits of headroom, which is less
89 // kZero31ModP is 0 mod p where bit 31 is set in all limbs so that we can
111 // kZero63ModP is 0 mod p where bit 63 is set in all limbs. See the section
146 // 32-bit operations.
605 uint32_t bit = static_cast<uint32_t>(static_cast<int32_t>( local
608 CopyConditional(out, tmp, bit);
  /external/libcups/filter/
rastertoepson.c 62 DotBit, /* Bit in buffers */
470 * Check the last bit in the current byte and the first bit in the
628 unsigned char bit; local
637 for (x = header->cupsWidth, bit = 128, pixel = Planes[0],
642 if (*pixel & bit)
645 if (bit > 1)
646 bit >>= 1;
649 bit = 128;
850 printf("\033*"); /* Select bit image *
    [all...]
  /external/libopus/celt/
rate.c 52 /*Determines if V(N,K) fits in a 32-bit unsigned integer.
153 /* N=1 bands only have a sign bit and fine bits. */
323 In the first case, we'd be coding a bit to signal we're going to waste
325 In the second case, we'd be coding a bit to redistribute all the bits
329 /* Give the bit we reserved to end skipping back. */
371 /*We used a bit to skip this band.*/
382 /*If we have enough for a fine energy bit per channel, use it.*/
440 opus_int32 excess, bit; local
445 bit = (opus_int32)bits[j]+balance;
449 excess = MAX32(bit-cap[j],0)
    [all...]
  /external/libvpx/libvpx/third_party/libwebm/mkvmuxer/
mkvmuxerutil.cc 222 // Doubling the requested value ensures positive values with their high bit
388 const uint64 bit = 1LL << (size * 7); local
390 if (value > (bit - 2))
393 value |= bit;
396 int64 bit; local
399 bit = 1LL << (size * 7);
400 const uint64 max = bit - 2;
411 value |= bit;
559 // is a signed, 16-bit integer). However, as a simplification we
  /external/ltp/lib/
random_range.c 449 * Attempts to be just like random_range, but everything is long long (64 bit)
534 * number min and max. It was designed to work the 64bit numbers
535 * even when compiled as 32 bit process.
563 rand = (long long)lrand48(); /* 32 bit random number */
584 * if the cnt bit of rand is zero or one, respectively.
593 * or top half (bit cnt is set).
622 * This function randomly returns a single bit from the bits
629 long bit; /* used to count bits and num of set bits choosen */ local
630 int nshift; /* used to count bit shifts */
640 bit = 1L
    [all...]
  /external/ltp/testcases/kernel/controllers/cpuset/cpuset_lib/
libbitmask.c 58 /* Return the value (0 or 1) of bit n in bitmask bmp */
67 /* Set bit n in bitmask bmp to value v (0 or 1) */
138 int bit; local
140 for (bit = HEXCHUNKSZ - 1; bit >= 0; bit--)
141 val = val << 1 | _getbit(bmp, chunk * HEXCHUNKSZ + bit);
176 * decimal numbers, the smallest and largest bit numbers set in
188 /* current bit is 'cur', most recently seen range is [rbot, rtop] */
237 int bit; local
    [all...]
  /external/ltp/testcases/network/lib6/
asapi_01.c 85 * set each bit in an address and check for unequal; then set
90 int word, bit; local
99 for (bit = 0; bit < 32; ++bit) {
100 uint32_t newbit = 1U << bit;
  /external/mesa3d/src/gallium/drivers/r600/sb/
sb_ra_coalesce.cpp 320 unsigned bit = sel_chan(reg, chan); local
321 if (bit >= rb.size() || !rb.get(bit)) {
322 color = bit;
548 unsigned bit = sel_chan(reg, swz[i]); local
549 if (bit < rb[i].size() && rb[i].get(bit))

Completed in 1038 milliseconds

1 2 3 4 5 6 7 891011>>