- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 21 for phi (0.03 sec)
-
src/cmd/compile/internal/ssa/deadstore.go
// Extend shadowed region. shadowed.set(ptr.ID, int32(sr.merge(off, off+sz))) } } // walk to previous store if v.Op == OpPhi { // At start of block. Move on to next block. // The memory phi, if it exists, is always // the first logical store in the block. // (Even if it isn't the first in the current b.Values order.) continue } for _, a := range v.Args {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 20:07:26 UTC 2024 - 11K bytes - Viewed (0) -
test/inline.go
if i == 3 { break loop } select2(x, y) // ERROR "inlining call to select2" } } // Issue #62211: inlining a function with unreachable "return" // statements could trip up phi insertion. func issue62211(x bool) { // ERROR "can inline issue62211" if issue62211F(x) { // ERROR "inlining call to issue62211F" } if issue62211G(x) { // ERROR "inlining call to issue62211G" }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:25 UTC 2023 - 11.7K bytes - Viewed (0) -
src/mdo/reader-stax.vm
entities.put("Pi", "\u03a0"); entities.put("Rho", "\u03a1"); entities.put("Sigma", "\u03a3"); entities.put("Tau", "\u03a4"); entities.put("Upsilon", "\u03a5"); entities.put("Phi", "\u03a6"); entities.put("Chi", "\u03a7"); entities.put("Psi", "\u03a8"); entities.put("Omega", "\u03a9"); entities.put("alpha", "\u03b1"); entities.put("beta", "\u03b2");
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Mon Mar 25 10:50:01 UTC 2024 - 38.1K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/plive.go
// goto B // B: // m1 = Phi mem_C mem_D // m2 = store operation ... m1 // m3 = store operation ... m2 // m4 = WBend m3 // Find first memory op in the block, which should be a Phi. m := v for { m = m.MemoryArg() if m.Block != b { lv.f.Fatalf("can't find Phi before write barrier end mark %v", v) } if m.Op == ssa.OpPhi {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 15:22:22 UTC 2024 - 45.2K bytes - Viewed (0) -
src/mdo/reader.vm
entities.put("Pi", "\u03a0"); entities.put("Rho", "\u03a1"); entities.put("Sigma", "\u03a3"); entities.put("Tau", "\u03a4"); entities.put("Upsilon", "\u03a5"); entities.put("Phi", "\u03a6"); entities.put("Chi", "\u03a7"); entities.put("Psi", "\u03a8"); entities.put("Omega", "\u03a9"); entities.put("alpha", "\u03b1"); entities.put("beta", "\u03b2");
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Dec 15 06:33:11 UTC 2023 - 42.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/internal/language/lookup.go
var e ValueError fmt.Fprint(bytes.NewBuffer([]byte(e.v[:])), n) return 0, e } // normRegion returns a region if r is deprecated or 0 otherwise. // TODO: consider supporting BYS (-> BLR), CSK (-> 200 or CZ), PHI (-> PHL) and AFI (-> DJ). // TODO: consider mapping split up regions to new most populous one (like CLDR). func normRegion(r Region) Region { m := regionOldMap k := sort.Search(len(m), func(i int) bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 12.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/genericOps.go
// See section 7.2 in ieee754. {name: "FMA", argLength: 3}, // compute (a*b)+c without intermediate rounding // Data movement. Max argument length for Phi is indefinite. {name: "Phi", argLength: -1, zeroWidth: true}, // select an argument based on which predecessor block we came from {name: "Copy", argLength: 1}, // output = arg0 // Convert converts between pointers and integers.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 42.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/value.go
// The returned value, if non-nil, will be memory-typed (or a tuple with a memory-typed second part). // Otherwise, nil is returned. func (v *Value) MemoryArg() *Value { if v.Op == OpPhi { v.Fatalf("MemoryArg on Phi") } na := len(v.Args) if na == 0 { return nil } if m := v.Args[na-1]; m.Type.IsMemory() { return m } return nil }
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/encoding/xml/xml.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 18:46:41 UTC 2024 - 47.3K bytes - Viewed (0) -
src/math/big/nat.go
for i := 2; i < 1<<n; i += 2 { p2, p, p1 := powers[i/2], powers[i], powers[i+1] *p = p.sqr(*p2) *p = p.trunc(*p, logM) *p1 = p1.mul(*p, x) *p1 = p1.trunc(*p1, logM) } // Because phi(2**logM) = 2**(logM-1), x**(2**(logM-1)) = 1, // so we can compute x**(y mod 2**(logM-1)) instead of x**y. // That is, we can throw away all but the bottom logM-1 bits of y.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0)