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
|
# IBM_PROLOG_BEGIN_TAG
# This is an automatically generated prolog.
#
# $Source: src/test/testcases/testSecurity.py $
#
# OpenPOWER sbe Project
#
# Contributors Listed Below - COPYRIGHT 2017
# [+] International Business Machines Corp.
#
#
# 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.
#
# IBM_PROLOG_END_TAG
import os
import sys
import struct
SECURITY_FILE = "../../src/import/chips/p9/security/p9_security_white_black_list.csv"
SECURITY_SCRIPT = "../../src/build/security/securityRegListGen.py"
def getlist(cmd):
os.system("python "+SECURITY_SCRIPT+" "+cmd+" -f "+SECURITY_FILE+" > temp")
list = []
with open('temp', 'r') as f:
a = f.read()
list = a.split('[')[-1].split(']')[0].split(", ")
list = [eval(x) for x in list]
return list
def getmap(cmd):
map = ()
os.system("python "+SECURITY_SCRIPT+" "+cmd+" -f "+SECURITY_FILE+" > temp")
with open('temp', 'r') as f:
a = f.read()
map = eval(a.split('[')[-1].split(']')[0])
return map
# Takes around 27hrs to complete on tmux
BRUTE_FORCE_TEST = False
BRUTE_FORCE_LAST_ADDR = 0x000FFFFF
# Recommended to disable debug in brute force test
DEBUG = False
# Number of random addresses for negative testcase
NUM_RANDOM_ADDR = 100000
def main():
whitelist = getlist('-w')
whitelist_table1 = getmap('-W 1')
whitelist_table2 = getmap('-W 2')
whitelist_table3 = getlist('-W 3')
blacklist = getlist('-b')
blacklist_table1 = getmap('-B 1')
blacklist_table2 = getmap('-B 2')
blacklist_table3 = getlist('-B 3')
try:
if(BRUTE_FORCE_TEST == True):
test_brute_force('whitelist',
whitelist,
whitelist_table1,
whitelist_table2,
whitelist_table3)
else:
test_normal('whitelist',
whitelist,
whitelist_table1,
whitelist_table2,
whitelist_table3)
test_normal('blacklist',
blacklist,
blacklist_table1,
blacklist_table2,
blacklist_table3)
except Exception, error:
raise Exception(error)
def test_normal(id, list, table1, table2, table3):
# Positive testcase
num_list = [eval(a) for a in list]
for addr in num_list:
if(False == is_present(addr,
table1,
table2,
table3)):
print id, list
print 'table1:', table1
print 'table2:', table2
print 'table3:', table3
print "Failed Addr", hex(addr)
raise Exception(id+' positive testcase')
# negative testcase - number of random addresses checked is configurable
i = 0
while(i < NUM_RANDOM_ADDR):
i = i+1
random_addr = struct.unpack('>L', os.urandom(4))[0]
if(random_addr in num_list):
i = i-1
else:
if(True == is_present(random_addr, table1, table2, table3)):
print id, list
print 'table1:', table1
print 'table2:', table2
print 'table3:', table3
print "Failed Addr", hex(random_addr)
raise Exception(id+' negative testcase')
def test_brute_force(id, list, table1, table2, table3):
num_list = [eval(a) for a in list]
addr = 0
last_addr = BRUTE_FORCE_LAST_ADDR
while(addr <= last_addr):
if(addr not in num_list):
sys.stdout.write('\r')
sys.stdout.write("Progress: addr[0x%08x] last_addr[0x%08x]" % (addr, last_addr) )
sys.stdout.flush()
if(True == is_present(addr, table1, table2, table3)):
print id, list
print 'table1:', table1
print 'table2:', table2
print 'table3:', table3
print "Failed Addr", hex(addr)
raise Exception(id+' brute force testcase')
addr = addr + 1
def is_present(addr, table1, table2, table3):
t1_addr = (addr & 0xFF000000) >> 24;
if(DEBUG):
print "find", t1_addr, "in table1"
for id1, (chiplet_range, count) in enumerate(table1):
start = (chiplet_range & 0xFF00) >> 8
end = chiplet_range & 0x00FF
if( t1_addr >= start and t1_addr <= end ):
if(id1-1 < 0):
first_t2 = 0
else:
first_t2 = table1[id1-1][1]
last_t2 = count-1
t2_addr = (addr & 0x00FF0000) >> 16;
if(DEBUG):
print "find", t2_addr, "in table2", first_t2, last_t2
(found, id2) = binary_search(t2_addr, table2, first_t2, last_t2, True)
if(found):
if(id2-1 < 0):
first_t3 = 0
else:
first_t3 = table2[id2-1][1]
last_t3 = table2[id2][1]-1
t3_addr = (addr & 0x0000FFFF)
if(DEBUG):
print "find",t3_addr,"in table3", first_t3, last_t3
(found, id3) = binary_search(t3_addr, table3, first_t3, last_t3)
if(found):
if(DEBUG):
print "found"
return True
return False
def binary_search(item, list, first, last, isMap = False):
found = False
found_index = 0
while(first<=last and not found):
midpoint = (first+last)//2
if(isMap):
ele = list[midpoint][0]
else:
ele = list[midpoint]
if(item == ele):
found = True
found_index = midpoint
else:
if(item < ele):
last = midpoint-1
else:
first = midpoint+1
return (found, found_index)
#-------------------------------------------------
# Calling all test code
#-------------------------------------------------
if __name__=="__main__":
main()
if err:
print ("\nTest Suite completed with error(s)")
else:
print ("\nTest Suite completed with no errors")
|
