-
Notifications
You must be signed in to change notification settings - Fork 23
/
compile.go
81 lines (72 loc) · 2.91 KB
/
compile.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
/*
* Copyright 2022 ByteDance Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package ssa
import (
`reflect`
`github.com/cloudwego/frugal/internal/atm/abi`
`github.com/cloudwego/frugal/internal/atm/hir`
)
type Pass interface {
Apply(*CFG)
}
type PassDescriptor struct {
Pass Pass
Name string
}
var Passes = [...]PassDescriptor {
{ Name: "Early Constant Propagation" , Pass: new(ConstProp) },
{ Name: "Early Reduction" , Pass: new(Reduce) },
{ Name: "Branch Elimination" , Pass: new(BranchElim) },
{ Name: "Return Spreading" , Pass: new(ReturnSpread) },
{ Name: "Value Reordering" , Pass: new(Reorder) },
{ Name: "Late Constant Propagation" , Pass: new(ConstProp) },
{ Name: "Late Reduction" , Pass: new(Reduce) },
{ Name: "Machine Dependent Lowering" , Pass: new(Lowering) },
{ Name: "Zero Register Substitution" , Pass: new(ZeroReg) },
{ Name: "Write Barrier Insertion" , Pass: new(WriteBarrier) },
{ Name: "ABI-Specific Lowering" , Pass: new(ABILowering) },
{ Name: "Instruction Fusion" , Pass: new(Fusion) },
{ Name: "Instruction Compaction" , Pass: new(Compaction) },
{ Name: "Block Merging" , Pass: new(BlockMerge) },
{ Name: "Critical Edge Splitting" , Pass: new(SplitCritical) },
{ Name: "Phi Propagation" , Pass: new(PhiProp) },
{ Name: "Operand Allocation" , Pass: new(OperandAlloc) },
{ Name: "Constant Rematerialize" , Pass: new(Rematerialize) },
{ Name: "Pre-allocation TDCE" , Pass: new(TDCE) },
{ Name: "Register Allocation" , Pass: new(RegAlloc) },
{ Name: "Stack Liveness Analysis" , Pass: new(StackLiveness) },
{ Name: "Function Layout" , Pass: new(Layout) },
}
func toFuncType(fn interface{}) reflect.Type {
if vt := reflect.TypeOf(fn); vt.Kind() != reflect.Func {
panic("ssa: fn must be a function prototype")
} else {
return vt
}
}
func executeSSAPasses(cfg *CFG) {
for _, p := range Passes {
p.Pass.Apply(cfg)
}
}
func Compile(p hir.Program, fn interface{}) (cfg *CFG) {
cfg = newGraphBuilder().build(p)
cfg.Layout = abi.ABI.LayoutFunc(-1, toFuncType(fn))
insertPhiNodes(cfg)
renameRegisters(cfg)
executeSSAPasses(cfg)
return
}