|
2 | 2 | # -*- coding: utf-8 -*- |
3 | 3 |
|
4 | 4 | """ |
5 | | -This takes a crashing qtest trace and tries to remove superflous operations |
| 5 | +This takes a crashing qtest trace and tries to remove superfluous operations |
6 | 6 | """ |
7 | 7 |
|
8 | 8 | import sys |
@@ -38,7 +38,7 @@ def usage(): |
38 | 38 | Options: |
39 | 39 |
|
40 | 40 | -M1: enable a loop around the remove minimizer, which may help decrease some |
41 | | - timing dependant instructions. Off by default. |
| 41 | + timing dependent instructions. Off by default. |
42 | 42 | -M2: try setting bits in operand of write/out to zero. Off by default. |
43 | 43 |
|
44 | 44 | """.format((sys.argv[0]))) |
@@ -177,7 +177,7 @@ def remove_lines(newtrace, outpath): |
177 | 177 | # it into two separate write commands. If splitting the data operand |
178 | 178 | # from length/2^n bytes to the left does not work, try to move the pivot |
179 | 179 | # to the right side, then add one to n, until length/2^n == 0. The idea |
180 | | - # is to prune unneccessary bytes from long writes, while accommodating |
| 180 | + # is to prune unnecessary bytes from long writes, while accommodating |
181 | 181 | # arbitrary MemoryRegion access sizes and alignments. |
182 | 182 |
|
183 | 183 | # This algorithm will fail under some rare situations. |
@@ -292,7 +292,7 @@ def minimize_trace(inpath, outpath): |
292 | 292 | old_len = len(newtrace) + 1 |
293 | 293 | while(old_len > len(newtrace)): |
294 | 294 | old_len = len(newtrace) |
295 | | - print("trace lenth = ", old_len) |
| 295 | + print("trace length = ", old_len) |
296 | 296 | remove_lines(newtrace, outpath) |
297 | 297 | if not M1 and not M2: |
298 | 298 | break |
|
0 commit comments