Searched refs:count (Results 276 - 300 of 5577) sorted by relevance

<<11121314151617181920>>

/macosx-10.10/dcerpc-61/dcerpc/ncklib/
H A Dtwr_uxd.c139 ** structure (includes the floor count in the
169 unsigned32 count,
214 twr_t_length = TWR_C_TOWER_FLR_COUNT_SIZE; /* to store floor count */
216 for ( count = 0; count < floor_count; count++ )
219 twr_t_length += related_data_size[count];
263 for ( count = 0; count < floor_count; count
168 unsigned32 count, local
363 unsigned16 count, local
[all...]
/macosx-10.10/libiconv-42/libiconv/lib/
H A Diso2022_kr.h57 int count = 0; local
62 if (n < count+4)
68 s += 4; count += 4;
69 if (n < count+1)
81 s++; count++;
82 if (n < count+1)
88 s++; count++;
89 if (n < count+1)
108 return count+1;
112 if (n < count
147 int count = (state1 == STATE_ASCII ? 1 : 2); local
169 int count = (state2 == STATE2_DESIGNATED_KSC5601 ? 0 : 4) + (state1 == STATE_TWOBYTE ? 0 : 1) + 2; local
[all...]
H A Dutf32.h38 int count = 0; local
43 count += 4;
51 return count;
58 return RET_TOOFEW(count);
67 int count = 0; local
74 r += 4; n -= 4; count += 4;
85 return count+4;
H A Dutf16.h38 int count = 0; local
51 return count+4;
59 return count+2;
61 s += 2; n -= 2; count += 2;
64 return RET_TOOFEW(count);
76 int count = 0; local
81 r += 2; n -= 2; count += 2;
90 return count+2;
103 return count+4;
/macosx-10.10/BerkeleyDB-21/db/test_micro/source/
H A Db_txn.c15 int tabort, ch, i, count; local
17 count = 1000;
25 count = atoi(optarg);
49 /* Start and commit/abort a transaction count times. */
52 for (i = 0; i < count; ++i) {
63 for (i = 0; i < count; ++i) {
76 count, tabort ? "abort" : "commit");
77 TIMER_DISPLAY(count);
87 (void)fprintf(stderr, "usage: b_txn [-a] [-c count]\n");
/macosx-10.10/ICU-531.30/icuSources/layout/
H A DGXLayoutEngine.cpp32 le_int32 GXLayoutEngine::computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, LEGlyphStorage &glyphStorage, LEErrorCode &success) argument
38 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
43 mapCharsToGlyphs(chars, offset, count, FALSE, rightToLeft, glyphStorage, success);
51 return count;
55 void GXLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool /*reverse*/, argument
62 if (chars == NULL || offset < 0 || count < 0) {
H A DGXLayoutEngine2.cpp29 le_int32 GXLayoutEngine2::computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, LEGlyphStorage &glyphStorage, LEErrorCode &success) argument
35 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
40 mapCharsToGlyphs(chars, offset, count, rightToLeft, rightToLeft, glyphStorage, success);
47 return count;
51 void GXLayoutEngine2::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool /*reverse*/, argument
58 if (chars == NULL || offset < 0 || count < 0) {
H A DLEInsertionList.cpp19 le_int32 count; member in struct:InsertionRecord
54 LEGlyphID *LEInsertionList::insert(le_int32 position, le_int32 count, LEErrorCode &success) argument
60 InsertionRecord *insertion = (InsertionRecord *) LE_NEW_ARRAY(char, sizeof(InsertionRecord) + (count - ANY_NUMBER) * sizeof (LEGlyphID));
67 insertion->count = count;
69 growAmount += count - 1;
88 if (callback->applyInsertion(rec->position, rec->count, rec->glyphs)) {
/macosx-10.10/IOKitUser-1050.1.21/kext.subproj/
H A Dmisc_util.c61 CFIndex count, i; local
68 count = CFDataGetLength(aData);
72 if (count) {
74 for (i = 0; i < count && i < maxBytes; i++) {
77 (i > 0 && !((i + 1) % 4) && (i + 1 < count)) ? " " : "");
79 if (maxBytes < count) {
81 CFSTR("...(%u bytes total)"), (unsigned)count);
/macosx-10.10/JavaScriptCore-7600.1.17/tests/mozilla/js1_2/function/
H A DFunction_object.js38 var count = 0; variable
50 testcases[count++] = new TestCase( SECTION, "f.name",
53 testcases[count++] = new TestCase( SECTION, "f.length",
56 testcases[count++] = new TestCase( SECTION, "f.arity",
59 testcases[count++] = new TestCase( SECTION, "f(2,3,4)",
64 testcases[count++] = new TestCase( SECTION, "(new Function()).name",
67 testcases[count++] = new TestCase( SECTION, "(new Function()).toString()",
/macosx-10.10/JavaScriptCore-7600.1.17/tests/mozilla/js1_2/regexp/
H A DRegExp_lastIndex.js39 var count = 0; variable
45 testcases[count++] = new TestCase ( SECTION, "re=/x./g; re.lastIndex=4; re.exec('xyabcdxa')",
49 testcases[count++] = new TestCase ( SECTION, "re.lastIndex",
53 testcases[count++] = new TestCase ( SECTION, "re.exec('xyabcdef')",
57 testcases[count++] = new TestCase ( SECTION, "re.lastIndex",
61 testcases[count++] = new TestCase ( SECTION, "re.exec('xyabcdef')",
66 testcases[count++] = new TestCase ( SECTION, "re.lastIndex=30; re.exec('123xaxbxc456')",
H A DRegExp_lastMatch.js38 var count = 0; variable
43 testcases[count++] = new TestCase ( SECTION, "'foo'.match(/foo/); RegExp.lastMatch",
48 testcases[count++] = new TestCase ( SECTION, "'foo'.match(new RegExp('foo')); RegExp.lastMatch",
53 testcases[count++] = new TestCase ( SECTION, "'xxx'.match(/bar/); RegExp.lastMatch",
58 testcases[count++] = new TestCase ( SECTION, "'xxx'.match(/$/); RegExp.lastMatch",
63 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.match(/^..(cd)[a-z]+/); RegExp.lastMatch",
68 testcases[count++] = new TestCase ( SECTION, "'abcdefgabcdefg'.match(/(a(b(c(d)e)f)g)\\1/); RegExp.lastMatch",
H A DRegExp_lastMatch_as_array.js38 var count = 0; variable
43 testcases[count++] = new TestCase ( SECTION, "'foo'.match(/foo/); RegExp['$&']",
48 testcases[count++] = new TestCase ( SECTION, "'foo'.match(new RegExp('foo')); RegExp['$&']",
53 testcases[count++] = new TestCase ( SECTION, "'xxx'.match(/bar/); RegExp['$&']",
58 testcases[count++] = new TestCase ( SECTION, "'xxx'.match(/$/); RegExp['$&']",
63 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.match(/^..(cd)[a-z]+/); RegExp['$&']",
68 testcases[count++] = new TestCase ( SECTION, "'abcdefgabcdefg'.match(/(a(b(c(d)e)f)g)\\1/); RegExp['$&']",
/macosx-10.10/JavaScriptCore-7600.1.17/tests/mozilla/js1_2/statements/
H A Dbreak.js38 var count = 0; variable
49 testcases[count++] = new TestCase ( SECTION, 'breaking out of "for" loop',
70 testcases[count++] = new TestCase ( SECTION, 'breaking out of a "for" loop with a "label"',
82 testcases[count++] = new TestCase ( SECTION, 'breaking out of a "while" loop',
108 testcases[count++] = new TestCase ( SECTION, 'breaking out of a "while" loop with a "label"',
120 testcases[count++] = new TestCase ( SECTION, 'breaking out of a "do" loop',
145 testcases[count++] = new TestCase ( SECTION, 'breaking out of a "do" loop with a "label"',
/macosx-10.10/WebCore-7600.1.25/dom/
H A DChildNodeList.cpp67 void ChildNodeList::collectionTraverseForward(Node*& current, unsigned count, unsigned& traversedCount) const argument
69 ASSERT(count);
70 for (traversedCount = 0; traversedCount < count; ++traversedCount) {
77 void ChildNodeList::collectionTraverseBackward(Node*& current, unsigned count) const
79 ASSERT(count);
80 for (; count && current ; --count)
/macosx-10.10/vim-55/src/proto/
H A Dsearch.pro14 int searchit __ARGS((win_T *win, buf_T *buf, pos_T *pos, int dir, char_u *pat, long count, int options, int pat_use, linenr_T stop_lnum, proftime_T *tm));
16 int do_search __ARGS((oparg_T *oap, int dirc, char_u *pat, long count, int options, proftime_T *tm));
22 int findsent __ARGS((int dir, long count));
23 int findpar __ARGS((int *pincl, int dir, long count, int what, int both));
25 int fwd_word __ARGS((long count, int bigword, int eol));
26 int bck_word __ARGS((long count, int bigword, int stop));
27 int end_word __ARGS((long count, int bigword, int stop, int empty));
28 int bckend_word __ARGS((long count, int bigword, int eol));
29 int current_word __ARGS((oparg_T *oap, long count, int include, int bigword));
30 int current_sent __ARGS((oparg_T *oap, long count, in
[all...]
/macosx-10.10/Security-57031.1.35/Security/sec/SOSCircle/SecureObjectSync/
H A DSOSDigestVector.c36 #define VECTOR_GROW(vector, count, capacity) \
38 if ((count) > capacity) { \
40 if (capacity < (count)) \
41 capacity = (count); \
46 static void SOSDigestVectorEnsureCapacity(struct SOSDigestVector *dv, size_t count) { argument
47 VECTOR_GROW(dv->digest, count, dv->capacity);
59 SOSDigestVectorEnsureCapacity(dv, dv->count + 1);
60 memcpy(dv->digest[dv->count++], digest, SOSDigestSize);
77 qsort(dv->digest, dv->count, sizeof(*dv->digest), SOSDigestCompare);
91 for (idx = 1; idx < (int)dv->count; id
182 SOSDigestVectorAppendMultipleOrdered(struct SOSDigestVector *dv, size_t count, const uint8_t *digests) argument
[all...]
/macosx-10.10/objc4-646/runtime/
H A Dobjc-opt.mm112 uint32_t count = classes->getClassAndHeader(name, cls, hi);
113 if (count == 1 && ((header_info *)hi)->loaded) {
117 else if (count > 1) {
119 void *clslist[count];
120 void *hilist[count];
122 for (uint32_t i = 0; i < count; i++) {
143 uint32_t count = classes->getClassAndHeader(name, cls, hi);
144 if (count == 0) return nil;
146 Class *result = (Class *)_calloc_internal(count, sizeof(Class));
147 if (count
[all...]
/macosx-10.10/libdispatch-442.1.4/src/
H A Dbenchmark.c30 size_t count; member in struct:__dispatch_benchmark_data_s
41 register size_t cnt = bdata->count;
75 dispatch_benchmark(size_t count, void (^block)(void)) argument
77 return dispatch_benchmark_f(count, block, _dispatch_Block_invoke(block));
87 dispatch_benchmark_f(size_t count, register void *ctxt, argument
92 .count = 10000000ul, // ten million
105 if (slowpath(count == 0)) {
113 } while (i < count);
123 big_denom *= count;
/macosx-10.10/zlib-55/zlib/contrib/dotzlib/DotZLib/
H A DChecksumImpl.cs60 /// <param name="count">The number of bytes from <c>data</c> to use</param>
61 /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
63 /// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
66 public abstract void Update(byte[] data, int offset, int count); argument
129 /// <param name="count">The number of bytes from <c>data</c> to use</param>
130 /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
132 /// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
133 public override void Update(byte[] data, int offset, int count) argument
135 if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
136 if ((offset+count) > dat
184 Update(byte[] data, int offset, int count) argument
[all...]
/macosx-10.10/AppleUSBIrDA-145.2.4/IrDA/Utils/
H A DCDynamicArray.cpp42 {kLogSetSize2, "CDynamicArray: set size, new count="},
51 {kLogRemoveAt, "CDynamicArray: remove at, index=, count="},
149 IrDAErr CDynamicArray::RemoveElementsAt(ArrayIndex index, ArrayIndex count) argument
151 remove count elements starting with index.
164 XTRACE(kLogRemoveAt, index, count);
168 // zero or negative count (count <= 0)
170 // past the end (index + count > fSize)
177 XASSERT(count >= 0);
179 XASSERT((index + count) <
241 InsertElementsBefore(ArrayIndex index, void* elemPtr, ArrayIndex count) argument
296 ReplaceElementsAt(ArrayIndex index, void* elemPtr, ArrayIndex count) argument
[all...]
/macosx-10.10/BerkeleyDB-21/db/test/
H A Drecd023.tcl58 for { set count 2 } { $count < 10 } { incr count } {
59 error_check_good db_del [$db del a$count] 0
61 for { set count 15 } { $count < 100 } { incr count } {
62 error_check_good db_del [$db del a$count] 0
64 for { set count 150 } { $count < 100
[all...]
/macosx-10.10/Heimdal-398.1.2/lib/hcrypto/libtommath/
H A Dpretty.build12 my $count = 0;
17 ++$count;
19 print "Source files to build: $count\nBuilding...\n";
24 printf("Building %3.2f%%, ", (++$i/$count)*100.0);
30 my $tleft = ($count - $i) / $rate;
36 my $cnt = ($i/$count)*30.0;
/macosx-10.10/ICU-531.30/icuSources/i18n/unicode/
H A Ddtfmtsym.h186 * @param count Filled in with length of the array.
190 const UnicodeString* getEras(int32_t& count) const;
195 * @param count Filled in with length of the array.
198 void setEras(const UnicodeString* eras, int32_t count);
203 * @param count Filled in with length of the array.
207 const UnicodeString* getEraNames(int32_t& count) const;
212 * @param count Filled in with length of the array.
215 void setEraNames(const UnicodeString* eraNames, int32_t count);
220 * @param count Filled in with length of the array.
224 const UnicodeString* getNarrowEras(int32_t& count) cons
[all...]
/macosx-10.10/JavaScriptCore-7600.1.17/tests/mozilla/js1_2/operator/
H A Dequality.js38 var count = 0; variable
43 //testcases[count++] = new TestCase( SECTION, "(new String('') == new String('')) ",
46 //testcases[count++] = new TestCase( SECTION, "(new Boolean(true) == new Boolean(true)) ",
49 testcases[count++] = new TestCase( SECTION, "(new String('x') == 'x') ",
52 testcases[count++] = new TestCase( SECTION, "('x' == new String('x')) ",

Completed in 300 milliseconds

<<11121314151617181920>>