Searched defs:beg (Results 1 - 25 of 28) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/oops/
H A DobjArrayKlass.inline.hpp52 T* const beg = base + beg_index; local
56 for (T* e = beg; e < end; e++) {
86 T* const beg = base + beg_index; local
90 for (T* e = beg; e < end; e++) {
/openjdk7/jdk/src/share/native/java/util/zip/zlib-1.2.3/
H A Dinffast.c99 unsigned char FAR *beg; /* inflate()'s initial strm->next_out */ local
126 beg = out - (start - strm->avail_out);
210 op = (unsigned)(out - beg); /* max distance in output */
H A Ddeflate.c678 uInt beg = s->pending; /* start of bytes to update crc */ local
682 if (s->gzhead->hcrc && s->pending > beg)
683 strm->adler = crc32(strm->adler, s->pending_buf + beg,
684 s->pending - beg);
686 beg = s->pending;
693 if (s->gzhead->hcrc && s->pending > beg)
694 strm->adler = crc32(strm->adler, s->pending_buf + beg,
695 s->pending - beg);
706 uInt beg = s->pending; /* start of bytes to update crc */ local
711 if (s->gzhead->hcrc && s->pending > beg)
737 uInt beg = s->pending; /* start of bytes to update crc */ local
[all...]
/openjdk7/jdk/src/share/classes/javax/naming/ldap/
H A DLdapName.java160 * of "rdns" in the range [beg,end)) and, optionally
164 // private LdapName(String name, List<Rdn> rdns, int beg, int end) {
166 private LdapName(String name, ArrayList rdns, int beg, int end) { argument
168 // this.rdns = rdns.subList(beg, end);
170 List sList = rdns.subList(beg, end);
373 private boolean doesListMatch(int beg, int end, List rdns) { argument
374 for (int i = beg; i < end; i++) {
375 if (!this.rdns.get(i).equals(rdns.get(i - beg))) {
384 * Returns true if components [beg,end) match the components of "n".
387 * The following must hold: end - beg
389 matches(int beg, int end, Name n) argument
[all...]
H A DRdn.java605 int beg = 0;
609 while ((beg < end) && isWhitespace(chars[beg])) {
610 ++beg;
613 while ((beg < end) && isWhitespace(chars[end - 1])) {
621 (beg < end) &&
625 if (beg >= end) {
629 if (chars[beg] == '#') {
631 return decodeHexPairs(chars, ++beg, end);
635 if ((chars[beg]
688 decodeHexPairs(char[] chars, int beg, int end) argument
714 getUtf8Octets(char[] chars, int beg, int end) argument
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DparMarkBitMap.cpp257 const idx_t* const beg = (const idx_t*)_virtual_space->committed_low_addr(); local
259 for (const idx_t* p = beg; p < end; ++p) {
H A DparMarkBitMap.hpp151 // respectively) in the range [beg, end). If no object is found, return end.
152 inline idx_t find_obj_beg(idx_t beg, idx_t end) const;
153 inline idx_t find_obj_end(idx_t beg, idx_t end) const;
155 inline HeapWord* find_obj_beg(HeapWord* beg, HeapWord* end) const;
156 inline HeapWord* find_obj_end(HeapWord* beg, HeapWord* end) const;
160 inline void clear_range(idx_t beg, idx_t end);
221 inline void ParMarkBitMap::clear_range(idx_t beg, idx_t end) argument
223 _beg_bits.clear_range(beg, end);
224 _end_bits.clear_range(beg, end);
397 ParMarkBitMap::find_obj_beg(idx_t beg, idx_
[all...]
H A DpsParallelCompact.hpp403 // Fill in the regions covering [beg, end) so that no data moves; i.e., the
404 // destination of region n is simply the start of region n. The argument beg
406 void summarize_dense_prefix(HeapWord* beg, HeapWord* end);
419 void clear_range(HeapWord* beg, HeapWord* end) { argument
420 clear_range(addr_to_region_idx(beg), addr_to_region_idx(end));
1065 // Find the first (left-most) region in the range [beg, end) that has at least
1066 // dead_words of dead space to the left. The argument beg must be the first
1068 static RegionData* dead_wood_limit_region(const RegionData* beg,
1072 // Return a pointer to the first region in the range [beg, end) that is not
1074 static RegionData* first_dead_space_region(const RegionData* beg,
[all...]
/openjdk7/hotspot/src/share/vm/memory/
H A Dheap.cpp49 void CodeHeap::mark_segmap_as_free(size_t beg, size_t end) { argument
50 assert(0 <= beg && beg < _number_of_committed_segments, "interval begin out of bounds");
51 assert(beg < end && end <= _number_of_committed_segments, "interval end out of bounds");
53 address p = (address)_segmap.low() + beg;
60 void CodeHeap::mark_segmap_as_used(size_t beg, size_t end) {
61 assert(0 <= beg && beg < _number_of_committed_segments, "interval begin out of bounds");
62 assert(beg < end && end <= _number_of_committed_segments, "interval end out of bounds");
64 address p = (address)_segmap.low() + beg;
365 size_t beg = segment_for(a); local
456 size_t beg = segment_for(best_block); local
[all...]
/openjdk7/jdk/src/share/classes/com/sun/jndi/dns/
H A DDnsName.java141 * the components of "n" in the range [beg,end). Indexing is as
144 private DnsName(DnsName n, int beg, int end) { argument
146 // at index 0 (opposite to the convention used for "beg" and "end").
148 int e = n.size() - beg;
382 * compares components of this name in the range [beg,end) with
388 private int compareRange(int beg, int end, Name n) { argument
393 int minSize = Math.min(end - beg, n.size());
395 String label1 = get(i + beg);
398 int j = size() - (i + beg) - 1; // index of label1 in "labels"
406 return ((end - beg)
[all...]
/openjdk7/hotspot/src/share/tools/launcher/
H A Dwildcard.c287 FileList_addSubstring(FileList fl, const char *beg, int len) argument
290 memcpy(filename, beg, len);
/openjdk7/jdk/src/share/bin/
H A Dwildcard.c275 FileList_addSubstring(FileList fl, const char *beg, int len) argument
278 memcpy(filename, beg, len);
/openjdk7/jdk/test/tools/pack200/pack200-verifier/src/xmlkit/
H A DTokenList.java63 public TokenList(Object[] tokens, int beg, int end) { argument
64 super(end - beg); // capacity
66 addTokens(tokens, beg, end);
69 public TokenList(Object[] tokens, int beg, int end, String separator) { argument
70 super(end - beg); // capacity
72 addTokens(tokens, beg, end);
179 public boolean addTokens(Object[] tokens, int beg, int end) { argument
181 for (int i = beg; i < end; i++) {
241 // { modCount, hint, -1==beg[0], end[0]==beg[
309 subSequence(int beg, int end) argument
[all...]
H A DXMLKit.java140 * void clear(int beg=0, int end=size)
538 public void clear(int beg) { argument
539 clear(beg, size);
542 public void clear(int beg, int end) { argument
546 if (beg < 0 || beg > end) {
547 badIndex(beg);
549 if (beg == end) {
554 if (beg == 0
560 clearParts(beg, siz
568 clearParts(int beg, int end) argument
[all...]
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/
H A Dbytes.h62 bytes slice(size_t beg, size_t end) { argument
64 res.ptr = ptr + beg;
65 res.len = end - beg;
/openjdk7/jdk/src/share/classes/com/sun/jndi/ldap/
H A DLdapName.java107 * of "rdns" in the range [beg,end)) and, optionally
110 private LdapName(String name, Vector rdns, int beg, int end) { argument
113 for (int i = beg; i < end; i++) {
247 * Returns true if components [beg,end) match the components of "n".
250 * The following must hold: end - beg == n.size().
252 private boolean matches(int beg, int end, Name n) { argument
253 for (int i = beg; i < end; i++) {
257 rdn = (Rdn)ln.rdns.elementAt(i - beg);
259 String rdnString = n.get(i - beg);
477 final int beg
933 decodeHexPairs(char[] chars, int beg, int end) argument
959 getUtf8Octets(char[] chars, int beg, int end) argument
[all...]
/openjdk7/jdk/test/java/lang/invoke/
H A DInvokeGenericTest.java295 int beg, int end, Class<?> argType) {
299 Collections.fill(argTypes.subList(beg, end), argType);
294 changeArgTypes(MethodHandle target, int beg, int end, Class<?> argType) argument
H A DMethodHandlesTest.java334 int beg, int end, Class<?> argType) {
338 Collections.fill(argTypes.subList(beg, end), argType);
333 changeArgTypes(MethodHandle target, int beg, int end, Class<?> argType) argument
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_ValueType.hpp208 IntInterval(jint beg, jint end) { argument
209 assert(beg <= end, "illegal interval");
210 _beg = beg;
214 jint beg() const { return _beg; } function in class:IntInterval
H A Dc1_GraphBuilder.cpp2429 void GraphBuilder::connect_to_end(BlockBegin* beg) { argument
2432 _block = beg;
2433 _state = beg->state()->copy_for_parsing();
2434 _last = beg;
2435 iterate_bytecodes_for_block(beg->bci());
/openjdk7/hotspot/src/share/vm/utilities/
H A DbitMap.cpp80 void BitMap::set_range_within_word(idx_t beg, idx_t end) { argument
81 // With a valid range (beg <= end), this test ensures that end != 0, as
83 if (beg != end) {
84 bm_word_t mask = inverted_bit_mask_for_range(beg, end);
85 *word_addr(beg) |= ~mask;
89 void BitMap::clear_range_within_word(idx_t beg, idx_t end) { argument
90 // With a valid range (beg <= end), this test ensures that end != 0, as
92 if (beg != end) {
93 bm_word_t mask = inverted_bit_mask_for_range(beg, end);
94 *word_addr(beg)
98 par_put_range_within_word(idx_t beg, idx_t end, bool value) argument
116 set_range(idx_t beg, idx_t end) argument
135 clear_range(idx_t beg, idx_t end) argument
154 set_large_range(idx_t beg, idx_t end) argument
169 clear_large_range(idx_t beg, idx_t end) argument
226 par_at_put_range(idx_t beg, idx_t end, bool value) argument
250 at_put_large_range(idx_t beg, idx_t end, bool value) argument
258 par_at_put_large_range(idx_t beg, idx_t end, bool value) argument
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dlcm.cpp976 static void catch_cleanup_intra_block(Node *use, Node *def, Block *blk, int beg, int n_clone_idx) { argument
983 uint offset_idx = use_idx - beg;
1014 uint beg = end;
1015 while(!_nodes[beg-1]->is_MachProj() ||
1016 !_nodes[beg-1]->in(0)->is_MachCall() ) {
1017 beg--;
1018 assert(beg > 0,"Catch cleanup walking beyond block boundary");
1020 // Range of inserted instructions is [beg, end)
1021 if( beg == end ) return;
1023 // Clone along all Catch output paths. Clone area between the 'beg' an
[all...]
/openjdk7/jdk/src/share/native/java/util/zip/
H A Dzip_util.c525 countCENHeaders(unsigned char *beg, unsigned char *end) argument
529 for (i = 0; i + CENHDR <= end - beg; i += CENSIZE(beg + i))
/openjdk7/hotspot/src/share/vm/code/
H A Ddependencies.cpp235 address beg = nm->dependencies_begin(); local
237 guarantee(end - beg >= (ptrdiff_t) size_in_bytes(), "bad sizing");
239 (HeapWord*) beg,
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/
H A DPackage.java1071 private static boolean isDigitString(String x, int beg, int end) { argument
1072 if (beg == end) return false; // null string
1073 for (int i = beg; i < end; i++) {

Completed in 136 milliseconds

12