- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for NamedValues (0.37 sec)
-
src/cmd/compile/internal/ssa/decompose.go
for j, v := range f.NamedValues[*name] { if v.Op != OpSliceMake { continue } f.NamedValues[*ptrName] = append(f.NamedValues[*ptrName], v.Args[0]) f.NamedValues[*lenName] = append(f.NamedValues[*lenName], v.Args[1]) f.NamedValues[*capName] = append(f.NamedValues[*capName], v.Args[2]) toDelete = append(toDelete, namedVal{i, j}) } case t.IsInterface():
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 23 21:22:15 UTC 2022 - 13.4K bytes - Viewed (0) -
analysis/analysis-api-fe10/src/org/jetbrains/kotlin/analysis/api/descriptors/utils/KtFe10DebugTypeRenderer.kt
val namedValues = annotation.getKtNamedAnnotationArguments(this@Fe10AnalysisContext) renderAnnotationDebug(annotation.annotationClass?.classId, namedValues, printer) } private fun renderAnnotationDebug(classId: ClassId?, namedValues: List<KaNamedAnnotationValue>, printer: PrettyPrinter) { with(printer) { append("@")
Registered: Wed Jun 12 09:53:16 UTC 2024 - Last Modified: Wed May 22 06:28:34 UTC 2024 - 10.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadcode.go
defer func() { f.Cache.freeValueSlice(order) }() // Remove dead & duplicate entries from namedValues map. s := f.newSparseSet(f.NumValues()) defer f.retSparseSet(s) i := 0 for _, name := range f.Names { j := 0 s.clear() values := f.NamedValues[*name] for _, v := range values { if live[v.ID] && !s.contains(v.ID) { values[j] = v j++ s.add(v.ID)
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/copyelim.go
for i, v := range b.ControlValues() { if v.Op == OpCopy { b.ReplaceControl(i, v.Args[0]) } } } // Update named values. for _, name := range f.Names { values := f.NamedValues[*name] for i, v := range values { if v.Op == OpCopy { values[i] = v.Args[0] } } } } // copySource returns the (non-copy) op which is the // ultimate source of v. v must be a copy op.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 14:55:18 UTC 2024 - 3.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/print.go
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/stackalloc.go
} else { s.names = make([]LocalSlot, n) } names := s.names empty := LocalSlot{} for _, name := range f.Names { // Note: not "range f.NamedValues" above, because // that would be nondeterministic. for _, v := range f.NamedValues[*name] { if v.Op == OpArgIntReg || v.Op == OpArgFloatReg { aux := v.Aux.(*AuxNameOffset) // Never let an arg be bound to a differently named thing.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 12.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/func.go
RegAlloc []Location // temporary registers allocated to rare instructions tempRegs map[ID]*Register // map from LocalSlot to set of Values that we want to store in that slot. NamedValues map[LocalSlot][]*Value // Names is a copy of NamedValues.Keys. We keep a separate list // of keys to make iteration order deterministic. Names []*LocalSlot // Canonicalize root/top-level local slots, and canonicalize their pieces.
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/debug.go
// slots that is type-insenstitive. sc := newSlotCanonicalizer() for _, sl := range f.Names { sc.lookup(*sl) } // Add slot -> value entry to f.NamedValues if not already present. addToNV := func(v *Value, sl LocalSlot) { values, ok := f.NamedValues[sl] if !ok { // Haven't seen this slot yet. sla := f.localSlotAddr(sl) f.Names = append(f.Names, sla) } else { for _, ev := range values {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/value.go
s += " : " + r[v.ID].String() } if reg := v.Block.Func.tempRegs[v.ID]; reg != nil { s += " tmp=" + reg.String() } var names []string for name, values := range v.Block.Func.NamedValues { for _, value := range values { if value == v { names = append(names, name.String()) break // drop duplicates. } } } if len(names) != 0 {
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/ssa/html.go
s += " : " + html.EscapeString(r[v.ID].String()) } if reg := v.Block.Func.tempRegs[v.ID]; reg != nil { s += " tmp=" + reg.String() } var names []string for name, values := range v.Block.Func.NamedValues { for _, value := range values { if value == v { names = append(names, name.String()) break // drop duplicates. } } } if len(names) != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 04 15:11:40 UTC 2023 - 34.8K bytes - Viewed (0)