Linux vmi284606.contaboserver.net 4.15.0-213-generic #224-Ubuntu SMP Mon Jun 19 13:30:12 UTC 2023 x86_64
Apache/2.4.57 (Ubuntu)
: 167.86.127.34 | : 216.73.217.51
Cant Read [ /etc/named.conf ]
7.2.24-0ubuntu0.18.04.17
root
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
local /
go /
src /
cmd /
compile /
internal /
ssa /
[ HOME SHELL ]
Name
Size
Permission
Action
gen
[ DIR ]
drwxr-xr-x
testdata
[ DIR ]
drwxr-xr-x
README.md
7.76
KB
-rw-r--r--
TODO
950
B
-rw-r--r--
biasedsparsemap.go
2.71
KB
-rw-r--r--
block.go
8.64
KB
-rw-r--r--
branchelim.go
11.41
KB
-rw-r--r--
branchelim_test.go
5.21
KB
-rw-r--r--
cache.go
2.46
KB
-rw-r--r--
check.go
13.9
KB
-rw-r--r--
checkbce.go
956
B
-rw-r--r--
compile.go
16.22
KB
-rw-r--r--
config.go
11.39
KB
-rw-r--r--
copyelim.go
1.82
KB
-rw-r--r--
copyelim_test.go
1.29
KB
-rw-r--r--
critical.go
3.15
KB
-rw-r--r--
cse.go
10.62
KB
-rw-r--r--
cse_test.go
4.21
KB
-rw-r--r--
deadcode.go
9.73
KB
-rw-r--r--
deadcode_test.go
3.49
KB
-rw-r--r--
deadstore.go
8.98
KB
-rw-r--r--
deadstore_test.go
4.09
KB
-rw-r--r--
debug.go
33.92
KB
-rw-r--r--
debug_test.go
28.68
KB
-rw-r--r--
decompose.go
10.91
KB
-rw-r--r--
dom.go
7.98
KB
-rw-r--r--
dom_test.go
13.34
KB
-rw-r--r--
export_test.go
5.68
KB
-rw-r--r--
flagalloc.go
5.49
KB
-rw-r--r--
func.go
22.17
KB
-rw-r--r--
func_test.go
12.85
KB
-rw-r--r--
fuse.go
5.7
KB
-rw-r--r--
fuse_test.go
5.04
KB
-rw-r--r--
html.go
29.04
KB
-rw-r--r--
id.go
576
B
-rw-r--r--
layout.go
3.56
KB
-rw-r--r--
lca.go
3.71
KB
-rw-r--r--
lca_test.go
1.65
KB
-rw-r--r--
likelyadjust.go
15.23
KB
-rw-r--r--
location.go
2.8
KB
-rw-r--r--
loopbce.go
9.85
KB
-rw-r--r--
loopreschedchecks.go
15.36
KB
-rw-r--r--
looprotate.go
2.24
KB
-rw-r--r--
lower.go
1.24
KB
-rw-r--r--
magic.go
13.42
KB
-rw-r--r--
magic_test.go
9.1
KB
-rw-r--r--
nilcheck.go
11.11
KB
-rw-r--r--
nilcheck_test.go
12.07
KB
-rw-r--r--
numberlines.go
8.44
KB
-rw-r--r--
op.go
8.74
KB
-rw-r--r--
opGen.go
839.32
KB
-rw-r--r--
opt.go
290
B
-rw-r--r--
passbm_test.go
3.14
KB
-rw-r--r--
phielim.go
1.47
KB
-rw-r--r--
phiopt.go
3.96
KB
-rw-r--r--
poset.go
37.23
KB
-rw-r--r--
poset_test.go
18.14
KB
-rw-r--r--
print.go
2.98
KB
-rw-r--r--
prove.go
36.68
KB
-rw-r--r--
redblack32.go
8.9
KB
-rw-r--r--
redblack32_test.go
5.96
KB
-rw-r--r--
regalloc.go
76.36
KB
-rw-r--r--
regalloc_test.go
6.41
KB
-rw-r--r--
rewrite.go
33.06
KB
-rw-r--r--
rewrite386.go
514.14
KB
-rw-r--r--
rewrite386splitload.go
3.7
KB
-rw-r--r--
rewriteAMD64.go
1.31
MB
-rw-r--r--
rewriteAMD64splitload.go
4.95
KB
-rw-r--r--
rewriteARM.go
538.26
KB
-rw-r--r--
rewriteARM64.go
837.68
KB
-rw-r--r--
rewriteMIPS.go
203.31
KB
-rw-r--r--
rewriteMIPS64.go
227.84
KB
-rw-r--r--
rewritePPC64.go
661.88
KB
-rw-r--r--
rewriteRISCV64.go
123.11
KB
-rw-r--r--
rewriteS390X.go
904.36
KB
-rw-r--r--
rewriteWasm.go
136.86
KB
-rw-r--r--
rewrite_test.go
3.01
KB
-rw-r--r--
rewritedec.go
10.56
KB
-rw-r--r--
rewritedec64.go
64.01
KB
-rw-r--r--
rewritedecArgs.go
6.6
KB
-rw-r--r--
rewritegeneric.go
1.09
MB
-rw-r--r--
schedule.go
13.99
KB
-rw-r--r--
schedule_test.go
2.91
KB
-rw-r--r--
shift_test.go
4.05
KB
-rw-r--r--
shortcircuit.go
3.97
KB
-rw-r--r--
shortcircuit_test.go
1.31
KB
-rw-r--r--
sizeof_test.go
855
B
-rw-r--r--
softfloat.go
1.94
KB
-rw-r--r--
sparsemap.go
1.98
KB
-rw-r--r--
sparseset.go
1.54
KB
-rw-r--r--
sparsetree.go
7.88
KB
-rw-r--r--
sparsetreemap.go
7.67
KB
-rw-r--r--
stackalloc.go
10.95
KB
-rw-r--r--
stackframe.go
290
B
-rw-r--r--
stmtlines_test.go
2.75
KB
-rw-r--r--
tighten.go
4.21
KB
-rw-r--r--
trim.go
4.24
KB
-rw-r--r--
value.go
10.71
KB
-rw-r--r--
writebarrier.go
17.92
KB
-rw-r--r--
writebarrier_test.go
1.75
KB
-rw-r--r--
xposmap.go
3.29
KB
-rw-r--r--
zcse.go
2.12
KB
-rw-r--r--
zeroextension_test.go
1.66
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : trim.go
// Copyright 2016 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" // trim removes blocks with no code in them. // These blocks were inserted to remove critical edges. func trim(f *Func) { n := 0 for _, b := range f.Blocks { if !trimmableBlock(b) { f.Blocks[n] = b n++ continue } bPos := b.Pos bIsStmt := bPos.IsStmt() == src.PosIsStmt // Splice b out of the graph. NOTE: `mergePhi` depends on the // order, in which the predecessors edges are merged here. p, i := b.Preds[0].b, b.Preds[0].i s, j := b.Succs[0].b, b.Succs[0].i ns := len(s.Preds) p.Succs[i] = Edge{s, j} s.Preds[j] = Edge{p, i} for _, e := range b.Preds[1:] { p, i := e.b, e.i p.Succs[i] = Edge{s, len(s.Preds)} s.Preds = append(s.Preds, Edge{p, i}) } // Attempt to preserve a statement boundary if bIsStmt { sawStmt := false for _, v := range s.Values { if isPoorStatementOp(v.Op) { continue } if v.Pos.SameFileAndLine(bPos) { v.Pos = v.Pos.WithIsStmt() } sawStmt = true break } if !sawStmt && s.Pos.SameFileAndLine(bPos) { s.Pos = s.Pos.WithIsStmt() } } // If `s` had more than one predecessor, update its phi-ops to // account for the merge. if ns > 1 { for _, v := range s.Values { if v.Op == OpPhi { mergePhi(v, j, b) } } // Remove the phi-ops from `b` if they were merged into the // phi-ops of `s`. k := 0 for _, v := range b.Values { if v.Op == OpPhi { if v.Uses == 0 { v.resetArgs() continue } // Pad the arguments of the remaining phi-ops so // they match the new predecessor count of `s`. // Since s did not have a Phi op corresponding to // the phi op in b, the other edges coming into s // must be loopback edges from s, so v is the right // argument to v! args := make([]*Value, len(v.Args)) copy(args, v.Args) v.resetArgs() for x := 0; x < j; x++ { v.AddArg(v) } v.AddArg(args[0]) for x := j + 1; x < ns; x++ { v.AddArg(v) } for _, a := range args[1:] { v.AddArg(a) } } b.Values[k] = v k++ } b.Values = b.Values[:k] } // Merge the blocks' values. for _, v := range b.Values { v.Block = s } k := len(b.Values) m := len(s.Values) for i := 0; i < k; i++ { s.Values = append(s.Values, nil) } copy(s.Values[k:], s.Values[:m]) copy(s.Values, b.Values) } if n < len(f.Blocks) { f.invalidateCFG() tail := f.Blocks[n:] for i := range tail { tail[i] = nil } f.Blocks = f.Blocks[:n] } } // emptyBlock reports whether the block does not contain actual // instructions func emptyBlock(b *Block) bool { for _, v := range b.Values { if v.Op != OpPhi { return false } } return true } // trimmableBlock reports whether the block can be trimmed from the CFG, // subject to the following criteria: // - it should not be the first block // - it should be BlockPlain // - it should not loop back to itself // - it either is the single predecessor of the successor block or // contains no actual instructions func trimmableBlock(b *Block) bool { if b.Kind != BlockPlain || b == b.Func.Entry { return false } s := b.Succs[0].b return s != b && (len(s.Preds) == 1 || emptyBlock(b)) } // mergePhi adjusts the number of `v`s arguments to account for merge // of `b`, which was `i`th predecessor of the `v`s block. func mergePhi(v *Value, i int, b *Block) { u := v.Args[i] if u.Block == b { if u.Op != OpPhi { b.Func.Fatalf("value %s is not a phi operation", u.LongString()) } // If the original block contained u = φ(u0, u1, ..., un) and // the current phi is // v = φ(v0, v1, ..., u, ..., vk) // then the merged phi is // v = φ(v0, v1, ..., u0, ..., vk, u1, ..., un) v.SetArg(i, u.Args[0]) v.AddArgs(u.Args[1:]...) } else { // If the original block contained u = φ(u0, u1, ..., un) and // the current phi is // v = φ(v0, v1, ..., vi, ..., vk) // i.e. it does not use a value from the predecessor block, // then the merged phi is // v = φ(v0, v1, ..., vk, vi, vi, ...) for j := 1; j < len(b.Preds); j++ { v.AddArg(v.Args[i]) } } }
Close
