Home
last modified time | relevance | path

Searched refs:limit (Results 1 – 25 of 995) sorted by relevance

12345678910>>...40

/external/apache-harmony/nio/src/test/java/common/org/apache/harmony/nio/tests/java/nio/
DAbstractBufferTest.java42 assertTrue(0 <= baseBuf.position() && baseBuf.position() <= baseBuf.limit() in testCapacity()
43 && baseBuf.limit() <= baseBuf.capacity()); in testCapacity()
49 int oldLimit = baseBuf.limit(); in testClear()
54 assertEquals(baseBuf.limit(), baseBuf.capacity()); in testClear()
63 baseBuf.limit(oldLimit); in testClear()
70 int oldLimit = baseBuf.limit(); in testFlip()
75 assertEquals(baseBuf.limit(), oldPosition); in testFlip()
84 baseBuf.limit(oldLimit); in testFlip()
91 int oldLimit = baseBuf.limit(); in testHasRemaining()
93 assertEquals(baseBuf.hasRemaining(), baseBuf.position() < baseBuf.limit()); in testHasRemaining()
[all …]
/external/icu4c/common/
Dbmpset.cpp63 static void set32x64Bits(uint32_t table[64], int32_t start, int32_t limit) { in set32x64Bits() argument
69 if((start+1)==limit) { // Single-character shortcut. in set32x64Bits()
74 int32_t limitLead=limit>>6; in set32x64Bits()
75 int32_t limitTrail=limit&0x3f; in set32x64Bits()
109 UChar32 start, limit; in initBits() local
116 limit=list[listIndex++]; in initBits()
118 limit=0x110000; in initBits()
125 } while(start<limit && start<0x80); in initBits()
126 } while(limit<=0x80); in initBits()
130 set32x64Bits(table7FF, start, limit<=0x800 ? limit : 0x800); in initBits()
[all …]
Dunorm_it.c73 api->start=api->index=api->limit=0; in initIndexes()
78 api->start=api->index=api->limit=uni->capacity; in initIndexes()
83 api->start=api->index=api->limit=uni->capacity/2; in initIndexes()
95 int32_t start, limit; in reallocArrays() local
106 limit=api->limit; in reallocArrays()
113 uprv_memcpy(states+delta+start, uni->states+start, (limit-start+1)*4); in reallocArrays()
114 uprv_memcpy(chars+delta+start, uni->chars+start, (limit-start)*4); in reallocArrays()
118 api->limit=limit+delta; in reallocArrays()
121 uprv_memcpy(states+start, uni->states+start, (limit-start+1)*4); in reallocArrays()
122 uprv_memcpy(chars+start, uni->chars+start, (limit-start)*4); in reallocArrays()
[all …]
Duiter.cpp96 return iter->limit; in stringIteratorGetIndex()
121 pos=iter->limit+delta; in stringIteratorMove()
132 } else if(pos>iter->limit) { in stringIteratorMove()
133 pos=iter->limit; in stringIteratorMove()
141 return iter->index<iter->limit; in stringIteratorHasNext()
151 if(iter->index<iter->limit) { in stringIteratorCurrent()
160 if(iter->index<iter->limit) { in stringIteratorNext()
187 } else if((int32_t)state<iter->start || iter->limit<(int32_t)state) { in stringIteratorSetState()
219 iter->limit=iter->length; in uiter_setString()
249 if((index=iter->index)<iter->limit) { in utf16BEIteratorCurrent()
[all …]
Dnormalizer2impl.cpp45 limit=start+length; in init()
48 if(start==limit) { in init()
63 int32_t length=(int32_t)(limit-start); in equals()
74 limit[0]=U16_LEAD(c); in appendSupplementary()
75 limit[1]=U16_TRAIL(c); in appendSupplementary()
76 limit+=2; in appendSupplementary()
79 reorderStart=limit; in appendSupplementary()
100 reorderStart=limit+length; in append()
102 reorderStart=limit+1; // Ok if not a code point boundary. in append()
105 do { *limit++=*s++; } while(s!=sLimit); in append()
[all …]
Duarrsort.c57 doInsertionSort(char *array, int32_t start, int32_t limit, int32_t itemSize, in doInsertionSort() argument
61 for(j=start+1; j<limit; ++j) { in doInsertionSort()
120 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, in subQuickSort() argument
127 if((start+MIN_QSORT)>=limit) { in subQuickSort()
128 doInsertionSort(array, start, limit, itemSize, cmp, context, px); in subQuickSort()
133 right=limit; in subQuickSort()
136 uprv_memcpy(px, array+((start+limit)/2)*itemSize, itemSize); in subQuickSort()
165 if((right-start)<(limit-left)) { in subQuickSort()
175 if(left<(limit-1)) { in subQuickSort()
176 subQuickSort(array, left, limit, itemSize, cmp, context, px, pw); in subQuickSort()
[all …]
Dubidiln.c125 int32_t start, int32_t limit, in ubidi_setLine() argument
133 RETURN_VOID_IF_BAD_RANGE(start, 0, limit, *pErrorCode); in ubidi_setLine()
134 RETURN_VOID_IF_BAD_RANGE(limit, 0, pParaBiDi->length+1, *pErrorCode); in ubidi_setLine()
140 ubidi_getParagraph(pParaBiDi, limit-1, NULL, NULL, NULL, pErrorCode)) { in ubidi_setLine()
149 length=pLineBiDi->length=limit-start; in ubidi_setLine()
160 for(j=start; j<limit; j++) { in ubidi_setLine()
183 } else if(pParaBiDi->trailingWSStart<limit) { in ubidi_setLine()
563 int32_t length=pBiDi->length, limit; in ubidi_getRuns() local
578 limit=pBiDi->trailingWSStart; in ubidi_getRuns()
581 for(i=0; i<limit; ++i) { in ubidi_getRuns()
[all …]
/external/freetype/src/psaux/
Dpsobjs.c104 FT_Byte** limit = offset + table->max_elems; in shift_elements() local
107 for ( ; offset < limit; offset++ ) in shift_elements()
292 FT_Byte* limit ) in skip_comment() argument
297 while ( cur < limit ) in skip_comment()
310 FT_Byte* limit ) in skip_spaces() argument
315 while ( cur < limit ) in skip_spaces()
321 skip_comment( &cur, limit ); in skip_spaces()
340 FT_Byte* limit ) in skip_literal_string() argument
348 while ( cur < limit ) in skip_literal_string()
364 if ( cur == limit ) in skip_literal_string()
[all …]
Dpsconv.c74 FT_Byte* limit, in PS_Conv_Strtol() argument
82 if ( p == limit || base < 2 || base > 36 ) in PS_Conv_Strtol()
90 if ( p == limit ) in PS_Conv_Strtol()
94 for ( ; p < limit; p++ ) in PS_Conv_Strtol()
121 FT_Byte* limit ) in PS_Conv_ToInt() argument
128 num = PS_Conv_Strtol( cursor, limit, 10 ); in PS_Conv_ToInt()
131 if ( p < limit && *p == '#' ) in PS_Conv_ToInt()
135 return PS_Conv_Strtol( cursor, limit, num ); in PS_Conv_ToInt()
144 FT_Byte* limit, in PS_Conv_ToFixed() argument
153 if ( p == limit ) in PS_Conv_ToFixed()
[all …]
/external/iproute2/netem/
Dmaketable.c24 int limit; in readdoubles() local
29 limit = 2*info.st_size/sizeof(double); /* @@ approximate */ in readdoubles()
31 limit = 10000; in readdoubles()
34 x = calloc(limit, sizeof(double)); in readdoubles()
40 for (i=0; i<limit; ++i){ in readdoubles()
51 arraystats(double *x, int limit, double *mu, double *sigma, double *rho) in arraystats() argument
57 for (i=0; i<limit; ++i){ in arraystats()
93 makedist(double *x, int limit, double mu, double sigma) in makedist() argument
105 for (i=0; i < limit; ++i) { in makedist()
123 cumulativedist(int *table, int limit, int *total) in cumulativedist() argument
[all …]
/external/icu4c/samples/uciter8/
Duit_len8.c120 int32_t i, limit, index; in lenient8IteratorGetIndex() local
124 limit=iter->start; /* count up to the UTF-8 index */ in lenient8IteratorGetIndex()
125 while(i<limit) { in lenient8IteratorGetIndex()
126 L8_NEXT(s, i, limit, c); in lenient8IteratorGetIndex()
135 if(i==iter->limit) { in lenient8IteratorGetIndex()
149 int32_t i, limit, length; in lenient8IteratorGetIndex() local
158 limit=iter->start; in lenient8IteratorGetIndex()
161 while(i<limit) { in lenient8IteratorGetIndex()
162 L8_NEXT(s, i, limit, c); in lenient8IteratorGetIndex()
182 limit=iter->limit; in lenient8IteratorGetIndex()
[all …]
/external/icu4c/tools/gentest/
Dgenres32.c27 incKey(char *key, char *limit) { in incKey() argument
30 while(limit>key) { in incKey()
31 c=*--limit; in incKey()
33 *limit='1'; in incKey()
36 *limit='o'; in incKey()
51 char *limit; in genres32() local
71 for(limit=key; *limit!=0; ++limit) { in genres32()
92 incKey(key, limit); in genres32()
/external/icu4c/test/cintltst/
Dtrietest.c38 UChar32 start, limit; member
49 UChar32 limit; member
57 UChar32 limit; in _testFoldedValue32() local
62 limit=start+0x400; in _testFoldedValue32()
63 while(start<limit) { in _testFoldedValue32()
88 UChar32 limit; in _testFoldedValue16() local
93 limit=start+0x400; in _testFoldedValue16()
94 while(start<limit) { in _testFoldedValue16()
126 _testEnumRange(const void *context, UChar32 start, UChar32 limit, uint32_t value) { in _testEnumRange() argument
131 if(start!=(b-1)->limit || limit!=b->limit || value!=b->value) { in _testEnumRange()
[all …]
/external/icu4c/i18n/
Duni2name.cpp77 offsets.start = offsets.limit; in handleTransliterate()
84 offsets.start = offsets.limit; in handleTransliterate()
89 int32_t limit = offsets.limit; in handleTransliterate() local
95 while (cursor < limit) { in handleTransliterate()
105 limit += len-clen; // change in length in handleTransliterate()
111 offsets.contextLimit += limit - offsets.limit; in handleTransliterate()
112 offsets.limit = limit; in handleTransliterate()
Danytrans.cpp87 int32_t limit; member in ScriptRunIterator
93 ScriptRunIterator(const Replaceable& text, int32_t start, int32_t limit);
119 limit = myStart; in ScriptRunIterator()
128 start = limit; in next()
149 while (limit < textLimit) { in next()
150 ch = text.char32At(limit); // look ahead in next()
159 ++limit; in next()
168 limit += delta; in adjustLimit()
231 int32_t allLimit = pos.limit; in handleTransliterate()
237 if (it.limit <= allStart) continue; in handleTransliterate()
[all …]
Dname2uni.cpp114 offsets.start = offsets.limit; in handleTransliterate()
122 offsets.start = offsets.limit; in handleTransliterate()
130 int32_t limit = offsets.limit; in handleTransliterate() local
139 while (cursor < limit) { in handleTransliterate()
147 ICU_Utility::parsePattern(openPat, text, cursor, limit); in handleTransliterate()
148 if (i >= 0 && i < limit) { in handleTransliterate()
208 limit -= delta; in handleTransliterate()
243 offsets.contextLimit += limit - offsets.limit; in handleTransliterate()
244 offsets.limit = limit; in handleTransliterate()
Dnortrans.cpp103 int32_t limit = offsets.limit; in handleTransliterate() local
104 if(start >= limit) { in handleTransliterate()
145 } while(start < limit && !fNorm2.hasBoundaryBefore(c = text.char32At(start))); in handleTransliterate()
146 if(start == limit && isIncremental && !fNorm2.hasBoundaryAfter(c)) { in handleTransliterate()
164 limit += delta; in handleTransliterate()
166 } while(start < limit); in handleTransliterate()
169 offsets.contextLimit += limit - offsets.limit; in handleTransliterate()
170 offsets.limit = limit; in handleTransliterate()
Dunesctrn.cpp174 int32_t limit = pos.limit; in handleTransliterate() local
177 while (start < limit) { in handleTransliterate()
196 if (s >= limit) { in handleTransliterate()
220 if (s >= limit) { in handleTransliterate()
243 if (s >= limit) { in handleTransliterate()
262 limit -= s - start - str.length(); in handleTransliterate()
275 if (start < limit) { in handleTransliterate()
281 pos.contextLimit += limit - pos.limit; in handleTransliterate()
282 pos.limit = limit; in handleTransliterate()
Dstrmatch.cpp28 int32_t limit, in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
36 theString.extractBetween(start, limit, pattern); in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
85 int32_t limit, in matches() argument
89 if (limit < cursor) { in matches()
95 if (cursor > limit && in matches()
103 subm->matches(text, cursor, limit, incremental); in matches()
118 if (incremental && cursor == limit) { in matches()
129 if (cursor < limit && in matches()
137 subm->matches(text, cursor, limit, incremental); in matches()
215 int32_t limit, in replace() argument
[all …]
/external/qemu/android/utils/
Dintmap.c83 int limit = map->size + 1; in aintMap_getWithDefault() local
88 DUFF4(limit,{ in aintMap_getWithDefault()
127 int index, limit; in aintMap_set() local
133 limit = map->size; in aintMap_set()
135 DUFF4(limit,{ in aintMap_set()
145 map->keys[limit] = key; in aintMap_set()
146 map->values[limit] = value; in aintMap_set()
160 int index, limit; in aintMap_del() local
165 limit = map->size; in aintMap_del()
167 DUFF4(limit,{ in aintMap_del()
[all …]
/external/libvpx/vp8/common/
Dloopfilter_filters.c27 static __inline signed char vp8_filter_mask(signed char limit, signed char flimit, in vp8_filter_mask() argument
31 mask |= (abs(p3 - p2) > limit) * -1; in vp8_filter_mask()
32 mask |= (abs(p2 - p1) > limit) * -1; in vp8_filter_mask()
33 mask |= (abs(p1 - p0) > limit) * -1; in vp8_filter_mask()
34 mask |= (abs(q1 - q0) > limit) * -1; in vp8_filter_mask()
35 mask |= (abs(q2 - q1) > limit) * -1; in vp8_filter_mask()
36 mask |= (abs(q3 - q2) > limit) * -1; in vp8_filter_mask()
37 mask |= (abs(p0 - q0) * 2 + abs(p1 - q1) / 2 > flimit * 2 + limit) * -1; in vp8_filter_mask()
102 const signed char *limit, in vp8_loop_filter_horizontal_edge_c() argument
116 mask = vp8_filter_mask(limit[i], flimit[i], in vp8_loop_filter_horizontal_edge_c()
[all …]
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_2/String/
Dsplit-003.js77 var limit = (split_array.length > string.split(separator).length )
89 string, separator, str_sep, limit, split_array ) { argument
94 "( " + string + " ).split(" + str_sep +", " + limit +
97 string.split(separator, limit).constructor == Array );
102 "( " + string + " ).split(" + str_sep +", " + limit + " ).length",
104 string.split(separator, limit).length );
109 ? split_array.length : string.split(separator, limit).length;
113 "( " + string + " ).split(" + str_sep +", " + limit + " )[" + matches +"]",
115 string.split( separator, limit )[matches] );
/external/icu4c/test/intltest/
Dreptest.cpp90 void extractBetween(int32_t start, int32_t limit, UnicodeString& result) const { in extractBetween() argument
91 chars.extractBetween(start, limit, result); in extractBetween()
121 void fixStyles(int32_t start, int32_t limit, int32_t newLen) { in fixStyles() argument
123 if (start != limit && styles.charAt(start) != NO_STYLE) { in fixStyles()
127 } else if (limit < styles.length()) { in fixStyles()
128 newStyle = styles.charAt(limit); in fixStyles()
142 styles.replaceBetween(start, limit, s); in fixStyles()
145 virtual void handleReplaceBetween(int32_t start, int32_t limit, const UnicodeString& text) { in handleReplaceBetween() argument
147 this->extractBetween(start, limit, s); in handleReplaceBetween()
149 this->chars.replaceBetween(start, limit, text); in handleReplaceBetween()
[all …]
/external/chromium/net/disk_cache/
Dbitmap.cc212 bool Bitmap::FindNextBit(int* index, int limit, bool value) const { in FindNextBit() argument
214 DCHECK_LE(limit, num_bits_); in FindNextBit()
215 DCHECK_LE(*index, limit); in FindNextBit()
217 DCHECK_GE(limit, 0); in FindNextBit()
220 if (bit_index >= limit || limit <= 0) in FindNextBit()
249 const int last_word_index = (limit - 1) >> kLogIntBits; in FindNextBit()
261 const int last_bit_offset = (limit - 1) & (kIntBits - 1); in FindNextBit()
275 int Bitmap::FindBits(int* index, int limit, bool value) const { in FindBits() argument
277 DCHECK_LE(limit, num_bits_); in FindBits()
278 DCHECK_LE(*index, limit); in FindBits()
[all …]
/external/e2fsprogs/lib/ext2fs/
Dblock.c63 int i, flags, limit, offset; in block_iterate_ind() local
66 limit = ctx->fs->blocksize >> 2; in block_iterate_ind()
74 ctx->bcount += limit; in block_iterate_ind()
93 for (i = 0; i < limit; i++, ctx->bcount++, block_nr++) { in block_iterate_ind()
105 for (i = 0; i < limit; i++, ctx->bcount++, block_nr++) { in block_iterate_ind()
140 int i, flags, limit, offset; in block_iterate_dind() local
143 limit = ctx->fs->blocksize >> 2; in block_iterate_dind()
151 ctx->bcount += limit*limit; in block_iterate_dind()
170 for (i = 0; i < limit; i++, block_nr++) { in block_iterate_dind()
182 for (i = 0; i < limit; i++, block_nr++) { in block_iterate_dind()
[all …]

12345678910>>...40