/openjdk7/jdk/src/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...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | regmask.cpp | 49 //-------------Non-zero bit search methods used by RegMask--------------------- 162 int bit = _A[i] & -_A[i]; // Extract low bit local 163 // Convert to bit number, return hi bit in pair 164 return OptoReg::Name((i<<_LogWordBits)+find_lowest_bit(bit)+1); 171 // Clear out partial bits; leave only bit pairs 175 bits &= ((bits & 0x55555555)<<1); // 1 hi-bit set for each pair 176 bits |= (bits>>1); // Smear 1 hi-bit into a pair 183 // Smear out partial bits; leave only bit pair 200 int bit = bits & -bits; // Extract low bit local 216 int bit = -1; // Set to hold the one bit allowed local 233 int bit = -1; // Set to hold the one bit allowed local 262 int bit = _A[i] & -_A[i]; // Extract low bit local 331 int bit = bits & -bits; // Extract low bit local 351 int bit = -1; // Set to hold the one bit allowed local [all...] |
H A D | indexSet.hpp | 58 // Finally, the bit index determines which single bit within that word indicates 81 // These routines are used for extracting the block, word, and bit index 104 // A BitBlock is composed of some number of 32 bit words. When a BitBlock 137 uint32 bit = (0x1 << bit_index); local 139 words()[word_index] = before | bit; 140 return ((before & bit) != 0); 147 uint32 bit = (0x1 << bit_index); local 149 words()[word_index] = before & ~bit; 150 return ((before & bit) ! [all...] |
/openjdk7/jdk/src/macosx/native/jobjc/src/generator/java/com/apple/internal/jobjc/generator/classes/ |
H A D | CopiedFile.java | 49 int bit; 50 while (-1 != (bit = in.read())) { 51 out.write(bit);
|
/openjdk7/hotspot/src/share/vm/utilities/ |
H A D | bitMap.hpp | 41 typedef size_t idx_t; // Type used for bit and word indices. 60 // Return the position of bit within the word that contains it (e.g., if 62 static idx_t bit_in_word(idx_t bit) { return bit & (BitsPerWord - 1); } argument 64 // Return a mask that will select the specified bit, when applied to the word 65 // containing the bit. 66 static bm_word_t bit_mask(idx_t bit) { return (bm_word_t)1 << bit_in_word(bit); } argument 68 // Return the index of the word containing the specified bit. 69 static idx_t word_index(idx_t bit) { retur argument 153 word_align_up(idx_t bit) argument 156 word_align_down(idx_t bit) argument 159 is_word_aligned(idx_t bit) argument [all...] |
H A D | bitMap.inline.hpp | 43 inline void BitMap::set_bit(idx_t bit) { 44 verify_index(bit); 45 *word_addr(bit) |= bit_mask(bit); 48 inline void BitMap::clear_bit(idx_t bit) { 49 verify_index(bit); 50 *word_addr(bit) &= ~bit_mask(bit); 53 inline bool BitMap::par_set_bit(idx_t bit) { 54 verify_index(bit); [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | parMarkBitMap.hpp | 52 // Return whether the specified begin or end bit is set. 53 inline bool is_obj_beg(idx_t bit) const; 54 inline bool is_obj_end(idx_t bit) const; 58 inline bool is_marked(idx_t bit) const; 62 inline bool is_unmarked(idx_t bit) const; 72 // Return the size in words of an object given a begin bit and an end bit, or 77 // Return the size in words of the object (a search is done for the end bit). 113 // This method assumes that if the first bit in the range (range_beg) is not 146 // Convert a heap address to/from a bit inde [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/ |
H A D | BitArray.java | 60 * Constructor. Defines the initial size of the bit array (in bits). 81 * Set the mask for this bit array. The upper 8 bits of this mask 96 * Returns the size of this bit array (in bits). 103 * Returns true if the given bit is set 105 public final boolean getBit(int bit) { argument 107 if (bit >= _bitSize) { 113 return((_bits[bit>>>5] & _masks[bit%32]) != 0); 117 * Returns the next set bit from a given position 135 * This method returns the Nth bit tha 187 setBit(int bit) argument [all...] |
/openjdk7/jdk/src/windows/native/sun/windows/ |
H A D | img_util_md.h | 62 #define SetOpaqueBit(mask, bit) ((mask) &= ~(bit)) 63 #define SetTransparentBit(mask, bit) ((mask) |= (bit))
|
/openjdk7/jdk/src/solaris/native/sun/java2d/x11/ |
H A D | X11PMBlitLoops.c | 295 unsigned int bit = 0x80; local 298 if (bit == 0) { 301 bit = 0x80; 303 pix |= bit & (srcLut[*srcPixel++] >> 31); 304 bit >>= 1; 314 unsigned int bit = 1; local 317 if ((bit >> 8) != 0) { 320 bit = 1; 322 pix |= bit & (srcLut[*srcPixel++] >> 31); 323 bit << 341 unsigned int bit = 0x80; local 366 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...] |
/openjdk7/jdk/src/share/native/sun/font/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; 85 le_uint8 bit = highBit(recordCount); local 86 le_int32 power = 1 << bit; 124 le_uint8 bit = highBit(recordCount); local [all...] |
H A D | CoverageTables.cpp | 70 le_uint8 bit = OpenTypeUtilities::highBit(count); local 71 le_uint16 power = 1 << bit;
|
/openjdk7/jdk/src/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...] |
/openjdk7/jdk/src/share/native/sun/awt/medialib/ |
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) << 88 bit); 149 bit = 7 - (i & 7); 153 res = (res & ~(1 << bit)) | (((srcPixelPtr[X >> (MLIB_SHIFT + 3)] >> (7 - (X >> MLIB_SHIFT) & 7)) & 1) << bit);
|
/openjdk7/jdk/src/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...] |
/openjdk7/jdk/src/solaris/native/sun/awt/ |
H A D | img_util_md.h | 77 #define SetOpaqueBit(mask, bit) ((mask) |= (bit)) 78 #define SetTransparentBit(mask, bit) ((mask) &= ~(bit))
|
/openjdk7/hotspot/test/compiler/7100757/ |
H A D | Test7100757.java | 28 * @summary The BitSet.nextSetBit() produces incorrect result in 32bit VM on Sparc 58 long bit = 1L << b++; 59 if((ra[t]&bit) != 0) {
|
/openjdk7/jdk/make/bridge/AccessBridgeJava/ |
H A D | Makefile | 37 ABPLATFORM = 64bit 45 ABPLATFORM = 32bit
|
/openjdk7/hotspot/test/compiler/6661247/ |
H A D | Test.java | 28 * @summary Internal bug in 32-bit HotSpot optimizer while bit manipulations 142 for (int bit = 0; bit < 64; bit++) { 143 src[i * 64 + bit] = (l & (1L << bit)) != 0;
|
/openjdk7/jdk/src/share/native/sun/security/ec/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.
|
/openjdk7/jdk/src/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
|
/openjdk7/jdk/src/share/native/sun/awt/image/cvutils/ |
H A D | README | 57 <img_input8.h> Fetch 8 bit pixels from a byte array 58 <img_input32.h> Fetch 32 bit pixels from a int array 59 <img_input8_32.h> Fetch 8 or 32 bit pixels 75 <img_nodither.h> No encoding at all (only for 24-bit images) 92 <img_alpha.h> Produce 1-bit transparency masks from alpha 96 <img_output8.h> Store 8-bit pixels in a byte array 97 <img_output16.h> Store 16-bit pixels in a short array 98 <img_output24.h> Store 24-bit pixels in a byte triplet array 99 <img_output32.h> Store 32-bit pixels in an int array 100 <img_output8_16_24.h> Store 8, 16 or 24 bit pixel [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/codemodel/internal/ |
H A D | JMods.java | 48 /** bit-packed representation of modifiers. */ 56 * Gets the bit-packed representaion of modifiers. 134 private void setFlag(int bit, boolean newValue) { argument 135 mods = (mods & ~bit) | (newValue ? bit : 0);
|
/openjdk7/jdk/src/share/classes/sun/security/util/ |
H A D | BitArray.java | 69 * specified byte array. The most significant bit of a[0] gets 71 * to specify a value for every bit in the BitArray. In other words, 81 "bit array of given length"); 125 * Returns the indexed bit in this BitArray. 136 * Sets the indexed bit in this BitArray. 144 int bit = position(index); 147 repn[idx] |= bit; 149 repn[idx] &= ~bit; 162 * The bit stored at index zero in this BitArray will be copied 163 * into the most significant bit o [all...] |