// VARDEF ops are scheduled before the corresponding LEA.
score[v.ID] = ScoreMemory
case v.Op == OpSelect0 || v.Op == OpSelect1 || v.Op == OpSelectN:
- if (v.Op == OpSelect1 || v.Op == OpSelect0) && (v.Args[0].isCarry() || v.Type.IsFlags()) {
+ if (v.Op == OpSelect1 || v.Op == OpSelect0) && (v.Args[0].Op.isCarry() || v.Type.IsFlags()) {
// When the Select pseudo op is being used for a carry or flag from
// a tuple then score it as ScoreFlags so it happens later. This
// prevents the bit from being clobbered before it is used.
} else {
score[v.ID] = ScoreReadTuple
}
- case v.isCarry():
- if w := v.getCarryInput(); w != nil && w.Block == b {
+ case v.Op.isCarry():
+ if w := v.getCarryProducer(); w != nil {
// The producing op is not the final user of the carry bit. Its
// current score is one of unscored, Flags, or CarryChainTail.
// These occur if the producer has not been scored, another user
// one chain to be scheduled, if possible.
score[v.ID] = ScoreCarryChainTail
}
- case v.isFlagOp():
+ case v.Type.IsFlags() || v.Type.IsTuple() && v.Type.FieldType(1).IsFlags():
// Schedule flag register generation as late as possible.
// This makes sure that we only have one live flags
// value at a time.
score[v.ID] = ScoreDefault
// If we're reading flags, schedule earlier to keep flag lifetime short.
for _, a := range v.Args {
- if a.isFlagOp() {
+ if a.Type.IsFlags() {
score[v.ID] = ScoreReadFlags
}
}
}
}
}
+
}
// To put things into a priority queue
v := heap.Pop(priq).(*Value)
- if f.pass.debug > 1 && score[v.ID] == ScoreCarryChainTail && v.isCarry() {
+ if f.pass.debug > 1 && score[v.ID] == ScoreCarryChainTail && v.Op.isCarry() {
// Add some debugging noise if the chain of carrying ops will not
// likely be scheduled without potential carry flag clobbers.
if !isCarryChainReady(v, uses) {
return order
}
-// isFlagOp reports if v is an OP with the flag type.
-func (v *Value) isFlagOp() bool {
- return v.Type.IsFlags() || v.Type.IsTuple() && v.Type.FieldType(1).IsFlags()
-}
-
-// isCarryChainReady reports whether all dependent carry ops can be scheduled after this.
+// Return whether all dependent carry ops can be scheduled after this.
func isCarryChainReady(v *Value, uses []int32) bool {
// A chain can be scheduled in it's entirety if
// the use count of each dependent op is 1. If none,
// schedule the first.
j := 1 // The first op uses[k.ID] == 0. Dependent ops are always >= 1.
- for k := v; k != nil; k = k.getCarryInput() {
+ for k := v; k != nil; k = k.getCarryProducer() {
j += int(uses[k.ID]) - 1
}
return j == 0
}
-// isCarryInput reports whether v accepts a carry value as input.
-func (v *Value) isCarryInput() bool {
- return v.getCarryInput() != nil
-}
-
-// isCarryOutput reports whether v generates a carry as output.
-func (v *Value) isCarryOutput() bool {
- if v.isFlagOp() && v.Op != OpSelect1 {
- return true
- }
- // special cases for PPC64 which put their carry values in XER instead of flags
- switch v.Op {
+// Return whether op is an operation which produces a carry bit value, but does not consume it.
+func (op Op) isCarryCreator() bool {
+ switch op {
case OpPPC64SUBC, OpPPC64ADDC, OpPPC64SUBCconst, OpPPC64ADDCconst:
return true
}
return false
}
-// isCarryCreator reports whether op is an operation which produces a carry bit value,
-// but does not consume it.
-func (v *Value) isCarryCreator() bool {
- return v.isCarryOutput() && !v.isCarryInput()
-}
-
-// isCarry reports whether op consumes or creates a carry a bit value.
-func (v *Value) isCarry() bool {
- return v.isCarryOutput() || v.isCarryInput()
+// Return whether op consumes or creates a carry a bit value.
+func (op Op) isCarry() bool {
+ switch op {
+ case OpPPC64SUBE, OpPPC64ADDE, OpPPC64SUBZEzero, OpPPC64ADDZEzero:
+ return true
+ }
+ return op.isCarryCreator()
}
-// getCarryProducer returns the producing *Value of the carry bit of this op, or nil if none.
-func (v *Value) getCarryInput() *Value {
- for _, a := range v.Args {
- if !a.isFlagOp() {
- continue
- }
- if a.Op == OpSelect1 {
- a = a.Args[0]
- }
- return a
- }
- // special cases for PPC64 which put their carry values in XER instead of flags
- switch v.Op {
- case OpPPC64SUBE, OpPPC64ADDE, OpPPC64SUBZEzero, OpPPC64ADDZEzero:
+// Return the producing *Value of the carry bit of this op, or nil if none.
+func (v *Value) getCarryProducer() *Value {
+ if v.Op.isCarry() && !v.Op.isCarryCreator() {
// PPC64 carry dependencies are conveyed through their final argument.
// Likewise, there is always an OpSelect1 between them.
return v.Args[len(v.Args)-1].Args[0]
t.Errorf("store order is wrong: got %v, want v2 v3 v4 after v5", order)
}
}
-
-func TestCarryChainOrder(t *testing.T) {
- // In the function below, there are two carry chains that have no dependencies on each other,
- // one is A1 -> A1carry -> A1Carryvalue, the other is A2 -> A2carry -> A2Carryvalue. If they
- // are not scheduled properly, the carry will be clobbered, causing the carry to be regenerated.
- c := testConfigARM64(t)
- fun := c.Fun("entry",
- Bloc("entry",
- Valu("mem0", OpInitMem, types.TypeMem, 0, nil),
- Valu("x", OpARM64MOVDconst, c.config.Types.UInt64, 5, nil),
- Valu("y", OpARM64MOVDconst, c.config.Types.UInt64, 6, nil),
- Valu("z", OpARM64MOVDconst, c.config.Types.UInt64, 7, nil),
- Valu("A1", OpARM64ADDSflags, types.NewTuple(c.config.Types.UInt64, types.TypeFlags), 0, nil, "x", "z"), // x+z, set flags
- Valu("A1carry", OpSelect1, types.TypeFlags, 0, nil, "A1"),
- Valu("A2", OpARM64ADDSflags, types.NewTuple(c.config.Types.UInt64, types.TypeFlags), 0, nil, "y", "z"), // y+z, set flags
- Valu("A2carry", OpSelect1, types.TypeFlags, 0, nil, "A2"),
- Valu("A1value", OpSelect0, c.config.Types.UInt64, 0, nil, "A1"),
- Valu("A1Carryvalue", OpARM64ADCzerocarry, c.config.Types.UInt64, 0, nil, "A1carry"), // 0+0+A1carry
- Valu("A2value", OpSelect0, c.config.Types.UInt64, 0, nil, "A2"),
- Valu("A2Carryvalue", OpARM64ADCzerocarry, c.config.Types.UInt64, 0, nil, "A2carry"), // 0+0+A2carry
- Valu("ValueSum", OpARM64ADD, c.config.Types.UInt64, 0, nil, "A1value", "A2value"),
- Valu("CarrySum", OpARM64ADD, c.config.Types.UInt64, 0, nil, "A1Carryvalue", "A2Carryvalue"),
- Valu("Sum", OpARM64AND, c.config.Types.UInt64, 0, nil, "ValueSum", "CarrySum"),
- Goto("exit")),
- Bloc("exit",
- Exit("mem0")),
- )
-
- CheckFunc(fun.f)
- schedule(fun.f)
-
- // The expected order is A1 < A1carry < A1Carryvalue < A2 < A2carry < A2Carryvalue.
- // There is no dependency between the two carry chains, so it doesn't matter which
- // comes first and which comes after, but the unsorted position of A1 is before A2,
- // so A1Carryvalue < A2.
- var ai, bi, ci, di, ei, fi int
- for i, v := range fun.f.Blocks[0].Values {
- switch {
- case fun.values["A1"] == v:
- ai = i
- case fun.values["A1carry"] == v:
- bi = i
- case fun.values["A1Carryvalue"] == v:
- ci = i
- case fun.values["A2"] == v:
- di = i
- case fun.values["A2carry"] == v:
- ei = i
- case fun.values["A2Carryvalue"] == v:
- fi = i
- }
- }
- if !(ai < bi && bi < ci && ci < di && di < ei && ei < fi) {
- t.Logf("Func: %s", fun.f)
- t.Errorf("carry chain order is wrong: got %v, want V%d after V%d after V%d after V%d after V%d after V%d,",
- fun.f.Blocks[0], fun.values["A1"].ID, fun.values["A1carry"].ID, fun.values["A1Carryvalue"].ID,
- fun.values["A2"].ID, fun.values["A2carry"].ID, fun.values["A2Carryvalue"].ID)
- }
-}