| /external/srec/tools/test_g2g/ |
| test_g2g.c | 368 tree_head topo; local
370 topo.nnodes = 0;
371 traverse_tree(node, &topo, num_terminal_nodes);
372 return topo.nnodes;
379 tree_head topo; local
386 topo.low_pel_no = 32567;
387 topo.high_pel_no = 0;
388 traverse_tree(a->pdata[i].model_nodes, &topo, &num_hmms_in_phoneme);
390 topo.low_pel_no, topo.high_pel_no)
517 tree_head topo; local
[all...] |
| /ndk/build/core/ |
| definitions-graph.mk | 40 -ndk-topo-debug = $(info $1)
42 -ndk-topo-debug = $(empty)
280 -ndk-mod-topo-zero-incoming = \
284 -ndk-mod-topo-increment-incoming = \
288 -ndk-mod-topo-decrement-incoming = \
292 -ndk-mod-topo-has-incoming = $(_ndk_mod_topo_incoming.$1)
297 -ndk-mod-topo-find-first-zero-incoming = $(firstword $(call -ndk-mod-filter-out,$1,-ndk-mod-topo-has-incoming))
300 -ndk-mod-topo-dump-count = \
318 -ndk-mod-get-topo-list = $(strip
[all...] |
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 116 static void addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency);
117 static pANTLR3_UINT32 sortToArray (pANTLR3_TOPO topo);
118 static void sortVector (pANTLR3_TOPO topo, pANTLR3_VECTOR v);
119 static void freeTopo (pANTLR3_TOPO topo);
2286 pANTLR3_TOPO topo = (pANTLR3_TOPO)ANTLR3_MALLOC(sizeof(ANTLR3_TOPO)); local
[all...] |
| /external/srec/srec/clib/ |
| srec_arb.c | 421 tree_head topo;
423 topo.nnodes = 0;
424 traverse_tree(node, &topo, num_terminal_nodes);
425 return topo.nnodes;
441 tree_head topo; local
448 topo.low_pel_no = 32567;
449 topo.high_pel_no = 0;
450 topo.nnodes = 0;
451 traverse_tree(a->pdata[i].model_nodes, &topo, &num_hmms_in_phoneme);
453 topo.low_pel_no, topo.high_pel_no); *
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 216 /// Topo - A topological ordering for SUnits which permits fast IsReachable
218 ScheduleDAGTopologicalSort Topo;
258 Topo(SUnits, &ExitSU), RPTracker(RegPressure), CurrentTop(),
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 35 /** Test topo sort in GraphNode. */
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 475 void (*addEdge) (struct ANTLR3_TOPO_struct * topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency);
489 * make a long term copy of this array if you do not want to keep the topo
492 pANTLR3_UINT32 (*sortToArray) (struct ANTLR3_TOPO_struct * topo);
498 void (*sortVector) (struct ANTLR3_TOPO_struct * topo, pANTLR3_VECTOR v);
503 void (*free) (struct ANTLR3_TOPO_struct * topo);
|
| /packages/apps/VideoEditor/res/values-pt-rPT/ |
| strings.xml | 136 <string name="transitions_sliding_top_out_bottom_in" msgid="5442312445544903771">"Deslizar topo para fora e fundo para dentro"</string>
137 <string name="transitions_sliding_bottom_out_top_in" msgid="2053651773008656618">"Deslizar fundo para fora e topo para dentro"</string>
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGRRList.cpp | 152 /// Topo - A topological ordering for SUnits which permits fast IsReachable
154 ScheduleDAGTopologicalSort Topo;
166 Topo(SUnits, NULL) {
186 return Topo.IsReachable(SU, TargetSU);
192 return Topo.WillCreateCycle(SU, TargetSU);
199 Topo.AddPred(SU, D.getSUnit());
207 Topo.RemovePred(SU, D.getSUnit());
247 Topo.InitDAGTopologicalSorting();
258 Topo.InitDAGTopologicalSorting();
340 Topo.InitDAGTopologicalSorting()
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineScheduler.cpp | 330 if (Topo.IsReachable(PredDep.getSUnit(), SuccSU))
332 Topo.AddPred(SuccSU, PredDep.getSUnit());
523 Topo.InitDAGTopologicalSorting();
[all...] |
| /packages/inputmethods/LatinIME/dictionaries/ |
| pt_BR_wordlist.combined.gz | |
| pt_PT_wordlist.combined.gz | |
