/external/boringssl/include/openssl/ |
H A D | 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...] |
H A D | 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/include/openssl/ |
H A D | 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...] |
H A D | 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/ |
H A D | lhash.c | 115 void lh_free(_LHASH *lh) { argument 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; } argument 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_ argument 161 lh_retrieve(const _LHASH *lh, const void *data) argument 176 lh_rebucket(_LHASH *lh, const size_t new_num_buckets) argument 207 lh_maybe_resize(_LHASH *lh) argument 236 lh_insert(_LHASH *lh, void **old_data, void *data) argument 268 lh_delete(_LHASH *lh, const void *data) argument 289 lh_doall_internal(_LHASH *lh, void (*no_arg_func)(void *), void (*arg_func)(void *, void *), void *arg) argument 322 lh_doall(_LHASH *lh, void (*func)(void *)) argument 326 lh_doall_arg(_LHASH *lh, void (*func)(void *, void *), void *arg) argument [all...] |
H A D | lhash_test.cc | 44 void operator()(_LHASH *lh) { lh_free(lh); } argument 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 [all...] |
H A D | 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_CAS [all...] |
/external/xmlrpcpp/src/ |
H A D | XmlRpc.h | 65 static void setLogHandler(XmlRpcLogHandler* lh) argument 66 { _logHandler = lh; }
|
/external/capstone/suite/MC/Mips/ |
H A D | micromips-loadstore-instructions-EB.s.cs | 4 0x3c,0x44,0x00,0x08 = lh $2, 8($4)
|
H A D | micromips-loadstore-instructions.s.cs | 4 0x44,0x3c,0x08,0x00 = lh $2, 8($4)
|
H A D | mips-memory-instructions.s.cs | 12 0x04,0x00,0xa4,0x84 = lh $4, 4($5)
|
/external/ltp/testcases/kdump/lib/ |
H A D | verify.sh | 15 ls -lh "${vmcore}"
|
/external/libjpeg-turbo/simd/ |
H A D | jsimd_mips_dspr2.S | 923 lh t0, 0(s0) // t0 = A3|A2 924 lh t2, 0(s1) // t2 = B3|B2 1379 lh v0, 0(s2) 1380 lh v1, 0(t9) 1381 lh t0, 0(s0) 1382 lh t1, 0(s1) 1417 lh v0, 0(s2) 1418 lh v1, 0(t9) 1419 lh t0, 0(s0) 1420 lh t [all...] |
/external/skia/src/pathops/ |
H A D | SkOpAngle.cpp | 60 // return true if lh < this < rh 62 SkOpAngle* lh = test; local 63 SkOpAngle* rh = lh->fNext; 64 SkASSERT(lh != rh); 66 lh->fPart.fCurve = lh->fOriginalCurvePart; 67 lh->fPart.fCurve.offset(lh->segment()->verb(), fPart.fCurve[0] - lh->fPart.fCurve[0]); 76 lh [all...] |
/external/skqp/src/pathops/ |
H A D | SkOpAngle.cpp | 60 // return true if lh < this < rh 62 SkOpAngle* lh = test; local 63 SkOpAngle* rh = lh->fNext; 64 SkASSERT(lh != rh); 66 lh->fPart.fCurve = lh->fOriginalCurvePart; 67 lh->fPart.fCurve.offset(lh->segment()->verb(), fPart.fCurve[0] - lh->fPart.fCurve[0]); 76 lh [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | DTMTreeWalker.java | 232 LexicalHandler lh = ((LexicalHandler) this.m_contentHandler); 233 data.dispatchAsComment(lh); 303 LexicalHandler lh = isLexH 308 lh.startCDATA(); 316 lh.endCDATA(); 394 LexicalHandler lh = ((LexicalHandler) this.m_contentHandler); 396 lh.endEntity(m_dtm.getNodeName(node));
|
/external/apache-xml/src/main/java/org/apache/xpath/objects/ |
H A D | XStringForChars.java | 151 * @param lh A non-null reference to a LexicalHandler. 155 public void dispatchAsComment(org.xml.sax.ext.LexicalHandler lh) argument 158 lh.comment((char[])m_obj, m_start, m_length);
|
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
H A D | TreeWalker.java | 293 LexicalHandler lh = ((LexicalHandler) this.m_contentHandler); 295 lh.comment(data.toCharArray(), 0, data.length()); 384 LexicalHandler lh = isLexH 389 lh.startCDATA(); 397 lh.endCDATA(); 517 LexicalHandler lh = ((LexicalHandler) this.m_contentHandler); 519 lh.endEntity(eref.getNodeName());
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | TreeWalker.java | 319 LexicalHandler lh = ((LexicalHandler) this.m_contentHandler); 321 lh.comment(data.toCharArray(), 0, data.length()); 389 LexicalHandler lh = isLexH 394 lh.startCDATA(); 402 lh.endCDATA(); 498 LexicalHandler lh = ((LexicalHandler) this.m_contentHandler); 500 lh.endEntity(eref.getNodeName());
|
/external/skia/tests/ |
H A D | PathOpsAngleTest.cpp | 195 static int After(SkOpAngle& lh, SkOpAngle& rh) { 196 return lh.after(&rh); 199 static int AllOnOneSide(SkOpAngle& lh, SkOpAngle& rh) { 200 return lh.allOnOneSide(&rh); 203 static int ConvexHullOverlaps(SkOpAngle& lh, SkOpAngle& rh) { 204 return lh.convexHullOverlaps(&rh); 207 static int Orderable(SkOpAngle& lh, SkOpAngle& rh) { 208 return lh.orderable(&rh); 211 static int EndsIntersect(SkOpAngle& lh, SkOpAngle& rh) { 212 return lh [all...] |
/external/skqp/tests/ |
H A D | PathOpsAngleTest.cpp | 195 static int After(SkOpAngle& lh, SkOpAngle& rh) { 196 return lh.after(&rh); 199 static int AllOnOneSide(SkOpAngle& lh, SkOpAngle& rh) { 200 return lh.allOnOneSide(&rh); 203 static int ConvexHullOverlaps(SkOpAngle& lh, SkOpAngle& rh) { 204 return lh.convexHullOverlaps(&rh); 207 static int Orderable(SkOpAngle& lh, SkOpAngle& rh) { 208 return lh.orderable(&rh); 211 static int EndsIntersect(SkOpAngle& lh, SkOpAngle& rh) { 212 return lh [all...] |
/external/llvm/test/MC/Mips/ |
H A D | mips-memory-instructions.s | 29 # CHECK: lh $4, 4($5) # encoding: [0x04,0x00,0xa4,0x84] 39 lh $4, 4($5)
|
/external/libvpx/libvpx/vpx_dsp/ |
H A D | fastssim.c | 54 int lh; local 57 lh = (_h + 1) >> 1; 63 im_size = lw * (size_t)lh; 71 lh = (lh + 1) >> 1; 78 lh = (_h + 1) >> 1; 83 _ctx->level[l].h = lh; 84 im_size = lw * (size_t)lh; 95 lh = (lh [all...] |
/external/libxcam/modules/ocl/ |
H A D | cl_newwavelet_denoise_handler.cpp | 91 image = buffer->lh[0]; 125 image = buffer->lh[1]; 345 args.push_back (new CLMemArgument (buffer->lh[0])); 346 args.push_back (new CLMemArgument (buffer->lh[1])); 347 args.push_back (new CLMemArgument (buffer->lh[2])); 475 args.push_back (new CLMemArgument (buffer->lh[0])); 479 args.push_back (new CLMemArgument (buffer->lh[2])); 484 args.push_back (new CLMemArgument (buffer->lh[0])); 559 decompBuffer->lh[0] = new CLImage2D (context, cl_desc); 582 decompBuffer->lh[ [all...] |
/external/libxcam/cl_kernel/ |
H A D | kernel_wavelet_haar.cl | 5 * ll/hl/lh/hh: wavelet decomposition image 24 __write_only image2d_t lh, __write_only image2d_t hh, 73 write_imagef(lh, (int2)(x, y), line_lh + 0.5f); 81 * ll/hl/lh/hh: input wavelet transform data as read only 93 __read_only image2d_t lh, __read_only image2d_t hh, 110 line_lh = read_imagef(lh, sampler, (int2)(x, y)) - 0.5f;
|