| /external/openssl/crypto/x509v3/ |
| v3_ncons.c | 71 STACK_OF(GENERAL_SUBTREE) *trees,
170 STACK_OF(GENERAL_SUBTREE) *trees,
175 if (sk_GENERAL_SUBTREE_num(trees) > 0)
177 for(i = 0; i < sk_GENERAL_SUBTREE_num(trees); i++)
179 tree = sk_GENERAL_SUBTREE_value(trees, i);
185 tree = sk_GENERAL_SUBTREE_value(trees, i);
|
| /external/zlib/contrib/delphi/ |
| zlibd32.mak | 22 OBJ2 = inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
24 OBJP2 = +inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
54 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| ZLib.pas | 208 {$L trees.obj}
|
| /external/zlib/contrib/pascal/ |
| zlibd32.mak | 22 OBJ2 = inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
24 OBJP2 = +inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
54 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| zlibpas.pas | 153 {$L trees.obj}
|
| /external/libpng/contrib/pngminim/decoder/ |
| makefile | 20 trees$(O) uncompr$(O) zutil$(O)
|
| /external/libpng/contrib/pngminim/encoder/ |
| makefile | 19 trees$(O) uncompr$(O) zutil$(O)
|
| /external/srec/seti/sltsEngine/include/ |
| lts_seq_internal.h | 96 /*RT tree is the compact representations of the trees
135 RT_LTREE **trees; member in struct:LTS
|
| /external/zlib/ |
| Android.mk | 15 trees.c \
|
| make_vms.com | 87 $ CALL MAKE trees.OBJ "CC ''CCOPT' trees" -
88 trees.c deflate.h zutil.h zlib.h zconf.h
280 deflate.obj, trees.obj, zutil.obj, inflate.obj, \
316 trees.obj : trees.c deflate.h zutil.h zlib.h zconf.h
|
| /external/libpng/contrib/pngminim/preader/ |
| makefile | 36 trees$(O) uncompr$(O) zutil$(O)
|
| /external/srec/seti/sltsEngine/src/ |
| run_seq_lts.c | 76 static SWIsltsResult free_trees(RT_LTREE **trees, int num_letters, LQUESTION **questions, int num_questions, LM *lm);
504 RT_LTREE ** trees = NULL; local
538 *ptrees = trees = (RT_LTREE**) lts_alloc(*num_letters, sizeof(RT_LTREE*));
539 if (trees == NULL) {
547 trees[let] = tree = (RT_LTREE*) lts_alloc(1, sizeof(RT_LTREE));
603 free_trees(trees, *num_letters, *pquestions, *num_questions, *plm);
613 /* deallocate trees */
614 static SWIsltsResult free_trees(RT_LTREE **trees, int num_letters,
628 if (trees) {
630 if (trees[i])
[all...] |
| /external/v8/test/mjsunit/ |
| deep-recursion.js | 29 * @fileoverview Check that flattening deep trees of cons strings does not
|
| /external/v8/test/mjsunit/compiler/ |
| simple-bailouts.js | 42 // trees with <= 4 leaves.
|
| /external/v8/benchmarks/ |
| splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
272 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
| earley-boyer.js | [all...] |
| /external/webkit/SunSpider/tests/v8-v4/ |
| v8-splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
267 * "Self-adjusting Binary Search Trees" by Sleator and Tarjan
|
| v8-earley-boyer.js | [all...] |
| /external/blktrace/btt/doc/ |
| btt.tex | 818 [ -P <output name> | --per-io-trees=<output name> ]
[all...] |
| /external/bison/tests/ |
| testsuite | 456 145;glr-regression.at:337;Duplicate representation of merged trees;;
[all...] |
