- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 58 for IsStmt (0.47 sec)
-
src/cmd/compile/internal/ssa/numberlines.go
// Find the first interesting position and check to see if it differs from any predecessor firstPos := src.NoXPos firstPosIndex := -1 if b.Pos.IsStmt() != src.PosNotStmt { note(b.Pos) } for i := 0; i < len(b.Values); i++ { v := b.Values[i] if v.Pos.IsStmt() != src.PosNotStmt { note(v.Pos) // skip ahead to better instruction for this line if possible i = nextGoodStatementIndex(v, i, b)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 14 21:26:13 UTC 2023 - 7.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/stmtlines_test.go
for { err := lrdr.Next(&le) if err == io.EOF { break } must(err) fl := Line{le.File.Name, le.Line} lines[fl] = lines[fl] || le.IsStmt } } nonStmtLines := []Line{} for line, isstmt := range lines { if !isstmt { nonStmtLines = append(nonStmtLines, line) } } var m int if runtime.GOARCH == "amd64" { m = 1 // > 99% obtained on amd64, no backsliding
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 03 17:05:14 UTC 2023 - 3.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadcode.go
live[v.ID] = true q = append(q, v) if v.Pos.IsStmt() != src.PosNotStmt { liveOrderStmts = append(liveOrderStmts, v) } } } for _, v := range b.Values { if (opcodeTable[v.Op].call || opcodeTable[v.Op].hasSideEffects || opcodeTable[v.Op].nilCheck) && !live[v.ID] { live[v.ID] = true q = append(q, v) if v.Pos.IsStmt() != src.PosNotStmt { liveOrderStmts = append(liveOrderStmts, v)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 08 00:29:01 UTC 2023 - 9.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/print.go
return } fmt.Fprintln(p.w, " "+b.LongString()) } func StmtString(p src.XPos) string { linenumber := "(?) " if p.IsKnown() { pfx := "" if p.IsStmt() == src.PosIsStmt { pfx = "+" } if p.IsStmt() == src.PosNotStmt { pfx = "-" } linenumber = fmt.Sprintf("(%s%d) ", pfx, p.Line()) } return linenumber } func (p stringFuncPrinter) value(v *Value, live bool) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 3.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/fuse.go
// try to move it to a value in the next block, // or to the next block's end, if possible. b_next = bx.Succs[0].b if bx.Pos.IsStmt() == src.PosIsStmt { l := bx.Pos.Line() // looking for another place to mark for line l outOfOrder := false for _, v := range b_next.Values { if v.Pos.IsStmt() == src.PosNotStmt { continue } if l == v.Pos.Line() { // Found a Value with same line, therefore done.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 9K bytes - Viewed (0) -
src/cmd/internal/src/xpos_test.go
{XPos.WithNotStmt, PosNotStmt}} { xposWith := x.f(xpos) expected := x.e if xpos.Line() == 0 && xpos.Col() == 0 { expected = PosNotStmt } if got := xposWith.IsStmt(); got != expected { t.Errorf("expected %v; got %v", expected, got) } if xposWith.Col() != xpos.Col() || xposWith.Line() != xpos.Line() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 01 15:52:41 UTC 2023 - 2.7K bytes - Viewed (0) -
src/cmd/internal/src/pos_test.go
{makeLico(lineMax+1, colMax+1).withNotStmt(), fmt.Sprintf(":%d", lineMax) + not, lineMax, 0}, } { x := test.x if got := formatstr("", x.Line(), x.Col(), true) + fmt.Sprintf(":%d", x.IsStmt()); got != test.string { t.Errorf("%s: got %q", test.string, got) } } } func TestLogue(t *testing.T) { defp := fmt.Sprintf(":%d", PosDefaultLogue) pro := fmt.Sprintf(":%d", PosPrologueEnd)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 14 23:50:26 UTC 2022 - 8.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/trim.go
func trim(f *Func) { n := 0 for _, b := range f.Blocks { if !trimmableBlock(b) { f.Blocks[n] = b n++ continue } bPos := b.Pos bIsStmt := bPos.IsStmt() == src.PosIsStmt // Splice b out of the graph. NOTE: `mergePhi` depends on the // order, in which the predecessors edges are merged here. p, i := b.Preds[0].b, b.Preds[0].i s, j := b.Succs[0].b, b.Succs[0].i
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 4.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug_lines_test.go
if len(matches) == 2 { stmt, err := strconv.ParseInt(matches[1], 10, 32) if err != nil { t.Fatalf("Expected to parse a line number but saw %s instead on dump line #%d, error %v", matches[1], dumpLineNum, err) } if testing.Verbose() { fmt.Printf("Saw stmt# %d for submatch '%s' on dump line #%d = '%s'\n", stmt, matches[1], dumpLineNum, line) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 20:24:52 UTC 2023 - 8.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/cse.go
} rewrites := int64(0) // Apply substitutions for _, b := range f.Blocks { for _, v := range b.Values { for i, w := range v.Args { if x := rewrite[w.ID]; x != nil { if w.Pos.IsStmt() == src.PosIsStmt { // about to lose a statement marker, w // w is an input to v; if they're in the same block // and the same line, v is a good-enough new statement boundary.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 9.6K bytes - Viewed (0)