Searched defs:bit (Results 1 - 23 of 23) sorted by relevance

/openjdk7/jdk/src/share/native/sun/awt/medialib/
H A Dmlib_ImageAffine_NN_Bit.c65 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/native/sun/font/layout/
H A DCoverageTables.cpp70 le_uint8 bit = OpenTypeUtilities::highBit(count); local
71 le_uint16 power = 1 << bit;
H A DOpenTypeUtilities.cpp40 // 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...]
/openjdk7/jdk/src/share/classes/java/math/
H A DBitSieve.java29 * 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/share/native/sun/security/ec/impl/
H A Dmplogic.c111 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.
H A Dmpi.c905 step is a bit more complicated, but we save a fair number of
1127 unsigned int dig, bit; local
1147 for(bit = 0; bit < DIGIT_BIT; bit++) {
1502 unsigned int dig, bit; local
1530 for(bit = 0; bit < DIGIT_BIT; bit++) {
2149 /* Compute T = (P ** -1) mod MP_RADIX. Also works for 16-bit mp_digit
4348 mp_size dig, bit; local
[all...]
/openjdk7/jdk/src/share/classes/javax/imageio/stream/
H A DImageOutputStream.java42 * the semantics for dealing with a non-zero bit offset before a byte-aligned
44 * a non-zero bit offset before a byte-aligned read. When reading bytes,
45 * any bit offset is set to 0 before the read; when writing bytes, a
46 * non-zero bit offset causes the remaining bits in the byte to be written
58 * <p> If the bit offset within the stream is non-zero, the
60 * and written out first. The bit offset will be 0 after the
79 * <p> If the bit offset within the stream is non-zero, the
81 * and written out first. The bit offset will be 0 after the
98 * <p> If the bit offset within the stream is non-zero, the
100 * and written out first. The bit offse
612 writeBit(int bit) argument
[all...]
H A DImageOutputStreamImpl.java389 public void writeBit(int bit) throws IOException { argument
390 writeBits((1L & bit), 1);
406 // and the bit offset is 0, there can't be any pre-existing bits
481 * If the bit offset is non-zero, forces the remaining bits
/openjdk7/hotspot/src/share/vm/opto/
H A Dregmask.cpp49 //-------------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 DindexSet.hpp58 // 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...]
H A DgraphKit.cpp844 // NOTE: set_bci (called from sync_jvms) might reset the reexecute bit to
848 "in LibraryCallKit the reexecute bit should not change");
1606 // The scaled index operand to AddP must be a clean 64-bit value.
1607 // Java allows a 32-bit int to be incremented to a negative
1608 // value, which appears in a 64-bit register as a large
1611 // On the other hand, 32-bit overflow is rare, and the possibility
2545 java_bc() == Bytecodes::_aastore, "MDO must collect null_seen bit here");
3087 // The layout_helper also encodes (in a low bit) the need for a slow path.
3106 Node* bit = intcon(Klass::_lh_instance_slow_path_bit); local
3107 initial_slow_test = _gvn.transform( new (C) AndINode(layout_val, bit) );
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/codemodel/internal/
H A DJMods.java48 /** 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/validator/
H A DEndEntityChecker.java102 // bit numbers in the key usage extension
204 * Utility method checking if bit 'bit' is set in this certificates
208 private boolean checkKeyUsage(X509Certificate cert, int bit) argument
214 return (keyUsage.length > bit) && keyUsage[bit];
286 // (aka Step-Up, 128 bit) EKU OIDs
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DBitArray.java60 * 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/jaxp/src/com/sun/org/apache/xml/internal/serializer/
H A DCharInfo.java113 // 5 for 32 bit words, 6 for 64 bit words ...
116 * calculate which element its bit is stored in.
117 * 5 for 32 bit words (int) , 6 for 64 bit words (long)
123 * calculate the value of the bit within a given word,
127 * 0x1F for 32 bit words (int),
128 * or 0x3F for 64 bit words (long)
244 // limited to the 7-bit ASCII range (at least, in English
541 * Returns the array element holding the bit valu
555 private static int bit(int i) { method in class:CharInfo
[all...]
/openjdk7/hotspot/src/share/vm/utilities/
H A DbitMap.hpp41 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 DbitMap.cpp193 // the bit, false to indicate that someone else did.
194 // In either case, the requested bit is in the
198 // change the requested bit to a state other than
200 // then the the bit is in the expected state
207 bool BitMap::par_at_put(idx_t bit, bool value) { argument
208 return value ? par_set_bit(bit) : par_clear_bit(bit);
/openjdk7/jdk/src/solaris/native/sun/java2d/x11/
H A DX11PMBlitLoops.c295 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 DX11TextRenderer_md.c57 // 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/classes/sun/security/ssl/
H A DX509KeyManagerImpl.java497 private static boolean getBit(boolean[] keyUsage, int bit) { argument
498 return (bit < keyUsage.length) && keyUsage[bit];
527 // require either signature bit
528 // or if server also allow key encipherment bit
535 // require signature bit
540 // require keyagreement bit
545 // require signature bit
550 // This is not totally accurate as the keyAgreement bit
/openjdk7/jdk/src/solaris/native/sun/java2d/loops/
H A Dmlib_ImageZoom_NN.c157 mlib_s32 bit, res, k, y_step = -1; local
181 /* save shifts for bit extracting */
273 bit = 7 - (k & 7);
275 (((sl[x >> (MLIB_SHIFT + 3)] >> (7 - (x >> MLIB_SHIFT) & 7)) & 1) << bit);
320 bit = 7 - (k & 7);
322 (((sl[x >> (MLIB_SHIFT + 3)] >> (7 - (x >> MLIB_SHIFT) & 7)) & 1) << bit);
445 /* save shifts for bit extracting */
/openjdk7/hotspot/src/share/vm/prims/
H A DjvmtiEventController.cpp364 jlong bit = JvmtiEventEnabled::bit_for((jvmtiEvent)ei); local
365 if (changed & bit) {
369 (now_enabled & bit)? "Enabling" : "Disabling", JvmtiTrace::event_name((jvmtiEvent)ei));
384 jlong bit = JvmtiEventEnabled::bit_for((jvmtiEvent)ei); local
385 if (changed & bit) {
388 (now_enabled & bit)? "Enabling" : "Disabling", JvmtiTrace::event_name((jvmtiEvent)ei));
712 // jvmtiEvent to set/clear the bit for this extension event.
732 // update the callback enable/disable bit
897 jlong bit = JvmtiEventEnabled::bit_for((jvmtiEvent)ei); local
898 assert(((THREAD_FILTERED_EVENT_BITS & bit) !
[all...]
/openjdk7/jdk/src/solaris/native/java/net/
H A DNetworkInterface.c1779 int byte, bit, plen = 0; local
1786 for (bit = 7; bit != 0; bit--, plen++)
1787 if (!(name[byte] & (1 << bit)))
1789 for (; bit != 0; bit--)
1790 if (name[byte] & (1 << bit))

Completed in 105 milliseconds