- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 473 for Shere (0.05 sec)
-
src/cmd/compile/internal/typecheck/iexport.go
// Strings section. At that offset is another uvarint, followed by // that many bytes, which form the string value. // // declOff means a uvarint that indicates an offset within the Data // section where the associated declaration can be found. // // // There are five kinds of declarations, distinguished by their first // byte: // // type Var struct { // Tag byte // 'V' // Pos Pos // Type typeOff // }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jul 21 02:40:02 UTC 2023 - 6.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/abi.go
// as though it could lead to situations where the linker's // nosplit-overflow analysis would trigger a link failure. On the // other hand if they not tagged NOSPLIT then this could cause // problems when building the runtime (since there may be calls to // asm routine in cases where it's not safe to grow the stack). In // most cases the wrapper would be (in effect) inlined, but are
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 19:57:43 UTC 2024 - 13.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/schedule.go
// We also score GetLoweredClosurePtr as early as possible to ensure that the // context register is not stomped. GetLoweredClosurePtr should only appear // in the entry block where there are no phi functions, so there is no // conflict or ambiguity here. if b != f.Entry { f.Fatalf("LoweredGetClosurePtr appeared outside of entry block, b=%s", b.String()) } score[v.ID] = ScorePhi case opcodeTable[v.Op].nilCheck:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 15:53:17 UTC 2024 - 16.4K bytes - Viewed (0) -
src/cmd/cgo/internal/testshared/testdata/dep3/dep3.go
package dep3 // The point of this test file is that it references a type from // depBase that is also referenced in dep2, but dep2 is loaded by the // linker before depBase (because it is earlier in the import list). // There was a bug in the linker where it would not correctly read out // the type data in this case and later crash. import ( "testshared/dep2" "testshared/depBase" ) type Dep3 struct { dep depBase.Dep dep2 dep2.Dep2 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 12 11:59:56 UTC 2023 - 503 bytes - Viewed (0) -
callbacks/helper.go
} func checkMissingWhereConditions(db *gorm.DB) { if !db.AllowGlobalUpdate && db.Error == nil { where, withCondition := db.Statement.Clauses["WHERE"] if withCondition { if _, withSoftDelete := db.Statement.Clauses["soft_delete_enabled"]; withSoftDelete { whereClause, _ := where.Expression.(clause.Where) withCondition = len(whereClause.Exprs) > 1 } } if !withCondition {
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Thu Apr 14 12:32:57 UTC 2022 - 3.7K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
return } // For SB, SP, and FP, there must be a name here. 0(FP) is not legal. if name != "PC" && a.Name == obj.NAME_NONE { p.errorf("cannot reference %s without a symbol", name) } p.setPseudoRegister(a, name, false, prefix) return } a.Reg = r1 if r2 != 0 { // TODO: Consistency in the encoding would be nice here. if p.arch.InFamily(sys.ARM, sys.ARM64) { // Special form
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 21 14:34:57 UTC 2024 - 36.9K bytes - Viewed (0) -
src/cmd/compile/internal/staticinit/sched.go
// // Currently, it outlines map assignment statements with large, // side-effect-free RHS expressions. func tryWrapGlobalInit(n ir.Node) *ir.Func { // Look for "X = ..." where X has map type. // FIXME: might also be worth trying to look for cases where // the LHS is of interface type but RHS is map type. if n.Op() != ir.OAS { return nil } as := n.(*ir.AssignStmt) if ir.IsBlank(as.X) || as.X.Op() != ir.ONAME {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 17:16:14 UTC 2024 - 30.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sparsetree.go
s += " " } s += t.treestructure1(c, i+1) } s += ")" } return s } // numberBlock assigns entry and exit numbers for b and b's // children in an in-order walk from a gappy sequence, where n // is the first number not yet assigned or reserved. N should // be larger than zero. For each entry and exit number, the // values one larger and smaller are reserved to indicate
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 8.1K bytes - Viewed (0) -
src/cmd/compile/internal/types2/initorder.go
// (the one with the fewest dependencies) and its edges from the graph, // repeatedly, until there are no nodes left. // In a valid Go program, those nodes always have zero dependencies (after // removing all incoming dependencies), otherwise there are initialization // cycles. emitted := make(map[*declInfo]bool) for len(pq) > 0 { // get the next node n := heap.Pop(&pq).(*graphNode)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 28 22:06:51 UTC 2024 - 9.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/loopbce.go
// the increment delta (inc), the temporary sum (nxt), // the initial value (init) and the limiting value (limit). // // We also know that ind has the form (Phi init nxt) where // nxt is (Add inc nxt) which means: 1) inc dominates nxt // and 2) there is a loop starting at inc and containing nxt. // // We need to prove that the induction variable is incremented // only when it's smaller than the limiting value.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 07 17:37:47 UTC 2023 - 11.8K bytes - Viewed (0)