/external/iproute2/include/linux/ |
H A D | pkt_sched.h | 110 __u32 limit; /* Queue length: bytes for bfifo, packets for pfifo */ member in struct:tc_fifo_qopt 148 __u32 limit; member in struct:tc_plug_qopt 156 __u32 limit; member in struct:tc_tbf_qopt 181 __u32 limit; /* Maximal packets in queue */ member in struct:tc_sfq_qopt 200 __u32 limit; /* HARD maximal flow queue length (bytes) */ member in struct:tc_sfq_qopt_v1 230 __u32 limit; /* HARD maximal queue length (bytes) */ member in struct:tc_red_qopt 265 __u32 limit; /* HARD maximal queue length (bytes) */ member in struct:tc_gred_qopt 305 __u32 limit; /* Hard queue length (packets) */ member in struct:tc_choke_qopt 519 __u32 limit; /* fifo limit (packet member in struct:tc_netem_qopt 623 __u32 limit; /* max SFB queue length */ member in struct:tc_sfb_qopt [all...] |
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/type1/ |
H A D | t1afm.c | 114 FT_Byte* limit; local 124 limit = (FT_Byte*)stream->limit; 129 if ( p + 2 > limit ) 137 if ( p + 0x12 > limit || FT_PEEK_USHORT_LE( p ) < 0x12 ) 149 if ( p + 2 > limit ) 157 if ( p + 4 * fi->NumKernPair > limit ) 173 limit = p + 4 * fi->NumKernPair; 200 for ( ; p < limit ; p += 4 ) 259 stream->limit ); [all...] |
H A D | t1load.c | 613 len = token->limit - token->start; 665 FT_Byte* old_limit = parser->root.limit; 682 parser->root.limit = token->limit; 716 parser->root.limit = token2->limit; 722 loader->parser.root.limit = old_limit; 760 old_limit = parser->root.limit; 779 parser->root.limit = axis_token->limit; 1050 FT_Byte* limit = parser->root.limit; local 1159 FT_Byte* limit = parser->root.limit; local 1504 FT_Byte* limit = parser->root.limit; local 1847 FT_Byte *limit, *start_binary = NULL; local [all...] |
/external/chromium_org/third_party/icu/source/common/ |
H A D | stringtriebuilder.cpp | 81 // Requires start<limit, 82 // and all strings of the [start..limit[ elements must be sorted and 85 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) { argument 92 if(start==limit) { 97 // Now all [start..limit[ strings are longer than unitIndex. 99 int32_t maxUnit=getElementUnit(limit-1, unitIndex); 102 int32_t lastUnitIndex=getLimitOfLinearMatch(start, limit-1, unitIndex); 103 writeNode(start, limit, lastUnitIndex); 117 int32_t length=countElementUnits(start, limit, unitIndex); 119 writeBranchSubNode(start, limit, unitInde 133 writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length) argument 206 makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode) argument 258 makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length, UErrorCode &errorCode) argument [all...] |
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 | dictionarydata.h | 72 int32_t limit, int32_t *values = NULL) const = 0; 85 int32_t limit, int32_t *values = NULL) const; 102 int32_t limit, int32_t *values = NULL) const;
|
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...] |
/external/icu/icu4c/source/common/ |
H A D | stringtriebuilder.cpp | 81 // Requires start<limit, 82 // and all strings of the [start..limit[ elements must be sorted and 85 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) { argument 92 if(start==limit) { 97 // Now all [start..limit[ strings are longer than unitIndex. 99 int32_t maxUnit=getElementUnit(limit-1, unitIndex); 102 int32_t lastUnitIndex=getLimitOfLinearMatch(start, limit-1, unitIndex); 103 writeNode(start, limit, lastUnitIndex); 117 int32_t length=countElementUnits(start, limit, unitIndex); 119 writeBranchSubNode(start, limit, unitInde 133 writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length) argument 206 makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode) argument 258 makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length, UErrorCode &errorCode) argument [all...] |
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 | ubidi.c | 572 pBiDi->paras[pBiDi->paraCount-1].limit=i; 619 pBiDi->paras[pBiDi->paraCount-1].limit=originalLength; 648 if(pindex<pBiDi->paras[i].limit) 676 bd->isoRuns[0].limit=0; 695 bd->isoRuns[0].limit=0; 711 pLastIsoRun->limit=pLastIsoRun->start; 723 lastLimit=pLastIsoRun->limit; 726 pLastIsoRun->start=pLastIsoRun->limit=lastLimit; 746 if(pLastIsoRun->limit>=bd->openingsCount) { /* no available new entry */ 748 if(!getInitialOpeningsMemory(pBiDi, pLastIsoRun->limit * 1093 int32_t paraIndex, start, limit; local 1109 int32_t paraIndex, start, limit; local 1802 setLevelsOutsideIsolates(UBiDi *pBiDi, int32_t start, int32_t limit, UBiDiLevel level) argument 1834 processPropertySeq(UBiDi *pBiDi, LevState *pLevState, uint8_t _prop, int32_t start, int32_t limit) argument 2100 resolveImplicitLevels(UBiDi *pBiDi, int32_t start, int32_t limit, DirProp sor, DirProp eor) argument 2351 start, limit, step, indexOddBit, logicalPos, local 2727 int32_t start, limit=0; local [all...] |
/external/libnl/lib/route/sch/ |
H A D | tbf.c | 74 tbf->qt_limit = opts.limit; 114 nl_dump(p, " rate %.2f%s/s (%.0f%s) limit %.2f%s", 172 opts.limit = tbf->qt_limit; 215 * Set limit of TBF qdisc. 217 * @arg limit New limit in bytes. 220 int rtnl_qdisc_tbf_set_limit(struct rtnl_qdisc *qdisc, int limit) argument 228 tbf->qt_limit = limit; 237 double limit; local 239 limit 266 double limit, limit2; local [all...] |
/external/bison/lib/ |
H A D | obstack.c | 179 h->chunk_limit = chunk->limit 227 h->chunk_limit = chunk->limit 264 new_chunk->limit = h->chunk_limit = (char *) new_chunk + new_size; 329 while (lp != 0 && ((void *) lp >= obj || (void *) (lp)->limit < obj)) 353 while (lp != 0 && ((void *) lp >= obj || (void *) (lp)->limit < obj)) 365 h->chunk_limit = lp->limit; 388 nbytes += lp->limit - (char *) lp;
|
/external/chromium_org/third_party/icu/source/common/unicode/ |
H A D | messagepattern.h | 695 int32_t limit=getPart(start).limitPartIndex; local 696 if(limit<start) { 699 return limit; 746 * Returns the pattern string limit (exclusive-end) index associated with this Part. 748 * @return this part's pattern string limit index, same as getIndex()+getLength(). 858 static int32_t parseArgNumber(const UnicodeString &s, int32_t start, int32_t limit); 860 int32_t parseArgNumber(int32_t start, int32_t limit) { argument 861 return parseArgNumber(msg, start, limit); 867 * @param limit limit inde [all...] |
/external/chromium_org/third_party/lzma_sdk/ |
H A D | LzmaDec.c | 28 #define TREE_DECODE(probs, limit, i) \ 29 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; } 56 #define TREE_DECODE_CHECK(probs, limit, i) \ 57 { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; } 131 static int MY_FAST_CALL LzmaDec_DecodeReal(CLzmaDec *p, SizeT limit, const Byte *bufLimit) argument 262 unsigned limit, offset; local 269 limit = (1 << kLenNumLowBits); 280 limit 428 LzmaDec_WriteRem(CLzmaDec *p, SizeT limit) argument 454 LzmaDec_DecodeReal2(CLzmaDec *p, SizeT limit, const Byte *bufLimit) argument 598 unsigned limit, offset; local [all...] |
/external/chromium_org/third_party/ots/third_party/lzma_sdk/ |
H A D | LzmaDec.c | 29 #define TREE_DECODE(probs, limit, i) \ 30 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; } 57 #define TREE_DECODE_CHECK(probs, limit, i) \ 58 { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; } 132 static int MY_FAST_CALL LzmaDec_DecodeReal(CLzmaDec *p, SizeT limit, const Byte *bufLimit) argument 263 unsigned limit, offset; local 270 limit = (1 << kLenNumLowBits); 281 limit 429 LzmaDec_WriteRem(CLzmaDec *p, SizeT limit) argument 455 LzmaDec_DecodeReal2(CLzmaDec *p, SizeT limit, const Byte *bufLimit) argument 599 unsigned limit, offset; local [all...] |
/external/icu/icu4c/source/common/unicode/ |
H A D | messagepattern.h | 695 int32_t limit=getPart(start).limitPartIndex; local 696 if(limit<start) { 699 return limit; 746 * Returns the pattern string limit (exclusive-end) index associated with this Part. 748 * @return this part's pattern string limit index, same as getIndex()+getLength(). 858 static int32_t parseArgNumber(const UnicodeString &s, int32_t start, int32_t limit); 860 int32_t parseArgNumber(int32_t start, int32_t limit) { argument 861 return parseArgNumber(msg, start, limit); 867 * @param limit limit inde [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | collationrootelements.cpp | 265 int32_t limit = length - 1; local 266 U_ASSERT(elements[limit] >= PRIMARY_SENTINEL); 267 U_ASSERT(p < elements[limit]); 268 while((start + 1) < limit) { 269 // Invariant: elements[start] and elements[limit] are primaries, 270 // and elements[start]<=p<=elements[limit]. 271 int32_t i = (start + limit) / 2; 277 if(j == limit) { break; } 298 // No primary between start and limit. 304 limit [all...] |
/external/iproute2/tc/ |
H A D | q_sfq.c | 30 fprintf(stderr, "Usage: ... sfq [ limit NUMBER ] [ perturb SECS ] [ quantum BYTES ]\n"); 53 fprintf(stderr, "Illegal \"limit\"\n"); 64 } else if (strcmp(*argv, "limit") == 0) { 66 if (get_u32(&opt.v0.limit, *argv, 0)) { 67 fprintf(stderr, "Illegal \"limit\"\n"); 70 if (opt.v0.limit < 2) { 71 fprintf(stderr, "Illegal \"limit\", must be > 1\n"); 101 if (get_u32(&opt.limit, *argv, 0)) { 158 if (!opt.limit) { 167 opt.qth_max = opt.limit / [all...] |
/external/lzma/C/ |
H A D | LzmaDec.c | 28 #define TREE_DECODE(probs, limit, i) \
29 { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
56 #define TREE_DECODE_CHECK(probs, limit, i) \
57 { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
131 static int MY_FAST_CALL LzmaDec_DecodeReal(CLzmaDec *p, SizeT limit, const Byte *bufLimit)
argument 262 unsigned limit, offset;
local 269 limit = (1 << kLenNumLowBits);
280 limit 428 LzmaDec_WriteRem(CLzmaDec *p, SizeT limit) argument 454 LzmaDec_DecodeReal2(CLzmaDec *p, SizeT limit, const Byte *bufLimit) argument 598 unsigned limit, offset; local [all...] |
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/ |
H A D | AbstractBox.java | 175 long size = (content == null ? getContentSize() : content.limit()); 179 size += (deadBytes == null ? 0 : deadBytes.limit()); 225 ByteBuffer bb = ByteBuffer.allocate(l2i(getContentSize() + (deadBytes != null ? deadBytes.limit() : 0))); 242 for (int i = content.limit() - 1, j = bb.limit() - 1; i >= p; i--, j--) { 261 return (content == null ? (getContentSize() + (deadBytes != null ? deadBytes.limit() : 0) + 8) : content.limit()) < 1L << 32;
|
/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/chromium_org/sdch/open-vcdiff/src/ |
H A D | testing.h | 157 // limit. It uses the standard rand() function to produce the value, and makes 163 inline IntType PortableRandomInRange(IntType limit) { argument 166 while (rand_limit < limit) { 175 return static_cast<IntType>(limit * scaled_value);
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | brktrans.cpp | 97 for(boundary = bi->next(); boundary != UBRK_DONE && boundary < offsets.limit; boundary = bi->next()) { 132 offsets.limit += delta; 133 offsets.start = isIncremental ? lastBoundary + delta : offsets.limit;
|
H A D | csrucode.cpp | 80 int32_t limit = (textIn->fRawLength / 4) * 4; local 86 if (limit > 0 && getChar(input, 0) == 0x0000FEFFUL) { 90 for(int32_t i = 0; i < limit; i += 4) {
|
H A D | quant.cpp | 65 int32_t limit, 71 UMatchDegree m = matcher->toMatcher()->matches(text, offset, limit, incremental); 85 if (incremental && offset == limit) { 63 matches(const Replaceable& text, int32_t& offset, int32_t limit, UBool incremental) argument
|