- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for checkEnabled (0.12 sec)
-
src/cmd/compile/internal/ssa/compile.go
if phase == "check" { switch flag { case "on": checkEnabled = val != 0 debugPoset = checkEnabled // also turn on advanced self-checking in prove's data structure return "" case "off": checkEnabled = val == 0 debugPoset = checkEnabled return "" case "seed": checkEnabled = true checkRandSeed = val debugPoset = checkEnabled return "" } } alltime := false
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 14:55:18 UTC 2024 - 18.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/prove.go
func (ft *factsTable) cleanup(f *Func) { for _, po := range []*poset{ft.orderS, ft.orderU} { // Make sure it's empty as it should be. A non-empty poset // might cause errors and miscompilations if reused. if checkEnabled { if err := po.CheckEmpty(); err != nil { f.Fatalf("poset not empty after function %s: %v", f.Name, err) } } f.retPoset(po) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/regalloc.go
v := s.regs[r].v if v == nil { continue } regList = append(regList, endReg{r, v, s.regs[r].c}) } s.endRegs[b.ID] = regList if checkEnabled { regValLiveSet.clear() for _, x := range s.live[b.ID] { regValLiveSet.add(x.ID) } for r := register(0); r < s.numRegs; r++ { v := s.regs[r].v if v == nil { continue
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0)