/external/openssl/crypto/lhash/ |
H A D | lhash.c | 110 static void expand(_LHASH *lh); 111 static void contract(_LHASH *lh); 112 static LHASH_NODE **getrn(_LHASH *lh, const void *data, unsigned long *rhash); 157 void lh_free(_LHASH *lh) argument 162 if (lh == NULL) 165 for (i=0; i<lh->num_nodes; i++) 167 n=lh->b[i]; 175 OPENSSL_free(lh->b); 176 OPENSSL_free(lh); 179 void *lh_insert(_LHASH *lh, voi argument 217 lh_delete(_LHASH *lh, const void *data) argument 248 lh_retrieve(_LHASH *lh, const void *data) argument 270 doall_util_fn(_LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func, LHASH_DOALL_ARG_FN_TYPE func_arg, void *arg) argument 300 lh_doall(_LHASH *lh, LHASH_DOALL_FN_TYPE func) argument 305 lh_doall_arg(_LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg) argument 310 expand(_LHASH *lh) argument 366 contract(_LHASH *lh) argument 405 getrn(_LHASH *lh, const void *data, unsigned long *rhash) argument 472 lh_num_items(const _LHASH *lh) argument [all...] |
H A D | lh_stats.c | 73 void lh_stats(LHASH *lh, FILE *out) argument 75 fprintf(out,"num_items = %lu\n",lh->num_items); 76 fprintf(out,"num_nodes = %u\n",lh->num_nodes); 77 fprintf(out,"num_alloc_nodes = %u\n",lh->num_alloc_nodes); 78 fprintf(out,"num_expands = %lu\n",lh->num_expands); 79 fprintf(out,"num_expand_reallocs = %lu\n",lh->num_expand_reallocs); 80 fprintf(out,"num_contracts = %lu\n",lh->num_contracts); 81 fprintf(out,"num_contract_reallocs = %lu\n",lh->num_contract_reallocs); 82 fprintf(out,"num_hash_calls = %lu\n",lh->num_hash_calls); 83 fprintf(out,"num_comp_calls = %lu\n",lh 99 lh_node_stats(LHASH *lh, FILE *out) argument 112 lh_node_usage_stats(LHASH *lh, FILE *out) argument 142 lh_stats(const _LHASH *lh, FILE *fp) argument 154 lh_node_stats(const _LHASH *lh, FILE *fp) argument 166 lh_node_usage_stats(const _LHASH *lh, FILE *fp) argument 180 lh_stats_bio(const _LHASH *lh, BIO *out) argument 208 lh_node_stats_bio(const _LHASH *lh, BIO *out) argument 221 lh_node_usage_stats_bio(const _LHASH *lh, BIO *out) argument [all...] |
H A D | lhash.h | 173 #define lh_error(lh) ((lh)->error) 176 void lh_free(_LHASH *lh); 177 void *lh_insert(_LHASH *lh, void *data); 178 void *lh_delete(_LHASH *lh, const void *data); 179 void *lh_retrieve(_LHASH *lh, const void *data); 180 void lh_doall(_LHASH *lh, LHASH_DOALL_FN_TYPE func); 181 void lh_doall_arg(_LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg); 183 unsigned long lh_num_items(const _LHASH *lh); 186 void lh_stats(const _LHASH *lh, FIL [all...] |
/external/chromium_org/third_party/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 | 155 OPENSSL_EXPORT void lh_free(_LHASH *lh); 157 /* lh_num_items returns the number of items in |lh|. */ 158 OPENSSL_EXPORT size_t lh_num_items(const _LHASH *lh); 162 OPENSSL_EXPORT void *lh_retrieve(const _LHASH *lh, const void *data); 169 OPENSSL_EXPORT int lh_insert(_LHASH *lh, void **old_data, void *data); 173 OPENSSL_EXPORT void *lh_delete(_LHASH *lh, const void *data); 177 OPENSSL_EXPORT void lh_doall(_LHASH *lh, void (*func)(void *)); 182 OPENSSL_EXPORT void lh_doall_arg(_LHASH *lh, void (*func)(void *, void *),
|
/external/chromium_org/third_party/boringssl/src/crypto/lhash/ |
H A D | lhash.c | 100 void lh_free(_LHASH *lh) { argument 104 if (lh == NULL) { 108 for (i = 0; i < lh->num_buckets; i++) { 109 for (n = lh->buckets[i]; n != NULL; n = next) { 115 OPENSSL_free(lh->buckets); 116 OPENSSL_free(lh); 119 size_t lh_num_items(const _LHASH *lh) { return lh->num_items; } argument 124 * element of |lh->buckets|, otherwise it returns a pointer to the |next| 128 static LHASH_ITEM **get_next_ptr_and_hash(const _LHASH *lh, uint32_ argument 148 lh_retrieve(const _LHASH *lh, const void *data) argument 163 lh_rebucket(_LHASH *lh, const size_t new_num_buckets) argument 194 lh_maybe_resize(_LHASH *lh) argument 223 lh_insert(_LHASH *lh, void **old_data, void *data) argument 255 lh_delete(_LHASH *lh, const void *data) argument 276 lh_doall_internal(_LHASH *lh, void (*no_arg_func)(void *), void (*arg_func)(void *, void *), void *arg) argument 311 lh_doall(_LHASH *lh, void (*func)(void *)) argument 315 lh_doall_arg(_LHASH *lh, void (*func)(void *, void *), void *arg) argument [all...] |
H A D | lhash_test.c | 33 static void dummy_lh_free(struct dummy_lhash *lh) { argument 36 for (cur = lh->head; cur != NULL; cur = next) { 43 static size_t dummy_lh_num_items(const struct dummy_lhash *lh) { argument 47 for (cur = lh->head; cur != NULL; cur = cur->next) { 54 static char *dummy_lh_retrieve(struct dummy_lhash *lh, const char *s) { argument 57 for (cur = lh->head; cur != NULL; cur = cur->next) { 66 static int dummy_lh_insert(struct dummy_lhash *lh, char **old_data, char *s) { argument 69 for (cur = lh->head; cur != NULL; cur = cur->next) { 80 node->next = lh->head; 81 lh 85 dummy_lh_delete(struct dummy_lhash *lh, const void *s) argument 117 _LHASH *lh; local [all...] |
H A D | make_macros.sh | 32 #define lh_${type}_free(lh)\\ 33 lh_free(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh)); 35 #define lh_${type}_num_items(lh)\\ 36 lh_num_items(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh)) 38 #define lh_${type}_retrieve(lh, data)\\ 39 ((${type}*) lh_retrieve(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh), CHECKED_CAST(void*, ${type}*, data))) 41 #define lh_${type}_insert(lh, old_data, data)\\ 42 lh_insert(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh), CHECKED_CAST(void**, ${type}**, old_data), CHECKED_CAST(void*, ${type}*, data)) 44 #define lh_${type}_delete(lh, data)\\ 45 ((${type}*) lh_delete(CHECKED_CAST(_LHASH*, LHASH_OF(${type})*, lh), CHECKED_CAS [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | ActiveEdge_Test.cpp | 49 static bool operator_less_than(const UnitTest::ActiveEdge& lh, argument 51 if ((rh.fAbove.fY - lh.fAbove.fY > lh.fBelow.fY - rh.fAbove.fY 52 && lh.fBelow.fY < rh.fBelow.fY) 53 || (lh.fAbove.fY - rh.fAbove.fY < rh.fBelow.fY - lh.fAbove.fY 54 && rh.fBelow.fY < lh.fBelow.fY)) { 55 const SkPoint& check = rh.fBelow.fY <= lh.fBelow.fY 56 && lh.fBelow != rh.fBelow ? rh.fBelow : 58 return (check.fY - lh [all...] |
/external/skia/experimental/Intersection/ |
H A D | ActiveEdge_Test.cpp | 49 static bool operator_less_than(const UnitTest::ActiveEdge& lh, argument 51 if ((rh.fAbove.fY - lh.fAbove.fY > lh.fBelow.fY - rh.fAbove.fY 52 && lh.fBelow.fY < rh.fBelow.fY) 53 || (lh.fAbove.fY - rh.fAbove.fY < rh.fBelow.fY - lh.fAbove.fY 54 && rh.fBelow.fY < lh.fBelow.fY)) { 55 const SkPoint& check = rh.fBelow.fY <= lh.fBelow.fY 56 && lh.fBelow != rh.fBelow ? rh.fBelow : 58 return (check.fY - lh [all...] |
/external/openssl/include/openssl/ |
H A D | lhash.h | 173 #define lh_error(lh) ((lh)->error) 176 void lh_free(_LHASH *lh); 177 void *lh_insert(_LHASH *lh, void *data); 178 void *lh_delete(_LHASH *lh, const void *data); 179 void *lh_retrieve(_LHASH *lh, const void *data); 180 void lh_doall(_LHASH *lh, LHASH_DOALL_FN_TYPE func); 181 void lh_doall_arg(_LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg); 183 unsigned long lh_num_items(const _LHASH *lh); 186 void lh_stats(const _LHASH *lh, FIL [all...] |
H A D | safestack.h | 2433 #define lh_ADDED_OBJ_insert(lh,inst) LHM_lh_insert(ADDED_OBJ,lh,inst) 2434 #define lh_ADDED_OBJ_retrieve(lh,inst) LHM_lh_retrieve(ADDED_OBJ,lh,inst) 2435 #define lh_ADDED_OBJ_delete(lh,inst) LHM_lh_delete(ADDED_OBJ,lh,inst) 2436 #define lh_ADDED_OBJ_doall(lh,fn) LHM_lh_doall(ADDED_OBJ,lh,fn) 2437 #define lh_ADDED_OBJ_doall_arg(lh,fn,arg_type,arg) \ 2438 LHM_lh_doall_arg(ADDED_OBJ,lh,f [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | ucol_bld.cpp | 255 inline int32_t ucol_inv_getPrevious(UColTokenParser *src, UColTokListHeader *lh, uint32_t strength) { 257 uint32_t CE = lh->baseCE; 258 uint32_t SecondCE = lh->baseContCE; 280 lh->previousCE = previousCE; 281 lh->previousContCE = previousContCE; 287 inline int32_t ucol_inv_getNext(UColTokenParser *src, UColTokListHeader *lh, uint32_t strength) { argument 288 uint32_t CE = lh->baseCE; 289 uint32_t SecondCE = lh->baseContCE; 314 lh->nextCE = nextCE; 315 lh 320 ucol_inv_getGapPositions(UColTokenParser *src, UColTokListHeader *lh, UErrorCode *status) argument 737 ucol_initBuffers(UColTokenParser *src, UColTokListHeader *lh, UErrorCode *status) argument 848 ucol_createElements(UColTokenParser *src, tempUCATable *t, UColTokListHeader *lh, UErrorCode *status) argument [all...] |
/external/openssl/crypto/stack/ |
H A D | safestack.h | 2433 #define lh_ADDED_OBJ_insert(lh,inst) LHM_lh_insert(ADDED_OBJ,lh,inst) 2434 #define lh_ADDED_OBJ_retrieve(lh,inst) LHM_lh_retrieve(ADDED_OBJ,lh,inst) 2435 #define lh_ADDED_OBJ_delete(lh,inst) LHM_lh_delete(ADDED_OBJ,lh,inst) 2436 #define lh_ADDED_OBJ_doall(lh,fn) LHM_lh_doall(ADDED_OBJ,lh,fn) 2437 #define lh_ADDED_OBJ_doall_arg(lh,fn,arg_type,arg) \ 2438 LHM_lh_doall_arg(ADDED_OBJ,lh,f [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/chromium_org/third_party/skia/src/pathops/ |
H A D | SkOpAngle.cpp | 60 // return true if lh < this < rh 62 const SkOpAngle& lh = *test; local 63 const SkOpAngle& rh = *lh.fNext; 64 SkASSERT(&lh != &rh); 70 lh.fSegment->debugID(), lh.debugID(), lh.fSectorStart, lh.fSectorEnd, 71 lh.fSegment->t(lh [all...] |
/external/skia/src/pathops/ |
H A D | SkOpAngle.cpp | 60 // return true if lh < this < rh 62 const SkOpAngle& lh = *test; local 63 const SkOpAngle& rh = *lh.fNext; 64 SkASSERT(&lh != &rh); 70 lh.fSegment->debugID(), lh.debugID(), lh.fSectorStart, lh.fSectorEnd, 71 lh.fSegment->t(lh [all...] |
/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/llvm/test/MC/Mips/ |
H A D | micromips-loadstore-instructions.s | 14 # CHECK-EL: lh $2, 8($4) # encoding: [0x44,0x3c,0x08,0x00] 28 # CHECK-EB: lh $2, 8($4) # encoding: [0x3c,0x44,0x00,0x08] 39 lh $2, 8($4)
|
H A D | mips-memory-instructions.s | 29 # CHECK: lh $4, 4($5) # encoding: [0x04,0x00,0xa4,0x84] 39 lh $4, 4($5)
|
/external/openssl/crypto/ec/ |
H A D | ec2_smpl.c | 555 BIGNUM *lh, *y2; local 577 lh = BN_CTX_get(ctx); 578 if (lh == NULL) goto err; 585 if (!BN_GF2m_add(lh, &point->X, &group->a)) goto err; 586 if (!field_mul(group, lh, lh, &point->X, ctx)) goto err; 587 if (!BN_GF2m_add(lh, lh, &point->Y)) goto err; 588 if (!field_mul(group, lh, lh, [all...] |
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsAngleTest.cpp | 194 static int After(const SkOpAngle& lh, const SkOpAngle& rh) { 195 return lh.after(&rh); 198 static int ConvexHullOverlaps(const SkOpAngle& lh, const SkOpAngle& rh) { 199 return lh.convexHullOverlaps(rh); 202 static int Orderable(const SkOpAngle& lh, const SkOpAngle& rh) { 203 return lh.orderable(rh); 206 static int EndsIntersect(const SkOpAngle& lh, const SkOpAngle& rh) { 207 return lh.endsIntersect(rh); 210 static void SetNext(SkOpAngle& lh, SkOpAngle& rh) { 211 lh [all...] |
/external/skia/tests/ |
H A D | PathOpsAngleTest.cpp | 194 static int After(const SkOpAngle& lh, const SkOpAngle& rh) { 195 return lh.after(&rh); 198 static int ConvexHullOverlaps(const SkOpAngle& lh, const SkOpAngle& rh) { 199 return lh.convexHullOverlaps(rh); 202 static int Orderable(const SkOpAngle& lh, const SkOpAngle& rh) { 203 return lh.orderable(rh); 206 static int EndsIntersect(const SkOpAngle& lh, const SkOpAngle& rh) { 207 return lh.endsIntersect(rh); 210 static void SetNext(SkOpAngle& lh, SkOpAngle& rh) { 211 lh [all...] |
/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());
|