Searched defs:limit (Results 101 - 125 of 170) sorted by relevance

1234567

/openjdk7/jdk/test/sun/nio/cs/
H A DFindDecoderBugs.java114 final int limit; field in class:FindDecoderBugs.Result
126 limit = ob.limit();
132 byte[] a = new byte[b.limit()];
157 cr, string(oa), oa.length, limit,
199 for (int i = 0; i < ob.limit(); i++)
203 equal(ib.limit(), ib.capacity());
204 equal(ob.limit(), ob.capacity());
227 if (ob.position() < ob.limit() &&
248 equal(rob.limit(),
[all...]
H A DFindEncoderBugs.java114 final int limit; field in class:FindEncoderBugs.Result
133 limit = ob.limit();
139 char[] a = new char[b.limit()];
164 cr, string(oa), oa.length, limit,
292 // rob.clear(); rob.limit(lim);
309 // rob.clear(); rob.limit(lim);
333 for (int i = 0; i < ob.limit(); i++)
337 equal(ib.limit(), ib.capacity());
338 equal(ob.limit(), o
[all...]
/openjdk7/jdk/src/share/classes/sun/java2d/pipe/
H A DBufferedRenderPipe.java389 int pos, int limit,
388 fillSpans(RenderQueue rq, long buf, int pos, int limit, SpanIterator si, long iterator, int transx, int transy) argument
/openjdk7/jdk/src/share/classes/sun/java2d/pisces/
H A DDasher.java275 // return as many as 1<<limit curves, but this is an iterator and we
280 // limit+1 curves - one for each level of the tree + 1.
295 private final int limit; field in class:Dasher.LengthIterator
305 // the current level in the recursion tree. 0 is the root. limit
316 this.limit = reclimit;
317 this.minTincrement = 1f / (1 << limit);
492 nextT += (1 << (limit - recLevel)) * minTincrement;
524 if (polyLen - lineLen < ERR || recLevel == limit) {
/openjdk7/jdk/src/share/classes/sun/font/
H A DExtendedTextSourceLabel.java495 public float getAdvanceBetween(int start, int limit) { argument
500 while (++start < limit) {
658 int gxlimit = numGlyphs; // limit of gx, when we reach this we're done
891 public TextLineComponent getSubset(int start, int limit, int dir) { argument
892 return new ExtendedTextSourceLabel(source.getSubSource(start, limit-start, dir), decorator);
/openjdk7/jdk/src/share/classes/java/lang/
H A DString.java2195 * <p> The <tt>limit</tt> parameter controls the number of times the
2197 * array. If the limit <i>n</i> is greater than zero then the pattern
2209 * <blockquote><table cellpadding=1 cellspacing=0 summary="Split example showing regex, limit, and result">
2250 * @param limit
2264 public String[] split(String regex, int limit) { argument
2284 boolean limited = limit > 0;
2287 if (!limited || list.size() < limit - 1) {
2291 //assert (list.size() == limit - 1);
2302 if (!limited || list.size() < limit)
2307 if (limit
[all...]
/openjdk7/hotspot/src/share/vm/classfile/
H A DsymbolTable.cpp777 const int limit = the_table()->table_size(); local
779 assert(0 <= start_idx && start_idx <= limit,
781 assert(0 <= end_idx && end_idx <= limit,
812 const int limit = the_table()->table_size(); local
817 if (start_idx >= limit) {
822 int end_idx = MIN2(limit, start_idx + ClaimChunkSize);
H A DsystemDictionary.hpp414 int limit = (int)end_id + 1; local
415 initialize_wk_klasses_until((WKID) limit, start_id, THREAD);
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/
H A DmutableNUMASpace.cpp78 void MutableNUMASpace::check_mangled_unused_area(HeapWord* limit) { argument
419 size_t MutableNUMASpace::adaptive_chunk_size(int i, size_t limit) { argument
437 if (limit > 0) {
438 limit = round_down(limit, page_size());
441 if (upper_bound > limit &&
442 current_chunk_size(i) < upper_bound - limit) {
445 upper_bound = current_chunk_size(i) + limit;
450 if (current_chunk_size(i) > limit) { // lower_bound shouldn't underflow.
451 lower_bound = current_chunk_size(i) - limit;
625 size_t limit = NUMASpaceResizeRate / local
[all...]
/openjdk7/hotspot/src/share/vm/memory/
H A DcardTableModRefBS.cpp534 jbyte* limit = byte_for(mri.start()); local
535 while (cur_entry >= limit) {
540 while (next_entry >= limit && *next_entry != clean_card) {
613 jbyte *cur_entry, *next_entry, *limit; local
614 for (cur_entry = byte_for(mri.start()), limit = byte_for(mri.last());
615 cur_entry <= limit;
622 next_entry <= limit && *next_entry == dirty_card;
639 jbyte* cur_entry, *next_entry, *limit; local
640 for (cur_entry = byte_for(mri.start()), limit = byte_for(mri.last());
641 cur_entry <= limit;
[all...]
H A Dspace.cpp340 void ContiguousSpace::check_mangled_unused_area(HeapWord* limit) { argument
341 mangler()->check_mangled_unused_area(limit);
752 HeapWord * limit = concurrent_iteration_safe_limit(); local
753 assert(limit <= top(), "sanity check");
754 for (HeapWord* p = bottom(); p < limit;) {
H A DdefNewGeneration.cpp268 HeapWord* limit = (HeapWord*) _virtual_space.high(); local
269 eden()->check_mangled_unused_area(limit);
270 from()->check_mangled_unused_area(limit);
271 to()->check_mangled_unused_area(limit);
639 // A successful scavenge should restart the GC time limit count which is
671 // set new iteration safe limit for the survivor spaces
1012 // Tell the next generation we reached a limit.
1022 // The allocation failed and the soft limit is equal to the hard limit,
1027 // Try to allocate until succeeded or the soft limit ca
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A DidealKit.cpp157 // * if (iv relop limit) {
165 void IdealKit::loop(GraphKit* gkit, int nargs, IdealVariable& iv, Node* init, BoolTest::mask relop, Node* limit, float prob, float cnt) { argument
180 if_then(value(iv), relop, limit, prob, cnt, false /* no new state */); local
H A DloopPredicate.cpp376 // Clone loop limit check last to insert it before loop.
377 // Don't clone a limit check which was already finalized
378 // for this counted loop (only one limit check is needed).
382 assert(new_entry != NULL && new_entry->is_Proj(), "IfTrue or IfFalse after clone limit check");
633 // for (i = init; i < limit; i += stride) {
637 // Compute max(scale*i + offset) for init <= i < limit and build the predicate
642 // max(scale*i + offset) = scale*(limit-stride) + offset
647 Node* init, Node* limit, Node* stride,
659 // With LoopLimitCheck limit is not exact.
660 // Calculate exact limit her
645 rc_predicate(IdealLoopTree *loop, Node* ctrl, int scale, Node* offset, Node* init, Node* limit, Node* stride, Node* range, bool upper) argument
840 Node* limit = cl->limit(); local
[all...]
H A DparseHelper.cpp317 void Parse::test_counter_against_threshold(Node* cnt, int limit) { argument
318 // Test the counter against the limit and uncommon trap if greater.
324 Node *threshold = makecon(TypeInt::make(limit));
336 void Parse::increment_and_test_invocation_counter(int limit) { argument
348 test_counter_against_threshold(cnt, limit);
390 void Parse::test_for_osr_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize counter_offset, int limit) { argument
396 test_counter_against_threshold(cnt, limit);
419 // To do: factor out the the limit calculations below. These duplicate
420 // the similar limit calculations in the interpreter.
437 int limit local
445 int limit = (CompileThreshold * OnStackReplacePercentage) / 100; local
[all...]
H A Dparse.hpp216 int limit() const { return flow()->limit(); } function in class:Parse::Block
555 void test_counter_against_threshold(Node* cnt, int limit);
556 void increment_and_test_invocation_counter(int limit);
557 void test_for_osr_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize offset, int limit);
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/
H A DPackageReader.java84 long limit; // current declared limit field in class:PackageReader.LimitedBuffer
87 boolean z = (getBytesServed() == limit);
88 assert(!z || limit == buffered);
96 limit = -1;
98 limit = getBytesServed() + newLimit;
101 if (limit == -1)
102 return limit;
104 return limit - getBytesServed();
115 assert(served <= limit || limi
[all...]
/openjdk7/jdk/src/share/native/java/util/zip/zlib-1.2.3/
H A Ddeflate.c1061 IPos limit = s->strstart > (IPos)MAX_DIST(s) ? local
1063 /* Stop when cur_match becomes <= limit. To simplify the code,
1187 } while ((cur_match = prev[cur_match & wmask]) > limit
1301 /* Deal with !@#$% 64K limit: */
/openjdk7/jdk/src/share/native/sun/font/layout/
H A DHangulLayoutEngine.cpp264 le_int32 limit = offset + count; local
267 while (i < limit) {
272 while( i < limit) {
/openjdk7/jdk/src/share/classes/sun/text/normalizer/
H A DNormalizerBase.java259 protected QuickCheckResult quickCheck(char[] src,int start, int limit, argument
323 int limit,boolean allowMaybe,
326 src, start,limit,
385 int limit,boolean allowMaybe,
388 src,start,limit,
443 int limit,boolean allowMaybe,
446 src,start,limit,
501 int limit,boolean allowMaybe,
504 src,start,limit,
322 quickCheck(char[] src,int start, int limit,boolean allowMaybe, UnicodeSet nx) argument
384 quickCheck(char[] src,int start, int limit,boolean allowMaybe, UnicodeSet nx) argument
442 quickCheck(char[] src,int start, int limit,boolean allowMaybe, UnicodeSet nx) argument
500 quickCheck(char[] src,int start, int limit,boolean allowMaybe, UnicodeSet nx) argument
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xpath/regex/
H A DRegularExpression.java733 if (matchEnd == con.limit) {
750 int o = this.fixedStringTable.matches(target, con.start, con.limit);
769 int o = this.fixedStringTable.matches(target, con.start, con.limit);
777 int limit = con.limit-this.minlength;
791 for (matchStart = con.start; matchStart <= limit; matchStart ++) {
813 for (matchStart = con.start; matchStart <= limit; matchStart ++) {
815 if (REUtil.isHighSurrogate(ch) && matchStart+1 < con.limit) {
832 for (matchStart = con.start; matchStart <= limit; matchStart ++) {
922 System.err.println("con.limit
1753 regionMatches(boolean ignoreCase, int offset, int limit, String part, int partlen) argument
1754 regionMatches(boolean ignoreCase, int offset, int limit, int offset2, int partlen) argument
1773 regionMatches(boolean ignoreCase, int offset, int limit, String part, int partlen) argument
1781 regionMatches(boolean ignoreCase, int offset, int limit, int offset2, int partlen) argument
1807 regionMatches(boolean ignoreCase, int offset, int limit, String part, int partlen) argument
1816 regionMatches(int offset, int limit, String part, int partlen) argument
1826 regionMatchesIgnoreCase(int offset, int limit, String part, int partlen) argument
1846 regionMatches(boolean ignoreCase, int offset, int limit, int offset2, int partlen) argument
1854 regionMatches(int offset, int limit, int offset2, int partlen) argument
1863 regionMatchesIgnoreCase(int offset, int limit, int offset2, int partlen) argument
1899 regionMatches(boolean ignoreCase, int offset, int limit, String part, int partlen) argument
1908 regionMatches(int offset, int limit, String part, int partlen) argument
1918 regionMatchesIgnoreCase(int offset, int limit, String part, int partlen) argument
1938 regionMatches(boolean ignoreCase, int offset, int limit, int offset2, int partlen) argument
1946 regionMatches(int offset, int limit, int offset2, int partlen) argument
1956 regionMatchesIgnoreCase(int offset, int limit, int offset2, int partlen) argument
2015 int limit; field in class:RegularExpression.Context
2047 reset(CharacterIterator target, int start, int limit, int nofclosures) argument
2060 reset(String target, int start, int limit, int nofclosures) argument
2073 reset(char[] target, int start, int limit, int nofclosures) argument
[all...]
/openjdk7/jdk/src/share/classes/sun/awt/image/
H A DPNGImageDecoder.java528 PNGEncoder.prChunk(e.toString(),inbuf,pos,limit-pos,true);
623 int pos, limit; field in class:PNGImageDecoder
666 if(pos>0 && pos<limit) {
667 System.arraycopy(inbuf,pos,inbuf,0,limit-pos);
668 limit = limit-pos;
670 } else if(pos>=limit) {
671 pos = 0; limit = 0;
674 while(limit<bsize) {
675 int n = underlyingInputStream.read(inbuf,limit,bsiz
[all...]
/openjdk7/hotspot/src/share/vm/code/
H A DrelocInfo.cpp97 // cannot compact, so just update the count and return the limit pointer
143 void RelocIterator::initialize(nmethod* nm, address begin, address limit) { argument
169 assert(limit == NULL || limit <= nm->code_end(), "in bounds");
170 set_limits(begin, limit);
174 RelocIterator::RelocIterator(CodeSection* cs, address begin, address limit) { argument
193 assert(limit == NULL || limit <= cs->end(), "in bounds");
194 set_limits(begin, limit);
289 void RelocIterator::set_limits(address begin, address limit) { argument
354 set_limit(address limit) argument
[all...]
/openjdk7/jdk/src/share/classes/java/awt/
H A DFont.java2043 * <code>limit</code>. This method is a convenience overload.
2048 * @param limit the specified ending offset (in
2058 public int canDisplayUpTo(char[] text, int start, int limit) { argument
2060 for (int i = start; i < limit; i++) {
2068 if (!font2d.canDisplay(Character.codePointAt(text, i, limit))) {
2079 * <code>start</code> and ending at <code>limit</code>.
2084 * @param limit the specified ending offset into the specified
2093 public int canDisplayUpTo(CharacterIterator iter, int start, int limit) { argument
2096 for (int i = start; i < limit; i++, c = iter.next()) {
2255 * @param limit th
2260 getLineMetrics( String str, int beginIndex, int limit, FontRenderContext frc) argument
2279 getLineMetrics(char [] chars, int beginIndex, int limit, FontRenderContext frc) argument
2298 getLineMetrics(CharacterIterator ci, int beginIndex, int limit, FontRenderContext frc) argument
2360 getStringBounds( String str, int beginIndex, int limit, FontRenderContext frc) argument
2395 getStringBounds(char [] chars, int beginIndex, int limit, FontRenderContext frc) argument
2462 getStringBounds(CharacterIterator ci, int beginIndex, int limit, FontRenderContext frc) argument
2629 layoutGlyphVector(FontRenderContext frc, char[] text, int start, int limit, int flags) argument
[all...]
/openjdk7/jdk/src/share/classes/java/awt/font/
H A DTextLayout.java453 int limit,
469 if (font.canDisplayUpTo(text, start, limit) != -1) {
474 CodePointIterator iter = CodePointIterator.create(text, start, limit);
476 if (iter.charIndex() == limit) {
482 if (sameBaselineUpTo(font, text, start, limit) != limit) {
510 int limit = text.getEndIndex();
511 if (start == limit) {
515 int len = limit - start;
524 if (text.getRunLimit() == limit) {
451 singleFont(char[] text, int start, int limit, Map attributes) argument
2655 sameBaselineUpTo(Font font, char[] text, int start, int limit) argument
[all...]

Completed in 334 milliseconds

1234567