forked from secretflow/scql
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathgraph_splitter.go
86 lines (79 loc) · 2.56 KB
/
graph_splitter.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
82
83
84
85
86
// Copyright 2023 Ant Group Co., Ltd.
//
// 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 optimizer
import (
"sort"
"github.com/secretflow/scql/pkg/interpreter/translator"
)
// PartySubDAG struct
type PartySubDAG struct {
Nodes []*translator.ExecutionNode
PartyCode string
PartyURL string
Credential string
}
func splitExecutionNode(node *translator.ExecutionNode) map[string]*translator.ExecutionNode {
result := make(map[string]*translator.ExecutionNode)
for _, party := range node.PartyCodeInfos.GetParties() {
result[party] = &translator.ExecutionNode{
ID: node.ID,
Name: node.Name,
OpType: node.OpType,
Inputs: node.Inputs,
Outputs: node.Outputs,
Attributes: node.Attributes,
}
}
return result
}
// Split a subDAG into several party subDAGs
func Split(subDag *SubDAG) (map[string]*PartySubDAG, error) {
partyNodes := make([]*translator.ExecutionNode, 0)
singlePartyNodes := make([]*translator.ExecutionNode, 0)
for node := range subDag.Nodes {
if len(node.PartyCodeInfos.GetParties()) == 1 {
singlePartyNodes = append(singlePartyNodes, node)
} else {
partyNodes = append(partyNodes, node)
}
}
sort.Slice(partyNodes, func(i, j int) bool { return partyNodes[i].Name < partyNodes[j].Name })
sort.Slice(singlePartyNodes, func(i, j int) bool { return singlePartyNodes[i].Name < singlePartyNodes[j].Name })
partyNodes = append(partyNodes, singlePartyNodes...)
result := make(map[string]*PartySubDAG)
for _, node := range partyNodes {
nodes := splitExecutionNode(node)
for party, n := range nodes {
_, ok := result[party]
if !ok {
url, err := node.PartyCodeInfos.GetUrlByParty(party)
if err != nil {
return nil, err
}
credential, err := node.PartyCodeInfos.GetCredentialByParty(party)
if err != nil {
return nil, err
}
result[party] = &PartySubDAG{
Nodes: make([]*translator.ExecutionNode, 0),
PartyCode: party,
PartyURL: url,
Credential: credential,
}
}
result[party].Nodes = append(result[party].Nodes, n)
}
}
return result, nil
}