/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/openssl/crypto/lhash/ |
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.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...] |
/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/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);
|
H A D | XString.java | 214 * @param lh A non-null reference to a LexicalHandler. 218 public void dispatchAsComment(org.xml.sax.ext.LexicalHandler lh) argument 224 lh.comment(str.toCharArray(), 0, str.length());
|
H A D | XStringForFSB.java | 192 * @param lh A non-null reference to a LexicalHandler. 196 public void dispatchAsComment(org.xml.sax.ext.LexicalHandler lh) argument 199 fsb().sendSAXComment(lh, m_start, m_length);
|
/external/chromium_org/third_party/boringssl/src/crypto/lhash/ |
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 | 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...] |
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | XMLString.java | 53 * @param lh A non-null reference to a LexicalHandler. 57 public abstract void dispatchAsComment(org.xml.sax.ext.LexicalHandler lh) argument
|
H A D | XMLStringDefault.java | 63 * @param lh A non-null reference to a LexicalHandler. 67 public void dispatchAsComment(org.xml.sax.ext.LexicalHandler lh) argument
|
/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/jhead/ |
H A D | jpgfile.c | 142 int ll,lh, got; local 162 lh = fgetc(infile); 165 itemlen = (lh << 8) | ll; 184 Data[0] = (uchar)lh; 340 int ll,lh, got; local 359 lh = buffer[pos++]; 362 itemlen = (lh << 8) | ll; 379 Data[0] = (uchar)lh;
|
/external/chromium_org/third_party/bintrees/bintrees/ |
H A D | ctrees.c | 536 int lh, rh, max; local 540 lh = height(up[top]->link[upd[top]]); 544 if (lh - rh == 0) 546 if (lh - rh >= 2) { 563 lh = height(up[top]->link[upd[top]]); 565 max = avl_max(lh, rh); 634 int lh = height(up[top]->link[upd[top]]); local 636 int max = avl_max(lh, rh); 642 if (lh - rh == -1) 644 if (lh [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | ucol_tok.h | 121 UColTokListHeader *lh; member in struct:__anon12128
|
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/chromium_org/third_party/skia/tests/ |
H A D | PathOpsAngleIdeas.cpp | 21 static int ConvexHullOverlaps(const SkOpAngle& lh, const SkOpAngle& rh) { argument 22 return lh.convexHullOverlaps(rh); 25 static int EndsIntersect(const SkOpAngle& lh, const SkOpAngle& rh) { argument 26 return lh.endsIntersect(rh);
|
/external/opencv/cxcore/src/ |
H A D | cxsvd.cpp | 398 int lh = nu - i; local 410 icvMatrAXPY3_64f( lh, l-1, hv+1, lduT, uT+1, h ); 420 for( j = 1; j < lh; j++ ) 442 int lh = nv - i; local 453 icvMatrAXPY3_64f( lh, l-1, hv+1, ldvT, vT+1, h ); 463 for( j = 1; j < lh; j++ ) 795 int lh = nu - i; local 807 icvMatrAXPY3_32f( lh, l-1, hv+1, lduT, uT+1, h ); 817 for( j = 1; j < lh; j++ ) 839 int lh local [all...] |
/external/skia/tests/ |
H A D | PathOpsAngleIdeas.cpp | 21 static int ConvexHullOverlaps(const SkOpAngle& lh, const SkOpAngle& rh) { argument 22 return lh.convexHullOverlaps(rh); 25 static int EndsIntersect(const SkOpAngle& lh, const SkOpAngle& rh) { argument 26 return lh.endsIntersect(rh);
|
/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/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
H A D | RenderStyle.cpp | 1160 const Length& lh = inherited->line_height; local 1166 if (multiplier > 1 && lh.isFixed()) 1167 return Length(TextAutosizer::computeAutosizedFontSize(lh.value(), multiplier), Fixed); 1169 return lh; 1176 const Length& lh = lineHeight(); local 1179 if (lh.isNegative()) 1182 if (lh.isPercent()) 1183 return minimumValueForLength(lh, fontSize()); 1185 return lh.value();
|
/external/chromium_org/third_party/skia/third_party/lua/src/ |
H A D | lparser.c | 1108 static void check_conflict (LexState *ls, struct LHS_assign *lh, expdesc *v) { argument 1112 for (; lh; lh = lh->prev) { /* check all previous assignments */ 1113 if (lh->v.k == VINDEXED) { /* assigning to a table? */ 1115 if (lh->v.u.ind.vt == v->k && lh->v.u.ind.t == v->u.info) { 1117 lh->v.u.ind.vt = VLOCAL; 1118 lh->v.u.ind.t = extra; /* previous assignment will use safe copy */ 1121 if (v->k == VLOCAL && lh 1136 assignment(LexState *ls, struct LHS_assign *lh, int nvars) argument [all...] |
/external/chromium_org/v8/src/mips/ |
H A D | assembler-mips.cc | 1686 void Assembler::lh(Register rd, const MemOperand& rs) { function in class:v8::Assembler 1691 GenInstrImmediate(LH, at, rd, 0); // Equiv to lh(rd, MemOperand(at, 0));
|
/external/chromium_org/v8/src/mips64/ |
H A D | assembler-mips64.cc | 1813 void Assembler::lh(Register rd, const MemOperand& rs) { function in class:v8::Assembler 1818 GenInstrImmediate(LH, at, rd, 0); // Equiv to lh(rd, MemOperand(at, 0));
|