-
Notifications
You must be signed in to change notification settings - Fork 16
/
resource_zpa_policy_access_rule_reorder.go
364 lines (336 loc) · 10.3 KB
/
resource_zpa_policy_access_rule_reorder.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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
package zpa
import (
"fmt"
"log"
"sort"
"strconv"
"strings"
"sync"
"github.com/hashicorp/go-cty/cty"
"github.com/hashicorp/terraform-plugin-sdk/v2/diag"
"github.com/hashicorp/terraform-plugin-sdk/v2/helper/schema"
)
// Global variables for state management
var deceptionAccessPolicyRuleExist *bool // Pointer to check if deception rule exists.
var m sync.Mutex // Mutex to ensure thread safety.
// Validate the access policy rule's order.
func validateAccessPolicyRuleOrder(order string, zClient *Client) error {
m.Lock()
defer m.Unlock()
// Check if we've already verified the existence of the Deception rule.
if deceptionAccessPolicyRuleExist == nil {
policy, _, err := zClient.policysetcontroller.GetByNameAndType("ACCESS_POLICY", "Zscaler Deception")
if err != nil || policy == nil {
f := false
deceptionAccessPolicyRuleExist = &f
} else {
t := true
deceptionAccessPolicyRuleExist = &t
}
}
// If Deception rule doesn't exist or the order is empty, no further checks needed.
if deceptionAccessPolicyRuleExist != nil && !*deceptionAccessPolicyRuleExist || order == "" {
return nil
}
if order == "" {
return nil
}
// Convert string order to integer.
o, err := strconv.Atoi(order)
if err != nil {
return nil
}
// If the Deception rule exists, order should start from 2.
if o == 1 {
return fmt.Errorf("policy Zscaler Deception exists, order must start from 2")
}
return nil
}
// Define the Terraform resource for reordering policy access rules.
func resourcePolicyAccessRuleReorder() *schema.Resource {
return &schema.Resource{
Create: resourcePolicyAccessReorderUpdate,
Read: resourcePolicyAccessReorderRead,
Update: resourcePolicyAccessReorderUpdate,
Delete: resourcePolicyAccessReorderDelete,
Schema: map[string]*schema.Schema{
"policy_type": {
Type: schema.TypeString,
Required: true,
},
"rules": {
Type: schema.TypeSet,
Required: true,
Description: "List of rules and their orders",
MaxItems: 2000,
Elem: &schema.Resource{
Schema: map[string]*schema.Schema{
"id": {
Type: schema.TypeString,
Required: true,
},
"order": {
Type: schema.TypeString,
Required: true,
ValidateDiagFunc: func(v interface{}, p cty.Path) diag.Diagnostics {
order, _ := strconv.Atoi(v.(string))
if order <= 0 {
return diag.Diagnostics{
diag.Diagnostic{
Severity: diag.Error,
Summary: "Invalid order",
Detail: "Orders must start from 1, got:" + v.(string),
},
}
}
return nil
},
},
},
},
},
},
}
}
type RuleOrder struct {
ID string
Order int
OriginalOrder int
}
type RulesOrders struct {
PolicySetID string
PolicyType string
Orders []RuleOrder
}
// Validate that no two rules have the same order.
func validateRuleOrders(orders *RulesOrders) error {
// Sort rules by order.
sort.Slice(orders.Orders, func(i, j int) bool {
return orders.Orders[i].Order < orders.Orders[j].Order
})
// Check for orders <= 0
for _, rule := range orders.Orders {
if rule.Order <= 0 {
return fmt.Errorf("order must be a positive integer greater than 0")
}
}
// Check for duplicate order values.
if dupOrder, dupRuleIDs, ok := hasDuplicates(orders.Orders); ok {
return fmt.Errorf("duplicate order '%d' used by rules with IDs: %v", dupOrder, strings.Join(dupRuleIDs, ", "))
}
// Check for missing order numbers
missingOrders := findMissingOrders(orders.Orders)
exceededOrders := findExceededOrders(orders.Orders, len(orders.Orders))
errMsgs := make([]string, 0)
if len(missingOrders) > 0 {
errMsgs = append(errMsgs, fmt.Sprintf("missing rule order numbers: %v", missingOrders))
}
// Check if rule order numbers exceed the total number of rules available
if len(exceededOrders) > 0 {
errMsgs = append(errMsgs, fmt.Sprintf("rule orders (%v) exceed the total number of rules (%d)", exceededOrders, len(orders.Orders)))
}
if len(errMsgs) > 0 {
return fmt.Errorf(strings.Join(errMsgs, "; "))
}
return nil
}
// Check for duplicate order values.
func hasDuplicates(rules []RuleOrder) (int, []string, bool) {
ruleSet := make(map[int][]string)
for _, rule := range rules {
ruleSet[rule.Order] = append(ruleSet[rule.Order], rule.ID)
}
for order, ruleIDs := range ruleSet {
if len(ruleIDs) > 1 {
return order, ruleIDs, true
}
}
return 0, nil, false
}
// Function to find missing rule orders
func findMissingOrders(rules []RuleOrder) []int {
var missingOrders []int
ruleSet := make(map[int]bool)
for _, rule := range rules {
ruleSet[rule.Order] = true
}
for i := 1; i <= len(rules); i++ {
if !ruleSet[i] {
missingOrders = append(missingOrders, i)
}
}
return missingOrders
}
// Function to check if rule order numbers exceed the total number of rules available
func findExceededOrders(rules []RuleOrder, total int) []int {
var exceededOrders []int
for _, rule := range rules {
if rule.Order > total {
exceededOrders = append(exceededOrders, rule.Order)
}
}
return exceededOrders
}
func getRules(d *schema.ResourceData, zClient *Client) (*RulesOrders, error) {
policyType := d.Get("policy_type").(string)
globalPolicySet, err := GetGlobalPolicySetByPolicyType(zClient.policysetcontroller, policyType)
if err != nil {
log.Printf("[ERROR] reordering rules failed getting global policy set '%s': %v\n", policyType, err)
return nil, err
}
orders := RulesOrders{
PolicySetID: globalPolicySet.ID,
PolicyType: policyType,
Orders: []RuleOrder{},
}
rulesSet, ok := d.Get("rules").(*schema.Set)
if ok && rulesSet != nil {
for _, r := range rulesSet.List() {
rule, ok := r.(map[string]interface{})
if !ok || rule == nil {
continue
}
id := rule["id"].(string)
order, _ := strconv.Atoi(rule["order"].(string))
orders.Orders = append(orders.Orders, RuleOrder{
ID: id,
Order: order,
})
}
}
sort.Slice(orders.Orders, func(i, j int) bool {
return orders.Orders[i].Order < orders.Orders[j].Order
})
return &orders, nil
}
func resourcePolicyAccessReorderRead(d *schema.ResourceData, m interface{}) error {
zClient := m.(*Client)
rulesOrders, err := getRules(d, zClient)
if err != nil {
return err
}
rules, _, err := zClient.policysetcontroller.GetAllByType(rulesOrders.PolicyType)
if err != nil {
log.Printf("[ERROR] failed to get rules: %v\n", err)
return err
}
log.Printf("[INFO] reorder rules on read: %v\n", rulesOrders)
for _, r := range rules {
for i, r2 := range rulesOrders.Orders {
if r.ID == r2.ID {
rulesOrders.Orders[i].Order, _ = strconv.Atoi(r.RuleOrder)
}
}
}
rulesMap := []map[string]interface{}{}
for _, r := range rulesOrders.Orders {
rulesMap = append(rulesMap, map[string]interface{}{
"id": r.ID,
"order": strconv.Itoa(r.Order),
})
}
_ = d.Set("rules", rulesMap)
return nil
}
func resourcePolicyAccessReorderUpdate(d *schema.ResourceData, m interface{}) error {
// Convert the interface to a client instance.
zClient := m.(*Client)
// Fetch and sort the rule orders from the provided data.
rules, err := getRules(d, zClient)
if err != nil {
return err
}
// Validate the fetched rule orders.
if err := validateRuleOrders(rules); err != nil {
log.Printf("[ERROR] reordering rules failed: %v\n", err)
return err
}
d.SetId(rules.PolicySetID)
// Fetch the existing remote rules based on the policy type.
remoteRules, _, err := zClient.policysetcontroller.GetAllByType(rules.PolicyType)
if err != nil {
log.Printf("[ERROR] failed to get rules: %v\n", err)
return err
}
log.Printf("[INFO] reorder rules on update: %v\n", rules)
// Maps and slices for storing rule orders.
orders := map[int]RuleOrder{}
ordersList := []RuleOrder{}
// Iterate over the fetched rule orders to determine changes.
for _, r := range rules.Orders {
originalOrder := r.Order
for _, r2 := range remoteRules {
if r.ID == r2.ID {
if strconv.Itoa(r.Order) != r2.RuleOrder {
originalOrder, _ = strconv.Atoi(r2.RuleOrder)
}
break
}
}
o := RuleOrder{
ID: r.ID,
Order: r.Order,
OriginalOrder: originalOrder,
}
orders[r.Order] = o
ordersList = append(ordersList, o)
}
// Sort rules based on the order field.
sort.SliceStable(ordersList, func(i, j int) bool {
return ordersList[i].Order < ordersList[j].Order
})
// Re-check and re-order the rule set.
for _, r := range ordersList {
orderchanged := false
originalOrder := r.Order
found := false
// Check if there's a change in order for each rule against the remote set.
for _, r2 := range remoteRules {
if r.ID == r2.ID {
found = true
if strconv.Itoa(r.Order) != r2.RuleOrder {
orderchanged = true
originalOrder, _ = strconv.Atoi(r2.RuleOrder)
}
}
}
// If no match was found or order did not change, skip to the next iteration.
if !found || !orderchanged {
continue
}
// Check for special rules related to 'ACCESS_POLICY'.
if rules.PolicyType == "ACCESS_POLICY" {
if err := validateAccessPolicyRuleOrder(strconv.Itoa(r.Order), zClient); err != nil {
log.Printf("[ERROR] reordering rule ID '%s' failed, order validation error: %v\n", r.ID, err)
continue
}
}
_, err := zClient.policysetcontroller.Reorder(rules.PolicySetID, r.ID, r.Order)
if err != nil {
log.Printf("[ERROR] reordering rule ID '%s' failed: %v\n", r.ID, err)
}
// avoid NO adjacent rules issue
// Handle potential ordering issue related to adjacency.
if replacedByRule, ok := orders[r.OriginalOrder]; ok && replacedByRule.OriginalOrder == r.Order && r.Order != replacedByRule.Order+1 && r.Order != replacedByRule.Order-1 {
continue
}
// reconcile the remote rules copy
// Re-adjust the order of rules in the remote copy for consistency.
for i := range remoteRules {
if r.ID == remoteRules[i].ID {
continue
}
o, _ := strconv.Atoi(remoteRules[i].RuleOrder)
if originalOrder > r.Order && o >= r.Order && o < originalOrder {
remoteRules[i].RuleOrder = strconv.Itoa(o + 1)
} else if originalOrder < r.Order && o <= r.Order && o > originalOrder {
remoteRules[i].RuleOrder = strconv.Itoa(o - 1)
}
}
}
// Read the updated rule set.
return resourcePolicyAccessReorderRead(d, m)
}
func resourcePolicyAccessReorderDelete(d *schema.ResourceData, m interface{}) error {
return nil
}