-
Notifications
You must be signed in to change notification settings - Fork 65
/
expressions.py
2426 lines (2079 loc) · 67.2 KB
/
expressions.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
# -*- coding: utf-8 -*-
# This code is part of Amoco
# Copyright (C) 2006-2011 Axel Tillequin (bdcht3@gmail.com)
# published under GPLv2 license
"""
cas/expressions.py
==================
The expressions module implements all above :class:`exp` classes.
All symbolic representation of data in amoco rely on these expressions.
"""
from amoco.config import conf
from amoco.logger import Log
logger = Log(__name__)
logger.debug("loading module")
from amoco.ui import render
import operator
# decorators:
# ------------
def _checkarg1_exp(f):
def checkarg1_exp(*args):
if len(args) > 0 and isinstance(args[0], exp):
return f(*args)
else:
logger.error("first arg is not an expression")
raise TypeError(args)
return checkarg1_exp
def _checkarg_sizes(f):
def checkarg_sizes(self, n):
if self.size != n.size:
if self.size > 0 and n.size > 0:
logger.error("size mismatch")
raise ValueError(n)
return f(self, n)
return checkarg_sizes
def _checkarg_numeric(f):
def checkarg_numeric(self, n):
if isinstance(n, int):
n = cst(n, self.size)
elif isinstance(n, (float)):
n = cfp(n, self.size)
return f(self, n)
return checkarg_numeric
def _checkarg_slice(f):
def checkarg_slice(self, *args):
i = args[0]
if isinstance(i, slice):
if i.step != None:
raise ValueError(i)
if i.start < 0 or i.stop > self.size:
logger.error("size mismatch")
raise ValueError(i)
if i.stop <= i.start:
logger.error("invalid slice")
raise ValueError(i)
else:
logger.error("argument should be a slice")
raise TypeError(i)
return f(self, *args)
return checkarg_slice
# expression types:
et_cst = 0x00001
et_reg = 0x00002
# note: 0x00004 \
# note: 0x00008 / these 2 values are used as variants to other types.
et_vra = 0x00004
et_vrb = 0x00008
# note: 0x000#0 is for reg subtypes (STD/PC/FLAG/STACK/OTHER)
et_slc = 0x00100
et_ext = 0x00200
et_lab = 0x00400
et_mem = 0x00800
et_ptr = 0x01000
et_tst = 0x02000
et_eqn = 0x04000
et_vec = 0x08000
et_cmp = 0x10000
et_blb = 0x20000
et_msk = 0x3ffff
# ------------------------------------------------------------------------------
# exp is the core class for all expressions.
# It defines mandatory attributes, shared methods like dumps/loads, etc.
# ------------------------------------------------------------------------------
class exp(object):
"""the core class for all expressions.
It defines mandatory attributes, shared methods like dumps/loads etc.
Attributes:
size (int): the bit size of the expression (default is 0.)
sf (Bool): the sign flag of the expression (default is False: unsigned.)
length (int): the byte size of the expression.
mask (int): the bit mask of the expression.
Note:
len(exp) returns the byte size, assuming that size is a multiple of 8.
"""
etype = 0
__slots__ = ["size", "sf"]
def __init__(self, size=0, sf=False):
self.size = size
self.sf = False
def __len__(self):
return self.length
def signed(self):
"consider expression as signed"
self.sf = True
return self
def unsigned(self):
"consider expression as unsigned"
self.sf = False
return self
@property
def length(self): # length value is in bytes
return self.size // 8
@property
def mask(self):
return (1 << self.size) - 1
def eval(self, env):
"evalute expression in given :class:`mapper` env"
if self._is_top:
return top(self.size)
if not self._is_def:
return exp(self.size)
else:
raise NotImplementedError("can't eval %s" % self)
def simplify(self, **kargs):
"simplify expression based on predefined heuristics"
return self
def depth(self):
"depth size of the expression tree"
return 1.0
def addr(self, env):
raise TypeError("exp has no address")
def dumps(self):
"pickle expression"
from pickle import dumps, HIGHEST_PROTOCOL
return dumps(self, HIGHEST_PROTOCOL)
def loads(self, s):
"unpickle expression"
from pickle import loads
self = loads(s)
return self
def __unicode__(self):
if self._is_top:
return render.icons.top+("%d" % self.size)
if not self._is_def:
return render.icons.bot+("%d" % self.size)
raise ValueError("void expression")
def __str__(self):
res = self.__unicode__()
try:
return str(res)
except UnicodeEncodeError:
return res.encode("utf-8")
def toks(self, **kargs):
"returns list of pretty printing tokens of the expression"
return [(render.Token.Literal, "%s" % self)]
def pp(self, **kargs):
"pretty-printed string of the expression"
return render.highlight(self.toks(**kargs))
def bit(self, i):
"extract i-th bit expression of the expression"
i = i % self.size
return self[i : i + 1]
def bytes(self, sta=0, sto=None, endian=1):
"""
returns the expression slice located at bytes [sta,sto]
taking into account given endianess 1 (little)
or -1 (big). Defaults to little endian.
"""
s = slice(sta, sto)
l = self.length
sta, sto, stp = s.indices(l)
if endian == -1:
sta, sto = l - sto, l - sta
return self[sta * 8 : sto * 8]
# get item allows to extract the expression of a slice of the exp
@_checkarg_slice
def __getitem__(self, i):
return slicer(self, i.start, i.stop - i.start)
# set item allows to insert the expression of a slice in the exp
# note: most child classes can't really inherit from this method
# since the method makes sense only by returning an comp object
# while __setitem__ is supposed to modify self...
@_checkarg_slice
def __setitem__(self, i, e):
res = comp(self.size)
res[0 : res.size] = self
res[i.start : i.stop] = e
return res.simplify()
def extend(self, sign, size):
"extend expression to given size, taking sign into account"
xt = size - self.size
if xt <= 0:
return self
sb = self[self.size - 1 : self.size]
if sign is True:
xx = tst(sb, cst(-1, xt), cst(0, xt))
xx.sf = True
else:
xx = cst(0, xt)
xx.sf = False
return composer([self, xx])
def signextend(self, size):
"sign extend expression to given size"
return self.extend(True, size)
def zeroextend(self, size):
"zero extend expression to given size"
return self.extend(False, size)
# arithmetic / logic methods : These methods are shared by all nodes.
# unary operators:
def __invert__(self):
return oper(OP_NOT, self)
def __neg__(self):
return oper(OP_MIN, self)
def __pos__(self):
return self
# binary operators:
@_checkarg_numeric
def __add__(self, n):
return oper(OP_ADD, self, n)
@_checkarg_numeric
def __sub__(self, n):
return oper(OP_MIN, self, n)
@_checkarg_numeric
def __mul__(self, n):
return oper(OP_MUL, self, n)
@_checkarg_numeric
def __pow__(self, n):
return oper(OP_MUL2, self, n)
@_checkarg_numeric
def __truediv__(self, n):
return oper(OP_DIV, self, n)
@_checkarg_numeric
def __div__(self, n):
return oper(OP_DIV, self, n)
@_checkarg_numeric
def __truediv__(self, n):
return oper(OP_DIV, self, n)
@_checkarg_numeric
def __mod__(self, n):
return oper(OP_MOD, self, n)
@_checkarg_numeric
def __floordiv__(self, n):
return oper(OP_ASR, self, n)
@_checkarg_numeric
def __and__(self, n):
return oper(OP_AND, self, n)
@_checkarg_numeric
def __or__(self, n):
return oper(OP_OR, self, n)
@_checkarg_numeric
def __xor__(self, n):
return oper(OP_XOR, self, n)
# reflected operand cases:
@_checkarg_numeric
def __radd__(self, n):
return oper(OP_ADD, n, self)
@_checkarg_numeric
def __rsub__(self, n):
return oper(OP_MIN, n, self)
@_checkarg_numeric
def __rmul__(self, n):
return oper(OP_MUL, n, self)
@_checkarg_numeric
def __rpow__(self, n):
return oper(OP_MUL2, n, self)
@_checkarg_numeric
def __rand__(self, n):
return oper(OP_AND, n, self)
@_checkarg_numeric
def __ror__(self, n):
return oper(OP_OR, n, self)
@_checkarg_numeric
def __rxor__(self, n):
return oper(OP_XOR, n, self)
# shifts:
@_checkarg_numeric
def __lshift__(self, n):
return oper(OP_LSL, self, n)
@_checkarg_numeric
def __rshift__(self, n):
return oper(OP_LSR, self, n)
# WARNING: comparison operators cmp returns a python bool
# but any other operators always return an expression !
def __hash__(self):
return hash("%s" % self) + self.size
# An expression defaults to False, and only bit1 will return True.
def __bool__(self):
return False
def __eq__(self, n):
# we inline checkarg_numeric only here:
if isinstance(n, int):
n = cst(n, self.size)
elif isinstance(n, (float)):
n = cfp(n, self.size)
if hash(self) == hash(n):
return bit1
return oper(OP_EQ, self, n)
@_checkarg_numeric
def __ne__(self, n):
if hash(self) == hash(n):
return bit0
return oper(OP_NEQ, self, n)
@_checkarg_numeric
def __lt__(self, n):
if hash(self) == hash(n):
return bit0
return oper(OP_LT, self, n)
@_checkarg_numeric
def __le__(self, n):
if hash(self) == hash(n):
return bit1
return oper(OP_LE, self, n)
@_checkarg_numeric
def __ge__(self, n):
if hash(self) == hash(n):
return bit1
return oper(OP_GE, self, n)
@_checkarg_numeric
def __gt__(self, n):
if hash(self) == hash(n):
return bit0
return oper(OP_GT, self, n)
def to_smtlib(self, solver=None):
"translate expression to its smt form"
logger.warning("no SMT solver defined")
raise NotImplementedError
def is_(self,t):
return t & self.etype
def set_top(self):
self.etype = ~(~self.etype & et_msk)
@property
def _is_def(self):
return self.etype > 0
@property
def _is_top(self):
return self.etype < 0
@property
def _is_cst(self):
return et_cst & self.etype
@property
def _is_reg(self):
return et_reg & self.etype
@property
def _is_cmp(self):
return et_cmp & self.etype
@property
def _is_slc(self):
return et_slc & self.etype
@property
def _is_mem(self):
return et_mem & self.etype
@property
def _is_ext(self):
return et_ext & self.etype
@property
def _is_lab(self):
return et_lab & self.etype
@property
def _is_ptr(self):
return et_ptr & self.etype
@property
def _is_tst(self):
return et_tst & self.etype
@property
def _is_eqn(self):
return et_eqn & self.etype
@property
def _is_vec(self):
return et_vec & self.etype
class top(exp):
"""
top expression represents symbolic values
that have reached a high complexity threshold.
Note:
This expression is an absorbing element of the
algebra. Any expression that involves a top
expression results in a top expression.
"""
etype = -et_msk-1
__hash__ = exp.__hash__
__eq__ = exp.__eq__
def depth(self):
return float("inf")
# -----------------------------------
# cst holds numeric immediate values
# -----------------------------------
class cst(exp):
"""
cst expression represents concrete values (constants).
Attributes:
value (int): get the integer of the expression, taking into account
the sign flag.
"""
__slots__ = ["v"]
etype = et_cst
__hash__ = exp.__hash__
__eq__ = exp.__eq__
def __init__(self, v, size=32):
if isinstance(v, bool): # only True/False forces size=1 (not 0/1 !)
v = 1 if v else 0
size = 1
self.sf = False if v >= 0 else True
self.size = size
self.v = v & self.mask
@property
def value(self):
if self.sf and (self.v >> (self.size - 1) == 1):
return -(self.v ^ self.mask) - 1
else:
return self.v
# for slicing purpose:
def __index__(self):
return self.value
# coercion to Python int:
def __int__(self):
return self.value
# defaults to signed hex base
def __unicode__(self):
return "{:#x}".format(self.value)
def toks(self, **kargs):
return [(render.Token.Constant, "%s" % self)]
def to_sym(self, ref):
"cast into a symbol expression associated to name ref"
return sym(ref, self.v, self.size)
def to_bytes(self,endian=1):
s = []
v = self.v
for i in range(0,self.size,8):
s.append(v&0xff)
v = v>>8
return bytes(s[::endian])
# eval of cst is always itself: (sf flag conserved)
def eval(self, env):
return cst(self.value, self.size)
def zeroextend(self, size):
return cst(self.v, max(size, self.size))
def signextend(self, size):
sf = self.sf
self.sf = True
v = self.value
self.sf = sf
return cst(v, max(size, self.size))
# bit-slice (returns cst) :
@_checkarg_slice
def __getitem__(self, i):
start = i.start or 0
stop = i.stop or self.size
return cst(self.v >> start, stop - start)
def __invert__(self):
# note: masking is needed because python uses unlimited ints
# so ~0x80 means not(...0000080) = ...fffffef
return cst((~(self.v)) & self.mask, self.size)
def __neg__(self):
return cst(-(self.value), self.size)
@_checkarg_numeric
@_checkarg_sizes
def __add__(self, n):
if n._is_cst:
return cst(self.value + n.value, self.size)
else:
return exp.__add__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __sub__(self, n):
if n._is_cst:
return cst(self.value - n.value, self.size)
else:
return exp.__sub__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __mul__(self, n):
if n._is_cst:
return cst(self.value * n.value, self.size)
else:
return exp.__mul__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __pow__(self, n):
if n._is_cst:
return cst(self.value * n.value, 2 * self.size)
else:
return exp.__pow__(self, n)
@_checkarg_numeric
def __div__(self, n):
if n._is_cst:
return cst(self.value // n.value, self.size)
else:
return exp.__div__(self, n)
@_checkarg_numeric
def __truediv__(self, n):
if n._is_cst:
return cst(self.value // n.value, self.size)
else:
return exp.__truediv__(self, n)
@_checkarg_numeric
def __div__(self, n):
if n._is_cst:
return cst(self.value // n.value, self.size)
else:
return exp.__div__(self, n)
@_checkarg_numeric
def __mod__(self, n):
if n._is_cst:
return cst(self.value % n.value, self.size)
else:
return exp.__mod__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __and__(self, n):
if n._is_cst:
return cst(self.v & n.v, self.size)
else:
return exp.__and__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __or__(self, n):
if n._is_cst:
return cst(self.v | n.v, self.size)
else:
return exp.__or__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __xor__(self, n):
if n._is_cst:
return cst(self.v ^ n.v, self.size)
else:
return exp.__xor__(self, n)
@_checkarg_numeric
def __lshift__(self, n):
if n._is_cst:
return cst(self.value << n.value, self.size)
else:
return exp.__lshift__(self, n)
@_checkarg_numeric
def __rshift__(self, n):
self.sf = False # rshift implements logical right shift
if n._is_cst:
return cst(self.value >> n.value, self.size)
else:
return exp.__rshift__(self, n)
@_checkarg_numeric
def __floordiv__(self, n):
self.sf = True # floordiv implements arithmetic right shift
if n._is_cst:
return cst(self.value >> n.value, self.size)
else:
return exp.__floordiv__(self, n)
@_checkarg_numeric
def __radd__(self, n):
return n + self
@_checkarg_numeric
def __rsub__(self, n):
return n - self
@_checkarg_numeric
def __rmul__(self, n):
return n * self
@_checkarg_numeric
def __rpow__(self, n):
return n ** self
@_checkarg_numeric
def __rdiv__(self, n):
return n / self
@_checkarg_numeric
def __rand__(self, n):
return n & self
@_checkarg_numeric
def __ror__(self, n):
return n | self
@_checkarg_numeric
def __rxor__(self, n):
return n ^ self
# the only atom that is considered True is the cst(1,1) (ie bit1 below)
def __bool__(self):
if self.size == 1 and self.v == 1:
return True
else:
return False
@_checkarg_numeric
@_checkarg_sizes
def __eq__(self, n):
if n._is_cst:
return cst(self.v == n.v)
else:
return exp.__eq__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __ne__(self, n):
if n._is_cst:
return cst(self.v != n.v)
else:
return exp.__ne__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __lt__(self, n):
if n._is_cst:
return cst(self.value < n.value)
else:
return exp.__lt__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __le__(self, n):
if n._is_cst:
return cst(self.value <= n.value)
else:
return exp.__le__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __ge__(self, n):
if n._is_cst:
return cst(self.value >= n.value)
else:
return exp.__ge__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __gt__(self, n):
if n._is_cst:
return cst(self.value > n.value)
else:
return exp.__gt__(self, n)
bit0 = cst(0, 1)
bit1 = cst(1, 1)
assert bool(bit1)
class sym(cst):
"symbol expression extends cst with a reference name for pretty printing"
__slots__ = ["ref"]
__hash__ = cst.__hash__
__eq__ = exp.__eq__
def __init__(self, ref, v, size=32):
self.ref = ref
cst.__init__(self, v, size)
def __unicode__(self):
return "#%s" % self.ref
class cfp(exp):
"floating point concrete value expression"
__slots__ = ["v"]
__hash__ = exp.__hash__
__eq__ = exp.__eq__
etype = et_cst
def __init__(self, v, size=32):
self.size = size
self.v = float(v)
@property
def value(self):
return self.v
# coercion to integer:
def __int__(self):
return NotImplementedError
def __unicode__(self):
return "{:f}".format(self.value)
def toks(self, **kargs):
return [(render.Token.Constant, "%s" % self)]
def eval(self, env):
return cfp(self.value, self.size)
def __neg__(self):
return cfp(-(self.value), self.size)
@_checkarg_numeric
@_checkarg_sizes
def __add__(self, n):
if n._is_cst:
return cfp(self.v + n.value, self.size)
else:
return exp.__add__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __sub__(self, n):
if n._is_cst:
return cfp(self.v - n.value, self.size)
else:
return exp.__sub__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __mul__(self, n):
if n._is_cst:
return cfp(self.v * n.value, self.size)
else:
return exp.__mul__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __pow__(self, n):
if n._is_cst:
return cfp(self.v * n.value, self.size)
else:
return exp.__pow__(self, n)
@_checkarg_numeric
def __div__(self, n):
if n._is_cst:
return cfp(self.v / n.value, self.size)
else:
return exp.__div__(self, n)
@_checkarg_numeric
def __truediv__(self, n):
if n._is_cst:
return cfp(self.v / n.value, self.size)
else:
return exp.__truediv__(self, n)
@_checkarg_numeric
def __radd__(self, n):
return n + self
@_checkarg_numeric
def __rsub__(self, n):
return n - self
@_checkarg_numeric
def __rmul__(self, n):
return n * self
@_checkarg_numeric
def __rpow__(self, n):
return n ** self
@_checkarg_numeric
def __rdiv__(self, n):
return n / self
@_checkarg_numeric
@_checkarg_sizes
def __eq__(self, n):
if n._is_cst:
return cst(self.value == n.value)
else:
return exp.__eq__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __ne__(self, n):
if n._is_cst:
return cst(self.value != n.value)
else:
return exp.__ne__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __lt__(self, n):
if n._is_cst:
return cst(self.value < n.value)
else:
return exp.__lt__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __le__(self, n):
if n._is_cst:
return cst(self.value <= n.value)
else:
return exp.__le__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __ge__(self, n):
if n._is_cst:
return cst(self.value >= n.value)
else:
return exp.__ge__(self, n)
@_checkarg_numeric
@_checkarg_sizes
def __gt__(self, n):
if n._is_cst:
return cst(self.value > n.value)
else:
return exp.__gt__(self, n)
# ------------------------------------------------------------------------------
# reg holds 32-bit register reference (refname).
# ------------------------------------------------------------------------------
class reg(exp):
"symbolic register expression"
__slots__ = ["ref", "etype", "_subrefs", "__protect"]
__hash__ = exp.__hash__
__eq__ = exp.__eq__
def __init__(self, refname, size=32):
self.__protect = False
self.size = size
self.__protect = True
self.sf = False
self.ref = refname
self._subrefs = {}
self.etype = et_reg | (regtype.cur or regtype.STD)
def __unicode__(self):
return "%s" % self.ref
def toks(self, **kargs):
return [(render.Token.Register, "%s" % self)]
def eval(self, env):
r = env[self]
r.sf = self.sf
return r
def addr(self, env):
return self
def __setattr__(self, a, v):
if a == "size" and self.__protect == True:
raise AttributeError("protected attribute")
exp.__setattr__(self, a, v)
# howto pickle/unpickle reg objects:
def __setstate__(self, state):
v = state[1]
self.__protect = False
self.size = v["size"]
self.sf = v["sf"]
self.ref = v["ref"]
self.etype = v["etype"]
self._subrefs = v["_subrefs"]
self.__protect = v["_reg__protect"]
class regtype(object):
"""
decorator and context manager (with...) for associating
a register to a specific category among STD (standard),
PC (program counter), FLAGS, STACK, OTHER.
"""
STD = 0x00
PC = 0x10
FLAGS = 0x20
STACK = 0x40
OTHER = 0x80
cur = None
def __init__(self, t):
self.t = t
def __call__(self, r):
if not r._is_reg:
logger.error("pc decorator ignored (not a register)")
r.etype |= self.t
return r
def __enter__(self):
regtype.cur = self.t
def __exit__(self, exc_type, exc_value, traceback):
regtype.cur = None