Searched refs:limit (Results 101 - 125 of 4587) sorted by relevance

1234567891011>>

/external/icu/icu4c/source/tools/toolutil/
H A Duparse.c79 char *start, *limit; local
124 limit=uprv_strchr(start, '#');
125 if(limit!=NULL) {
127 while(limit>start && U_IS_INV_WHITESPACE(*(limit-1))) {
128 --limit;
132 *limit=0;
142 /* set the limit pointer of this field */
143 limit=start;
144 while(*limit!
[all...]
/external/icu/icu4c/source/common/
H A Dnormalizer2impl.cpp46 limit=start+length;
49 if(start==limit) {
64 int32_t length=(int32_t)(limit-start);
75 limit[0]=U16_LEAD(c);
76 limit[1]=U16_TRAIL(c);
77 limit+=2;
80 reorderStart=limit;
101 reorderStart=limit+length;
103 reorderStart=limit+1; // Ok if not a code point boundary.
106 do { *limit
510 decompose(const UChar *src, const UChar *limit, UnicodeString &dest, int32_t destLengthEstimate, UErrorCode &errorCode) const argument
528 decompose(const UChar *src, const UChar *limit, ReorderingBuffer *buffer, UErrorCode &errorCode) const argument
618 decomposeShort(const UChar *src, const UChar *limit, ReorderingBuffer &buffer, UErrorCode &errorCode) const argument
740 decomposeAndAppend(const UChar *src, const UChar *limit, UBool doDecompose, UnicodeString &safeMiddle, ReorderingBuffer &buffer, UErrorCode &errorCode) const argument
912 UChar *limit=buffer.getLimit(); local
1127 compose(const UChar *src, const UChar *limit, UBool onlyContiguous, UBool doCompose, ReorderingBuffer &buffer, UErrorCode &errorCode) const argument
1387 composeQuickCheck(const UChar *src, const UChar *limit, UBool onlyContiguous, UNormalizationCheckResult *pQCResult) const argument
1496 composeAndAppend(const UChar *src, const UChar *limit, UBool doCompose, UBool onlyContiguous, UnicodeString &safeMiddle, ReorderingBuffer &buffer, UErrorCode &errorCode) const argument
1666 makeFCD(const UChar *src, const UChar *limit, ReorderingBuffer *buffer, UErrorCode &errorCode) const argument
1808 makeFCDAndAppend(const UChar *src, const UChar *limit, UBool doMakeFCD, UnicodeString &safeMiddle, ReorderingBuffer &buffer, UErrorCode &errorCode) const argument
[all...]
H A Dappendable.cpp42 const UChar *limit=s+length; local
47 } while(s<limit);
H A Duiter.cpp99 return iter->limit;
124 pos=iter->limit+delta;
135 } else if(pos>iter->limit) {
136 pos=iter->limit;
144 return iter->index<iter->limit;
154 if(iter->index<iter->limit) {
163 if(iter->index<iter->limit) {
190 } else if((int32_t)state<iter->start || iter->limit<(int32_t)state) {
222 iter->limit=iter->length;
252 if((index=iter->index)<iter->limit) {
597 int32_t i, limit, index; local
622 int32_t i, limit, length; local
771 int32_t limit=iter->limit; local
[all...]
/external/okhttp/okio/src/main/java/okio/
H A DBase64.java32 int limit = in.length();
33 for (; limit > 0; limit--) {
34 char c = in.charAt(limit - 1);
41 byte[] out = new byte[(int) (limit * 6L / 8L)];
46 for (int pos = 0; pos < limit; pos++) {
H A DOkio.java43 while (offset >= (s.limit - s.pos)) {
44 offset -= (s.limit - s.pos);
51 int toWrite = (int) Math.min(s.limit - pos, byteCount);
69 int toCopy = (int) Math.min(byteCount, head.limit - head.pos);
76 if (head.pos == head.limit) {
112 int maxToCopy = (int) Math.min(byteCount, Segment.SIZE - tail.limit);
113 int bytesRead = in.read(tail.data, tail.limit, maxToCopy);
115 tail.limit += bytesRead;
/external/chromium_org/third_party/icu/source/common/
H A Dnormalizer2impl.cpp46 limit=start+length;
49 if(start==limit) {
64 int32_t length=(int32_t)(limit-start);
75 limit[0]=U16_LEAD(c);
76 limit[1]=U16_TRAIL(c);
77 limit+=2;
80 reorderStart=limit;
101 reorderStart=limit+length;
103 reorderStart=limit+1; // Ok if not a code point boundary.
106 do { *limit
426 decompose(const UChar *src, const UChar *limit, ReorderingBuffer *buffer, UErrorCode &errorCode) const argument
516 decomposeShort(const UChar *src, const UChar *limit, ReorderingBuffer &buffer, UErrorCode &errorCode) const argument
638 decomposeAndAppend(const UChar *src, const UChar *limit, UBool doDecompose, UnicodeString &safeMiddle, ReorderingBuffer &buffer, UErrorCode &errorCode) const argument
810 UChar *limit=buffer.getLimit(); local
1025 compose(const UChar *src, const UChar *limit, UBool onlyContiguous, UBool doCompose, ReorderingBuffer &buffer, UErrorCode &errorCode) const argument
1285 composeQuickCheck(const UChar *src, const UChar *limit, UBool onlyContiguous, UNormalizationCheckResult *pQCResult) const argument
1394 composeAndAppend(const UChar *src, const UChar *limit, UBool doCompose, UBool onlyContiguous, UnicodeString &safeMiddle, ReorderingBuffer &buffer, UErrorCode &errorCode) const argument
1564 makeFCD(const UChar *src, const UChar *limit, ReorderingBuffer *buffer, UErrorCode &errorCode) const argument
1706 makeFCDAndAppend(const UChar *src, const UChar *limit, UBool doMakeFCD, UnicodeString &safeMiddle, ReorderingBuffer &buffer, UErrorCode &errorCode) const argument
[all...]
H A Dappendable.cpp42 const UChar *limit=s+length; local
47 } while(s<limit);
H A Duiter.cpp99 return iter->limit;
124 pos=iter->limit+delta;
135 } else if(pos>iter->limit) {
136 pos=iter->limit;
144 return iter->index<iter->limit;
154 if(iter->index<iter->limit) {
163 if(iter->index<iter->limit) {
190 } else if((int32_t)state<iter->start || iter->limit<(int32_t)state) {
222 iter->limit=iter->length;
252 if((index=iter->index)<iter->limit) {
597 int32_t i, limit, index; local
622 int32_t i, limit, length; local
771 int32_t limit=iter->limit; local
[all...]
H A Dmessageimpl.h41 * Appends the s[start, limit[ substring to sb, but with only half of the apostrophes
44 static void appendReducedApostrophes(const UnicodeString &s, int32_t start, int32_t limit,
/external/chromium_org/v8/src/
H A Dhydrogen-bch.cc47 DCHECK(data->limit() != NULL);
142 // related to the induction limit, therefore hoisting checks is
197 // Check that the limit is defined in the loop preheader.
198 if (!data->limit()->IsInteger32Constant()) {
199 HBasicBlock* limit_block = data->limit()->block();
205 // Check that the length and limit have compatible representations.
206 if (!(data->limit()->representation().Equals(
208 data->limit()->IsInteger32Constant())) {
235 // We will do the hoisting, but we must see if the limit is "limit" o
255 HValue* limit = data->limit(); local
322 int32_t limit = data->ComputeUpperLimit(decomposition.and_mask, local
[all...]
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/type1/
H A Dt1parse.c233 parser->root.limit = parser->root.cursor + parser->base_len;
336 FT_Byte* limit = cur + parser->base_len; local
344 if ( c == 'e' && cur + 9 < limit ) /* 9 = 5 letters for `eexec' + */
354 if ( cur >= limit )
367 /* set limit to `eexec' + whitespace + 4 characters */
368 parser->root.limit = cur + 10;
371 limit = parser->root.limit;
373 while ( cur < limit )
388 cur = limit;
[all...]
/external/chromium_org/third_party/icu/source/test/cintltst/
H A Dtrietest.c39 UChar32 start, limit; member in struct:SetRange
46 * value is set from the previous boundary's limit to before
47 * this boundary's limit
50 UChar32 limit; member in struct:CheckRange
58 UChar32 limit; local
63 limit=start+0x400;
64 while(start<limit) {
89 UChar32 limit; local
94 limit=start+0x400;
95 while(start<limit) {
127 _testEnumRange(const void *context, UChar32 start, UChar32 limit, uint32_t value) argument
147 const UChar *p, *limit; local
265 UChar32 start, limit; local
459 UChar32 start, limit; local
[all...]
/external/chromium_org/third_party/leveldatabase/src/util/
H A Dcoding.cc113 const char* limit,
116 for (uint32_t shift = 0; shift <= 28 && p < limit; shift += 7) {
133 const char* limit = p + input->size(); local
134 const char* q = GetVarint32Ptr(p, limit, value);
138 *input = Slice(q, limit - q);
143 const char* GetVarint64Ptr(const char* p, const char* limit, uint64_t* value) { argument
145 for (uint32_t shift = 0; shift <= 63 && p < limit; shift += 7) {
162 const char* limit = p + input->size(); local
163 const char* q = GetVarint64Ptr(p, limit, value);
167 *input = Slice(q, limit
112 GetVarint32PtrFallback(const char* p, const char* limit, uint32_t* value) argument
172 GetLengthPrefixedSlice(const char* p, const char* limit, Slice* result) argument
[all...]
/external/icu/icu4c/source/test/cintltst/
H A Dtrietest.c39 UChar32 start, limit; member in struct:SetRange
46 * value is set from the previous boundary's limit to before
47 * this boundary's limit
50 UChar32 limit; member in struct:CheckRange
58 UChar32 limit; local
63 limit=start+0x400;
64 while(start<limit) {
89 UChar32 limit; local
94 limit=start+0x400;
95 while(start<limit) {
127 _testEnumRange(const void *context, UChar32 start, UChar32 limit, uint32_t value) argument
147 const UChar *p, *limit; local
265 UChar32 start, limit; local
459 UChar32 start, limit; local
[all...]
/external/pcre/dist/sljit/
H A DsljitUtils.c203 SLJIT_API_FUNC_ATTRIBUTE struct sljit_stack* SLJIT_CALL sljit_allocate_stack(sljit_uw limit, sljit_uw max_limit) argument
214 if (limit > max_limit || limit < 1)
232 /* Align limit and max_limit. */
246 stack->limit = stack->base;
248 if (sljit_stack_resize(stack, stack->base + limit)) {
269 stack->limit = stack->base + limit;
297 aligned_old_limit = (stack->limit + sljit_page_align) & ~sljit_page_align;
308 stack->limit
[all...]
/external/chromium_org/third_party/freetype/src/cff/
H A Dcffparse.h41 FT_Byte* limit; member in struct:CFF_ParserRec_
62 FT_Byte* limit );
/external/chromium_org/v8/test/mjsunit/compiler/
H A Dosr-regress-max-locals.js30 var limit = %RunningInSimulator() ? 10000 : 10000000; variable
40 for (a1 = 0; a1 < limit; a1++) a2 = 23;
/external/freetype/src/cff/
H A Dcffparse.h41 FT_Byte* limit; member in struct:CFF_ParserRec_
62 FT_Byte* limit );
/external/icu/icu4c/source/layoutex/
H A DRunArrays.cpp60 le_int32 RunArray::add(le_int32 limit) argument
69 limits[index] = limit;
104 le_int32 FontRuns::add(const LEFontInstance *font, le_int32 limit) argument
106 le_int32 index = RunArray::add(limit);
156 le_int32 LocaleRuns::add(const Locale *locale, le_int32 limit) argument
158 le_int32 index = RunArray::add(limit);
208 le_int32 ValueRuns::add(le_int32 value, le_int32 limit) argument
210 le_int32 index = RunArray::add(limit);
/external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/mdat/
H A DMediaDataBox.java99 transfer(fileChannel, startPosition - header.limit(), contentSize + header.limit(), writableByteChannel);
117 fileChannel.position(startPosition - header.limit());
118 ByteBuffer h2 = ByteBuffer.allocate(header.limit());
133 long size = header.limit();
157 if ((cacheEntry != null) && ((chacheEntryOffset + cacheEntry.limit()) >= (offset + length))) {
161 cachedSample.limit(length);
180 cachedSample.limit(length);
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/cff/
H A Dcffparse.h41 FT_Byte* limit; member in struct:CFF_ParserRec_
62 FT_Byte* limit );
/external/zopfli/src/zopfli/
H A Dlz77.c159 Updates the limit value to a smaller one if possible with more limited
163 size_t pos, size_t* limit,
174 (*limit == ZOPFLI_MAX_MATCH || s->lmc->length[lmcpos] <= *limit ||
176 lmcpos, s->lmc->length[lmcpos]) >= *limit));
182 if (*length > *limit) *length = *limit;
186 if (*limit == ZOPFLI_MAX_MATCH && *length >= ZOPFLI_MIN_MATCH) {
196 *limit = s->lmc->length[lmcpos];
207 size_t pos, size_t limit,
162 TryGetFromLongestMatchCache(ZopfliBlockState* s, size_t pos, size_t* limit, unsigned short* sublen, unsigned short* distance, unsigned short* length) argument
206 StoreInLongestMatchCache(ZopfliBlockState* s, size_t pos, size_t limit, const unsigned short* sublen, unsigned short distance, unsigned short length) argument
229 ZopfliFindLongestMatch(ZopfliBlockState* s, const ZopfliHash* h, const unsigned char* array, size_t pos, size_t size, size_t limit, unsigned short* sublen, unsigned short* distance, unsigned short* length) argument
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/io/
H A DStreams.java29 public static byte[] readAllLimited(InputStream inStr, int limit) argument
33 pipeAllLimited(inStr, limit, buf);
70 public static long pipeAllLimited(InputStream inStr, long limit, OutputStream outStr) argument
79 if (total > limit)
/external/chromium_org/base/
H A Dsys_info_posix.cc61 struct rlimit limit; local
62 int result = getrlimit(RLIMIT_DATA, &limit);
67 return limit.rlim_cur == RLIM_INFINITY ? 0 : limit.rlim_cur;

Completed in 674 milliseconds

1234567891011>>