@ttsc/lint 0.18.4 → 0.19.1

package/linthost/regexp_cache.go

@@ -0,0 +1,44 @@
+package linthost
+
+import (
+  "regexp"
+  "sync"
+)
+
+// userPatternCache memoizes RE2 compilation of option-supplied regex patterns.
+//
+// Several rules accept a custom regex option — no-fallthrough's and
+// default-case's `commentPattern`, functional's identifier patterns,
+// no-param-reassign's `ignorePropertyModificationsForRegex` — and compile it
+// inside Check. That recompiles the same immutable, config-derived automaton on
+// every invocation: once per visited node, or once per candidate name in an
+// inner loop. The pattern is invariant for a whole run, so compiling it once and
+// reusing the result collapses the per-node cost to a single compile. Distinct
+// option patterns come from configuration and are therefore few and bounded, so
+// the cache cannot grow without bound.
+//
+// The engine walks files in parallel, so access is synchronized. Both the
+// compiled regexp and a compile error are cached so every caller keeps its
+// existing success/failure handling — an invalid custom pattern still surfaces
+// its error, just without recompiling on each visit.
+var userPatternCache sync.Map // map[string]userPatternResult
+
+type userPatternResult struct {
+  re  *regexp.Regexp
+  err error
+}
+
+// compileUserPattern compiles an option-supplied RE2 pattern, memoizing the
+// (regexp, error) result keyed by the pattern text. It is a drop-in replacement
+// for regexp.Compile at option-derived call sites that run during dispatch, with
+// identical return semantics.
+func compileUserPattern(pattern string) (*regexp.Regexp, error) {
+  if cached, ok := userPatternCache.Load(pattern); ok {
+    result := cached.(userPatternResult)
+    return result.re, result.err
+  }
+  re, err := regexp.Compile(pattern)
+  actual, _ := userPatternCache.LoadOrStore(pattern, userPatternResult{re: re, err: err})
+  result := actual.(userPatternResult)
+  return result.re, result.err
+}

package/linthost/rule_codes.go

@@ -0,0 +1,105 @@
+package linthost
+
+import (
+  _ "embed"
+  "encoding/json"
+  "fmt"
+  "sort"
+  "sync"
+
+  "github.com/samchon/ttsc/packages/lint/internal/rulecode"
+)
+
+//go:generate go run ../tools/rulecodes -root ..
+
+// ruleCodeLedgerJSON is the append-only compatibility ledger for built-in
+// rules. Removed names stay in the ledger so their codes are never reused.
+//
+//go:embed rule_codes.json
+var ruleCodeLedgerJSON []byte
+
+var builtInRuleCodes = mustLoadBuiltInRuleCodes()
+
+var runtimeRuleCodes = struct {
+  sync.Mutex
+  codes map[string]int32
+  dirty bool
+}{dirty: true}
+
+func mustLoadBuiltInRuleCodes() map[string]int32 {
+  var ledger map[string]int32
+  if err := json.Unmarshal(ruleCodeLedgerJSON, &ledger); err != nil {
+    panic(fmt.Sprintf("@ttsc/lint: parse rule code ledger: %v", err))
+  }
+  if len(ledger) == 0 {
+    panic("@ttsc/lint: rule code ledger is empty; restore it from version control")
+  }
+  validated, err := rulecode.Allocate(ledger, nil)
+  if err != nil {
+    panic(fmt.Sprintf("@ttsc/lint: invalid rule code ledger: %v", err))
+  }
+  return validated
+}
+
+// invalidateRuntimeRuleCodes marks the contributed-rule assignment stale.
+// Register calls it only for names absent from the frozen built-in ledger.
+func invalidateRuntimeRuleCodes() {
+  runtimeRuleCodes.Lock()
+  runtimeRuleCodes.dirty = true
+  runtimeRuleCodes.Unlock()
+}
+
+// RuleCode returns the collision-free positive TS-style code for a rule.
+// Built-in assignments come from the append-only ledger. Runtime contributor
+// assignments are recomputed over the complete sorted contributor set, so the
+// same set receives the same codes regardless of registration order.
+func RuleCode(name string) int32 {
+  if code, exists := builtInRuleCodes[name]; exists {
+    return code
+  }
+
+  runtimeRuleCodes.Lock()
+  defer runtimeRuleCodes.Unlock()
+  _, isFileRule := registered.rules[name]
+  _, isProjectRule := registeredProjectRules[name]
+  isRegistered := isFileRule || isProjectRule
+  if !runtimeRuleCodes.dirty && isRegistered {
+    if code, exists := runtimeRuleCodes.codes[name]; exists {
+      return code
+    }
+  }
+
+  names := make([]string, 0, len(registered.rules)+1)
+  for registeredName := range registered.rules {
+    if _, builtIn := builtInRuleCodes[registeredName]; !builtIn {
+      names = append(names, registeredName)
+    }
+  }
+  for registeredName := range registeredProjectRules {
+    if _, builtIn := builtInRuleCodes[registeredName]; !builtIn {
+      names = append(names, registeredName)
+    }
+  }
+  if !isRegistered {
+    names = append(names, name)
+  }
+  sort.Strings(names)
+  assigned, err := rulecode.Allocate(builtInRuleCodes, names)
+  if err != nil {
+    panic(fmt.Sprintf("@ttsc/lint: allocate diagnostic code for %q: %v", name, err))
+  }
+
+  runtimeRuleCodes.codes = make(map[string]int32, len(names))
+  for _, registeredName := range names {
+    _, fileRule := registered.rules[registeredName]
+    _, projectRule := registeredProjectRules[registeredName]
+    if fileRule || projectRule {
+      runtimeRuleCodes.codes[registeredName] = assigned[registeredName]
+    }
+  }
+  runtimeRuleCodes.dirty = false
+  return assigned[name]
+}
+
+// ruleCode is the internal alias used by native diagnostic construction.
+func ruleCode(name string) int32 { return RuleCode(name) }