| /external/boringssl/src/include/openssl/ |
| lhash_macros.h | 27 #define lh_ASN1_OBJECT_free(lh) \
28 lh_free(CHECKED_CAST(_LHASH *, LHASH_OF(ASN1_OBJECT) *, lh));
30 #define lh_ASN1_OBJECT_num_items(lh) \
31 lh_num_items(CHECKED_CAST(_LHASH *, LHASH_OF(ASN1_OBJECT) *, lh))
33 #define lh_ASN1_OBJECT_retrieve(lh, data) \
35 CHECKED_CAST(_LHASH *, LHASH_OF(ASN1_OBJECT) *, lh), \
38 #define lh_ASN1_OBJECT_insert(lh, old_data, data) \
39 lh_insert(CHECKED_CAST(_LHASH *, LHASH_OF(ASN1_OBJECT) *, lh), \
43 #define lh_ASN1_OBJECT_delete(lh, data) \
45 CHECKED_CAST(_LHASH *, LHASH_OF(ASN1_OBJECT) *, lh), \
[all...] |
| lhash.h | 135 OPENSSL_EXPORT void lh_free(_LHASH *lh);
137 // lh_num_items returns the number of items in |lh|.
138 OPENSSL_EXPORT size_t lh_num_items(const _LHASH *lh);
142 OPENSSL_EXPORT void *lh_retrieve(const _LHASH *lh, const void *data);
149 OPENSSL_EXPORT int lh_insert(_LHASH *lh, void **old_data, void *data);
153 OPENSSL_EXPORT void *lh_delete(_LHASH *lh, const void *data);
157 OPENSSL_EXPORT void lh_doall(_LHASH *lh, void (*func)(void *));
162 OPENSSL_EXPORT void lh_doall_arg(_LHASH *lh, void (*func)(void *, void *),
|
| /external/boringssl/src/crypto/lhash/ |
| lhash.c | 115 void lh_free(_LHASH *lh) {
116 if (lh == NULL) {
120 for (size_t i = 0; i < lh->num_buckets; i++) {
122 for (LHASH_ITEM *n = lh->buckets[i]; n != NULL; n = next) {
128 OPENSSL_free(lh->buckets);
129 OPENSSL_free(lh);
132 size_t lh_num_items(const _LHASH *lh) { return lh->num_items; }
137 // element of |lh->buckets|, otherwise it returns a pointer to the |next|
141 static LHASH_ITEM **get_next_ptr_and_hash(const _LHASH *lh, uint32_t *out_hash
[all...] |
| lhash_test.cc | 44 void operator()(_LHASH *lh) { lh_free(lh); }
58 std::unique_ptr<_LHASH, FreeLHASH> lh(
60 ASSERT_TRUE(lh);
62 // lh is expected to store a canonical instance of each string. dummy_lh
68 EXPECT_EQ(dummy_lh.size(), lh_num_items(lh.get()));
83 lh_doall_arg(lh.get(),
104 void *value = lh_retrieve(lh.get(), key.get());
112 ASSERT_TRUE(lh_insert(lh.get(), &previous, key.get()));
120 void *value = lh_delete(lh.get(), key.get())
[all...] |
| make_macros.sh | 35 #define lh_${type}_free(lh)\\
36 lh_free(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh));
38 #define lh_${type}_num_items(lh)\\
39 lh_num_items(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh))
41 #define lh_${type}_retrieve(lh, data)\\
42 ((${type}*) lh_retrieve(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh), CHECKED_CAST(void*, ${type}*, data)))
44 #define lh_${type}_insert(lh, old_data, data)\\
45 lh_insert(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh), CHECKED_CAST(void**, ${type}**, old_data), CHECKED_CAST(void*, ${type}*, data))
47 #define lh_${type}_delete(lh, data)\\
48 ((${type}*) lh_delete(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh), CHECKED_CAST(void*, ${type}*, data))
[all...] |
| /art/runtime/interpreter/mterp/mips64/ |
| op_goto_16.S | 8 lh rINST, 2(rPC) # rINST <- offset (sign-extended AAAA)
|
| op_goto_32.S | 11 lh rINST, 2(rPC) # rINST <- aaaa (low)
12 lh a1, 4(rPC) # a1 <- AAAA (high)
|
| op_const_wide.S | 3 lh a0, 2(rPC) # a0 <- bbbb (low)
4 lh a1, 4(rPC) # a1 <- BBBB (low middle)
5 lh a2, 6(rPC) # a2 <- hhhh (high middle)
6 lh a3, 8(rPC) # a3 <- HHHH (high)
|
| op_const.S | 3 lh a0, 2(rPC) # a0 <- bbbb (low)
4 lh a1, 4(rPC) # a1 <- BBBB (high)
|
| op_const_string_jumbo.S | 4 lh a0, 2(rPC) # a0 <- bbbb (low)
5 lh a4, 4(rPC) # a4 <- BBBB (high)
|
| op_const_wide_32.S | 3 lh a0, 2(rPC) # a0 <- bbbb (low)
4 lh a1, 4(rPC) # a1 <- BBBB (high)
|
| op_packed_switch.S | 13 lh a0, 2(rPC) # a0 <- bbbb (lo)
14 lh a1, 4(rPC) # a1 <- BBBB (hi)
|
| op_const_16.S | 3 lh a0, 2(rPC) # a0 <- sign-extended BBBB
|
| op_const_high16.S | 3 lh a0, 2(rPC) # a0 <- BBBB
|
| op_const_wide_16.S | 3 lh a0, 2(rPC) # a0 <- sign-extended BBBB
|
| op_const_wide_high16.S | 3 lh a0, 2(rPC) # a0 <- BBBB
|
| op_fill_array_data.S | 4 lh a1, 2(rPC) # a1 <- bbbb (lo)
5 lh a0, 4(rPC) # a0 <- BBBB (hi)
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| ImageFilterKMeans.java | 69 int lh = h; local
70 while (lw > 256 && lh > 256) {
72 lh /= 2;
75 large_bm_ds = Bitmap.createScaledBitmap(bitmap, lw, lh, true);
80 int sh = lh;
91 nativeApplyFilter(bitmap, w, h, large_bm_ds, lw, lh, small_bm_ds, sw, sh, p, mSeed);
|
| /external/xmlrpcpp/src/ |
| XmlRpc.h | 65 static void setLogHandler(XmlRpcLogHandler* lh)
66 { _logHandler = lh; }
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mips/ |
| ld-zero.s | 5 lh $0, 0x12345678($2)
|
| fix-rm7000-2.s | 14 lh $7,0($fp)
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/score/ |
| ls32ls16.d | 24 40: 2039 lh! r0, \[r3\]
25 42: 2039 lh! r0, \[r3\]
26 44: 23f9 lh! r3, \[r15\]
27 46: 23f9 lh! r3, \[r15\]
28 48: 2f89 lh! r15, \[r8\]
29 4a: 2f89 lh! r15, \[r8\]
30 4c: c4888000 lh r4, \[r8, 0\]
31 50: c7338000 lh r25, \[r19, 0\]
32 54: 2579 lh! r5, \[r7\]
33 56: 2579 lh! r5, \[r7\
[all...] |
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/nds32/ |
| ls.s | 3 lh $r0, [$r1 + ($r2 << 1)]
11 lh.bi $r0, [$r1], $r2 << 1
|
| ls.d | 11 0+0004 <[^>]*> lh \$r0, \[\$r1 \+ \(\$r2 << #1\)\]
19 0+0024 <[^>]*> lh.bi \$r0, \[\$r1\], \$r2 << #1
|
| /libcore/ojluni/src/main/java/java/util/ |
| ArraysParallelSortHelpers.java | 175 for (int lh, rh;;) { // split larger, find point in smaller
180 T split = a[(lh = ln >>> 1) + lb];
192 lh = ln;
194 for (int lo = 0; lo < lh; ) {
195 int lm = (lo + lh) >>> 1;
197 lh = lm;
202 Merger<T> m = new Merger<T>(this, a, w, lb + lh, ln - lh,
204 k + lh + rh, g, c);
206 ln = lh;
[all...] |
