- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for LackingPos (0.13 sec)
-
src/cmd/compile/internal/ssa/block.go
phi.Args = phi.Args[:n] phielimValue(phi) } // LackingPos indicates whether b is a block whose position should be inherited // from its successors. This is true if all the values within it have unreliable positions // and if it is "plain", meaning that there is no control flow that is also very likely // to correspond to a well-understood source position. func (b *Block) LackingPos() bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 12.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/value.go
return m } return nil } // LackingPos indicates whether v is a value that is unlikely to have a correct // position assigned to it. Ignoring such values leads to more user-friendly positions // assigned to nearby values and the blocks containing them. func (v *Value) LackingPos() bool { // The exact definition of LackingPos is somewhat heuristically defined and may change
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:40:22 UTC 2024 - 16.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/ssa.go
s.Fatalf("Block %s should have a position", b) } bestPos := src.NoXPos for _, e := range b.Preds { p := e.Block() if !p.LackingPos() { continue } if bestPos == src.NoXPos { bestPos = b.Pos for _, v := range b.Values { if v.LackingPos() { continue } if v.Pos != src.NoXPos { // Assume values are still in roughly textual order;
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 284.9K bytes - Viewed (0)