- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for countTrue (0.45 sec)
-
src/internal/coverage/pods/pods.go
} // FIXME: should probably check file length and hash here for // the duplicate. } } counterRE := regexp.MustCompile(fmt.Sprintf(coverage.CounterFileRegexp, coverage.CounterFilePref)) for k, f := range files { base := filepath.Base(f) if m := counterRE.FindStringSubmatch(base); m != nil { tag := m[1] // meta hash pid, err := strconv.Atoi(m[2]) if err != nil { continue
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 6.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/func.go
PrintOrHtmlSSA bool // true if GOSSAFUNC matches, true even if fe.Log() (spew phase results to stdout) is false. There's an odd dependence on this in debug.go for method logf. ruleMatches map[string]int // number of times countRule was called during compilation for any given string ABI0 *abi.ABIConfig // A copy, for no-sync access ABI1 *abi.ABIConfig // A copy, for no-sync access
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 25.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
func noteRule(s string) bool { fmt.Println(s) return true } // countRule increments Func.ruleMatches[key]. // If Func.ruleMatches is non-nil at the end // of compilation, it will be printed to stdout. // This is intended to make it easier to find which functions // which contain lots of rules matches when developing new rules. func countRule(v *Value, key string) bool { f := v.Block.Func if f.ruleMatches == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0)