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: xposmap.go
// Copyright 2019 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 import ( "cmd/internal/src" "fmt" ) type lineRange struct { first, last uint32 } // An xposmap is a map from fileindex and line of src.XPos to int32, // implemented sparsely to save space (column and statement status are ignored). // The sparse skeleton is constructed once, and then reused by ssa phases // that (re)move values with statements attached. type xposmap struct { // A map from file index to maps from line range to integers (block numbers) maps map[int32]*biasedSparseMap // The next two fields provide a single-item cache for common case of repeated lines from same file. lastIndex int32 // -1 means no entry in cache lastMap *biasedSparseMap // map found at maps[lastIndex] } // newXposmap constructs an xposmap valid for inputs which have a file index in the keys of x, // and line numbers in the range x[file index]. // The resulting xposmap will panic if a caller attempts to set or add an XPos not in that range. func newXposmap(x map[int]lineRange) *xposmap { maps := make(map[int32]*biasedSparseMap) for i, p := range x { maps[int32(i)] = newBiasedSparseMap(int(p.first), int(p.last)) } return &xposmap{maps: maps, lastIndex: -1} // zero for the rest is okay } // clear removes data from the map but leaves the sparse skeleton. func (m *xposmap) clear() { for _, l := range m.maps { if l != nil { l.clear() } } m.lastIndex = -1 m.lastMap = nil } // mapFor returns the line range map for a given file index. func (m *xposmap) mapFor(index int32) *biasedSparseMap { if index == m.lastIndex { return m.lastMap } mf := m.maps[index] m.lastIndex = index m.lastMap = mf return mf } // set inserts p->v into the map. // If p does not fall within the set of fileindex->lineRange used to construct m, this will panic. func (m *xposmap) set(p src.XPos, v int32) { s := m.mapFor(p.FileIndex()) if s == nil { panic(fmt.Sprintf("xposmap.set(%d), file index not found in map\n", p.FileIndex())) } s.set(p.Line(), v) } // get returns the int32 associated with the file index and line of p. func (m *xposmap) get(p src.XPos) int32 { s := m.mapFor(p.FileIndex()) if s == nil { return -1 } return s.get(p.Line()) } // add adds p to m, treating m as a set instead of as a map. // If p does not fall within the set of fileindex->lineRange used to construct m, this will panic. // Use clear() in between set/map interpretations of m. func (m *xposmap) add(p src.XPos) { m.set(p, 0) } // contains returns whether the file index and line of p are in m, // treating m as a set instead of as a map. func (m *xposmap) contains(p src.XPos) bool { s := m.mapFor(p.FileIndex()) if s == nil { return false } return s.contains(p.Line()) } // remove removes the file index and line for p from m, // whether m is currently treated as a map or set. func (m *xposmap) remove(p src.XPos) { s := m.mapFor(p.FileIndex()) if s == nil { return } s.remove(p.Line()) } // foreachEntry applies f to each (fileindex, line, value) triple in m. func (m *xposmap) foreachEntry(f func(j int32, l uint, v int32)) { for j, mm := range m.maps { s := mm.size() for i := 0; i < s; i++ { l, v := mm.getEntry(i) f(j, l, v) } } }
Upload File
Create Folder