| /external/llvm/docs/ |
| Lexicon.rst | 213 Reverse postorder
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | [all...] |
| /external/elfutils/libcpu/ |
| i386_parse.y | 870 if (value == leaf || value == postorder)
1079 if (value == leaf || value == postorder)
1095 if (value == leaf || value == postorder)
1104 if (value == leaf || value == postorder)
1379 if (value == leaf || value == postorder)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| suitesparse.cc | 191 cc_.postorder = 0;
|
| /external/v8/src/ |
| transitions.h | 130 // Traverse the transition tree in postorder.
|
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| popt.go | 356 func postorder(r *Flow, rpo2r []*Flow, n int32) int32 { func
360 n = postorder(r1, rpo2r, n)
364 n = postorder(r1, rpo2r, n)
438 d := postorder(g.Start, rpo2r, 0)
|
| go.go | 716 // After calling flowrpo, rpo lists the flow nodes in reverse postorder,
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| popt.go | 353 func postorder(r *Flow, rpo2r []*Flow, n int32) int32 { func
357 n = postorder(r1, rpo2r, n)
361 n = postorder(r1, rpo2r, n)
435 d := postorder(g.Start, rpo2r, 0)
|
| go.go | 713 // After calling flowrpo, rpo lists the flow nodes in reverse postorder,
|
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| popt.go | 356 func postorder(r *Flow, rpo2r []*Flow, n int32) int32 { func
360 n = postorder(r1, rpo2r, n)
364 n = postorder(r1, rpo2r, n)
438 d := postorder(g.Start, rpo2r, 0)
|
| go.go | 716 // After calling flowrpo, rpo lists the flow nodes in reverse postorder,
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| popt.go | 353 func postorder(r *Flow, rpo2r []*Flow, n int32) int32 { func
357 n = postorder(r1, rpo2r, n)
361 n = postorder(r1, rpo2r, n)
435 d := postorder(g.Start, rpo2r, 0)
|
| go.go | 713 // After calling flowrpo, rpo lists the flow nodes in reverse postorder,
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 58 /* depth-first search and postorder of a tree rooted at node j */
433 for(k = 0, i = 0; i <= n; i++) /* postorder the assembly tree */
|
| /external/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 330 /// 6) The order of the SCCs in the vector will be a valid postorder
|
| /external/llvm/include/llvm/CodeGen/ |
| FastISel.h | 464 /// possible to fix this by selecting blocks in reverse postorder.
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 302 // reverse postorder so that LastValueMap contains the correct value at each
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| cfgloop.h | 597 /* Push the loops to LI->TO_VISIT in postorder. */
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/ |
| pyassem.py | 77 """Return the blocks in reverse postorder
|
| /prebuilts/gdb/linux-x86/lib/python2.7/compiler/ |
| pyassem.py | 77 """Return the blocks in reverse postorder
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| pyassem.py | 77 """Return the blocks in reverse postorder
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| pyassem.py | 77 """Return the blocks in reverse postorder
|
| /external/llvm/lib/Analysis/ |
| LazyCallGraph.cpp | 462 // We return a list of the resulting *new* SCCs in postorder.
|
| LoopInfo.cpp | 510 // Iterate over the postorder list of blocks, propagating the nearest loop
|
| /external/llvm/utils/TableGen/ |
| CodeGenRegisters.cpp | 354 // processes the register hierarchy in postorder.
[all...] |
