/openjdk10/jdk/src/jdk.rmic/share/classes/sun/tools/tree/ |
H A D | Vset.java | 165 long bit = (1L << varNumber); 171 return (x[i] & bit) != 0; 173 return (vset & bit) != 0; 183 long bit = (1L << varNumber); 190 return (x[i] & bit) != 0; 192 return (uset & bit) != 0; 207 long bit = (1L << varNumber); 213 x[i] |= bit; 215 x[i+1] &=~ bit; 218 vset |= bit; [all...] |
/openjdk10/hotspot/src/share/vm/opto/ |
H A D | regmask.cpp | 34 //-------------Non-zero bit search methods used by RegMask--------------------- 150 int bit = _A[i] & -_A[i]; // Extract low bit local 151 // Convert to bit number, return hi bit in pair 152 return OptoReg::Name((i<<_LogWordBits)+find_lowest_bit(bit)+1); 159 // Clear out partial bits; leave only bit pairs 163 bits &= ((bits & 0x55555555)<<1); // 1 hi-bit set for each pair 164 bits |= (bits>>1); // Smear 1 hi-bit into a pair 171 // Smear out partial bits; leave only bit pair 188 int bit = bits & -bits; // Extract low bit local 204 int bit = -1; // Set to hold the one bit allowed local 221 int bit = -1; // Set to hold the one bit allowed local 251 int bit = _A[i] & -_A[i]; // Extract low bit local 326 int bit = bits & -bits; // Extract low bit local 346 int bit = -1; // Set to hold the one bit allowed local [all...] |
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/ |
H A D | BitVector.java | 67 * @param bits a bits array from another bit vector 110 * Resize the bit vector to accommodate the new length. 134 * Set a bit in the bit vector. 135 * @param bit Bit number. 137 public void set(final long bit) { argument 138 bits[(int)(bit >> BITSHIFT)] |= (1L << (int)(bit & BITMASK)); 142 * Clear a bit in the bit vecto 145 clear(final long bit) argument 153 toggle(final long bit) argument 186 isSet(final long bit) argument 195 isClear(final long bit) argument [all...] |
/openjdk10/hotspot/src/share/vm/utilities/ |
H A D | bitMap.inline.hpp | 31 inline void BitMap::set_bit(idx_t bit) { argument 32 verify_index(bit); 33 *word_addr(bit) |= bit_mask(bit); 36 inline void BitMap::clear_bit(idx_t bit) { argument 37 verify_index(bit); 38 *word_addr(bit) &= ~bit_mask(bit); 41 inline bool BitMap::par_set_bit(idx_t bit) { argument 42 verify_index(bit); 60 par_clear_bit(idx_t bit) argument 348 idx_t bit = bit_index(slot_index, bit_within_slot_index); local [all...] |
H A D | bitMap.hpp | 51 typedef size_t idx_t; // Type used for bit and word indices. 65 // Return the position of bit within the word that contains it (e.g., if 67 static idx_t bit_in_word(idx_t bit) { return bit & (BitsPerWord - 1); } argument 69 // Return a mask that will select the specified bit, when applied to the word 70 // containing the bit. 71 static bm_word_t bit_mask(idx_t bit) { return (bm_word_t)1 << bit_in_word(bit); } argument 73 // Return the index of the word containing the specified bit. 74 static idx_t word_index(idx_t bit) { retur argument 85 word_addr(idx_t bit) argument 192 word_align_up(idx_t bit) argument 195 word_align_down(idx_t bit) argument 198 is_word_aligned(idx_t bit) argument [all...] |
/openjdk10/langtools/test/tools/javac/util/ |
H A D | BitsTest.java | 160 for (int bit = 0; bit < ints.length * 32; bit++) 161 if ((ints[bit / 32] & (1 << (bit % 32))) != 0) 162 bits.incl(bit); 179 for (int bit = 0; bit < LENGTH; bit++) { 186 if (bit [all...] |
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.java/src/org/graalvm/compiler/java/ |
H A D | SmallLocalLiveness.java | 29 * local n is represented by the bit accessible as (1 << n) 102 long bit = 1L << local; 103 if ((localsLiveKill[blockID] & bit) == 0L) { 104 localsLiveGen[blockID] |= bit; 110 long bit = 1L << local; 111 if ((localsLiveGen[blockID] & bit) == 0L) { 112 localsLiveKill[blockID] |= bit; 120 this.localsChangedInLoop[pos] |= bit;
|
/openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/ |
H A D | BitArray.java | 58 * Constructor. Defines the initial size of the bit array (in bits). 79 * Set the mask for this bit array. The upper 8 bits of this mask 94 * Returns the size of this bit array (in bits). 101 * Returns true if the given bit is set 103 public final boolean getBit(int bit) { argument 105 if (bit >= _bitSize) { 111 return((_bits[bit>>>5] & _masks[bit%32]) != 0); 115 * Returns the next set bit from a given position 133 * This method returns the Nth bit tha 185 setBit(int bit) argument [all...] |
/openjdk10/hotspot/src/share/vm/gc/parallel/ |
H A D | parMarkBitMap.inline.hpp | 41 // Need two bits (one begin bit, one end bit) for each unit of 'object 66 inline bool ParMarkBitMap::is_obj_beg(idx_t bit) const { 67 return _beg_bits.at(bit); 70 inline bool ParMarkBitMap::is_obj_end(idx_t bit) const { 71 return _end_bits.at(bit); 74 inline bool ParMarkBitMap::is_marked(idx_t bit) const { 75 return is_obj_beg(bit); 86 inline bool ParMarkBitMap::is_unmarked(idx_t bit) const { 87 return !is_marked(bit); [all...] |
H A D | psParallelCompact.inline.hpp | 46 idx_t bit) { 47 assert(bit > 0, "cannot call this for the first bit/region"); 48 assert(_summary_data.region_to_addr(region) == _mark_bitmap.bit_to_addr(bit), 55 !_mark_bitmap.is_obj_beg(bit) && 56 !_mark_bitmap.is_obj_end(bit - 1); 45 dead_space_crosses_boundary(const RegionData* region, idx_t bit) argument
|
H A D | parMarkBitMap.hpp | 51 // Return whether the specified begin or end bit is set. 52 inline bool is_obj_beg(idx_t bit) const; 53 inline bool is_obj_end(idx_t bit) const; 57 inline bool is_marked(idx_t bit) const; 61 inline bool is_unmarked(idx_t bit) const; 71 // Return the size in words of an object given a begin bit and an end bit, or 76 // Return the size in words of the object (a search is done for the end bit). 107 // This method assumes that if the first bit in the range (range_beg) is not 137 // Convert a heap address to/from a bit inde [all...] |
/openjdk10/jdk/src/java.desktop/windows/native/libawt/windows/ |
H A D | img_util_md.h | 62 #define SetOpaqueBit(mask, bit) ((mask) &= ~(bit)) 63 #define SetTransparentBit(mask, bit) ((mask) |= (bit))
|
/openjdk10/jdk/src/java.desktop/unix/native/common/java2d/x11/ |
H A D | X11PMBlitLoops.c | 304 unsigned int bit = 0x80; local 307 if (bit == 0) { 310 bit = 0x80; 312 pix |= bit & (srcLut[*srcPixel++] >> 31); 313 bit >>= 1; 323 unsigned int bit = 1; local 326 if ((bit >> 8) != 0) { 329 bit = 1; 331 pix |= bit & (srcLut[*srcPixel++] >> 31); 332 bit << 350 unsigned int bit = 0x80; local 375 unsigned int bit = 1; local [all...] |
H A D | X11TextRenderer_md.c | 57 // Force same bit/byte ordering 164 int bit = left; local 166 if (bit == 0) { 169 bit = 0x80; 172 pix |= bit; 174 bit >>= 1; 185 int bit = left; local 187 if ((bit >> 8) != 0) { 190 bit = 1; 193 pix |= bit; [all...] |
/openjdk10/jdk/src/java.desktop/share/native/libfontmanager/layout/ |
H A D | OpenTypeUtilities.cpp | 40 // Finds the high bit by binary searching 49 le_uint8 bit = 0; local 53 bit += 16; 58 bit += 8; 63 bit += 4; 68 bit += 2; 73 bit += 1; 76 return bit; 86 le_uint8 bit = highBit(recordCount); local 87 le_int32 power = 1 << bit; 125 le_uint8 bit = highBit(recordCount); local [all...] |
H A D | CoverageTables.cpp | 74 le_uint8 bit = OpenTypeUtilities::highBit(count); local 75 le_uint16 power = 1 << bit;
|
/openjdk10/jdk/src/java.desktop/share/classes/sun/font/ |
H A D | ScriptRun.java | 284 * Find the highest bit that's set in a word. Uses a binary search through 287 * @param n the word in which to find the highest bit that's set. 288 * @return the bit number (counting from the low order bit) of the highest bit. 296 byte bit = 0; 300 bit += 16; 305 bit += 8; 310 bit += 4; 315 bit [all...] |
/openjdk10/jdk/src/java.desktop/share/native/libmlib_image/ |
H A D | mlib_ImageAffine_NN_Bit.c | 65 mlib_s32 i, bit, res; local 83 bit = 7 - (i & 7); 87 res = (res & ~(1 << bit)) | (((srcPixelPtr[X >> (MLIB_SHIFT + 3)] >> (7 - ((X >> MLIB_SHIFT) & 7))) & 1) << bit); 148 bit = 7 - (i & 7); 152 res = (res & ~(1 << bit)) | (((srcPixelPtr[X >> (MLIB_SHIFT + 3)] >> (7 - ((X >> MLIB_SHIFT) & 7))) & 1) << bit);
|
/openjdk10/jdk/src/java.base/share/classes/java/math/ |
H A D | BitSieve.java | 29 * A simple bit sieve used for finding prime number candidates. Allows setting 35 * represented in the sieve (each bit in the sieve represents an odd number). 36 * The relationship between the index of a bit and the number it represents is 39 * Where N is the integer represented by a bit in the sieve, offset is some 41 * index of a bit in the sieve array. 93 * Construct a bit sieve of searchLen bits used for finding prime number 100 * nonprimality is calculated, a bit is set in the sieve to eliminate 102 * are represented in the sieve (each bit in the sieve represents an 132 * Given a bit index return unit index containing it. 139 * Return a unit that masks the specified bit i 141 private static long bit(int bitIndex) { method in class:BitSieve [all...] |
/openjdk10/jdk/src/java.desktop/unix/native/common/awt/ |
H A D | img_util_md.h | 77 #define SetOpaqueBit(mask, bit) ((mask) |= (bit)) 78 #define SetTransparentBit(mask, bit) ((mask) &= ~(bit))
|
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/regexp/joni/ |
H A D | BitSet.java | 47 return (bits[pos >>> ROOM_SHIFT] & bit(pos)) != 0; 51 bits[pos >>> ROOM_SHIFT] |= bit(pos); 55 bits[pos >>> ROOM_SHIFT] &= ~bit(pos); 117 static int bit(final int pos){ method in class:BitSet
|
/openjdk10/hotspot/test/compiler/c2/ |
H A D | Test6661247.java | 27 * @summary Internal bug in 32-bit HotSpot optimizer while bit manipulations 145 for (int bit = 0; bit < 64; bit++) { 146 src[i * 64 + bit] = (l & (1L << bit)) != 0;
|
/openjdk10/jdk/src/jdk.crypto.ec/share/native/libsunec/impl/ |
H A D | mplogic.c | 111 Grows a if needed to set a bit to 1. 145 mp_size bit, ix; local 153 bit = bitNum % MP_DIGIT_BIT; 154 rv = (mp_err)(MP_DIGIT(a, ix) >> bit) & 1; 160 - Extracts numBits bits from a, where the least significant extracted bit 161 is bit lsbNum. Returns a negative value if error occurs. 162 - Because sign bit is used to indicate error, maximum number of bits to 166 integer a, as long as bit lsbNum is in the high order digit of a.
|
/openjdk10/jdk/src/java.security.jgss/share/classes/sun/security/krb5/internal/crypto/dk/ |
H A D | Des3DkCrypto.java | 89 * Result is a 24 byte (192-bit) key. 153 byte bit = (byte) (input[i]&0x01); 156 " bit= " + Integer.toHexString(bit)); 159 if (bit != 0) { 160 last |= (bit<<posn); 173 * Sets the parity bit (0th bit) in each byte so that each byte
|
/openjdk10/hotspot/test/compiler/codegen/ |
H A D | Test7100757.java | 27 * @summary The BitSet.nextSetBit() produces incorrect result in 32bit VM on Sparc 65 long bit = 1L << b++; 66 if((ra[t]&bit) != 0) {
|