| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| loopbce.go | 36 sdom := f.sdom()
114 if !sdom.isAncestorEq(b.Succs[entry].b, nxt.Block) {
176 sdom := f.sdom()
205 if iv, has := m[ind]; has && sdom.isAncestorEq(iv.entry, b) && isNonNegative(iv.min) {
232 if iv, has := m[ind]; has && sdom.isAncestorEq(iv.entry, b) && isNonNegative(iv.min) {
253 if iv, has := m[ind]; has && sdom.isAncestorEq(iv.entry, b) && isGreaterOrEqualThan(iv.min, -add) {
|
| loopreschedchecks.go | 80 sdom := newSparseOrderedTree(f, idom, po)
83 fmt.Printf("before %s = %s\n", f.Name, sdom.treestructure(f.Entry))
135 addDFphis(mem0, h, h, f, memDefsAtBlockEnds, newmemphis, sdom)
151 rewriteNewPhis(f.Entry, f.Entry, f, memDefsAtBlockEnds, newmemphis, dfPhiTargets, sdom)
267 sdom = newSparseTree(f, f.Idom())
268 fmt.Printf("after %s = %s\n", f.Name, sdom.treestructure(f.Entry))
288 // sdom must yield a preorder of the flow graph if recursively walked, root-to-children.
291 func rewriteNewPhis(h, b *Block, f *Func, defsForUses []*Value, newphis map[*Block]rewrite, dfPhiTargets map[rewriteTarget]bool, sdom SparseTree) {
314 // Visiting in preorder (a property of how sdom was constructed)
353 for c := sdom[b.ID].child; c != nil; c = sdom[c.ID].sibling
[all...] |
| likelyadjust.go | 30 func (sdom SparseTree) outerinner(outer, inner *loop) {
37 for oldouter != nil && sdom.isAncestor(outer.header, oldouter.header) {
45 sdom.outerinner(oldouter, outer)
78 sdom SparseTree
277 func (l *loop) nearestOuterLoop(sdom SparseTree, b *Block) *loop {
279 for o = l.outer; o != nil && !sdom.isAncestorEq(o.header, b); o = o.outer {
286 sdom := f.sdom()
318 if sdom.isAncestorEq(bb, b) { // Found a loop header
338 if !sdom.isAncestorEq(l.header, b)
[all...] |
| phiopt.go | 27 sdom := f.sdom()
96 if tmp := v.Args[1-reverse]; sdom.isAncestorEq(tmp.Block, b) {
112 if tmp := v.Args[reverse]; sdom.isAncestorEq(tmp.Block, b) {
|
| sparsetreemap.go | 51 Sdom []SparseTreeNode // indexed by block.ID
70 func makeSparseTreeHelper(sdom SparseTree, dom, po []*Block, ponums []int32) *SparseTreeHelper {
71 helper := &SparseTreeHelper{Sdom: []SparseTreeNode(sdom),
104 blockIndex := &helper.Sdom[b.ID]
154 blockIndex := &helper.Sdom[b.ID]
|
| cse.go | 157 sdom := f.sdom()
165 byDom.sdom = sdom
181 if sdom.isAncestorEq(v.Block, w.Block) {
368 sdom SparseTree
376 return sv.sdom.domorder(v.Block) < sv.sdom.domorder(w.Block)
|
| nilcheck.go | 13 sdom := f.sdom()
145 for w := sdom[node.block.ID].child; w != nil; w = sdom[w.ID].sibling {
|
| prove.go | 508 sdom := f.sdom()
515 branch := getBranch(sdom, parent, node.block)
534 for s := sdom.Child(node.block); s != nil; s = sdom.Sibling(s) {
561 func getBranch(sdom SparseTree, p *Block, b *Block) branch {
571 if sdom.isAncestorEq(p.Succs[0].b, b) && len(p.Succs[0].b.Preds) == 1 {
574 if sdom.isAncestorEq(p.Succs[1].b, b) && len(p.Succs[1].b.Preds) == 1 {
|
| check.go | 264 sdom := f.sdom()
273 if !domCheck(f, sdom, x, y) {
278 if b.Control != nil && !domCheck(f, sdom, b.Control.Block, b) {
481 func domCheck(f *Func, sdom SparseTree, x, y *Block) bool {
482 if !sdom.isAncestorEq(f.Entry, y) {
486 return sdom.isAncestorEq(x, y)
|
| regalloc.go | 203 restoreMin int32 // minimum of all restores' blocks' sdom.entry
204 restoreMax int32 // maximum of all restores' blocks' sdom.exit
218 sdom SparseTree
440 vi.restoreMin = min32(vi.restoreMin, s.sdom[b.ID].entry)
441 vi.restoreMax = max32(vi.restoreMax, s.sdom[b.ID].exit)
451 vi.restoreMin = s.sdom[b.ID].entry
452 vi.restoreMax = s.sdom[b.ID].exit
666 s.sdom = f.sdom()
[all...] |
| func.go | 521 // sdom returns a sparse tree representing the dominator relationships
523 func (f *Func) sdom() SparseTree { func
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| loopbce.go | 36 sdom := f.sdom()
114 if !sdom.isAncestorEq(b.Succs[entry].b, nxt.Block) {
176 sdom := f.sdom()
205 if iv, has := m[ind]; has && sdom.isAncestorEq(iv.entry, b) && isNonNegative(iv.min) {
232 if iv, has := m[ind]; has && sdom.isAncestorEq(iv.entry, b) && isNonNegative(iv.min) {
253 if iv, has := m[ind]; has && sdom.isAncestorEq(iv.entry, b) && isGreaterOrEqualThan(iv.min, -add) {
|
| loopreschedchecks.go | 80 sdom := newSparseOrderedTree(f, idom, po)
83 fmt.Printf("before %s = %s\n", f.Name, sdom.treestructure(f.Entry))
135 addDFphis(mem0, h, h, f, memDefsAtBlockEnds, newmemphis, sdom)
151 rewriteNewPhis(f.Entry, f.Entry, f, memDefsAtBlockEnds, newmemphis, dfPhiTargets, sdom)
267 sdom = newSparseTree(f, f.Idom())
268 fmt.Printf("after %s = %s\n", f.Name, sdom.treestructure(f.Entry))
288 // sdom must yield a preorder of the flow graph if recursively walked, root-to-children.
291 func rewriteNewPhis(h, b *Block, f *Func, defsForUses []*Value, newphis map[*Block]rewrite, dfPhiTargets map[rewriteTarget]bool, sdom SparseTree) {
314 // Visiting in preorder (a property of how sdom was constructed)
353 for c := sdom[b.ID].child; c != nil; c = sdom[c.ID].sibling
[all...] |
| likelyadjust.go | 30 func (sdom SparseTree) outerinner(outer, inner *loop) {
37 for oldouter != nil && sdom.isAncestor(outer.header, oldouter.header) {
45 sdom.outerinner(oldouter, outer)
78 sdom SparseTree
277 func (l *loop) nearestOuterLoop(sdom SparseTree, b *Block) *loop {
279 for o = l.outer; o != nil && !sdom.isAncestorEq(o.header, b); o = o.outer {
286 sdom := f.sdom()
318 if sdom.isAncestorEq(bb, b) { // Found a loop header
338 if !sdom.isAncestorEq(l.header, b)
[all...] |
| phiopt.go | 27 sdom := f.sdom()
96 if tmp := v.Args[1-reverse]; sdom.isAncestorEq(tmp.Block, b) {
112 if tmp := v.Args[reverse]; sdom.isAncestorEq(tmp.Block, b) {
|
| sparsetreemap.go | 51 Sdom []SparseTreeNode // indexed by block.ID
70 func makeSparseTreeHelper(sdom SparseTree, dom, po []*Block, ponums []int32) *SparseTreeHelper {
71 helper := &SparseTreeHelper{Sdom: []SparseTreeNode(sdom),
104 blockIndex := &helper.Sdom[b.ID]
154 blockIndex := &helper.Sdom[b.ID]
|
| cse.go | 157 sdom := f.sdom()
165 byDom.sdom = sdom
181 if sdom.isAncestorEq(v.Block, w.Block) {
368 sdom SparseTree
376 return sv.sdom.domorder(v.Block) < sv.sdom.domorder(w.Block)
|
| nilcheck.go | 13 sdom := f.sdom()
145 for w := sdom[node.block.ID].child; w != nil; w = sdom[w.ID].sibling {
|
| prove.go | 508 sdom := f.sdom()
515 branch := getBranch(sdom, parent, node.block)
534 for s := sdom.Child(node.block); s != nil; s = sdom.Sibling(s) {
561 func getBranch(sdom SparseTree, p *Block, b *Block) branch {
571 if sdom.isAncestorEq(p.Succs[0].b, b) && len(p.Succs[0].b.Preds) == 1 {
574 if sdom.isAncestorEq(p.Succs[1].b, b) && len(p.Succs[1].b.Preds) == 1 {
|
| check.go | 264 sdom := f.sdom()
273 if !domCheck(f, sdom, x, y) {
278 if b.Control != nil && !domCheck(f, sdom, b.Control.Block, b) {
481 func domCheck(f *Func, sdom SparseTree, x, y *Block) bool {
482 if !sdom.isAncestorEq(f.Entry, y) {
486 return sdom.isAncestorEq(x, y)
|
| regalloc.go | 203 restoreMin int32 // minimum of all restores' blocks' sdom.entry
204 restoreMax int32 // maximum of all restores' blocks' sdom.exit
218 sdom SparseTree
440 vi.restoreMin = min32(vi.restoreMin, s.sdom[b.ID].entry)
441 vi.restoreMax = max32(vi.restoreMax, s.sdom[b.ID].exit)
451 vi.restoreMin = s.sdom[b.ID].entry
452 vi.restoreMax = s.sdom[b.ID].exit
666 s.sdom = f.sdom()
[all...] |
| func.go | 521 // sdom returns a sparse tree representing the dominator relationships
523 func (f *Func) sdom() SparseTree { func
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 218 // If V is a non-root vertex and sdom(V) = parent(V), then idom(V) is
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| DominatorInternals.h | 219 // If V is a non-root vertex and sdom(V) = parent(V), then idom(V) is
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 210 // If V is a non-root vertex and sdom(V) = parent(V), then idom(V) is
|
