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
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
|
# Copyright 2014-2015, Tresys Technology, LLC
#
# SPDX-License-Identifier: GPL-2.0-only
#
import collections
import typing
import pytest
import setools
from setools import TERuletype as TERT
from . import util
# Note: the testing for having correct rules on every edge is only
# performed once on the full graph, since it is assumed that NetworkX's
# Digraph.subgraph() function correctly copies the edge attributes into
# the subgraph.
@pytest.fixture
def analysis(compiled_policy: setools.SELinuxPolicy) -> setools.InfoFlowAnalysis:
perm_map = setools.PermissionMap("tests/library/perm_map")
ret = setools.InfoFlowAnalysis(compiled_policy, perm_map)
ret._build_graph()
return ret
@pytest.mark.obj_args("tests/library/infoflow.conf")
class TestInfoFlowAnalysis:
def test_full_graph(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis full graph."""
disconnected1 = analysis.policy.lookup_type("disconnected1")
disconnected2 = analysis.policy.lookup_type("disconnected2")
node1 = analysis.policy.lookup_type("node1")
node2 = analysis.policy.lookup_type("node2")
node3 = analysis.policy.lookup_type("node3")
node4 = analysis.policy.lookup_type("node4")
node5 = analysis.policy.lookup_type("node5")
node6 = analysis.policy.lookup_type("node6")
node7 = analysis.policy.lookup_type("node7")
node8 = analysis.policy.lookup_type("node8")
node9 = analysis.policy.lookup_type("node9")
nodes = set(analysis.G.nodes())
assert set([disconnected1, disconnected2, node1, node2, node3, node4, node5, node6, node7,
node8, node9]) == nodes
edges = set(analysis.G.out_edges())
assert set([(disconnected1, disconnected2),
(disconnected2, disconnected1),
(node1, node2),
(node1, node3),
(node2, node4),
(node3, node5),
(node4, node6),
(node5, node8),
(node6, node5),
(node6, node7),
(node8, node9),
(node9, node8)]) == edges
r = analysis.G.edges[disconnected1, disconnected2]["rules"]
assert len(r) == 1
util.validate_rule(r[0], TERT.allow, "disconnected1", "disconnected2", tclass="infoflow2",
perms=set(["super"]))
r = analysis.G.edges[disconnected2, disconnected1]["rules"]
assert len(r) == 1
util.validate_rule(r[0], TERT.allow, "disconnected1", "disconnected2", tclass="infoflow2",
perms=set(["super"]))
r = sorted(analysis.G.edges[node1, node2]["rules"])
assert len(r) == 2
util.validate_rule(r[0], TERT.allow, "node1", "node2", tclass="infoflow",
perms=set(["med_w"]))
util.validate_rule(r[1], TERT.allow, "node2", "node1", tclass="infoflow",
perms=set(["hi_r"]))
r = sorted(analysis.G.edges[node1, node3]["rules"])
assert len(r) == 1
util.validate_rule(r[0], TERT.allow, "node3", "node1", tclass="infoflow",
perms=set(["low_r", "med_r"]))
r = sorted(analysis.G.edges[node2, node4]["rules"])
assert len(r) == 1
util.validate_rule(r[0], TERT.allow, "node2", "node4", tclass="infoflow",
perms=set(["hi_w"]))
r = sorted(analysis.G.edges[node3, node5]["rules"])
assert len(r) == 1
util.validate_rule(r[0], TERT.allow, "node5", "node3", tclass="infoflow",
perms=set(["low_r"]))
r = sorted(analysis.G.edges[node4, node6]["rules"])
assert len(r) == 1
util.validate_rule(r[0], TERT.allow, "node4", "node6", tclass="infoflow2",
perms=set(["hi_w"]))
r = sorted(analysis.G.edges[node5, node8]["rules"])
assert len(r) == 1
util.validate_rule(r[0], TERT.allow, "node5", "node8", tclass="infoflow2",
perms=set(["hi_w"]))
r = sorted(analysis.G.edges[node6, node5]["rules"])
assert len(r) == 1
util.validate_rule(r[0], TERT.allow, "node5", "node6", tclass="infoflow",
perms=set(["med_r"]))
r = sorted(analysis.G.edges[node6, node7]["rules"])
assert len(r) == 1
util.validate_rule(r[0], TERT.allow, "node6", "node7", tclass="infoflow",
perms=set(["hi_w"]))
r = sorted(analysis.G.edges[node8, node9]["rules"])
assert len(r) == 1
util.validate_rule(r[0], TERT.allow, "node8", "node9", tclass="infoflow2",
perms=set(["super"]))
r = sorted(analysis.G.edges[node9, node8]["rules"])
assert len(r) == 1
util.validate_rule(r[0], TERT.allow, "node8", "node9", tclass="infoflow2",
perms=set(["super"]))
def test_minimum_3(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis with minimum weight 3."""
analysis.exclude = []
analysis.min_weight = 3
analysis._build_subgraph()
disconnected1 = analysis.policy.lookup_type("disconnected1")
disconnected2 = analysis.policy.lookup_type("disconnected2")
node1 = analysis.policy.lookup_type("node1")
node2 = analysis.policy.lookup_type("node2")
node3 = analysis.policy.lookup_type("node3")
node4 = analysis.policy.lookup_type("node4")
node5 = analysis.policy.lookup_type("node5")
node6 = analysis.policy.lookup_type("node6")
node7 = analysis.policy.lookup_type("node7")
node8 = analysis.policy.lookup_type("node8")
node9 = analysis.policy.lookup_type("node9")
# don't test nodes list, as disconnected nodes
# are not removed by subgraph generation. we
# assume NetworkX copies into the subgraph
# correctly.
edges = set(analysis.subG.out_edges())
assert set([(disconnected1, disconnected2),
(disconnected2, disconnected1),
(node1, node2),
(node1, node3),
(node2, node4),
(node4, node6),
(node5, node8),
(node6, node5),
(node6, node7),
(node8, node9),
(node9, node8)]) == edges
def test_minimum_8(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis with minimum weight 8."""
analysis.exclude = []
analysis.min_weight = 8
analysis._build_subgraph()
disconnected1 = analysis.policy.lookup_type("disconnected1")
disconnected2 = analysis.policy.lookup_type("disconnected2")
node1 = analysis.policy.lookup_type("node1")
node2 = analysis.policy.lookup_type("node2")
node4 = analysis.policy.lookup_type("node4")
node5 = analysis.policy.lookup_type("node5")
node6 = analysis.policy.lookup_type("node6")
node7 = analysis.policy.lookup_type("node7")
node8 = analysis.policy.lookup_type("node8")
node9 = analysis.policy.lookup_type("node9")
# don't test nodes list, as disconnected nodes
# are not removed by subgraph generation. we
# assume NetworkX copies into the subgraph
# correctly.
edges = set(analysis.subG.out_edges())
assert set([(disconnected1, disconnected2),
(disconnected2, disconnected1),
(node1, node2),
(node2, node4),
(node4, node6),
(node5, node8),
(node6, node7),
(node8, node9),
(node9, node8)]) == edges
def test_all_paths(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: all paths output"""
analysis.exclude = []
analysis.min_weight = 1
analysis.source = "node1"
analysis.target = "node4"
analysis.mode = setools.InfoFlowAnalysis.Mode.AllPaths
analysis.depth_limit = 3
paths = list(typing.cast(collections.abc.Iterable[setools.InfoFlowPath],
analysis.results()))
assert 1 == len(paths)
steps = list(paths[0])
assert 2 == len(steps)
step = steps[0]
assert isinstance(step.source, setools.Type)
assert isinstance(step.target, setools.Type)
assert step.source == "node1"
assert step.target == "node2"
for r in steps[0].rules:
assert TERT.allow == r.ruletype
step = steps[1]
assert isinstance(step.source, setools.Type)
assert isinstance(step.target, setools.Type)
assert step.source == "node2"
assert step.target == "node4"
for r in step.rules:
assert TERT.allow == r.ruletype
def test_all_shortest_paths(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: all shortest paths output"""
analysis.exclude = []
analysis.min_weight = 1
analysis.source = "node1"
analysis.target = "node4"
analysis.mode = setools.InfoFlowAnalysis.Mode.ShortestPaths
paths = list(typing.cast(collections.abc.Iterable[setools.InfoFlowPath],
analysis.results()))
assert 1 == len(paths)
steps = list(paths[0])
assert 2 == len(steps)
step = steps[0]
assert isinstance(step.source, setools.Type)
assert isinstance(step.target, setools.Type)
assert step.source == "node1"
assert step.target == "node2"
for r in steps[0].rules:
assert TERT.allow == r.ruletype
step = steps[1]
assert isinstance(step.source, setools.Type)
assert isinstance(step.target, setools.Type)
assert step.source == "node2"
assert step.target == "node4"
for r in step.rules:
assert TERT.allow == r.ruletype
def test_infoflows_out(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: flows out of a type"""
analysis.exclude = []
analysis.min_weight = 1
analysis.mode = setools.InfoFlowAnalysis.Mode.FlowsOut
analysis.depth_limit = 1
analysis.source = "node6"
for flow in analysis.results():
assert isinstance(flow, setools.InfoFlowStep)
assert isinstance(flow.source, setools.Type)
assert isinstance(flow.target, setools.Type)
assert flow.source == "node6"
for r in flow.rules:
assert TERT.allow == r.ruletype
def test_infoflows_in(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: flows in to a type"""
analysis.exclude = []
analysis.min_weight = 1
analysis.mode = setools.InfoFlowAnalysis.Mode.FlowsIn
analysis.depth_limit = 1
analysis.target = "node8"
for flow in analysis.results():
assert isinstance(flow, setools.InfoFlowStep)
assert isinstance(flow.source, setools.Type)
assert isinstance(flow.target, setools.Type)
assert flow.target == "node8"
for r in flow.rules:
assert TERT.allow == r.ruletype
def test_set_exclude_invalid_type(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: set invalid excluded type."""
with pytest.raises(setools.exception.InvalidType):
analysis.exclude = ["node1", "invalid_type"]
def test_set_small_min_weight(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: set too small weight."""
with pytest.raises(ValueError):
analysis.min_weight = 0
with pytest.raises(ValueError):
analysis.min_weight = -3
def test_set_large_min_weight(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: set too big weight."""
with pytest.raises(ValueError):
analysis.min_weight = 11
with pytest.raises(ValueError):
analysis.min_weight = 50
def test_invalid_source(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: invalid source type."""
with pytest.raises(setools.exception.InvalidType):
analysis.source = "invalid_type"
def test_invalid_target(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: invalid target type."""
with pytest.raises(setools.exception.InvalidType):
analysis.target = "invalid_type"
def test_all_paths_invalid_maxlen(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: all paths with invalid max path length."""
analysis.exclude = []
analysis.min_weight = 1
analysis.mode = setools.InfoFlowAnalysis.Mode.AllPaths
with pytest.raises(ValueError):
analysis.depth_limit = -2
def test_all_paths_source_excluded(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: all paths with excluded source type."""
analysis.exclude = ["node1"]
analysis.min_weight = 1
analysis.mode = setools.InfoFlowAnalysis.Mode.AllPaths
analysis.source = "node1"
analysis.target = "node2"
paths = list(analysis.results())
assert 0 == len(paths)
def test_all_paths_target_excluded(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: all paths with excluded target type."""
analysis.exclude = ["node2"]
analysis.min_weight = 1
analysis.mode = setools.InfoFlowAnalysis.Mode.AllPaths
analysis.source = "node1"
analysis.target = "node2"
paths = list(analysis.results())
assert 0 == len(paths)
def test_all_paths_source_disconnected(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: all paths with disconnected source type."""
analysis.exclude = []
analysis.min_weight = 1
analysis.mode = setools.InfoFlowAnalysis.Mode.AllPaths
analysis.source = "disconnected1"
analysis.target = "node2"
paths = list(analysis.results())
assert 0 == len(paths)
def test_all_paths_target_disconnected(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: all paths with disconnected target type."""
analysis.exclude = []
analysis.min_weight = 1
analysis.source = "node2"
analysis.target = "disconnected1"
analysis.mode = setools.InfoFlowAnalysis.Mode.AllPaths
paths = list(analysis.results())
assert 0 == len(paths)
def test_all_shortest_paths_source_excluded(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: all shortest paths with excluded source type."""
analysis.exclude = ["node1"]
analysis.min_weight = 1
analysis.mode = setools.InfoFlowAnalysis.Mode.ShortestPaths
analysis.source = "node1"
analysis.target = "node2"
paths = list(analysis.results())
assert 0 == len(paths)
def test_all_shortest_paths_target_excluded(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: all shortest paths with excluded target type."""
analysis.exclude = ["node2"]
analysis.min_weight = 1
analysis.mode = setools.InfoFlowAnalysis.Mode.ShortestPaths
analysis.source = "node1"
analysis.target = "node2"
paths = list(analysis.results())
assert 0 == len(paths)
def test_all_shortest_paths_source_disconnected(
self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: all shortest paths with disconnected source type."""
analysis.exclude = []
analysis.min_weight = 1
analysis.mode = setools.InfoFlowAnalysis.Mode.ShortestPaths
analysis.source = "disconnected1"
analysis.target = "node2"
paths = list(analysis.results())
assert 0 == len(paths)
def test_all_shortest_paths_target_disconnected(
self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: all shortest paths with disconnected target type."""
analysis.exclude = []
analysis.min_weight = 1
analysis.source = "node2"
analysis.target = "disconnected1"
analysis.mode = setools.InfoFlowAnalysis.Mode.ShortestPaths
paths = list(analysis.results())
assert 0 == len(paths)
def test_infoflows_source_excluded(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: infoflows with excluded source type."""
analysis.exclude = ["node1"]
analysis.min_weight = 1
analysis.mode = setools.InfoFlowAnalysis.Mode.FlowsOut
analysis.source = "node1"
paths = list(analysis.results())
assert 0 == len(paths)
def test_infoflows_source_disconnected(self, analysis: setools.InfoFlowAnalysis) -> None:
"""Information flow analysis: infoflows with disconnected source type."""
analysis.exclude = ["disconnected2"]
analysis.min_weight = 1
analysis.mode = setools.InfoFlowAnalysis.Mode.FlowsOut
analysis.source = "disconnected1"
paths = list(analysis.results())
assert 0 == len(paths)
|
