Home
last modified time | relevance | path

Searched refs:TREE (Results 1 – 25 of 44) sorted by relevance

12

/external/cldr/tools/scripts/
DplatformDiffTool.sh16 TREE=$1
17 rm -rf ${TREE}.new
18 mkdir ${TREE}.new
19 cp -r ${TREE}/CVS ${TREE}.new/
20 rm -rf ${TREE}.backup1
21 mv ${TREE}.backup0 ${TREE}.backup1
22 mv ${TREE} ${TREE}.backup1
23 mv ${TREE}.new ${TREE}
28 TREE=$1
29 for file in `cd ${COMMON}/${TREE} ; ls ${MATCHIT}*.xml | fgrep -v supplementalData`;
[all …]
DinterimVettingTool.sh15 TREE=$1
16 OUTF=${TREE}/index.html
45 cat ${TREE}/*.idx >> ${OUTF}
46 rm ${TREE}/*.idx
66 TREE=$1
67 rm -rf ${TREE}.backup1
68 mv ${TREE}.backup0 ${TREE}.backup1
69 mv ${TREE} ${TREE}.backup1
74 TREE=$1
75 mkdir ${TREE}
[all …]
DsidewaysCharts.sh9 TREE=$1
10 rm -rf ${TREE}.backup1
11 mv ${TREE}.backup0 ${TREE}.backup1
12 mv ${TREE} ${TREE}.backup1
/external/dtc/tests/
Ddumptrees.c21 #define TREE(name) { &name, #name ".dtb" } macro
22 TREE(test_tree1),
23 TREE(bad_node_char), TREE(bad_node_format), TREE(bad_prop_char),
24 TREE(ovf_size_strings),
25 TREE(truncated_property), TREE(truncated_string),
26 TREE(truncated_memrsv),
Drun_tests.sh335 TREE=$1
338 run_test get_mem_rsv $TREE
339 run_test root_node $TREE
340 run_test find_property $TREE
341 run_test subnode_offset $TREE
342 run_test path_offset $TREE
343 run_test get_name $TREE
344 run_test getprop $TREE
345 run_test get_prop_offset $TREE
346 run_test get_phandle $TREE
[all …]
/external/guava/android/guava-tests/test/com/google/common/graph/
DTraverserTest.java115 private static final SuccessorsFunction<Character> TREE = field in TraverserTest
269 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_breadthFirst_tree()
278 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_breadthFirstIterable_tree()
465 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_depthFirstPreOrder_tree()
474 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_depthFirstPreOrderIterable_tree()
646 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_depthFirstPostOrder_tree()
655 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_depthFirstPostOrderIterable_tree()
810 Traverser<Character> traverser = Traverser.forTree(TREE); in forTree_breadthFirst_tree()
819 Traverser<Character> traverser = Traverser.forTree(TREE); in forTree_breadthFirstIterable_tree()
912 RequestSavingGraph graph = new RequestSavingGraph(TREE); in forTree_breadthFirst_iterableIsLazy()
[all …]
/external/guava/guava-tests/test/com/google/common/graph/
DTraverserTest.java115 private static final SuccessorsFunction<Character> TREE = field in TraverserTest
269 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_breadthFirst_tree()
278 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_breadthFirstIterable_tree()
465 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_depthFirstPreOrder_tree()
474 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_depthFirstPreOrderIterable_tree()
646 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_depthFirstPostOrder_tree()
655 Traverser<Character> traverser = Traverser.forGraph(TREE); in forGraph_depthFirstPostOrderIterable_tree()
810 Traverser<Character> traverser = Traverser.forTree(TREE); in forTree_breadthFirst_tree()
819 Traverser<Character> traverser = Traverser.forTree(TREE); in forTree_breadthFirstIterable_tree()
912 RequestSavingGraph graph = new RequestSavingGraph(TREE); in forTree_breadthFirst_iterableIsLazy()
[all …]
/external/ltp/
Dbuild.sh112 $0 [ -c CC ] [ -o TREE ] [ -p DIR ] [ -t TYPE ]
118 -o TREE Specify build tree, default: $DEFAULT_TREE
128 BUILD TREE:
/external/linux-kselftest/tools/testing/selftests/rcutorture/configs/rcuperf/
DCFLIST1 TREE
/external/mesa3d/src/gallium/drivers/nouveau/codegen/
Dnv50_ir_graph.cpp76 case TREE: return "tree"; in typeStr()
301 case Graph::Edge::TREE: in search()
374 edge->type = Edge::TREE; in classifyDFS()
388 edge->type = Edge::TREE; in classifyDFS()
Dnv50_ir_graph.h46 TREE, enumerator
Dnv50_ir_bb.cpp326 this->cfg.attach(&bb->cfg, Graph::Edge::TREE); in splitCommon()
527 case Graph::Edge::TREE: in printCFGraph()
Dnv50_ir_from_tgsi.cpp3552 bb->cfg.attach(&ifBB->cfg, Graph::Edge::TREE); in handleInstruction()
3566 forkBB->cfg.attach(&elseBB->cfg, Graph::Edge::TREE); in handleInstruction()
3609 bb->cfg.attach(&lbgnBB->cfg, Graph::Edge::TREE); in handleInstruction()
3628 loopBB->cfg.attach(&getBB()->cfg, Graph::Edge::TREE); in handleInstruction()
3658 prog->main->call.attach(&s->f->call, Graph::Edge::TREE); in handleInstruction()
3676 func->call.attach(&s->f->call, Graph::Edge::TREE); in handleInstruction()
3704 bb->cfg.attach(&epilogue->cfg, Graph::Edge::TREE); in handleInstruction()
Dnv50_ir_from_nir.cpp1381 bb->cfg.attach(&exit->cfg, Graph::Edge::TREE); in visit()
1441 bb->cfg.attach(&ifBB->cfg, Graph::Edge::TREE); in visit()
1442 bb->cfg.attach(&elseBB->cfg, Graph::Edge::TREE); in visit()
1501 bb->cfg.attach(&loopBB->cfg, Graph::Edge::TREE); in visit()
1518 loopBB->cfg.attach(&tailBB->cfg, Graph::Edge::TREE); in visit()
Dnv50_ir_ssa.cpp176 nw->attach(nv, Graph::Edge::TREE); in build()
Dnv50_ir_lowering_nvc0.cpp1468 currBB->cfg.attach(&tryLockBB->cfg, Graph::Edge::TREE); in handleSharedATOMNVE4()
1481 tryLockBB->cfg.attach(&setAndUnlockBB->cfg, Graph::Edge::TREE); in handleSharedATOMNVE4()
1536 setAndUnlockBB->cfg.attach(&failLockBB->cfg, Graph::Edge::TREE); in handleSharedATOMNVE4()
1543 failLockBB->cfg.attach(&joinBB->cfg, Graph::Edge::TREE); in handleSharedATOMNVE4()
1563 currBB->cfg.attach(&tryLockAndSetBB->cfg, Graph::Edge::TREE); in handleSharedATOM()
Dnv50_ir_ra.cpp404 if (ei.getType() == Graph::Edge::TREE || in needNewElseBlock()
465 pb->cfg.attach(&pn->cfg, Graph::Edge::TREE); in splitEdges()
/external/llvm-project/polly/cmake/
Dpolly_macros.cmake94 # to 3.8 or higher. If this is done, the TREE version of source_group can
/external/skia/resources/text/
Demoji.txt18 �� JACK-O-LANTERN | �� CHRISTMAS TREE | �� FATHER CHRISTMAS | �� PARTY POPPER
/external/antlr/runtime/ObjC/Framework/
DCommonTreeNodeStream.m212 // TREE REWRITE INTERFACE
/external/antlr/runtime/ActionScript/project/src/org/antlr/runtime/tree/
DCommonTreeNodeStream.as342 // TREE REWRITE INTERFACE
/external/antlr/runtime/Cpp/include/
Dantlr3commontreeadaptor.inl408 dotSpec->append("n0[label=\"EMPTY TREE\"]\n");
/external/lzma/Asm/x86/
DLzmaDecOpt.asm67 ; x1 pbPos / (prob) TREE
/external/libxml2/doc/html/
Dindex.sgml363 <ANCHOR id="LIBXML-TREE-ENABLED-CAPS" href="libxml/libxml-xmlversion.html#LIBXML-TREE-ENABLED-CAPS">
/external/antlr/tool/src/main/antlr3/org/antlr/grammar/v3/
DANTLR.g73 TREE='tree';

12