-
Notifications
You must be signed in to change notification settings - Fork 4
/
dictionary.py
executable file
·1091 lines (876 loc) · 30.6 KB
/
dictionary.py
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
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, You can obtain one at http://mozilla.org/MPL/2.0/.
import static
import struct
from Peach import generator, group
from Peach.group import GroupSequence
from Peach.generator import *
from Peach.Generators.block import Block3
from Peach.Generators.static import *
#__all__ = ['Dictionary', 'GeneratorList', 'GeneratorList2', 'List', 'BinaryList']
class Flags2(SimpleGenerator):
"""
Define the layout of flags and provide a generator for each. Each flag
has a position, length, and generator. The Flag itself also has a total
length and byte order (litte or big). If values generated for each field in
the flag are masked such as they always fit and do not affect other fields
in the flag.
Example:
>>> gen = Flags2(None, 8, [ [0, 1, Bit()], [4, 1, Bit()], [6, 2, List(None, [0, 1, 2])] ])
>>> print gen.getValue()
0
>>> gen.next()
>>> print gen.getValue()
81
>>> gen.next()
>>> print gen.getValue()
145
>>> gen.next()
>>> print gen.getValue()
209
"""
def __init__(self, group, length, flags, isLittleEndian=True):
"""
@type group: Group
@param group: Group for this Generator
@type length: Integer
@type length: Length of flag field, must be 8, 16, 32, or 64.
@type flags: Array of Arrays
@param flags: Each sub-array must contain a position (zero based),
length (in bits), and a generator.
"""
SimpleGenerator.__init__(self, group)
if length % 2 != 0:
raise Exception("Invalid length argument. Length must be multiple of 2!")
for flag in flags:
if flag[0] > length:
raise Exception("Flag position larger then length")
if (flag[0] + flag[1]) > length:
raise Exception("Flag position + flag length larger then length")
self.length = length
self.flags = flags
# flags needs to contain position and length
def next(self):
done = True
for flag in self.flags:
try:
flag[2].next()
done = False
except GeneratorCompleted:
pass
if done:
raise GeneratorCompleted("Flags are done")
def getRawValue(self):
ret = 0
for flag in self.flags:
mask = 0x00 << self.length - (flag[0] + flag[1])
cnt = flag[0] + flag[1] - 1
for i in range(flag[1]):
#print "<< %d" % cnt
mask |= 1 << cnt
cnt -= 1
#print "Mask:",repr(mask)
flagValue = flag[2].getValue()
if flagValue is None or flagValue == 'None':
flagValue = 0
ret |= mask & (int(flagValue) << flag[0])
return ret
class Dictionary(generator.Generator):
"""
Iterates through a collection of values stored in a file.
Possible uses could be to brute force passwords or try a set of
known bad values.
"""
_fileName = None
_fd = None
_currentValue = None
def __init__(self, group, fileName):
"""
@type group: Group
@param group: Group this Generator belongs to
@type fileName: string
@param fileName: Name of file use
"""
Generator.__init__(self)
self._fileName = fileName
self.setGroup(group)
def getFilename(self):
"""
Get name of file.
@rtype: string
@return: name of file
"""
return self._fileName
def setFilename(self, filename):
"""
Set filename.
@type filename: string
@param filename: Filename to use
"""
self._fileName = filename
def next(self):
if self._fd is None:
self._fd = open(self._fileName, 'rb')
if self._fd is None:
raise Exception('Unable to open', self._fileName)
oldValue = self._currentValue
self._currentValue = self._fd.readline()
if self._currentValue is None or len(self._currentValue) == 0:
self._currentValue = oldValue
raise generator.GeneratorCompleted("Dictionary completed for file [%s]" % self._fileName)
self._currentValue = self._currentValue.rstrip("\r\n")
def getRawValue(self):
if self._fd is None:
self._fd = open(self._fileName, 'rb')
if self._fd is None:
raise Exception('Unable to open', self._fileName)
if self._currentValue is None:
self._currentValue = self._fd.readline()
self._currentValue = self._currentValue.rstrip("\r\n")
return self._currentValue
def reset(self):
self._fd = None
self._currentValue = None
@staticmethod
def unittest():
g = group.Group()
dict = Dictionary(g, 'samples/dict.txt')
try:
while g.next():
print(dict.getValue())
except group.GroupCompleted:
pass
g.reset()
try:
while g.next():
print(dict.getValue())
except group.GroupCompleted:
pass
class List(generator.Generator):
"""
Iterates through a specified list of values. When the end of the list is
reached a generator.GeneratorCompleted exceoption is raised. Last item
will be returned until reset is called.
Example:
>>> list = List(None, ['1', '2', '3'])
>>> list.getValue()
1
>>> list.next()
>>> list.getValue()
2
>>> list.next()
>>> list.getValue()
3
"""
_list = None
_curPos = 0
def __init__(self, group, list=None):
"""
@type group: Group
@param group: Group this Generator belongs to
@type list: list
@param list: List of values to iterate through
"""
Generator.__init__(self)
self.setGroup(group)
self._list = list
self._curPos = 0
if self._list is None:
self._list = []
def reset(self):
self._curPos = 0
def next(self):
self._curPos += 1
if self._curPos >= len(self._list):
self._curPos -= 1
raise generator.GeneratorCompleted("List")
def getRawValue(self):
return self._list[self._curPos]
def getList(self):
"""
Get current list of values.
@rtype: list
@return: Current list of values
"""
return self._list
def setList(self, list):
"""
Set list of values.
@type list: list
@param list: List of values
"""
self._list = list
if self._list is None:
self._list = []
@staticmethod
def unittest():
g = group.Group()
list = List(g, ['A', 'B', 'C', 'D'])
if list.getValue() != 'A':
raise Exception("List unittest failed 1")
g.next()
if list.getValue() != 'B':
raise Exception("List unittest failed 2")
g.next()
if list.getValue() != 'C':
raise Exception("List unittest failed 3")
g.next()
if list.getValue() != 'D':
raise Exception("List unittest failed 4")
try:
g.next()
raise Exception("List unittest failed 5")
except group.GroupCompleted:
pass
try:
g.next()
raise Exception("List unittest failed 5")
except group.GroupCompleted:
pass
if list.getValue() != 'D':
raise Exception("List unittest failed 6")
list = List(g, [1, 2, 3, 4, 5])
try:
while g.next():
print(list.getValue())
except group.GroupCompleted:
pass
class BinaryList(List):
"""
Iterates through a specified list of binary values. When the end
of the list is reached a generator.GeneratorCompleted exceoption
is raised.
"""
_packString = 'b'
def __init__(self, group, list=None, packString=None):
"""
@type group: Group
@param group: Group this Generator belongs to
@type list: list
@param list: List of values to iterate through
@type packString: string
@param packString: Defaults to 'b'
"""
Generator.__init__(self)
List.__init__(self, group, list)
self._packString = packString
def getRawValue(self):
out = self._list[self._curPos]
if self._packString is not None:
return struct.pack(self._packString, out)
return out
@staticmethod
def unittest():
g = group.Group()
list = BinaryList(g, [0, 1, 2, 3], '>B')
try:
while g.next():
print(list.getValue())
except group.GroupCompleted:
pass
class _ArrayList(generator.Generator):
"""Internal helper class"""
def __init__(self, listOfLists):
self._listOfLists = listOfLists
self._pos = 0
self._block = Block(self._listOfLists[self._pos])
def getRawValue(self):
return self._block
def next(self):
if (self._pos + 1) >= len(self._listOfLists):
raise generator.GeneratorCompleted("ArrayList")
self._pos += 1
self._block = Block(self._listOfLists[self._pos])
def reset(self):
self._pos = 0
import random
class GeneratorChoice(generator.Generator):
"""
Will choose from a list of Generators. See use cases below for
further description of operation:
Case 1 - minOccurs and maxOccurs are 1. In this case a single
generator is selected N times.
Case 2 - minOccurs is 1 and maxOccurs is 100. In this case
N sets of random items are chosen.
Case 3 - minOccurs is 0 and maxOccurs is 1. You will always
get 1 case were 0 items are chosen and 1 case of
other items chosen
Currently N == 10.
"""
def __init__(self, group, minOccurs, maxOccurs, groups, list, n=10, name=None):
"""
@type group: Group
@param group: Group this Generator belongs to
@type list: list
@param list: List of Generators to choose frome
@type name: string
@type name: Name of generator
"""
generator.Generator.__init__(self)
self.n = n
self.minOccurs = minOccurs
self.maxOccurs = maxOccurs
self._curPos = 0
self.setName(name)
if group is not None:
self.setGroup(group)
self._groups = groups
self._list = list
if self._list is None or self._groups is None:
raise Exception("groups and list cannot be None.")
if len(self._list) != len(self._groups):
raise Exception("groups and list must have same number of items!")
if len(self._list) < self.maxOccurs:
self.maxOccurs = len(self._list)
# handle case 1 - minOccurs == 1 and maxOccurs == 1
if self.minOccurs == 1 and self.maxOccurs == 1:
theGroups = []
theItems = []
# select a single generator
if len(self._list) <= self.n:
sample = range(len(self._list))
else:
sample = random.sample(range(len(self._list)), self.n)
for n in sample:
theGroups.append(self._groups[n])
theItems.append(self._list[n])
self.generator = GeneratorList2(None, theGroups, theItems)
# handle case 3 -- minOccurs == 0, maxOccurs == 1
elif self.minOccurs == 0 and self.maxOccurs == 1:
theGroups = []
theItems = []
if self.maxOccurs - self.minOccurs <= self.n:
sample = range(self.maxOccurs - self.minOccurs)
else:
sample = random.sample(range(len(self._list)), self.n)
for n in sample:
theGroups.append(self._groups[n])
theItems.append(self._list[n])
self.generator = GeneratorList(None, [
Static(''),
GeneratorList2(None, theGroups, theItems)
])
# handle case 2 - minOccurs == 1, maxOccurs == 100
else:
theGeneratorLists = []
sample = None
if self.maxOccurs - self.minOccurs <= self.n:
sample = range(self.maxOccurs - self.minOccurs)
else:
sample = random.sample(range(self.minOccurs, self.maxOccurs), self.n)
for n in sample:
theGroups = []
theItems = []
subSample = random.sample(range(len(self._list)), n)
subSample.sort()
# remove dups
old = -1
newSample = []
for x in subSample:
if x != old:
old = x
newSample.append(x)
subSample = newSample
for x in subSample:
theGroups.append(self._groups[x])
theItems.append(self._list[x])
theGeneratorLists.append(Block3(GroupSequence(theGroups), theItems))
self.generator = GeneratorList(None, theGeneratorLists)
def next(self):
self.generator.next()
def reset(self):
self.generator.reset()
def getRawValue(self):
return self.generator.getValue()
class GeneratorList(generator.Generator):
"""
Iterates through a specified list of generators. When the end of the list is
reached a generator.GeneratorCompleted exceoption is raised.
NOTE: Generators are incremented by this object so DON'T SET A GROUP ON THEM!
NOTE: We only increment to next generator in list when the GeneratorCompleted
exception has been thrown from current generator. This allows one todo kewl
things like have 2 static generators, then a dictionary, then a repeater.
Example:
>>> gen = GeneratorList(None, [
... Static('1'),
... Static('2'),
... Static('3')
... ])
>>> print gen.getValue()
1
>>> gen.next()
>>> print gen.getValue()
2
>>> gen.next()
>>> print gen.getValue()
3
>>> try:
... gen.next() # Will raise GeneraterCompleted exception
... except:
... pass
>>> print gen.getValue() # notice we get last value again.
3
Example:
>>> gen = GeneratorList(None, [
... Repeater(None, Static('Peach'), 1, 2),
... Static('Hello World')
... ])
>>> print gen.getValue()
Peach
>>> gen.next()
>>> print gen.getValue()
PeachPeach
>>> gen.next()
>>> print gen.getValue()
Hello World
>>> try:
... gen.next() # Will raise GeneraterCompleted exception
... except:
... pass
>>> print gen.getValue() # notice we get last value again.
Hello World
Bad Example, group set on Generator in list:
>>> group = Group()
>>> gen = GeneratorList(group, [
... Repeater(group, Static('Peach'), 1, 2),
... Static('Hello World')
... ])
>>> print gen.getValue()
Peach
>>> group.next()
>>> print gen.getValue()
Hello World
>>> try:
... gen.next() # Will raise GeneraterCompleted exception
... except:
... pass
>>> print gen.getValue() # notice we get last value again.
Hello World
"""
def __init__(self, group, list, name=None):
"""
@type group: Group
@param group: Group this Generator belongs to
@type list: list
@param list: List of Generators to iterate through
@type name: string
@type name: Name of generator
"""
Generator.__init__(self)
self._curPos = 0
self.setName(name)
if group is not None:
self.setGroup(group)
self._list = list
if self._list is None:
self._list = []
def next(self):
try:
self._list[self._curPos].next()
except generator.GeneratorCompleted:
#print "Peach.dictionary.GeneratorList2.next(): caught GeneratorCompleted"
self._curPos += 1
if self._curPos >= len(self._list):
self._curPos -= 1
#print "Peach.dictionary.GeneratorList2.next(): throwing complete exceptions"
raise generator.GeneratorCompleted("Peach.dictionary.GeneratorList")
def reset(self):
self._curPos = 0
for i in self._list:
i.reset()
def getRawValue(self):
# Use .getValue to make sure we
# pick up any transformers
value = self._list[self._curPos].getValue()
#if value is None:
# print "Peach.dictionary.GeneratorList.getRawValue(): getValue() was None"
# print "Peach.dictionary.GeneratorList.getRawValue(): Name is %s" % self._list[self._curPos].getName()
# print "Peach.dictionary.GeneratorList.getRawValue(): Type is %s" % self._list[self._curPos]
return value
def getList(self):
"""
Get list of Generators.
@rtype: list
@return: list of Generators
"""
return self._list
def setList(self, list):
"""
Set list of Generators.
@type list: list
@param list: List of Generators
"""
self._list = list
if self._list is None:
self._list = []
@staticmethod
def unittest():
g = group.Group()
list = GeneratorList(g, [static.Static('A'), static.Static('B'), static.Static('C')])
try:
while g.next():
print(list.getValue())
except group.GroupCompleted:
pass
class GeneratorList2(GeneratorList):
"""
Iterates through a specified list of generators (different group control).
When the end of the list is reached a generator.GeneratorCompleted exceoption
is raised.
This generator differs from GeneratorList by allowing one group to
drive the rounds, but associating different sub groups to each generator.
When the master group is incremented the group for the current generator is
also incremented. This allows more complex control of how generators
create data.
NOTE: We only increment to next generator in list when the GeneratorCompleted
exception has been thrown from current generator. This allows one todo kewl
things like have 2 static generators, then a dictionary, then a repeater.
Example:
>>> groupA = Group()
>>> groupBA = Group()
>>> groupBB = Group()
>>> groupB = GroupForeachDo(groupBA, groupBB)
>>>
>>> gen = GeneratorList2(None, [groupA, groupB], [
... Repeater(groupA, Static('A'), 1, 1, 3),
... Block([
... List(groupBA, [':', '\\', '/']),
... Repeater(groupBB, Static('B'), 1, 1, 3)
... ])
... ])
>>>
>>> print gen.getValue()
A
>>> gen.next()
>>> gen.getValue()
AA
>>> gen.next()
>>> gen.getValue()
AAA
>>> gen.next()
>>> gen.getValue()
:B
>>> gen.next()
>>> gen.getValue()
:BB
>>> gen.next()
>>> gen.getValue()
:BBB
>>> gen.next()
>>> gen.getValue()
\B
>>> gen.next()
>>> gen.getValue()
\BB
>>> gen.next()
>>> gen.getValue()
\BBB
>>> gen.next()
>>> gen.getValue()
/B
>>> gen.next()
>>> gen.getValue()
/BB
>>> gen.next()
>>> gen.getValue()
/BBB
@see: L{GeneratorList}
"""
#_groupList = None
def __init__(self, group, groupList=None, list=None, name=None):
"""
@type group: Group
@param group: Group this Generator belongs to
@type groupList: list
@param groupList: List of Groups to use on generators
@type list: list
@param list: List of Generators to iterate through
@type name: String
@param name: [optional] Name for this Generator. Used for debugging.
"""
Generator.__init__(self)
self.setGroup(group)
self.generators = self._list = list
self.groups = self._groupList = groupList
self.setName(name)
self._curPos = 0
if self._list is None:
self._list = []
if self._groupList is None:
self._groupList = []
self.reset()
def next(self):
try:
self._groupList[self._curPos].next()
#print "GeneratorList2.next(): ..."
except group.GroupCompleted:
#print "GeneratorList2.next(): Next pos [%d]" % self._curPos
#print "GeneratorList2.next(): %d items in our list" % len(self._list)
self._curPos += 1
if self._curPos < len(self._list):
self._groupList[self._curPos].reset()
#except:
# print "GeneratorList2.next(): Caught some other exception"
if self._curPos >= len(self._list):
self._curPos -= 1
#print "%s: GeneratorList2.next() Completed" % name
raise generator.GeneratorCompleted("Peach.dictionary.GeneratorList2")
def setGroups(self, list):
"""
Set list of Groups.
@type list: list
@param list: List of Groups
"""
self._groupList = list
if self._groupList is None:
self._groupList = []
def reset(self):
self._curPos = 0
for i in self._list:
i.reset()
for i in self._groupList:
i.reset()
@staticmethod
def unittest():
g = group.Group()
list = GeneratorList2(g, [static.Static('A'), static.Static('B'), static.Static('C')])
try:
while g.next():
print(list.getValue())
except group.GroupCompleted:
pass
class GeneratorListGroupMaster(GeneratorList2):
"""
Provides a mechanism to create in effect a group of GeneratorList2's that
will progress and increment together drivin by the master of the group. This
Generator is the Group Master generator and controls the slaves of the
group.
This generator comes in handy when you have two bits of data that are
logically linked but in separate places. An example would be a length of
data being generated. Both values are parameters and generated separaetly
but a test calls for performing different length tests against different
data being generated (zero length data and 100 bytes of data say) which
would be a subset of the noramally generated data.
Example:
>>> groupNormalBlock = Group()
>>> groupForeachBlock = Group()
>>> groupDoLength = Group()
>>> groupForeachBlockDoLength = GroupForeachDo(groupForeachBlock, groupDoLength)
>>>
>>> genBlock = GeneratorListGroupMaster(None, [
... groupNormalBlock,
... groupForeachBlockDoLength
... ], [
...
... # Our normal tests
... GeneratorList(groupNormalBlock, [
... Static('A'),
... Static('BB'),
... ]),
...
... # For each of these do all the length tests
... GeneratorList(groupForeachBlock, [
... Static(''),
... Static('PEACH' * 10),
... ]),
... ])
>>>
>>> genLength = GeneratorListGroupSlave([
... None,
... None,
... ], [
... # generated value for the normal block tests
... BlockSize(genBlock),
...
... # actual length tests
... GeneratorList(groupDoLength, [
... NumberVariance(None, BlockSize(genBlock), 20),
... BadNumbers(),
... ])
... ], genBlock)
>>>
>>> print genBlock.getValue()
A
>>> print genLength.getValue()
1
>>> genBlock.next()
>>> print genBlock.getValue()
BB
>>> print genLength.getValue()
2
>>> genBlock.next()
>>> print genBlock.getValue()
>>> print genLength.getValue()
-20
"""
_slaves = []
_completed = False
def __init__(self, group, groupList, list, slaves=None, name=None):
"""
@type group: Group
@param group: Group this Generator belongs to
@type groupList: list
@param groupList: List of Groups to use on generators
@type list: list
@param list: List of Generators to iterate through
@type name: String
@param name: [optional] Name for this Generator. Used for debugging.
"""
GeneratorList2.__init__(self, group, groupList, list, name)
if slaves is not None:
self._slaves = slaves
else:
self._slaves = []
def next(self):
if self._completed:
raise generator.GeneratorCompleted("Peach.dictionary.GeneratorListGroupMaster")
moveNext = True
# next our current generator
try:
self._groupList[self._curPos].next()
moveNext = False
except group.GroupCompleted:
pass
# next the generator for each of our slaves
for slave in self._slaves:
try:
slave.slaveNext()
moveNext = False
except group.GroupCompleted:
pass
if moveNext:
print("GeneratorListGroupMaster.next(): Next pos [%d]" % self._curPos)
if (self._curPos + 1) >= len(self._list):
self._completed = True
# Let the slaves know we are done
for slave in self._slaves:
slave.slaveCompleted()
raise generator.GeneratorCompleted("Peach.dictionary.GeneratorListGroupMaster")
# Move us and everyone else to next position
self._curPos += 1
for slave in self._slaves:
slave.slaveNextPosition()
def reset(self):
self._completed = False
self._curPos = 0
for i in self._list:
i.reset()
for i in self._groupList:
i.reset()
for slave in self._slaves:
slave.reset()
def addSlave(self, slave):
self._slaves.append(slave)
class GeneratorListGroupSlave(GeneratorList2):
"""
Provides a mechanism to create in effect a group of GeneratorList2's that
will progress and increment together drivin by the master of the group. This
Generator is the slave of ghr group and is controlled by the master. More
then one slave can be part of the group.
This generator comes in handy when you have two bits of data that are
logically linked but in separate places. An example would be a length of
data being generated. Both values are parameters and generated separaetly
but a test calls for performing different length tests against different
data being generated (zero length data and 100 bytes of data say) which
would be a subset of the noramally generated data.
Example:
>>> groupNormalBlock = Group()
>>> groupForeachBlock = Group()
>>> groupDoLength = Group()
>>> groupForeachBlockDoLength = GroupForeachDo(groupForeachBlock, groupDoLength)
>>>
>>> genBlock = GeneratorListGroupMaster(None, [
... groupNormalBlock,
... groupForeachBlockDoLength
... ], [
...
... # Our normal tests
... GeneratorList(groupNormalBlock, [
... Static('A'),
... Static('BB'),
... ]),
...
... # For each of these do all the length tests
... GeneratorList(groupForeachBlock, [
... Static(''),
... Static('PEACH' * 10),
... ]),
... ])
>>>
>>> genLength = GeneratorListGroupSlave([