Searched defs:bits (Results 1 - 25 of 80) sorted by relevance

1234

/openjdk7/hotspot/src/share/vm/prims/
H A DjvmtiEventController.inline.hpp46 assert(_init_guard == JEE_INIT_GUARD, "enable bits uninitialized or corrupted");
50 inline void JvmtiEventEnabled::set_bits(jlong bits) { argument
51 assert(_init_guard == JEE_INIT_GUARD, "enable bits uninitialized or corrupted on set");
52 _enabled_bits = bits;
/openjdk7/hotspot/src/share/vm/utilities/
H A DaccessFlags.cpp42 void AccessFlags::atomic_set_bits(jint bits) { argument
43 // Atomically update the flags with the bits given
47 new_flags = old_flags | bits;
52 void AccessFlags::atomic_clear_bits(jint bits) { argument
53 // Atomically update the flags with the bits given
57 new_flags = old_flags & ~bits;
H A Dcopy.cpp34 uintptr_t bits = (uintptr_t) src | (uintptr_t) dst | (uintptr_t) size; local
36 // (Note: We could improve performance by ignoring the low bits of size,
44 if (bits % sizeof(jlong) == 0) {
46 } else if (bits % sizeof(jint) == 0) {
48 } else if (bits % sizeof(jshort) == 0) {
60 uintptr_t bits = (uintptr_t) to | (uintptr_t) size; local
61 if (bits % sizeof(jlong) == 0) {
72 } else if (bits % sizeof(jint) == 0) {
82 } else if (bits % sizeof(jshort) == 0) {
/openjdk7/jdk/src/share/native/java/util/zip/zlib-1.2.3/
H A Dinftrees.h38 table that indexes more bits of the code. op indicates whether
41 pointer, the low four bits of op is the number of index bits of
42 that table. For a length or distance, the low four bits of op
43 is the number of extra bits to get after the code. bits is
44 the number of bits in this code or part of the code to drop off
49 unsigned char op; /* operation, extra bits, table bits */
50 unsigned char bits; /* bit member in struct:__anon663
[all...]
H A Dinffast.c70 state->bits < 8
80 - The maximum input bits used by a length/distance pair is 15 bits for the
81 length code, 5 bits for the length extra, 15 bits for the distance code,
82 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
109 unsigned bits; /* local strm->bits */ local
115 unsigned op; /* code bits, operatio
[all...]
H A Dinfback.c107 unsigned sym, bits; local
118 bits = 9;
119 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
125 bits = 5;
126 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
150 bits = state->bits; \
161 state->bits = bits; \
168 bits
277 unsigned bits; /* bits in bit buffer */ local
[all...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/utilities/
H A DMarkBits.java34 (object-external) set of mark bits, used for GC-like scans through
45 bits = new BitMap((int) numOopHandles);
49 bits.clear();
65 if ((idx < 0) || (idx >= bits.size())) {
70 if (bits.at(intIdx)) {
73 bits.atPut(intIdx, true);
82 if ((idx < 0) || (idx >= bits.size())) {
87 bits.atPut(intIdx, false);
90 private BitMap bits; field in class:MarkBits
/openjdk7/jdk/src/share/classes/com/sun/imageio/plugins/common/
H A DBitFile.java40 int bitsLeft; // bits left at current index that are avail.
70 public void writeBits(int bits, int numbits) throws IOException { argument
87 if (numbits <= bitsLeft) { // bits contents fit in current index byte
89 buffer[index] |= (bits & ((1 << numbits) - 1)) << (8 - bitsLeft);
94 buffer[index] |= (bits & ((1 << numbits) - 1)) << (bitsLeft - numbits);
99 } else { // bits overflow from current byte to next.
101 // if bits > space left in current byte then the lowest order bits
103 buffer[index] |= (bits & ((1 << bitsLeft) - 1)) << (8 - bitsLeft);
105 bits >>
[all...]
/openjdk7/jdk/src/share/native/sun/font/layout/
H A DDeviceTables.cpp54 le_uint16 bits = fieldBits[format]; local
55 le_uint16 count = 16 / bits;
58 le_uint16 shift = 16 - (bits * (fieldIndex + 1));
/openjdk7/jdk/src/share/classes/sun/security/krb5/internal/util/
H A DKerberosFlags.java52 * -- minimum number of bits shall be sent,
58 BitArray bits; field in class:KerberosFlags
64 bits = new BitArray(length);
68 bits = new BitArray(length, a);
70 bits = new BitArray(Arrays.copyOf(bits.toBooleanArray(), Krb5.KRB_FLAGS_MAX+1));
75 bits = new BitArray((bools.length==Krb5.KRB_FLAGS_MAX+1)?
81 bits.set(index, value);
85 return bits.get(index);
89 return bits
[all...]
/openjdk7/jdk/src/share/classes/java/math/
H A DBitSieve.java30 * and clearing of bits in a storage array. The size of the sieve is assumed to
31 * be constant to reduce overhead. All the bits of a new bitSieve are zero, and
32 * bits are removed from it by setting them.
49 * Stores the bits in this bitSieve.
51 private long bits[]; field in class:BitSieve
54 * Length is how many bits this sieve holds.
77 bits = new long[(unitIndex(length - 1) + 1)];
93 * Construct a bit sieve of searchLen bits used for finding prime number
99 * Candidates are indicated by clear bits in the sieve. As a candidates
105 bits
[all...]
/openjdk7/jdk/src/share/classes/sun/security/util/
H A DBitArray.java49 private static int position(int idx) { // bits big-endian in each unit
93 2. zero out extra bits in the last byte
103 * Create a BitArray whose bits are those of the given array
106 public BitArray(boolean[] bits) { argument
107 length = bits.length;
111 set(i, bits[i]);
165 * will be contain zeros in any bits that do not have corresponding
166 * bits in the BitArray. (This matters only if the BitArray's size
191 boolean[] bits = new boolean[length];
194 bits[
[all...]
/openjdk7/jdk/src/share/native/sun/security/ec/impl/
H A Decl.c224 int bits; local
248 /* determine number of bits */
249 bits = mpl_significant_bits(&irr) - 1;
250 if (bits < MP_OKAY) {
251 res = bits;
H A Dmplogic.c160 - Extracts numBits bits from a, where the least significant extracted bit
162 - Because sign bit is used to indicate error, maximum number of bits to
163 be returned is the lesser of (a) the number of bits in an mp_digit, or
164 (b) one less than the number of bits in an mp_err.
165 - lsbNum + numbits can be greater than the number of significant bits in
189 returns number of significnant bits in abs(a).
194 mp_err bits = 0; local
205 ++bits;
211 bits += ix * MP_DIGIT_BIT;
212 if (!bits)
[all...]
/openjdk7/jdk/src/share/classes/java/awt/image/
H A DPackedColorModel.java44 * in bits indicated by bit masks. Each bit mask must be contiguous and
94 * which specifies which bits in an <code>int</code> pixel representation
98 * the <code>ColorSpace</code>. All of the bits in each mask
100 * bits of an <code>int</code> pixel representation. If the
110 * @param bits the number of bits in the pixel values
112 * the bits of the pixel values that represent the color
115 * the bits of the pixel values that represent the alpha
122 * @throws IllegalArgumentException if <code>bits</code> is less than
125 public PackedColorModel (ColorSpace space, int bits, argument
193 PackedColorModel(ColorSpace space, int bits, int rmask, int gmask, int bmask, int amask, boolean isAlphaPremultiplied, int trans, int transferType) argument
[all...]
/openjdk7/jdk/src/share/classes/java/util/
H A DRandom.java49 * up to 32 pseudorandomly generated bits.
147 * happens to use only 48 bits of the given seed. In general, however,
148 * an overriding method may use all 64 bits of the {@code long}
163 * {@code int} value and if the argument {@code bits} is between
165 * bits of the returned value will be (approximately) independently
171 * <pre>{@code (int)(seed >>> (48 - bits))}.</pre>
178 * @param bits random bits
183 protected int next(int bits) { argument
190 return (int)(nextseed >>> (48 - bits));
[all...]
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DThreadLocalRandom.java128 protected int next(int bits) { argument
130 return (int) (rnd >>> (48-bits));
168 int bits = next(2);
170 long nextn = ((bits & 2) == 0) ? half : n - half;
171 if ((bits & 1) == 0)
/openjdk7/jdk/src/share/classes/javax/imageio/stream/
H A DImageOutputStream.java46 * non-zero bit offset causes the remaining bits in the byte to be written
56 * The 24 high-order bits of <code>b</code> are ignored.
66 * @param b an <code>int</code> whose lower 8 bits are to be
137 * Writes the 8 low-order bits of <code>v</code> to the
138 * stream. The 24 high-order bits of <code>v</code> are ignored.
155 * Writes the 16 low-order bits of <code>v</code> to the
156 * stream. The 16 high-order bits of <code>v</code> are ignored.
198 * Writes the 32 bits of <code>v</code> to the stream. If the
231 * Writes the 64 bits of <code>v</code> to the stream. If the
323 * the <code>writeByte</code> method. The high-order eight bits o
645 writeBits(long bits, int numBits) argument
[all...]
H A DImageOutputStreamImpl.java393 public void writeBits(long bits, int numBits) throws IOException { argument
403 // Prologue: deal with pre-existing bits
406 // and the bit offset is 0, there can't be any pre-existing bits
417 // Notch out the partial byte and drop in the new bits
420 partialByte &= ~(mask << shift); // Clear out old bits
421 partialByte |= ((bits & mask) << shift); // Or in new ones
430 partialByte &= ~mask; // Clear out bits
431 partialByte |= ((bits >> (numBits - num)) & mask);
445 ? bits & 0xFF
446 : (bits>>shif
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DparMarkBitMap.cpp49 const idx_t bits = bits_required(covered_region); local
50 // The bits will be divided evenly between two bitmaps; each of them should be
52 assert(bits % (BitsPerWord * 2) == 0, "region size unaligned");
54 const size_t words = bits / BitsPerWord;
74 _beg_bits.set_size(bits / 2);
76 _end_bits.set_size(bits / 2);
/openjdk7/hotspot/src/share/vm/opto/
H A Dregmask.cpp161 if( _A[i] ) { // Found some bits
171 // Clear out partial bits; leave only bit pairs
174 int bits = _A[i]; local
175 bits &= ((bits & 0x55555555)<<1); // 1 hi-bit set for each pair
176 bits |= (bits>>1); // Smear 1 hi-bit into a pair
177 _A[i] = bits;
183 // Smear out partial bits; leave only bit pairs
186 int bits local
198 int bits = _A[i]; local
278 int bits = _A[i]; local
303 int bits = _A[i]; local
329 int bits = _A[i]; local
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/
H A DBits.java42 private int[] bits; field in class:Bits
52 public Bits(int[] bits) { argument
53 this.bits = bits;
64 if (bits.length < len) {
66 System.arraycopy(bits, 0, newbits, 0, bits.length);
67 bits = newbits;
74 for (int i = 0; i < bits.length; i++) bits[
[all...]
/openjdk7/jdk/src/share/native/sun/awt/medialib/
H A Dmlib_ImageColormap.h40 mlib_s32 bits; member in struct:__anon747
114 ((mlib_s32)((( mlib_colormap *)( colormap))->bits))
/openjdk7/jdk/src/share/native/sun/java2d/cmm/lcms/
H A Dcmsmd5.c81 cmsUInt32Number bits[2]; member in struct:__anon831
196 ctx->bits[0] = 0;
197 ctx->bits[1] = 0;
209 t = ctx->bits[0];
210 if ((ctx->bits[0] = t + (len << 3)) < t)
211 ctx->bits[1]++;
213 ctx->bits[1] += len >> 29;
254 count = (ctx->bits[0] >> 3) & 0x3F;
273 ((cmsUInt32Number *) ctx->in)[14] = ctx->bits[0];
274 ((cmsUInt32Number *) ctx->in)[15] = ctx->bits[
[all...]
/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).
73 public BitArray(int size, int[] bits) { argument
77 _bits = 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).
121 int bits = _bits[i];
122 if (bits != 0) {
124 if ((bits & _masks[b]) != 0) {
156 // Scan through the bit array - skip integers that have no bits set
158 int bits
[all...]

Completed in 89 milliseconds

1234