/external/freetype/src/pfr/ |
H A D | pfrload.c | 40 FT_Byte* limit ) 42 return pfr_extra_items_parse( pp, limit, NULL, NULL ); 48 FT_Byte* limit, 253 FT_Byte* limit; local 261 limit = p + size; 310 error = pfr_extra_items_skip( &p, limit ); 349 FT_Byte* limit, 449 FT_Byte* limit, 454 FT_PtrDist len = limit - p; 475 FT_Byte* limit, 722 FT_Byte* limit; local [all...] |
/external/freetype/src/sfnt/ |
H A D | ttload.c | 60 TT_Table limit; local 74 limit = entry + face->num_tables; 76 for ( ; entry < limit; entry++ ) 703 /* we arbitrarily limit recursion to avoid stack exhaustion */
|
/external/icu/icu4c/source/common/ |
H A D | dictionarydata.cpp | 43 int32_t UCharsDictionaryMatcher::matches(UText *text, int32_t maxLength, int32_t *lengths, int32_t &count, int32_t limit, int32_t *values) const { argument 54 if (count < limit) { 68 // TODO: why do we have a text limit if the UText knows its length? 107 int32_t BytesDictionaryMatcher::matches(UText *text, int32_t maxLength, int32_t *lengths, int32_t &count, int32_t limit, int32_t *values) const { argument 118 if (count < limit) { 132 // TODO: why do we have a text limit if the UText knows its length?
|
H A D | propname.cpp | 150 // Read and skip the start and limit of this range. 152 int32_t limit=valueMaps[i+1]; local 157 if(property<limit) { 160 i+=(limit-start)*2; // Skip all entries for this range. 174 // Read and skip the start and limit of this range. 176 int32_t limit=valueMaps[valueMapIndex+1]; local 181 if(value<limit) { 184 valueMapIndex+=limit-start; // Skip all entries for this range.
|
H A D | propsvec.c | 30 int32_t columns; /* number of columns, plus two for start & limit values */ 54 columns+=2; /* count range start and limit columns */ 95 int32_t columns, i, start, limit, prevRow; local 98 limit=pv->rows; 133 while(start<limit-1) { 134 i=(start+limit)/2; 137 limit=i; 159 UChar32 limit; local 177 limit=end+1; 181 column+=2; /* skip range start and limit column 337 UChar32 start, limit; local [all...] |
H A D | rbbisetb.cpp | 60 UChar32 limit; local 63 limit=start+0x400; 64 while(start<limit) {
|
H A D | ubidi_props.c | 64 UChar32 c, start, limit; local 85 limit=bdp->indexes[UBIDI_IX_JG_LIMIT]; 88 while(start<limit) { 97 /* add the limit code point if the last value was not 0 (it is now start==limit) */ 98 sa->add(sa->set, limit); 201 UChar32 start, limit; local 204 limit=bdp->indexes[UBIDI_IX_JG_LIMIT]; 205 if(start<=c && c<limit) {
|
H A D | ucmndata.c | 121 int32_t limit=count; local 123 * Remember the shared prefix between s, start and limit, 125 * The shared prefix should get longer as we narrow the [start, limit[ range. 134 * both the start and limit indexes have moved. 135 * At the same time, we find if s is one of the start and (limit-1) names, 142 --limit; 143 if(0==strcmpAfterPrefix(s, names+toc[limit].nameOffset, &limitPrefixLength)) { 144 return limit; 146 while(start<limit) { 147 int32_t i=(start+limit)/ 166 int32_t limit=count; local [all...] |
H A D | unormcmp.cpp | 131 const UChar *start, *s, *limit; member in struct:CmpEquivLevel 150 /* current-level start/limit - s1/s2 as current */ 157 /* stacks of previous-level start/current/limit */ 163 /* case folding buffers, only use current-level start/limit */ 239 limit1=stack1[level1].limit; /*Not uninitialized*/ 262 limit2=stack2[level2].limit; /*Not uninitialized*/ 345 stack1[0].limit=limit1; 390 stack2[0].limit=limit2; 435 stack1[level1].limit=limit1; 476 stack2[level2].limit [all...] |
H A D | util.cpp | 108 int32_t start, int32_t limit, 110 for (int32_t i=start; i<limit; ++i) { 115 while (++i < limit 149 * given a range defined as [start, limit), the call 150 * skipWhitespace(text, start, limit) will advance start past leading 151 * whitespace, whereas the call skipWhitespace(text, limit, start), 152 * will back up limit past trailing whitespace. 154 * @param pos either the start or limit of a range of 'text', to skip 156 * @param stop either the limit or start of a range of 'text', to skip 158 * @return the new start or limit, dependin 227 parsePattern(const UnicodeString& pat, const Replaceable& text, int32_t index, int32_t limit) argument [all...] |
H A D | uvectr32.cpp | 237 void UVector32::setMaxCapacity(int32_t limit) { argument 238 U_ASSERT(limit >= 0); 239 if (limit < 0) { 240 limit = 0; 242 if (limit > (int32_t)(INT32_MAX / sizeof(int32_t))) { // integer overflow check for realloc 246 maxCapacity = limit; 248 // Current capacity is within the new limit.
|
/external/icu/icu4c/source/i18n/ |
H A D | anytrans.cpp | 60 * | | - first run (start, limit) 61 * | | - second run (start, limit) 89 int32_t limit; member in class:ScriptRunIterator 93 * (inclusive) to limit (exclusive). 95 ScriptRunIterator(const Replaceable& text, int32_t start, int32_t limit); 100 * examine scriptCode, start, and limit. 105 * Adjusts internal indices for a change in the limit index of the 106 * given delta. A positive delta means the limit has increased. 121 limit = myStart; 130 start = limit; 259 int32_t limit = pos.limit; local [all...] |
H A D | collationbasedatabuilder.cpp | 62 int32_t limit = list.size(); local 64 int32_t i = (start + limit) / 2; 72 limit = i;
|
H A D | cpdtrans.cpp | 478 * start, but with the limit as modified 489 * value) of transliterator i becomes the limit (input value) 490 * of transliterator i+1. Finally, the overall limit is fixed 494 * (1) contextStart <= start <= limit <= contextLimit <= text.length() 495 * (2) start <= start' <= limit' ;cursor doesn't move back 496 * (3) start <= limit' ;text before cursor unchanged 498 * - limit' is the value of limit after calling handleKT 504 * start, and limit. gl is the globalLimit. contextLimit is 505 * equal to limit throughou 553 int32_t limit = index.limit; local [all...] |
H A D | rbt_rule.cpp | 54 * context limit 345 * be completed by additional text inserted at pos.limit. 412 match = key->matches(text, oText, pos.limit, incremental); 421 if (incremental && keyLimit == pos.limit) { 422 // The key matches just before pos.limit, and there is 425 // pos.limit -- this is a partial match. 456 pos.limit += lenDelta; 458 // Restrict new value of start to [minOText, min(oText, pos.limit)]. 459 pos.start = uprv_max(minOText, uprv_min(uprv_min(oText, pos.limit), newStart)); 532 int32_t limit local [all...] |
H A D | strmatch.cpp | 27 int32_t limit, 35 theString.extractBetween(start, limit, pattern); 90 int32_t limit, 94 if (limit < cursor) { 100 if (cursor > limit && 108 subm->matches(text, cursor, limit, incremental); 115 // forward start, limit, and only if a prior match does not 123 if (incremental && cursor == limit) { 124 // We've reached the context limit without a mismatch and 131 // Don't need the cursor < limit chec 25 StringMatcher(const UnicodeString& theString, int32_t start, int32_t limit, int32_t segmentNum, const TransliterationRuleData& theData) argument 88 matches(const Replaceable& text, int32_t& offset, int32_t limit, UBool incremental) argument 218 replace(Replaceable& text, int32_t start, int32_t limit, int32_t& ) argument [all...] |
H A D | unesctrn.cpp | 175 int32_t limit = pos.limit; local 178 while (start < limit) { 197 if (s >= limit) { 221 if (s >= limit) { 244 if (s >= limit) { 263 limit -= s - start - str.length(); 276 if (start < limit) { 282 pos.contextLimit += limit - pos.limit; [all...] |
/external/icu/icu4c/source/io/ |
H A D | ufmt_cmn.c | 136 const UChar *limit; local 142 limit = buffer + *len; 147 while(ufmt_isdigit(*buffer, radix) && buffer < limit) {
|
/external/icu/icu4c/source/layoutex/ |
H A D | plruns.cpp | 103 le_int32 limit) 111 return fr->add((const LEFontInstance *) font, limit); 199 le_int32 limit) 207 return vr->add(value, limit); 216 * and limit indices. 222 * @param limits is the address of an array of limit indices. This array must remain valid until the 232 * Construct an empty <code>LoIDRuns</code> object. Clients can add locale and limit 235 * @param initialCapacity is the initial size of the locale and limit indices arrays. If 254 * limit index. 256 * @param run is the index into the font and limit indice 101 pl_addFontRun(pl_fontRuns *fontRuns, const le_font *font, le_int32 limit) argument 197 pl_addValueRun(pl_valueRuns *valueRuns, le_int32 value, le_int32 limit) argument 382 add(const char *locale, le_int32 limit) argument 490 pl_addLocaleRun(pl_localeRuns *localeRuns, const char *locale, le_int32 limit) argument [all...] |
/external/icu/icu4c/source/samples/layout/ |
H A D | paragraph.cpp | 57 static void subsetFontRuns(const FontRuns *fontRuns, le_int32 start, le_int32 limit, FontRuns *sub) argument 60 le_int32 endRun = findRun(fontRuns, limit - 1); 69 runLimit = limit - start;
|
/external/icu/icu4c/source/test/intltest/ |
H A D | reptest.cpp | 90 void extractBetween(int32_t start, int32_t limit, UnicodeString& result) const { argument 91 chars.extractBetween(start, limit, result); 121 void fixStyles(int32_t start, int32_t limit, int32_t newLen) { argument 123 if (start != limit && styles.charAt(start) != NO_STYLE) { 127 } else if (limit < styles.length()) { 128 newStyle = styles.charAt(limit); 142 styles.replaceBetween(start, limit, s); 145 virtual void handleReplaceBetween(int32_t start, int32_t limit, const UnicodeString& text) { argument 147 this->extractBetween(start, limit, s); 149 this->chars.replaceBetween(start, limit, tex 154 copy(int32_t start, int32_t limit, int32_t dest) argument [all...] |
/external/icu/icu4c/source/tools/toolutil/ |
H A D | ppucd.cpp | 134 char *limit=strchr(line, 0); local 135 while(line<limit && ((c=*(limit-1))=='\n' || c=='\r')) { --limit; } 137 while(line<limit && ((c=*(limit-1))==' ' || c=='\t')) { --limit; } 138 *limit=0; 139 lineLimit=limit; 140 if(line==limit) { [all...] |
/external/iproute2/netem/ |
H A D | maketable.c | 24 int limit; local 29 limit = 2*info.st_size/sizeof(double); /* @@ approximate */ 31 limit = 10000; 34 x = calloc(limit, sizeof(double)); 40 for (i=0; i<limit; ++i){ 51 arraystats(double *x, int limit, double *mu, double *sigma, double *rho) argument 57 for (i=0; i<limit; ++i){ 93 makedist(double *x, int limit, double mu, double sigma) argument 105 for (i=0; i < limit; ++i) { 123 cumulativedist(int *table, int limit, in argument 160 interpolatetable(short *table, int limit) argument 183 printtable(const short *table, int limit) argument 201 int limit; local [all...] |
/external/libopus/silk/float/ |
H A D | noise_shape_analysis_FLP.c | 55 /* Convert warped filter coefficients to monic pseudo-warped coefficients and limit maximum */ 61 silk_float limit, 90 if( maxabs <= limit ) { 108 chirp = 0.99f - ( 0.8f + 0.1f * iter ) * ( maxabs - limit ) / ( maxabs * ( ind + 1 ) ); 283 /* Convert to monic warped prediction coefficients and limit absolute values */ 57 warped_true2monic_coefs( silk_float *coefs_syn, silk_float *coefs_ana, silk_float lambda, silk_float limit, opus_int order ) argument
|
/external/libphonenumber/java/src/com/android/i18n/phonenumbers/ |
H A D | PhoneNumberMatcher.java | 134 String bracketPairLimit = limit(0, 3); 138 * closing bracket first. We limit the sets of brackets in a phone number to four. 147 String leadLimit = limit(0, 2); 149 String punctuationLimit = limit(0, 4); 157 String blockLimit = limit(0, digitBlockLimit); 162 String digitSequence = "\\p{Nd}" + limit(1, digitBlockLimit); 176 /** Returns a regular expression quantifier with an upper and lower limit. */ 177 private static String limit(int lower, int upper) { method in class:PhoneNumberMatcher
|