Searched refs:limit (Results 51 - 75 of 4587) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/icu/source/samples/uciter8/
H A Duit_len8.c86 * The caller must not modify start and limit because they are used internally.
93 * limit UTF-8 length of the string
120 int32_t i, limit, index; local
124 limit=iter->start; /* count up to the UTF-8 index */
125 while(i<limit) {
126 L8_NEXT(s, i, limit, c);
135 if(i==iter->limit) {
149 int32_t i, limit, length; local
158 limit=iter->start;
161 while(i<limit) {
306 int32_t limit=iter->limit; local
[all...]
/external/icu/icu4c/source/samples/uciter8/
H A Duit_len8.c86 * The caller must not modify start and limit because they are used internally.
93 * limit UTF-8 length of the string
120 int32_t i, limit, index; local
124 limit=iter->start; /* count up to the UTF-8 index */
125 while(i<limit) {
126 L8_NEXT(s, i, limit, c);
135 if(i==iter->limit) {
149 int32_t i, limit, length; local
158 limit=iter->start;
161 while(i<limit) {
306 int32_t limit=iter->limit; local
[all...]
/external/chromium_org/third_party/icu/source/i18n/
H A Dname2uni.cpp116 offsets.start = offsets.limit;
124 offsets.start = offsets.limit;
132 int32_t limit = offsets.limit; local
141 while (cursor < limit) {
149 ICU_Utility::parsePattern(openPat, text, cursor, limit);
150 if (i >= 0 && i < limit) {
163 // loop. If the limit is reached, exit the loop.
210 limit -= delta;
245 offsets.contextLimit += limit
[all...]
H A Dfuncrepl.cpp80 int32_t limit,
85 int32_t len = replacer->toReplacer()->replace(text, start, limit, cursor);
86 limit = start + len;
89 limit = translit->transliterate(text, start, limit);
91 return limit - start;
78 replace(Replaceable& text, int32_t start, int32_t limit, int32_t& cursor) argument
H A Dnultrans.cpp31 offsets.start = offsets.limit;
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/
H A Dpagemap_unittest.cc65 void TestMap(int limit, bool limit_is_below_the_overflow_boundary) { argument
66 RAW_LOG(INFO, "Running test with %d iterations...\n", limit);
70 for (intptr_t i = 0; i < static_cast<intptr_t>(limit); i++) {
75 for (intptr_t i = 0; i < static_cast<intptr_t>(limit); i++) {
82 map.Ensure(0, limit);
83 for (intptr_t i = 0; i < static_cast<intptr_t>(limit); i++) {
87 for (intptr_t i = 0; i < static_cast<intptr_t>(limit); i++) {
95 CHECK_EQ(map.Ensure(limit, limit+1), limit_is_below_the_overflow_boundary);
101 for (intptr_t i = 0; i < static_cast<intptr_t>(limit);
[all...]
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/
H A Dpagemap_unittest.cc65 void TestMap(int limit, bool limit_is_below_the_overflow_boundary) { argument
66 RAW_LOG(INFO, "Running test with %d iterations...\n", limit);
70 for (intptr_t i = 0; i < static_cast<intptr_t>(limit); i++) {
75 for (intptr_t i = 0; i < static_cast<intptr_t>(limit); i++) {
82 map.Ensure(0, limit);
83 for (intptr_t i = 0; i < static_cast<intptr_t>(limit); i++) {
87 for (intptr_t i = 0; i < static_cast<intptr_t>(limit); i++) {
95 CHECK_EQ(map.Ensure(limit, limit+1), limit_is_below_the_overflow_boundary);
101 for (intptr_t i = 0; i < static_cast<intptr_t>(limit);
[all...]
/external/icu/icu4c/source/i18n/
H A Dname2uni.cpp116 offsets.start = offsets.limit;
124 offsets.start = offsets.limit;
132 int32_t limit = offsets.limit; local
141 while (cursor < limit) {
149 ICU_Utility::parsePattern(openPat, text, cursor, limit);
150 if (i >= 0 && i < limit) {
163 // loop. If the limit is reached, exit the loop.
210 limit -= delta;
245 offsets.contextLimit += limit
[all...]
H A Dfuncrepl.cpp80 int32_t limit,
85 int32_t len = replacer->toReplacer()->replace(text, start, limit, cursor);
86 limit = start + len;
89 limit = translit->transliterate(text, start, limit);
91 return limit - start;
78 replace(Replaceable& text, int32_t start, int32_t limit, int32_t& cursor) argument
/external/chromium_org/third_party/leveldatabase/src/util/
H A Dcoding.h37 // [p..limit-1]
38 extern const char* GetVarint32Ptr(const char* p,const char* limit, uint32_t* v);
39 extern const char* GetVarint64Ptr(const char* p,const char* limit, uint64_t* v);
87 const char* limit,
90 const char* limit,
92 if (p < limit) {
99 return GetVarint32PtrFallback(p, limit, value);
89 GetVarint32Ptr(const char* p, const char* limit, uint32_t* value) argument
/external/valgrind/main/none/tests/x86-linux/
H A Dseg_override.c45 unsigned int limit = ent->LimitLow | (ent->HighWord.Bits.LimitHi << 16); local
46 if (ent->HighWord.Bits.Granularity) limit = (limit << 12) | 0xfff;
47 return limit;
75 unsigned int limit; member in struct:modify_ldt_ldt_s
98 ldt_entry.limit = 10;
/external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/
H A DMessageDigestSpiTest.java97 int limit = buf.limit();
99 assertEquals(limit, buf.limit());
100 assertEquals(limit, buf.position());
107 assertEquals(limit, buf.limit());
108 assertEquals(limit, buf.position());
/external/chromium_org/third_party/icu/source/common/
H A Dpatternprops.cpp180 int32_t limit=length; local
181 while(start<limit && isWhiteSpace(s[start])) {
184 if(start<limit) {
185 // There is non-white space at start; we will not move limit below that,
186 // so we need not test start<limit in the loop.
187 while(isWhiteSpace(s[limit-1])) {
188 --limit;
191 length=limit-start;
200 const UChar *limit=s+length; local
205 } while(s<limit);
[all...]
H A Dutil_props.cpp26 int32_t ICU_Utility::parseInteger(const UnicodeString& rule, int32_t& pos, int32_t limit) { argument
32 if (p < limit && rule.charAt(p) == 48 /*0*/) {
33 if (p+1 < limit && (rule.charAt(p+1) == 0x78 /*x*/ || rule.charAt(p+1) == 0x58 /*X*/)) {
44 while (p < limit) {
86 int32_t ICU_Utility::parsePattern(const UnicodeString& rule, int32_t pos, int32_t limit, argument
96 if (pos >= limit) {
109 parsedInts[intCount++] = parseInteger(rule, p, limit);
117 if (pos >= limit) {
/external/icu/icu4c/source/common/
H A Dpatternprops.cpp180 int32_t limit=length; local
181 while(start<limit && isWhiteSpace(s[start])) {
184 if(start<limit) {
185 // There is non-white space at start; we will not move limit below that,
186 // so we need not test start<limit in the loop.
187 while(isWhiteSpace(s[limit-1])) {
188 --limit;
191 length=limit-start;
200 const UChar *limit=s+length; local
205 } while(s<limit);
[all...]
H A Dutil_props.cpp26 int32_t ICU_Utility::parseInteger(const UnicodeString& rule, int32_t& pos, int32_t limit) { argument
32 if (p < limit && rule.charAt(p) == 48 /*0*/) {
33 if (p+1 < limit && (rule.charAt(p+1) == 0x78 /*x*/ || rule.charAt(p+1) == 0x58 /*X*/)) {
44 while (p < limit) {
86 int32_t ICU_Utility::parsePattern(const UnicodeString& rule, int32_t pos, int32_t limit, argument
96 if (pos >= limit) {
109 parsedInts[intCount++] = parseInteger(rule, p, limit);
117 if (pos >= limit) {
/external/valgrind/main/none/tests/x86/
H A Dx87trigOOR.c126 Double limit = 9223372036854775808.0; // 2^63 local
143 try( name, fn, limit * 0.900000 );
144 try( name, fn, limit * 0.999999 );
145 try( name, fn, limit * 1.000000 );
146 try( name, fn, limit * 1.000001 );
147 try( name, fn, limit * 1.100000 );
150 try( name, fn, -limit * 0.900000 );
151 try( name, fn, -limit * 0.999999 );
152 try( name, fn, -limit * 1.000000 );
153 try( name, fn, -limit * 1.00000
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/
H A DDHKeyGeneratorHelper.java23 int limit = dhParams.getL();
25 if (limit != 0)
27 return new BigInteger(limit, random).setBit(limit - 1);
/external/chromium_org/base/
H A Dsys_info_openbsd.cc54 size_t limit; local
55 size_t size = sizeof(limit);
56 if (sysctl(mib, arraysize(mib), &limit, &size, NULL, 0) < 0) {
60 return limit;
/external/chromium_org/content/browser/android/
H A Dcontent_startup_flags.cc34 std::string limit = parsed_command_line->GetSwitchValueASCII( local
37 if (base::StringToInt(limit, &value)) {
43 int limit = std::min(command_line_renderer_limit, local
45 RenderProcessHost::SetMaxRendererProcessCount(limit);
/external/chromium_org/net/disk_cache/blockfile/
H A Dbitmap.h78 // it finds that bit before reaching bit index |limit|, sets *|index| to the
80 // Requires |limit| <= Size().
85 // for (int index = 0 ; map.FindNextBit(&index, limit, value) ; ++index) {
88 bool FindNextBit(int* index, int limit, bool value) const;
90 // Finds the first offset >= *|index| and < |limit| that has its bit set.
92 bool FindNextSetBitBeforeLimit(int* index, int limit) const {
93 return FindNextBit(index, limit, true);
103 // it finds that bit before reaching bit index |limit|, sets *|index| to the
105 // (before reaching |limit|), and returns that count. If no bit is found
106 // returns 0. Requires |limit| <
[all...]
/external/chromium_org/third_party/freetype/include/freetype/
H A Dftautoh.h310 * prop.limit = 14;
337 FT_UInt limit; member in struct:FT_Prop_IncreaseXHeight_
/external/e2fsprogs/lib/ext2fs/
H A Dind_block.c28 int limit = fs->blocksize >> 2; local
41 for (i = 0; i < limit; i++, block_nr++)
52 int limit = fs->blocksize >> 2; local
60 for (i = 0; i < limit; i++, block_nr++)
/external/flac/libFLAC/include/private/
H A Dformat.h39 unsigned FLAC__format_get_max_rice_partition_order_from_blocksize_limited_max_and_predictor_order(unsigned limit, unsigned blocksize, unsigned predictor_order);
/external/freetype/include/
H A Dftautoh.h363 * prop.limit = 14;
390 FT_UInt limit; member in struct:FT_Prop_IncreaseXHeight_

Completed in 4224 milliseconds

1234567891011>>