X7ROOT File Manager
Current Path:
/opt/golang/1.19.4/src/cmd/compile/internal/ssa
opt
/
golang
/
1.19.4
/
src
/
cmd
/
compile
/
internal
/
ssa
/
📁
..
📄
README.md
(8.14 KB)
📄
TODO
(950 B)
📄
addressingmodes.go
(23.64 KB)
📄
bench_test.go
(531 B)
📄
biasedsparsemap.go
(2.71 KB)
📄
block.go
(11.1 KB)
📄
branchelim.go
(11.98 KB)
📄
branchelim_test.go
(5.21 KB)
📄
cache.go
(2.46 KB)
📄
check.go
(16.59 KB)
📄
checkbce.go
(956 B)
📄
compile.go
(18.19 KB)
📄
config.go
(11.7 KB)
📄
copyelim.go
(1.83 KB)
📄
copyelim_test.go
(1.29 KB)
📄
critical.go
(3.19 KB)
📄
cse.go
(9.43 KB)
📄
cse_test.go
(4.25 KB)
📄
deadcode.go
(9.61 KB)
📄
deadcode_test.go
(3.49 KB)
📄
deadstore.go
(9.08 KB)
📄
deadstore_test.go
(4.09 KB)
📄
debug.go
(56.34 KB)
📄
debug_lines_test.go
(8.29 KB)
📄
debug_test.go
(28.75 KB)
📄
decompose.go
(13.41 KB)
📄
dom.go
(7.98 KB)
📄
dom_test.go
(13.34 KB)
📄
expand_calls.go
(63.5 KB)
📄
export_test.go
(3.23 KB)
📄
flagalloc.go
(6.68 KB)
📄
flags_amd64_test.s
(533 B)
📄
flags_arm64_test.s
(699 B)
📄
flags_test.go
(2.49 KB)
📄
func.go
(27.08 KB)
📄
func_test.go
(13.07 KB)
📄
fuse.go
(6.5 KB)
📄
fuse_branchredirect.go
(3.24 KB)
📄
fuse_comparisons.go
(4.04 KB)
📄
fuse_test.go
(7.21 KB)
📁
gen
📄
html.go
(34.72 KB)
📄
id.go
(576 B)
📄
layout.go
(4.82 KB)
📄
lca.go
(3.77 KB)
📄
lca_test.go
(1.65 KB)
📄
likelyadjust.go
(15.24 KB)
📄
location.go
(3.06 KB)
📄
loopbce.go
(10.54 KB)
📄
loopreschedchecks.go
(15.86 KB)
📄
looprotate.go
(2.61 KB)
📄
lower.go
(1.36 KB)
📄
magic.go
(15.77 KB)
📄
magic_test.go
(9.1 KB)
📄
nilcheck.go
(11.06 KB)
📄
nilcheck_test.go
(12.17 KB)
📄
numberlines.go
(7.83 KB)
📄
op.go
(18.65 KB)
📄
opGen.go
(1.01 MB)
📄
opt.go
(308 B)
📄
passbm_test.go
(3.14 KB)
📄
phielim.go
(1.48 KB)
📄
phiopt.go
(8.08 KB)
📄
poset.go
(37.2 KB)
📄
poset_test.go
(18.14 KB)
📄
print.go
(3.85 KB)
📄
prove.go
(41.82 KB)
📄
regalloc.go
(83.69 KB)
📄
regalloc_test.go
(6.49 KB)
📄
rewrite.go
(53.49 KB)
📄
rewrite386.go
(289.01 KB)
📄
rewrite386splitload.go
(4.05 KB)
📄
rewriteAMD64.go
(888.95 KB)
📄
rewriteAMD64splitload.go
(21.41 KB)
📄
rewriteARM.go
(487.7 KB)
📄
rewriteARM64.go
(751.84 KB)
📄
rewriteCond_test.go
(10.62 KB)
📄
rewriteLOONG64.go
(193.44 KB)
📄
rewriteMIPS.go
(174.44 KB)
📄
rewriteMIPS64.go
(195.55 KB)
📄
rewritePPC64.go
(431.6 KB)
📄
rewriteRISCV64.go
(159.66 KB)
📄
rewriteS390X.go
(433.4 KB)
📄
rewriteWasm.go
(109.86 KB)
📄
rewrite_test.go
(6.91 KB)
📄
rewritedec.go
(10.16 KB)
📄
rewritedec64.go
(63.77 KB)
📄
rewritegeneric.go
(617.96 KB)
📄
schedule.go
(18.23 KB)
📄
schedule_test.go
(2.91 KB)
📄
shift_test.go
(4.05 KB)
📄
shortcircuit.go
(12.63 KB)
📄
shortcircuit_test.go
(1.31 KB)
📄
sizeof_test.go
(855 B)
📄
softfloat.go
(1.99 KB)
📄
sparsemap.go
(1.98 KB)
📄
sparseset.go
(1.54 KB)
📄
sparsetree.go
(8.05 KB)
📄
stackalloc.go
(12.79 KB)
📄
stackframe.go
(290 B)
📄
stmtlines_test.go
(2.96 KB)
📁
testdata
📄
tighten.go
(4.3 KB)
📄
trim.go
(4.24 KB)
📄
tuple.go
(1.97 KB)
📄
value.go
(15.21 KB)
📄
writebarrier.go
(19.29 KB)
📄
writebarrier_test.go
(1.75 KB)
📄
xposmap.go
(3.29 KB)
📄
zcse.go
(2.07 KB)
📄
zeroextension_test.go
(1.66 KB)
Editing: critical.go
// Copyright 2015 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package ssa // critical splits critical edges (those that go from a block with // more than one outedge to a block with more than one inedge). // Regalloc wants a critical-edge-free CFG so it can implement phi values. func critical(f *Func) { // maps from phi arg ID to the new block created for that argument blocks := make([]*Block, f.NumValues()) // need to iterate over f.Blocks without range, as we might // need to split critical edges on newly constructed blocks for j := 0; j < len(f.Blocks); j++ { b := f.Blocks[j] if len(b.Preds) <= 1 { continue } var phi *Value // determine if we've only got a single phi in this // block, this is easier to handle than the general // case of a block with multiple phi values. for _, v := range b.Values { if v.Op == OpPhi { if phi != nil { phi = nil break } phi = v } } // reset our block map if phi != nil { for _, v := range phi.Args { blocks[v.ID] = nil } } // split input edges coming from multi-output blocks. for i := 0; i < len(b.Preds); { e := b.Preds[i] p := e.b pi := e.i if p.Kind == BlockPlain { i++ continue // only single output block } var d *Block // new block used to remove critical edge reusedBlock := false // if true, then this is not the first use of this block if phi != nil { argID := phi.Args[i].ID // find or record the block that we used to split // critical edges for this argument if d = blocks[argID]; d == nil { // splitting doesn't necessarily remove the critical edge, // since we're iterating over len(f.Blocks) above, this forces // the new blocks to be re-examined. d = f.NewBlock(BlockPlain) d.Pos = p.Pos blocks[argID] = d if f.pass.debug > 0 { f.Warnl(p.Pos, "split critical edge") } } else { reusedBlock = true } } else { // no existing block, so allocate a new block // to place on the edge d = f.NewBlock(BlockPlain) d.Pos = p.Pos if f.pass.debug > 0 { f.Warnl(p.Pos, "split critical edge") } } // if this not the first argument for the // block, then we need to remove the // corresponding elements from the block // predecessors and phi args if reusedBlock { // Add p->d edge p.Succs[pi] = Edge{d, len(d.Preds)} d.Preds = append(d.Preds, Edge{p, pi}) // Remove p as a predecessor from b. b.removePred(i) // Update corresponding phi args b.removePhiArg(phi, i) // splitting occasionally leads to a phi having // a single argument (occurs with -N) // TODO(cuonglm,khr): replace this with phielimValue, and // make removePhiArg incorporates that. if len(b.Preds) == 1 { phi.Op = OpCopy } // Don't increment i in this case because we moved // an unprocessed predecessor down into slot i. } else { // splice it in p.Succs[pi] = Edge{d, 0} b.Preds[i] = Edge{d, 0} d.Preds = append(d.Preds, Edge{p, pi}) d.Succs = append(d.Succs, Edge{b, i}) i++ } } } }
Upload File
Create Folder