Searched refs:count (Results 226 - 250 of 7815) sorted by relevance

1234567891011>>

/external/v8/test/cctest/
H A Dtest-platform-linux.cc27 int count = 0; local
31 count = busy_lock_counter;
34 } while (count % 2 == rem && count < kLockCounterLimit);
35 if (count >= kLockCounterLimit) break;
37 CHECK_EQ(count, busy_lock_counter);
38 CHECK(last_count == -1 || count == last_count + 1);
40 last_count = count;
H A Dtest-platform-nullos.cc27 int count = 0; local
31 count = busy_lock_counter;
34 } while (count % 2 == rem && count < kLockCounterLimit);
35 if (count >= kLockCounterLimit) break;
37 CHECK_EQ(count, busy_lock_counter);
38 CHECK(last_count == -1 || count == last_count + 1);
40 last_count = count;
/external/wpa_supplicant_8/hostapd/src/crypto/
H A Dsha1-pbkdf2.c15 size_t ssid_len, int iterations, unsigned int count,
36 count_buf[0] = (count >> 24) & 0xff;
37 count_buf[1] = (count >> 16) & 0xff;
38 count_buf[2] = (count >> 8) & 0xff;
39 count_buf[3] = count & 0xff;
75 unsigned int count = 0; local
81 count++;
83 count, digest))
14 pbkdf2_sha1_f(const char *passphrase, const u8 *ssid, size_t ssid_len, int iterations, unsigned int count, u8 *digest) argument
/external/wpa_supplicant_8/src/crypto/
H A Dsha1-pbkdf2.c15 size_t ssid_len, int iterations, unsigned int count,
36 count_buf[0] = (count >> 24) & 0xff;
37 count_buf[1] = (count >> 16) & 0xff;
38 count_buf[2] = (count >> 8) & 0xff;
39 count_buf[3] = count & 0xff;
75 unsigned int count = 0; local
81 count++;
83 count, digest))
14 pbkdf2_sha1_f(const char *passphrase, const u8 *ssid, size_t ssid_len, int iterations, unsigned int count, u8 *digest) argument
/external/wpa_supplicant_8/wpa_supplicant/src/crypto/
H A Dsha1-pbkdf2.c15 size_t ssid_len, int iterations, unsigned int count,
36 count_buf[0] = (count >> 24) & 0xff;
37 count_buf[1] = (count >> 16) & 0xff;
38 count_buf[2] = (count >> 8) & 0xff;
39 count_buf[3] = count & 0xff;
75 unsigned int count = 0; local
81 count++;
83 count, digest))
14 pbkdf2_sha1_f(const char *passphrase, const u8 *ssid, size_t ssid_len, int iterations, unsigned int count, u8 *digest) argument
/external/chromium_org/third_party/skia/include/core/
H A DSkTSearch.h39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) argument
41 SkASSERT(count >= 0);
42 if (count <= 0) {
46 SkASSERT(base != NULL); // base may be NULL if count is zero
49 int hi = count - 1;
78 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { argument
80 return SkTSearch(base, count, target, elemSize, functor);
90 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { argument
92 return SkTSearch(base, count, target, elemSize, functor);
103 int SkTSearch(T* base[], int count, argument
[all...]
/external/chromium_org/v8/test/mjsunit/
H A Delements-transition-hoisting.js52 var count = 3;
55 } while (--count > 0);
76 var count = 3;
81 } while (--count > 0);
102 var count = 3;
112 } while (--count > 0);
134 var count = 3;
139 } while (--count > 0);
158 var count = 3;
164 } while (--count >
[all...]
/external/skia/include/core/
H A DSkTSearch.h39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) argument
41 SkASSERT(count >= 0);
42 if (count <= 0) {
46 SkASSERT(base != NULL); // base may be NULL if count is zero
49 int hi = count - 1;
78 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { argument
80 return SkTSearch(base, count, target, elemSize, functor);
90 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { argument
92 return SkTSearch(base, count, target, elemSize, functor);
103 int SkTSearch(T* base[], int count, argument
[all...]
/external/v8/test/mjsunit/
H A Delements-transition-hoisting.js54 var count = 3;
57 } while (--count > 0);
74 var count = 3;
79 } while (--count > 0);
96 var count = 3;
106 } while (--count > 0);
123 var count = 3;
128 } while (--count > 0);
143 var count = 3;
149 } while (--count >
[all...]
/external/webrtc/src/system_wrappers/source/
H A Dcritical_section_unittest.cc71 // Waits a number of cycles for the count to reach a given value.
73 bool WaitForCount(int target, ProtectedCount* count) { argument
78 while (count->Count() < target && loop_counter < 100*target) {
83 return (count->Count() >= target);
102 ProtectedCount count(crit_sect);
104 &LockUnlockThenStopRunFunction, &count);
110 // the lock, even though count.Count() locks and unlocks the critical section
112 // Thus, the thread should not be able to increment the count
113 ASSERT_EQ(0, count.Count());
115 EXPECT_TRUE(WaitForCount(1, &count));
[all...]
/external/chromium/base/
H A Dstring_util_posix.h28 inline int strncasecmp(const char* string1, const char* string2, size_t count) { argument
29 return ::strncasecmp(string1, string2, count);
37 inline int strncmp16(const char16* s1, const char16* s2, size_t count) { argument
39 return ::wcsncmp(s1, s2, count);
41 return c16memcmp(s1, s2, count);
/external/chromium_org/base/strings/
H A Dstring_util_posix.h28 inline int strncasecmp(const char* string1, const char* string2, size_t count) { argument
29 return ::strncasecmp(string1, string2, count);
37 inline int strncmp16(const char16* s1, const char16* s2, size_t count) { argument
39 return ::wcsncmp(s1, s2, count);
41 return c16memcmp(s1, s2, count);
/external/clang/test/CXX/temp/temp.fct.spec/temp.arg.explicit/
H A Dp3-0x.cpp5 template<typename ...> struct count;
8 struct count<Head, Tail...> { struct in namespace:ParameterPacksWithFunctions
9 static const unsigned value = 1 + count<Tail...>::value;
13 struct count<> { struct in namespace:ParameterPacksWithFunctions
20 unsigned_c<count<Types...>::value> f();
/external/eigen/bench/btl/generic_bench/timers/
H A DSTL_timer.hh36 count = 0;
50 ++count;
53 iterations.push_back(count);
55 count = 0;
72 unsigned long count; member in class:STL_Timer
/external/icu4c/common/
H A Duvectr32.h61 int32_t count; member in class:UVector32
222 return (index >= 0 && count > 0 && count - index > 0) ? elements[index] : 0;
227 if (ensureCapacity(count + 1, status)) {
228 elements[count] = elem;
229 count++;
234 if (ensureCapacity(count+size, status) == FALSE) {
237 int32_t *rp = elements+count;
238 count += size;
243 U_ASSERT(count >
[all...]
/external/chromium_org/content/test/data/indexeddb/
H A Dcursor_prefetch.js54 count = 0;
58 shouldBe("count", "kNumberOfItems");
62 if (cursor.key !== count)
63 shouldBe("cursor.key", "count");
64 if (cursor.value !== count)
65 shouldBe("cursor.value", "count");
67 ++count;
93 count = 0;
99 debug("Finished iterating after " + count + " steps.");
108 ++count;
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkBlitRow_D32.cpp19 int count, U8CPU alpha) {
21 memcpy(dst, src, count * sizeof(SkPMColor));
26 int count, U8CPU alpha) {
28 if (count > 0) {
33 if (count & 1) {
36 count -= 1;
39 const SkPMColor* SK_RESTRICT srcEnd = src + count;
51 } while (--count > 0);
58 int count, U8CPU alpha) {
60 if (count >
17 S32_Opaque_BlitRow32(SkPMColor* SK_RESTRICT dst, const SkPMColor* SK_RESTRICT src, int count, U8CPU alpha) argument
24 S32_Blend_BlitRow32(SkPMColor* SK_RESTRICT dst, const SkPMColor* SK_RESTRICT src, int count, U8CPU alpha) argument
56 S32A_Opaque_BlitRow32(SkPMColor* SK_RESTRICT dst, const SkPMColor* SK_RESTRICT src, int count, U8CPU alpha) argument
85 S32A_Blend_BlitRow32(SkPMColor* SK_RESTRICT dst, const SkPMColor* SK_RESTRICT src, int count, U8CPU alpha) argument
175 assignLoop(SkPMColor dst[], SkPMColor color, int count) argument
[all...]
H A DSkTRefArray.h25 static SkTRefArray<T>* Alloc(int count) { argument
26 // space for us, and our [count] elements
27 size_t size = sizeof(SkTRefArray<T>) + count * sizeof(T);
31 obj->fCount = count;
37 * Return a new array with 'count' elements, initialized to their default
41 static SkTRefArray<T>* Create(int count) { argument
42 SkTRefArray<T>* obj = Alloc(count);
44 for (int i = 0; i < count; ++i) {
51 * Return a new array with 'count' elements, initialized from the provided
55 static SkTRefArray<T>* Create(const T src[], int count) { argument
64 int count() const { return fCount; } function in class:SkTRefArray
[all...]
/external/skia/bench/
H A DInterpBench.cpp26 virtual void performTest(int16_t dst[], float x, float dx, int count) = 0;
51 virtual void performTest(int16_t dst[], float fx, float dx, int count) SK_OVERRIDE {
54 for (int i = 0; i < count; i += 4) {
55 dst[i + 0] = TILE(curr, count); curr += step;
56 dst[i + 1] = TILE(curr, count); curr += step;
57 dst[i + 2] = TILE(curr, count); curr += step;
58 dst[i + 3] = TILE(curr, count); curr += step;
70 virtual void performTest(int16_t dst[], float fx, float dx, int count) SK_OVERRIDE {
74 for (int i = 0; i < count; i += 4) {
76 dst[i + 0] = TILE(tmp, count);
[all...]
/external/skia/src/core/
H A DSkBlitRow_D32.cpp19 int count, U8CPU alpha) {
21 memcpy(dst, src, count * sizeof(SkPMColor));
26 int count, U8CPU alpha) {
28 if (count > 0) {
33 if (count & 1) {
36 count -= 1;
39 const SkPMColor* SK_RESTRICT srcEnd = src + count;
51 } while (--count > 0);
58 int count, U8CPU alpha) {
60 if (count >
17 S32_Opaque_BlitRow32(SkPMColor* SK_RESTRICT dst, const SkPMColor* SK_RESTRICT src, int count, U8CPU alpha) argument
24 S32_Blend_BlitRow32(SkPMColor* SK_RESTRICT dst, const SkPMColor* SK_RESTRICT src, int count, U8CPU alpha) argument
56 S32A_Opaque_BlitRow32(SkPMColor* SK_RESTRICT dst, const SkPMColor* SK_RESTRICT src, int count, U8CPU alpha) argument
85 S32A_Blend_BlitRow32(SkPMColor* SK_RESTRICT dst, const SkPMColor* SK_RESTRICT src, int count, U8CPU alpha) argument
175 assignLoop(SkPMColor dst[], SkPMColor color, int count) argument
[all...]
/external/chromium/base/third_party/icu/
H A Dicu_utf.cc139 uint8 count=CBU8_COUNT_TRAIL_BYTES(c); local
140 if((i)+count<=(length)) {
143 CBU8_MASK_LEAD_BYTE((c), count);
144 /* count==0 for illegally leading trail bytes and the illegal bytes 0xfe and 0xff */
145 switch(count) {
149 /* count>=4 is always illegal: no more than 3 trail bytes in Unicode's UTF-8 */
182 * that needs count bytes so that UTF8_GET_CHAR_SAFE() works right.
192 /* illegal is also set if count>=4 */
193 if(illegal || (c)<utf8_minLegal[count] || (CBU_IS_SURROGATE(c) && strict!=-2)) {
195 uint8 errorCount=count;
[all...]
/external/chromium_org/base/third_party/icu/
H A Dicu_utf.cc139 uint8 count=CBU8_COUNT_TRAIL_BYTES(c); local
140 if((i)+count<=(length)) {
143 CBU8_MASK_LEAD_BYTE((c), count);
144 /* count==0 for illegally leading trail bytes and the illegal bytes 0xfe and 0xff */
145 switch(count) {
149 /* count>=4 is always illegal: no more than 3 trail bytes in Unicode's UTF-8 */
182 * that needs count bytes so that UTF8_GET_CHAR_SAFE() works right.
192 /* illegal is also set if count>=4 */
193 if(illegal || (c)<utf8_minLegal[count] || (CBU_IS_SURROGATE(c) && strict!=-2)) {
195 uint8 errorCount=count;
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
H A Dlp_state_vertex.c42 unsigned count,
46 assert(count <= PIPE_MAX_ATTRIBS);
49 velems->count = count;
50 memcpy(velems->velem, attribs, sizeof(*attribs) * count);
67 draw_set_vertex_elements(llvmpipe->draw, lp_velems->count, lp_velems->velem);
78 unsigned count,
83 assert(count <= PIPE_MAX_ATTRIBS);
87 buffers, count);
91 draw_set_vertex_buffers(llvmpipe->draw, count, buffer
41 llvmpipe_create_vertex_elements_state(struct pipe_context *pipe, unsigned count, const struct pipe_vertex_element *attribs) argument
77 llvmpipe_set_vertex_buffers(struct pipe_context *pipe, unsigned count, const struct pipe_vertex_buffer *buffers) argument
[all...]
/external/chromium_org/third_party/skia/src/gpu/gl/
H A DGrGLSL.h61 static inline const char* GrGLSLOnesVecf(int count) { argument
64 GrAssert(count >= 1 && count < (int)GR_ARRAY_COUNT(kONESVEC));
65 return kONESVEC[count];
68 static inline const char* GrGLSLZerosVecf(int count) { argument
71 GrAssert(count >= 1 && count < (int)GR_ARRAY_COUNT(kZEROSVEC));
72 return kZEROSVEC[count];
142 const char* GrGLSLVectorHomogCoord(int count);
147 const char* GrGLSLVectorNonhomogCoords(int count);
[all...]
/external/dhcpcd/dhcpcd-hooks/
H A D20-dns.conf17 count=1
22 count=1
24 setprop dhcp.${intf}.dns${count} ${dnsaddr}
25 count=$(($count + 1))

Completed in 723 milliseconds

1234567891011>>