| blob | f6f347a052ea223ea6388550fe0134f6f2dfb6c3 |
2 /*---------------------------------------------------------------*/
3 /*--- begin libvex_ir.h ---*/
4 /*---------------------------------------------------------------*/
6 /*
7 This file is part of Valgrind, a dynamic binary instrumentation
8 framework.
10 Copyright (C) 2004-2017 OpenWorks LLP
11 info@open-works.net
13 This program is free software; you can redistribute it and/or
14 modify it under the terms of the GNU General Public License as
15 published by the Free Software Foundation; either version 2 of the
16 License, or (at your option) any later version.
18 This program is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with this program; if not, see <http://www.gnu.org/licenses/>.
26 The GNU General Public License is contained in the file COPYING.
28 Neither the names of the U.S. Department of Energy nor the
29 University of California nor the names of its contributors may be
30 used to endorse or promote products derived from this software
31 without prior written permission.
32 */
34 #ifndef __LIBVEX_IR_H
35 #define __LIBVEX_IR_H
40 /*---------------------------------------------------------------*/
41 /*--- High-level IR description ---*/
42 /*---------------------------------------------------------------*/
44 /* Vex IR is an architecture-neutral intermediate representation.
45 Unlike some IRs in systems similar to Vex, it is not like assembly
46 language (ie. a list of instructions). Rather, it is more like the
47 IR that might be used in a compiler.
49 Code blocks
50 ~~~~~~~~~~~
51 The code is broken into small code blocks ("superblocks", type:
52 'IRSB'). Each code block typically represents from 1 to perhaps 50
53 instructions. IRSBs are single-entry, multiple-exit code blocks.
54 Each IRSB contains three things:
55 - a type environment, which indicates the type of each temporary
56 value present in the IRSB
57 - a list of statements, which represent code
58 - a jump that exits from the end the IRSB
59 Because the blocks are multiple-exit, there can be additional
60 conditional exit statements that cause control to leave the IRSB
61 before the final exit. Also because of this, IRSBs can cover
62 multiple non-consecutive sequences of code (up to 3). These are
63 recorded in the type VexGuestExtents (see libvex.h).
65 Statements and expressions
66 ~~~~~~~~~~~~~~~~~~~~~~~~~~
67 Statements (type 'IRStmt') represent operations with side-effects,
68 eg. guest register writes, stores, and assignments to temporaries.
69 Expressions (type 'IRExpr') represent operations without
70 side-effects, eg. arithmetic operations, loads, constants.
71 Expressions can contain sub-expressions, forming expression trees,
72 eg. (3 + (4 * load(addr1)).
74 Storage of guest state
75 ~~~~~~~~~~~~~~~~~~~~~~
76 The "guest state" contains the guest registers of the guest machine
77 (ie. the machine that we are simulating). It is stored by default
78 in a block of memory supplied by the user of the VEX library,
79 generally referred to as the guest state (area). To operate on
80 these registers, one must first read ("Get") them from the guest
81 state into a temporary value. Afterwards, one can write ("Put")
82 them back into the guest state.
84 Get and Put are characterised by a byte offset into the guest
85 state, a small integer which effectively gives the identity of the
86 referenced guest register, and a type, which indicates the size of
87 the value to be transferred.
89 The basic "Get" and "Put" operations are sufficient to model normal
90 fixed registers on the guest. Selected areas of the guest state
91 can be treated as a circular array of registers (type:
92 'IRRegArray'), which can be indexed at run-time. This is done with
93 the "GetI" and "PutI" primitives. This is necessary to describe
94 rotating register files, for example the x87 FPU stack, SPARC
95 register windows, and the Itanium register files.
97 Examples, and flattened vs. unflattened code
98 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
99 For example, consider this x86 instruction:
101 addl %eax, %ebx
103 One Vex IR translation for this code would be this:
105 ------ IMark(0x24F275, 7, 0) ------
106 t3 = GET:I32(0) # get %eax, a 32-bit integer
107 t2 = GET:I32(12) # get %ebx, a 32-bit integer
108 t1 = Add32(t3,t2) # addl
109 PUT(0) = t1 # put %eax
111 (For simplicity, this ignores the effects on the condition codes, and
112 the update of the instruction pointer.)
114 The "IMark" is an IR statement that doesn't represent actual code.
115 Instead it indicates the address and length of the original
116 instruction. The numbers 0 and 12 are offsets into the guest state
117 for %eax and %ebx. The full list of offsets for an architecture
118 <ARCH> can be found in the type VexGuest<ARCH>State in the file
119 VEX/pub/libvex_guest_<ARCH>.h.
121 The five statements in this example are:
122 - the IMark
123 - three assignments to temporaries
124 - one register write (put)
126 The six expressions in this example are:
127 - two register reads (gets)
128 - one arithmetic (add) operation
129 - three temporaries (two nested within the Add32, one in the PUT)
131 The above IR is "flattened", ie. all sub-expressions are "atoms",
132 either constants or temporaries. An equivalent, unflattened version
133 would be:
135 PUT(0) = Add32(GET:I32(0), GET:I32(12))
137 IR is guaranteed to be flattened at instrumentation-time. This makes
138 instrumentation easier. Equivalent flattened and unflattened IR
139 typically results in the same generated code.
141 Another example, this one showing loads and stores:
143 addl %edx,4(%eax)
145 This becomes (again ignoring condition code and instruction pointer
146 updates):
148 ------ IMark(0x4000ABA, 3, 0) ------
149 t3 = Add32(GET:I32(0),0x4:I32)
150 t2 = LDle:I32(t3)
151 t1 = GET:I32(8)
152 t0 = Add32(t2,t1)
153 STle(t3) = t0
155 The "le" in "LDle" and "STle" is short for "little-endian".
157 No need for deallocations
158 ~~~~~~~~~~~~~~~~~~~~~~~~~
159 Although there are allocation functions for various data structures
160 in this file, there are no deallocation functions. This is because
161 Vex uses a memory allocation scheme that automatically reclaims the
162 memory used by allocated structures once translation is completed.
163 This makes things easier for tools that instruments/transforms code
164 blocks.
166 SSAness and typing
167 ~~~~~~~~~~~~~~~~~~
168 The IR is fully typed. For every IRSB (IR block) it is possible to
169 say unambiguously whether or not it is correctly typed.
170 Incorrectly typed IR has no meaning and the VEX will refuse to
171 process it. At various points during processing VEX typechecks the
172 IR and aborts if any violations are found. This seems overkill but
173 makes it a great deal easier to build a reliable JIT.
175 IR also has the SSA property. SSA stands for Static Single
176 Assignment, and what it means is that each IR temporary may be
177 assigned to only once. This idea became widely used in compiler
178 construction in the mid to late 90s. It makes many IR-level
179 transformations/code improvements easier, simpler and faster.
180 Whenever it typechecks an IR block, VEX also checks the SSA
181 property holds, and will abort if not so. So SSAness is
182 mechanically and rigidly enforced.
183 */
185 /*---------------------------------------------------------------*/
186 /*--- Type definitions for the IR ---*/
187 /*---------------------------------------------------------------*/
189 /* General comments about naming schemes:
191 All publically visible functions contain the name of the primary
192 type on which they operate (IRFoo, IRBar, etc). Hence you should
193 be able to identify these functions by grepping for "IR[A-Z]".
195 For some type 'IRFoo':
197 - ppIRFoo is the printing method for IRFoo, printing it to the
198 output channel specified in the LibVEX_Initialise call.
200 - eqIRFoo is a structural equality predicate for IRFoos.
202 - deepCopyIRFoo is a deep copy constructor for IRFoos.
203 It recursively traverses the entire argument tree and
204 produces a complete new tree. All types have a deep copy
205 constructor.
207 - shallowCopyIRFoo is the shallow copy constructor for IRFoos.
208 It creates a new top-level copy of the supplied object,
209 but does not copy any sub-objects. Only some types have a
210 shallow copy constructor.
211 */
213 /* ------------------ Types ------------------ */
215 /* A type indicates the size of a value, and whether it's an integer, a
216 float, or a vector (SIMD) value. */
217 typedef
220 Ity_I1,
221 Ity_I8,
222 Ity_I16,
223 Ity_I32,
224 Ity_I64,
234 Ity_V256 /* 256-bit SIMD */
235 }
236 IRType;
238 /* Pretty-print an IRType */
241 /* Get the size (in bytes) of an IRType */
244 /* Translate 1/2/4/8 into Ity_I{8,16,32,64} respectively. Asserts on
245 any other input. */
249 /* ------------------ Endianness ------------------ */
251 /* IREndness is used in load IRExprs and store IRStmts. */
252 typedef
255 Iend_BE /* big endian */
256 }
257 IREndness;
260 /* ------------------ Constants ------------------ */
262 /* IRConsts are used within 'Const' and 'Exit' IRExprs. */
264 /* The various kinds of constant. */
265 typedef
268 Ico_U8,
269 Ico_U16,
270 Ico_U32,
271 Ico_U64,
273 same encoding scheme as V128 */
276 as a IEEE754 single value. */
279 as a IEEE754 double value. */
281 (repeated 8 times) for each of the 16 x 1-byte lanes */
282 Ico_V256 /* 256-bit restricted vector constant, with 1 bit
283 (repeated 8 times) for each of the 32 x 1-byte lanes */
284 }
285 IRConstTag;
287 /* A constant. Stored as a tagged union. 'tag' indicates what kind of
288 constant this is. 'Ico' is the union that holds the fields. If an
289 IRConst 'c' has c.tag equal to Ico_U32, then it's a 32-bit constant,
290 and its value can be accessed with 'c.Ico.U32'. */
291 typedef
293 IRConstTag tag;
295 Bool U1;
296 UChar U8;
297 UShort U16;
298 UInt U32;
299 ULong U64;
300 UShort U128;
301 Float F32;
302 UInt F32i;
303 Double F64;
304 ULong F64i;
308 }
309 IRConst;
311 /* IRConst constructors */
325 /* Deep-copy an IRConst */
328 /* Pretty-print an IRConst */
331 /* Compare two IRConsts for equality */
335 /* ------------------ Call targets ------------------ */
337 /* Describes a helper function to call. The name part is purely for
338 pretty printing and not actually used. regparms=n tells the back
339 end that the callee has been declared
340 "__attribute__((regparm(n)))", although indirectly using the
341 VEX_REGPARM(n) macro. On some targets (x86) the back end will need
342 to construct a non-standard sequence to call a function declared
343 like this.
345 mcx_mask is a sop to Memcheck. It indicates which args should be
346 considered 'always defined' when lazily computing definedness of
347 the result. Bit 0 of mcx_mask corresponds to args[0], bit 1 to
348 args[1], etc. If a bit is set, the corresponding arg is excluded
349 (hence "x" in "mcx") from definedness checking.
350 */
352 typedef
354 Int regparms;
357 UInt mcx_mask;
358 }
359 IRCallee;
361 /* Create an IRCallee. */
364 /* Deep-copy an IRCallee. */
367 /* Pretty-print an IRCallee. */
371 /* ------------------ Guest state arrays ------------------ */
373 /* This describes a section of the guest state that we want to
374 be able to index at run time, so as to be able to describe
375 indexed or rotating register files on the guest. */
376 typedef
381 }
382 IRRegArray;
392 /* ------------------ Temporaries ------------------ */
394 /* This represents a temporary, eg. t1. The IR optimiser relies on the
395 fact that IRTemps are 32-bit ints. Do not change them to be ints of
396 any other size. */
399 /* Pretty-print an IRTemp. */
402 #define IRTemp_INVALID ((IRTemp)0xFFFFFFFF)
405 /* --------------- Primops (arity 1,2,3 and 4) --------------- */
407 /* Primitive operations that are used in Unop, Binop, Triop and Qop
408 IRExprs. Once we take into account integer, floating point and SIMD
409 operations of all the different sizes, there are quite a lot of them.
410 Most instructions supported by the architectures that Vex supports
411 (x86, PPC, etc) are represented. Some more obscure ones (eg. cpuid)
412 are not; they are instead handled with dirty helpers that emulate
413 their functionality. Such obscure ones are thus not directly visible
414 in the IR, but their effects on guest state (memory and registers)
415 are made visible via the annotations in IRDirty structures.
417 2018-Dec-27: some of int<->fp conversion operations have been renamed so as
418 to have a trailing _DEP, meaning "deprecated". This is because they don't
419 specify a rounding mode to be used for the conversion and so are
420 underspecified. Their use should be replaced with equivalents that do
421 specify a rounding mode, either as a first argument or using a suffix on the
422 name, that indicates the rounding mode to use.
423 */
424 typedef
426 /* -- Do not change this ordering. The IR generators rely on
427 (eg) Iop_Add64 == IopAdd8 + 3. -- */
432 /* Signless mul. MullS/MullU is elsewhere. */
440 /* Integer comparisons. */
443 /* Tags for unary ops */
446 /* Exactly like CmpEQ8/16/32/64, but carrying the additional
447 hint that these compute the success/failure of a CAS
448 operation, and hence are almost certainly applied to two
449 copies of the same value, which in turn has implications for
450 Memcheck's instrumentation. */
454 /* Exactly like CmpNE8/16/32/64, but carrying the additional
455 hint that these needs expensive definedness tracking. */
458 /* -- Ordering not important after here. -- */
460 /* Widening multiplies */
464 /* Counting bits */
465 /* Ctz64/Ctz32/Clz64/Clz32 are UNDEFINED when given arguments of zero.
466 You must ensure they are never given a zero argument. As of
467 2018-Nov-14 they are deprecated. Try to use the Nat variants
468 immediately below, if you can.
469 */
472 /* Count leading/trailing zeroes, with "natural" semantics for the
473 case where the input is zero: then the result is the number of bits
474 in the word. */
477 /* Population count -- compute the number of 1 bits in the argument. */
480 /* Standard integer comparisons */
486 /* As a sop to Valgrind-Memcheck, the following are useful. */
492 /* PowerPC-style 3-way integer comparisons. Without them it is
493 difficult to simulate PPC efficiently.
494 op(x,y) | x < y = 0x8 else
495 | x > y = 0x4 else
496 | x == y = 0x2
497 */
501 /* Division */
502 /* TODO: clarify semantics wrt rounding, negative values, whatever */
511 // concat with 32 0's (low))
514 // concat with 64 0's (low))
517 // concat with 128 0's (low))
521 // of which lo half is div and hi half is mod
525 // of which lo half is div and hi half is mod
529 // of which lo half is div and hi half is mod
531 // of which lo half is div and hi half is mod
533 // of which lo half is div and hi half is mod
535 // of which lo half is div and hi half is mod
540 /* Integer conversions. Some of these are redundant (eg
541 Iop_64to8 is the same as Iop_64to32 and then Iop_32to8), but
542 having a complete set reduces the typical dynamic size of IR
543 and makes the instruction selectors easier to write. */
545 /* Widening conversions */
548 Iop_32Uto64,
551 Iop_32Sto64,
553 /* Narrowing conversions */
555 /* 8 <-> 16 bit conversions */
559 /* 16 <-> 32 bit conversions */
563 /* 32 <-> 64 bit conversions */
567 /* 64 <-> 128 bit conversions */
571 /* 1-bit stuff */
585 /* ------ Floating point. We try to be IEEE754 compliant. ------ */
587 /* --- Simple stuff as mandated by 754. --- */
589 /* Binary operations, with rounding. */
590 /* :: IRRoundingMode(I32) x F64 x F64 -> F64 */
593 /* :: IRRoundingMode(I32) x F32 x F32 -> F32 */
596 /* Variants of the above which produce a 64-bit result but which
597 round their result to a IEEE float range first. */
598 /* :: IRRoundingMode(I32) x F64 x F64 -> F64 */
601 /* Unary operations, without rounding. */
602 /* :: F64 -> F64 */
605 /* :: F32 -> F32 */
608 /* :: F16 -> F16 */
611 /* Unary operations, with rounding. */
612 /* :: IRRoundingMode(I32) x F64 -> F64 */
613 Iop_SqrtF64,
615 /* :: IRRoundingMode(I32) x F32 -> F32 */
616 Iop_SqrtF32,
618 /* :: IRRoundingMode(I32) x F16 -> F16 */
619 Iop_SqrtF16,
621 /* :: IRRoundingMode(I32) x F16 x F16 -> F16 */
624 /* Comparison, yielding GT/LT/EQ/UN(ordered), as per the following:
625 0x45 Unordered
626 0x01 LT
627 0x00 GT
628 0x40 EQ
629 This just happens to be the Intel encoding. The values
630 are recorded in the type IRCmpF64Result.
631 */
632 /* :: F64 x F64 -> IRCmpF64Result(I32) */
633 Iop_CmpF64,
634 Iop_CmpF32,
635 Iop_CmpF16,
636 Iop_CmpF128,
638 /* --- Int to/from FP conversions. --- */
640 /* For the most part, these take a first argument :: Ity_I32 (as
641 IRRoundingMode) which is an indication of the rounding mode
642 to use, as per the following encoding ("the standard
643 encoding"):
644 00b to nearest (the default)
645 01b to -infinity
646 10b to +infinity
647 11b to zero
648 This just happens to be the Intel encoding. For reference only,
649 the PPC encoding is:
650 00b to nearest (the default)
651 01b to zero
652 10b to +infinity
653 11b to -infinity
654 Any PPC -> IR front end will have to translate these PPC
655 encodings, as encoded in the guest state, to the standard
656 encodings, to pass to the primops.
657 For reference only, the ARM VFP encoding is:
658 00b to nearest
659 01b to +infinity
660 10b to -infinity
661 11b to zero
662 Again, this will have to be converted to the standard encoding
663 to pass to primops.
665 If one of these conversions gets an out-of-range condition,
666 or a NaN, as an argument, the result is host-defined. On x86
667 the "integer indefinite" value 0x80..00 is produced. On PPC
668 it is either 0x80..00 or 0x7F..FF depending on the sign of
669 the argument.
671 On ARMvfp, when converting to a signed integer result, the
672 overflow result is 0x80..00 for negative args and 0x7F..FF
673 for positive args. For unsigned integer results it is
674 0x00..00 and 0xFF..FF respectively.
676 Rounding is required whenever the destination type cannot
677 represent exactly all values of the source type.
678 */
702 /* Conversion between floating point formats */
706 /* Reinterpretation. Take an F32/64/128 and produce an I32/64/128
707 with the same bit pattern, or vice versa. */
713 /* Support for 128-bit floating point */
718 /* :: IRRoundingMode(I32) x F128 x F128 -> F128 */
725 /* :: F128 -> F128 */
728 /* :: IRRoundingMode(I32) x F128 -> F128 */
729 Iop_SqrtF128,
749 /* Truncate to the specified value, source and result
750 * are stroed in a F128 register.
751 */
759 /* --- guest x86/amd64 specifics, not mandated by 754. --- */
761 /* Binary ops, with rounding. */
762 /* :: IRRoundingMode(I32) x F64 x F64 -> F64 */
771 /* Note that on x86 guest, PRem1{C3210} has the same behaviour
772 as the IEEE mandated RemF64, except it is limited in the
773 range of its operand. Hence the partialness. */
775 /* Unary ops, with rounding. */
776 /* :: IRRoundingMode(I32) x F64 -> F64 */
782 as F128) */
784 as F64) */
789 as F32) */
793 /* --- guest s390 specifics, not mandated by 754. --- */
795 /* Fused multiply-add/sub */
796 /* :: IRRoundingMode(I32) x F32 x F32 x F32 -> F32
797 (computes arg2 * arg3 +/- arg4) */
800 /* --- guest ppc32/64 specifics, not mandated by 754. --- */
802 /* Ternary operations, with rounding. */
803 /* Fused multiply-add/sub, with 112-bit intermediate
804 precision for ppc.
805 Also used to implement fused multiply-add/sub for s390. */
806 /* :: IRRoundingMode(I32) x F64 x F64 x F64 -> F64
807 (computes arg2 * arg3 +/- arg4) */
810 /* Variants of the above which produce a 64-bit result but which
811 round their result to a IEEE float range first. */
812 /* :: IRRoundingMode(I32) x F64 x F64 x F64 -> F64 */
815 /* :: F64 -> F64 */
822 /* :: F64 -> F32 */
825 /* :: IRRoundingMode(I32) x F64 -> F64 */
827 /* NB: pretty much the same as Iop_F64toF32, except no change
828 of type. */
830 /* --- guest arm64 specifics, not mandated by 754. --- */
835 /* --------- Possibly required by IEEE 754-2008. --------- */
842 /* ------------------ 16-bit scalar FP ------------------ */
850 /* ------------------ 32-bit SIMD Integer ------------------ */
852 /* 32x1 saturating add/sub (ok, well, not really SIMD :) */
853 Iop_QAdd32S,
854 Iop_QSub32S,
856 /* 16x2 add/sub, also signed/unsigned saturating variants */
861 /* 16x2 signed/unsigned halving add/sub. For each lane, these
862 compute bits 16:1 of (eg) sx(argL) + sx(argR),
863 or zx(argL) - zx(argR) etc. */
867 /* 8x4 add/sub, also signed/unsigned saturating variants */
872 /* 8x4 signed/unsigned halving add/sub. For each lane, these
873 compute bits 8:1 of (eg) sx(argL) + sx(argR),
874 or zx(argL) - zx(argR) etc. */
878 /* 8x4 sum of absolute unsigned differences. */
879 Iop_Sad8Ux4,
881 /* MISC (vector integer cmp != 0) */
884 /* Byte swap in a 32-bit word */
885 Iop_Reverse8sIn32_x1,
887 /* ------------------ 64-bit SIMD FP ------------------------ */
889 /* Conversion to/from int */
890 // Deprecated: these don't specify a rounding mode
895 /* Fixed32 format is floating-point number with fixed number of fraction
896 bits. The number of fraction bits is passed as a second argument of
897 type I8. */
901 /* Binary operations */
903 /* Pairwise Min and Max. See integer pairwise operations for more
904 details. */
906 /* Note: For the following compares, the arm front-end assumes a
907 nan in a lane of either argument returns zero for that lane. */
910 /* Vector Reciprocal Estimate finds an approximate reciprocal of each
911 element in the operand vector, and places the results in the destination
912 vector. */
913 Iop_RecipEst32Fx2,
915 /* Vector Reciprocal Step computes (2.0 - arg1 * arg2).
916 Note, that if one of the arguments is zero and another one is infinity
917 of arbitrary sign the result of the operation is 2.0. */
918 Iop_RecipStep32Fx2,
920 /* Vector Reciprocal Square Root Estimate finds an approximate reciprocal
921 square root of each element in the operand vector. */
922 Iop_RSqrtEst32Fx2,
924 /* Vector Reciprocal Square Root Step computes (3.0 - arg1 * arg2) / 2.0.
925 Note, that of one of the arguments is zero and another one is infiinty
926 of arbitrary sign the result of the operation is 1.5. */
927 Iop_RSqrtStep32Fx2,
929 /* Unary */
932 /* ------------------ 64-bit SIMD Integer. ------------------ */
934 /* MISC (vector integer cmp != 0) */
937 /* ADDITION (normal / unsigned sat / signed sat) */
942 /* PAIRWISE operations */
943 /* Iop_PwFoo16x4( [a,b,c,d], [e,f,g,h] ) =
944 [Foo16(a,b), Foo16(c,d), Foo16(e,f), Foo16(g,h)] */
950 /* Longening variant is unary. The resulting vector contains two times
951 less elements than operand, but they are two times wider.
952 Example:
953 Iop_PAddL16Ux4( [a,b,c,d] ) = [a+b,c+d]
954 where a+b and c+d are unsigned 32-bit values. */
958 /* SUBTRACTION (normal / unsigned sat / signed sat) */
963 /* ABSOLUTE VALUE */
966 /* MULTIPLICATION (normal / high half of signed/unsigned / plynomial ) */
968 Iop_Mul32Fx2,
969 Iop_MulHi16Ux4,
970 Iop_MulHi16Sx4,
971 /* Plynomial multiplication treats it's arguments as coefficients of
972 polynoms over {0, 1}. */
973 Iop_PolynomialMul8x8,
975 /* Vector Saturating Doubling Multiply Returning High Half and
976 Vector Saturating Rounding Doubling Multiply Returning High Half */
977 /* These IROp's multiply corresponding elements in two vectors, double
978 the results, and place the most significant half of the final results
979 in the destination vector. The results are truncated or rounded. If
980 any of the results overflow, they are saturated. */
984 /* AVERAGING: note: (arg1 + arg2 + 1) >>u 1 */
985 Iop_Avg8Ux8,
986 Iop_Avg16Ux4,
988 /* MIN/MAX */
994 /* COMPARISON */
999 /* COUNT ones / leading zeroes / leading sign bits (not including topmost
1000 bit) */
1001 Iop_Cnt8x8,
1004 Iop_Clz64x2,
1006 /*Vector COUNT trailing zeros */
1009 /* VECTOR x VECTOR SHIFT / ROTATE */
1015 /* VECTOR x SCALAR SHIFT (shift amt :: Ity_I8) */
1020 /* VECTOR x VECTOR SATURATING SHIFT */
1023 /* VECTOR x INTEGER SATURATING SHIFT */
1031 /* NARROWING (binary)
1032 -- narrow 2xI64 into 1xI64, hi half from left arg */
1033 /* For saturated narrowing, I believe there are 4 variants of
1034 the basic arithmetic operation, depending on the signedness
1035 of argument and result. Here are examples that exemplify
1036 what I mean:
1038 QNarrow16Uto8U ( UShort x ) if (x >u 255) x = 255;
1039 return x[7:0];
1041 QNarrow16Sto8S ( Short x ) if (x <s -128) x = -128;
1042 if (x >s 127) x = 127;
1043 return x[7:0];
1045 QNarrow16Uto8S ( UShort x ) if (x >u 127) x = 127;
1046 return x[7:0];
1048 QNarrow16Sto8U ( Short x ) if (x <s 0) x = 0;
1049 if (x >s 255) x = 255;
1050 return x[7:0];
1051 */
1052 Iop_QNarrowBin16Sto8Ux8,
1056 /* INTERLEAVING */
1057 /* Interleave lanes from low or high halves of
1058 operands. Most-significant result lane is from the left
1059 arg. */
1062 /* Interleave odd/even lanes of operands. Most-significant result lane
1063 is from the left arg. Note that Interleave{Odd,Even}Lanes32x2 are
1064 identical to Interleave{HI,LO}32x2 and so are omitted.*/
1068 /* CONCATENATION -- build a new value by concatenating either
1069 the even or odd lanes of both operands. Note that
1070 Cat{Odd,Even}Lanes32x2 are identical to Interleave{HI,LO}32x2
1071 and so are omitted. */
1075 /* GET / SET elements of VECTOR
1076 GET is binop (I64, I8) -> I<elem_size>
1077 SET is triop (I64, I8, I<elem_size>) -> I64 */
1078 /* Note: the arm back-end handles only constant second argument */
1082 /* DUPLICATING -- copy value to all lanes */
1085 /* SLICE -- produces the lowest 64 bits of (arg1:arg2) >> (8 * arg3).
1086 arg3 is a shift amount in bytes and may be between 0 and 8
1087 inclusive. When 0, the result is arg2; when 8, the result is arg1.
1088 Not all back ends handle all values. The arm32 and arm64 back
1089 ends handle only immediate arg3 values. */
1092 /* REVERSE the order of chunks in vector lanes. Chunks must be
1093 smaller than the vector lanes (obviously) and so may be 8-, 16- and
1094 32-bit in size. Note that the degenerate case,
1095 Iop_Reverse8sIn64_x1, is a simply a vanilla byte-swap. */
1096 /* Examples:
1097 Reverse8sIn16_x4([a,b,c,d,e,f,g,h]) = [b,a,d,c,f,e,h,g]
1098 Reverse8sIn32_x2([a,b,c,d,e,f,g,h]) = [d,c,b,a,h,g,f,e]
1099 Reverse8sIn64_x1([a,b,c,d,e,f,g,h]) = [h,g,f,e,d,c,b,a] */
1100 Iop_Reverse8sIn16_x4,
1104 /* PERMUTING -- copy src bytes to dst,
1105 as indexed by control vector bytes:
1106 for i in 0 .. 7 . result[i] = argL[ argR[i] ]
1107 argR[i] values may only be in the range 0 .. 7, else behaviour
1108 is undefined. That is, argR[i][7:3] must be zero. */
1109 Iop_Perm8x8,
1111 /* PERMUTING with optional zeroing:
1112 for i in 0 .. 7 . result[i] = if argR[i] bit 7 is set
1113 then zero else argL[ argR[i] ]
1114 argR[i][6:3] must be zero, else behaviour is undefined.
1115 */
1116 Iop_PermOrZero8x8,
1118 /* MISC CONVERSION -- get high bits of each byte lane, a la
1119 x86/amd64 pmovmskb */
1122 /* Vector Reciprocal Estimate and Vector Reciprocal Square Root Estimate
1123 See floating-point equivalents for details. */
1126 /* ------------------ Decimal Floating Point ------------------ */
1128 /* ARITHMETIC INSTRUCTIONS 64-bit
1129 ----------------------------------
1130 IRRoundingMode(I32) X D64 X D64 -> D64
1131 */
1134 /* ARITHMETIC INSTRUCTIONS 128-bit
1135 ----------------------------------
1136 IRRoundingMode(I32) X D128 X D128 -> D128
1137 */
1140 /* SHIFT SIGNIFICAND INSTRUCTIONS
1141 * The DFP significand is shifted by the number of digits specified
1142 * by the U8 operand. Digits shifted out of the leftmost digit are
1143 * lost. Zeros are supplied to the vacated positions on the right.
1144 * The sign of the result is the same as the sign of the original
1145 * operand.
1146 *
1147 * D64 x U8 -> D64 left shift and right shift respectively */
1150 /* D128 x U8 -> D128 left shift and right shift respectively */
1154 /* FORMAT CONVERSION INSTRUCTIONS
1155 * D32 -> D64
1156 */
1157 Iop_D32toD64,
1159 /* D64 -> D128 */
1160 Iop_D64toD128,
1162 /* I32S -> D128 */
1163 Iop_I32StoD128,
1165 /* I32U -> D128 */
1166 Iop_I32UtoD128,
1168 /* I64S -> D128 */
1169 Iop_I64StoD128,
1171 /* I64U -> D128 */
1172 Iop_I64UtoD128,
1174 /* IRRoundingMode(I32) x I128S -> D128 */
1175 Iop_I128StoD128,
1177 /* IRRoundingMode(I32) x D64 -> D32 */
1178 Iop_D64toD32,
1180 /* IRRoundingMode(I32) x D128 -> D64 */
1181 Iop_D128toD64,
1183 /* I32S -> D64 */
1184 Iop_I32StoD64,
1186 /* I32U -> D64 */
1187 Iop_I32UtoD64,
1189 /* IRRoundingMode(I32) x I64 -> D64 */
1190 Iop_I64StoD64,
1192 /* IRRoundingMode(I32) x I64 -> D64 */
1193 Iop_I64UtoD64,
1195 /* IRRoundingMode(I32) x D64 -> I32 */
1196 Iop_D64toI32S,
1198 /* IRRoundingMode(I32) x D64 -> I32 */
1199 Iop_D64toI32U,
1201 /* IRRoundingMode(I32) x D64 -> I64 */
1202 Iop_D64toI64S,
1204 /* IRRoundingMode(I32) x D64 -> I64 */
1205 Iop_D64toI64U,
1207 /* IRRoundingMode(I32) x D128 -> I32 */
1208 Iop_D128toI32S,
1210 /* IRRoundingMode(I32) x D128 -> I32 */
1211 Iop_D128toI32U,
1213 /* IRRoundingMode(I32) x D128 -> I64 */
1214 Iop_D128toI64S,
1216 /* IRRoundingMode(I32) x D128 -> I64 */
1217 Iop_D128toI64U,
1219 /* IRRoundingMode(I32) x D128 -> I128 */
1220 Iop_D128toI128S,
1222 /* IRRoundingMode(I32) x F32 -> D32 */
1223 Iop_F32toD32,
1225 /* IRRoundingMode(I32) x F32 -> D64 */
1226 Iop_F32toD64,
1228 /* IRRoundingMode(I32) x F32 -> D128 */
1229 Iop_F32toD128,
1231 /* IRRoundingMode(I32) x F64 -> D32 */
1232 Iop_F64toD32,
1234 /* IRRoundingMode(I32) x F64 -> D64 */
1235 Iop_F64toD64,
1237 /* IRRoundingMode(I32) x F64 -> D128 */
1238 Iop_F64toD128,
1240 /* IRRoundingMode(I32) x F128 -> D32 */
1241 Iop_F128toD32,
1243 /* IRRoundingMode(I32) x F128 -> D64 */
1244 Iop_F128toD64,
1246 /* IRRoundingMode(I32) x F128 -> D128 */
1247 Iop_F128toD128,
1249 /* IRRoundingMode(I32) x D32 -> F32 */
1250 Iop_D32toF32,
1252 /* IRRoundingMode(I32) x D32 -> F64 */
1253 Iop_D32toF64,
1255 /* IRRoundingMode(I32) x D32 -> F128 */
1256 Iop_D32toF128,
1258 /* IRRoundingMode(I32) x D64 -> F32 */
1259 Iop_D64toF32,
1261 /* IRRoundingMode(I32) x D64 -> F64 */
1262 Iop_D64toF64,
1264 /* IRRoundingMode(I32) x D64 -> F128 */
1265 Iop_D64toF128,
1267 /* IRRoundingMode(I32) x D128 -> F32 */
1268 Iop_D128toF32,
1270 /* IRRoundingMode(I32) x D128 -> F64 */
1271 Iop_D128toF64,
1273 /* IRRoundingMode(I32) x D128 -> F128 */
1274 Iop_D128toF128,
1276 /* ROUNDING INSTRUCTIONS
1277 * IRRoundingMode(I32) x D64 -> D64
1278 * The D64 operand, if a finite number, it is rounded to a
1279 * floating point integer value, i.e. no fractional part.
1280 */
1281 Iop_RoundD64toInt,
1283 /* IRRoundingMode(I32) x D128 -> D128 */
1284 Iop_RoundD128toInt,
1286 /* COMPARE INSTRUCTIONS
1287 * D64 x D64 -> IRCmpD64Result(I32) */
1288 Iop_CmpD64,
1290 /* D128 x D128 -> IRCmpD128Result(I32) */
1291 Iop_CmpD128,
1293 /* COMPARE BIASED EXPONENET INSTRUCTIONS
1294 * D64 x D64 -> IRCmpD64Result(I32) */
1295 Iop_CmpExpD64,
1297 /* D128 x D128 -> IRCmpD128Result(I32) */
1298 Iop_CmpExpD128,
1300 /* QUANTIZE AND ROUND INSTRUCTIONS
1301 * The source operand is converted and rounded to the form with the
1302 * immediate exponent specified by the rounding and exponent parameter.
1303 *
1304 * The second operand is converted and rounded to the form
1305 * of the first operand's exponent and the rounded based on the specified
1306 * rounding mode parameter.
1307 *
1308 * IRRoundingMode(I32) x D64 x D64-> D64 */
1309 Iop_QuantizeD64,
1311 /* IRRoundingMode(I32) x D128 x D128 -> D128 */
1312 Iop_QuantizeD128,
1314 /* IRRoundingMode(I32) x I8 x D64 -> D64
1315 * The Decimal Floating point operand is rounded to the requested
1316 * significance given by the I8 operand as specified by the rounding
1317 * mode.
1318 */
1319 Iop_SignificanceRoundD64,
1321 /* IRRoundingMode(I32) x I8 x D128 -> D128 */
1322 Iop_SignificanceRoundD128,
1324 /* EXTRACT AND INSERT INSTRUCTIONS
1325 * D64 -> I64
1326 * The exponent of the D32 or D64 operand is extracted. The
1327 * extracted exponent is converted to a 64-bit signed binary integer.
1328 */
1329 Iop_ExtractExpD64,
1331 /* D128 -> I64 */
1332 Iop_ExtractExpD128,
1334 /* D64 -> I64
1335 * The number of significand digits of the D64 operand is extracted.
1336 * The number is stored as a 64-bit signed binary integer.
1337 */
1338 Iop_ExtractSigD64,
1340 /* D128 -> I64 */
1341 Iop_ExtractSigD128,
1343 /* I64 x D64 -> D64
1344 * The exponent is specified by the first I64 operand the signed
1345 * significand is given by the second I64 value. The result is a D64
1346 * value consisting of the specified significand and exponent whose
1347 * sign is that of the specified significand.
1348 */
1349 Iop_InsertExpD64,
1351 /* I64 x D128 -> D128 */
1352 Iop_InsertExpD128,
1354 /* Support for 128-bit DFP type */
1357 /* I64 -> I64
1358 * Convert 50-bit densely packed BCD string to 60 bit BCD string
1359 */
1360 Iop_DPBtoBCD,
1362 /* I64 -> I64
1363 * Convert 60 bit BCD string to 50-bit densely packed BCD string
1364 */
1365 Iop_BCDtoDPB,
1367 /* BCD arithmetic instructions, (V128, V128) -> V128
1368 * The BCD format is the same as that used in the BCD<->DPB conversion
1369 * routines, except using 124 digits (vs 60) plus the trailing 4-bit
1370 * signed code. */
1373 /* Conversion signed 128-bit integer to signed BCD 128-bit */
1374 Iop_I128StoBCD128,
1376 /* Conversion signed BCD 128-bit to 128-bit integer */
1377 Iop_BCD128toI128S,
1379 /* Conversion I64 -> D64 */
1380 Iop_ReinterpI64asD64,
1382 /* Conversion D64 -> I64 */
1383 Iop_ReinterpD64asI64,
1385 /* ------------------ 128-bit SIMD FP. ------------------ */
1387 /* --- 16x8 vector FP --- */
1389 /* binary :: IRRoundingMode(I32) x V128 -> V128 */
1390 Iop_Sqrt16Fx8,
1392 /* ternary :: IRRoundingMode(I32) x V128 x V128 -> V128 */
1395 /* binary */
1398 /* unary */
1399 Iop_Abs16Fx8,
1400 Iop_Neg16Fx8,
1402 /* --- 32x4 vector FP --- */
1404 /* ternary :: IRRoundingMode(I32) x V128 x V128 -> V128 */
1407 /* binary */
1410 /* Note: For the following compares, the ppc and arm front-ends assume a
1411 nan in a lane of either argument returns zero for that lane. */
1415 /* Pairwise Max and Min. See integer pairwise operations for details. */
1418 /* unary */
1419 Iop_Abs32Fx4,
1420 Iop_Neg32Fx4,
1422 /* binary :: IRRoundingMode(I32) x V128 -> V128 */
1423 Iop_Sqrt32Fx4,
1425 /* Vector Reciprocal Estimate finds an approximate reciprocal of each
1426 element in the operand vector, and places the results in the
1427 destination vector. */
1428 Iop_RecipEst32Fx4,
1430 /* Vector Reciprocal Step computes (2.0 - arg1 * arg2).
1431 Note, that if one of the arguments is zero and another one is infinity
1432 of arbitrary sign the result of the operation is 2.0. */
1433 Iop_RecipStep32Fx4,
1435 /* Vector Reciprocal Square Root Estimate finds an approximate reciprocal
1436 square root of each element in the operand vector. */
1437 Iop_RSqrtEst32Fx4,
1439 /* Scaling of vector with a power of 2 (wd[i] <- ws[i] * 2^wt[i]) */
1440 Iop_Scale2_32Fx4,
1442 /* Vector floating-point base 2 logarithm */
1443 Iop_Log2_32Fx4,
1445 /* Vector floating-point exponential 2^x */
1446 Iop_Exp2_32Fx4,
1448 /* Vector Reciprocal Square Root Step computes (3.0 - arg1 * arg2) / 2.0.
1449 Note, that of one of the arguments is zero and another one is infiinty
1450 of arbitrary sign the result of the operation is 1.5. */
1451 Iop_RSqrtStep32Fx4,
1453 /* --- Int to/from FP conversion --- */
1454 /* Unlike the standard fp conversions, these irops take no
1455 rounding mode argument. Instead the irop trailers _R{M,P,N,Z}
1456 indicate the mode: {-inf, +inf, nearest, zero} respectively. */
1458 // These carry no rounding mode and are therefore deprecated
1468 /* Fixed32 format is floating-point number with fixed number of fraction
1469 bits. The number of fraction bits is passed as a second argument of
1470 type I8. */
1474 /* --- Single to/from half conversion --- */
1475 /* FIXME: what kind of rounding in F32x4 -> F16x4 case? */
1476 // FIXME these carry no rounding mode
1481 /* -- Double to/from half conversion -- */
1483 Iop_F16toF64x2,
1485 /* Values from two registers converted in smaller type and put in one
1486 IRRoundingMode(I32) x (F32x4 | F32x4) -> Q16x8 */
1487 Iop_F32x4_2toQ16x8,
1490 /* --- 32x4 lowest-lane-only scalar FP --- */
1492 /* In binary cases, upper 3/4 is copied from first operand. In
1493 unary cases, upper 3/4 is copied from the operand. */
1495 /* binary */
1500 /* unary */
1503 /* --- 64x2 vector FP --- */
1505 /* ternary :: IRRoundingMode(I32) x V128 x V128 -> V128 */
1508 /* binary */
1512 /* unary */
1513 Iop_Abs64Fx2,
1514 Iop_Neg64Fx2,
1516 /* binary :: IRRoundingMode(I32) x V128 -> V128 */
1517 Iop_Sqrt64Fx2,
1519 /* Scaling of vector with a power of 2 (wd[i] <- ws[i] * 2^wt[i]) */
1520 Iop_Scale2_64Fx2,
1522 /* Vector floating-point base 2 logarithm */
1523 Iop_Log2_64Fx2,
1525 /* see 32Fx4 variants for description */
1532 /* Values from two registers converted in smaller type and put in one
1533 IRRoundingMode(I32) x (F64x2 | F64x2) -> Q32x4 */
1534 Iop_F64x2_2toQ32x4,
1536 /* --- 64x2 lowest-lane-only scalar FP --- */
1538 /* In binary cases, upper half is copied from first operand. In
1539 unary cases, upper half is copied from the operand. */
1541 /* binary */
1546 /* unary */
1547 Iop_Sqrt64F0x2,
1549 /* --- pack / unpack --- */
1551 /* 64 <-> 128 bit vector */
1556 Iop_64UtoV128,
1557 Iop_SetV128lo64,
1559 /* Copies lower 64/32/16/8 bits, zeroes out the rest. */
1565 /* 32 <-> 128 bit vector */
1566 Iop_32UtoV128,
1570 /* ------------------ 128-bit SIMD Integer. ------------------ */
1572 /* BITWISE OPS */
1573 Iop_NotV128,
1576 /* VECTOR SHIFT (shift amt :: Ity_I8) */
1579 /* MISC (vector integer cmp != 0) */
1581 Iop_CmpNEZ128x1,
1583 /* ADDITION (normal / U->U sat / S->S sat) */
1588 /* ADDITION, ARM64 specific saturating variants. */
1589 /* Unsigned widen left arg, signed widen right arg, add, saturate S->S.
1590 This corresponds to SUQADD. */
1593 /* Signed widen left arg, unsigned widen right arg, add, saturate U->U.
1594 This corresponds to USQADD. */
1598 /* SUBTRACTION (normal / unsigned sat / signed sat) */
1603 /* MULTIPLICATION (normal / high half of signed/unsigned) */
1607 /* (widening signed/unsigned of even lanes, with lowest lane=zero) */
1611 /* Widening multiplies, all of the form (I64, I64) -> V128 */
1616 /* Signed doubling saturating widening multiplies, (I64, I64) -> V128 */
1619 /* Vector Saturating Doubling Multiply Returning High Half and
1620 Vector Saturating Rounding Doubling Multiply Returning High Half.
1621 These IROps multiply corresponding elements in two vectors, double
1622 the results, and place the most significant half of the final results
1623 in the destination vector. The results are truncated or rounded. If
1624 any of the results overflow, they are saturated. To be more precise,
1625 for each lane, the computed result is:
1626 QDMulHi:
1627 hi-half( sign-extend(laneL) *q sign-extend(laneR) *q 2 )
1628 QRDMulHi:
1629 hi-half( sign-extend(laneL) *q sign-extend(laneR) *q 2
1630 +q (1 << (lane-width-in-bits - 1)) )
1631 */
1635 /* Polynomial multiplication treats its arguments as
1636 coefficients of polynomials over {0, 1}. */
1640 /* Vector Polynomial multiplication add. (V128, V128) -> V128
1642 *** Below is the algorithm for the instructions. These Iops could
1643 be emulated to get this functionality, but the emulation would
1644 be long and messy.
1646 Example for polynomial multiply add for vector of bytes
1647 do i = 0 to 15
1648 prod[i].bit[0:14] <- 0
1649 srcA <- VR[argL].byte[i]
1650 srcB <- VR[argR].byte[i]
1651 do j = 0 to 7
1652 do k = 0 to j
1653 gbit <- srcA.bit[k] & srcB.bit[j-k]
1654 prod[i].bit[j] <- prod[i].bit[j] ^ gbit
1655 end
1656 end
1658 do j = 8 to 14
1659 do k = j-7 to 7
1660 gbit <- (srcA.bit[k] & srcB.bit[j-k])
1661 prod[i].bit[j] <- prod[i].bit[j] ^ gbit
1662 end
1663 end
1664 end
1666 do i = 0 to 7
1667 VR[dst].hword[i] <- 0b0 || (prod[2×i] ^ prod[2×i+1])
1668 end
1669 */
1673 /* PAIRWISE operations */
1674 /* Iop_PwFoo16x4( [a,b,c,d], [e,f,g,h] ) =
1675 [Foo16(a,b), Foo16(c,d), Foo16(e,f), Foo16(g,h)] */
1677 Iop_PwAdd32Fx2,
1679 /* Longening variant is unary. The resulting vector contains two times
1680 less elements than operand, but they are two times wider.
1681 Example:
1682 Iop_PwAddL16Ux4( [a,b,c,d] ) = [a+b,c+d]
1683 where a+b and c+d are unsigned 32-bit values. */
1687 /* This is amd64 PMADDUBSW, (V128, V128) -> V128. For each adjacent pair
1688 of bytes [a,b] in the first arg and [c,d] in the second, computes:
1689 signed/signed sat to 16 bits ( zxTo16(a) * sxTo16(b)
1690 + zxTo16(c) * sxTo16(d) )
1691 This exists because it's frequently used and there's no reasonably
1692 concise way to express it using other IROps.
1693 */
1694 Iop_PwExtUSMulQAdd8x16,
1696 /* Other unary pairwise ops */
1698 /* Vector bit matrix transpose. (V128) -> V128 */
1699 /* For each doubleword element of the source vector, an 8-bit x 8-bit
1700 * matrix transpose is performed. */
1701 Iop_PwBitMtxXpose64x2,
1703 /* ABSOLUTE VALUE */
1706 /* AVERAGING: note: (arg1 + arg2 + 1) >>u 1 */
1710 /* MIN/MAX */
1716 /* COMPARISON */
1721 /* COUNT ones / leading zeroes / leading sign bits (not including topmost
1722 bit) */
1723 Iop_Cnt8x16,
1727 /* VECTOR x SCALAR SHIFT (shift amt :: Ity_I8) */
1732 /* VECTOR x VECTOR SHIFT / ROTATE */
1733 /* FIXME: I'm pretty sure the ARM32 front/back ends interpret these
1734 differently from all other targets. The intention is that
1735 the shift amount (2nd arg) is interpreted as unsigned and
1736 only the lowest log2(lane-bits) bits are relevant. But the
1737 ARM32 versions treat the shift amount as an 8 bit signed
1738 number. The ARM32 uses should be replaced by the relevant
1739 vector x vector bidirectional shifts instead. */
1746 /* VECTOR x VECTOR SATURATING SHIFT */
1749 /* VECTOR x INTEGER SATURATING SHIFT */
1757 /* VECTOR x VECTOR BIDIRECTIONAL SATURATING (& MAYBE ROUNDING) SHIFT */
1758 /* All of type (V128, V128) -> V256. */
1759 /* The least significant 8 bits of each lane of the second
1760 operand are used as the shift amount, and interpreted signedly.
1761 Positive values mean a shift left, negative a shift right. The
1762 result is signedly or unsignedly saturated. There are also
1763 rounding variants, which add 2^(shift_amount-1) to the value before
1764 shifting, but only in the shift-right case. Vacated positions
1765 are filled with zeroes. IOW, it's either SHR or SHL, but not SAR.
1767 These operations return 129 bits: one bit ("Q") indicating whether
1768 saturation occurred, and the shift result. The result type is V256,
1769 of which the lower V128 is the shift result, and Q occupies the
1770 least significant bit of the upper V128. All other bits of the
1771 upper V128 are zero. */
1772 // Unsigned saturation, no rounding
1775 // Signed saturation, no rounding
1779 // Unsigned saturation, rounding
1782 // Signed saturation, rounding
1786 /* VECTOR x VECTOR BIDIRECTIONAL (& MAYBE ROUNDING) SHIFT */
1787 /* All of type (V128, V128) -> V128 */
1788 /* The least significant 8 bits of each lane of the second
1789 operand are used as the shift amount, and interpreted signedly.
1790 Positive values mean a shift left, negative a shift right.
1791 There are also rounding variants, which add 2^(shift_amount-1)
1792 to the value before shifting, but only in the shift-right case.
1794 For left shifts, the vacated places are filled with zeroes.
1795 For right shifts, the vacated places are filled with zeroes
1796 for the U variants and sign bits for the S variants. */
1797 // Signed and unsigned, non-rounding
1801 // Signed and unsigned, rounding
1805 /* The least significant 8 bits of each lane of the second
1806 operand are used as the shift amount, and interpreted signedly.
1807 Positive values mean a shift left, negative a shift right. The
1808 result is signedly or unsignedly saturated. There are also
1809 rounding variants, which add 2^(shift_amount-1) to the value before
1810 shifting, but only in the shift-right case. Vacated positions
1811 are filled with zeroes. IOW, it's either SHR or SHL, but not SAR.
1812 */
1814 /* VECTOR x SCALAR SATURATING (& MAYBE ROUNDING) NARROWING SHIFT RIGHT */
1815 /* All of type (V128, I8) -> V128 */
1816 /* The first argument is shifted right, then narrowed to half the width
1817 by saturating it. The second argument is a scalar shift amount that
1818 applies to all lanes, and must be a value in the range 1 to lane_width.
1819 The shift may be done signedly (Sar variants) or unsignedly (Shr
1820 variants). The saturation is done according to the two signedness
1821 indicators at the end of the name. For example 64Sto32U means a
1822 signed 64 bit value is saturated into an unsigned 32 bit value.
1823 Additionally, the QRS variants do rounding, that is, they add the
1824 value (1 << (shift_amount-1)) to each source lane before shifting.
1826 These operations return 65 bits: one bit ("Q") indicating whether
1827 saturation occurred, and the shift result. The result type is V128,
1828 of which the lower half is the shift result, and Q occupies the
1829 least significant bit of the upper half. All other bits of the
1830 upper half are zero. */
1831 // No rounding, sat U->U
1832 Iop_QandQShrNnarrow16Uto8Ux8,
1834 // No rounding, sat S->S
1835 Iop_QandQSarNnarrow16Sto8Sx8,
1837 // No rounding, sat S->U
1838 Iop_QandQSarNnarrow16Sto8Ux8,
1841 // Rounding, sat U->U
1842 Iop_QandQRShrNnarrow16Uto8Ux8,
1844 // Rounding, sat S->S
1845 Iop_QandQRSarNnarrow16Sto8Sx8,
1847 // Rounding, sat S->U
1848 Iop_QandQRSarNnarrow16Sto8Ux8,
1851 /* NARROWING (binary)
1852 -- narrow 2xV128 into 1xV128, hi half from left arg */
1853 /* See comments above w.r.t. U vs S issues in saturated narrowing. */
1859 Iop_NarrowBin64to32x4,
1861 /* NARROWING (unary) -- narrow V128 into I64 */
1863 /* Saturating narrowing from signed source to signed/unsigned
1864 destination */
1867 /* Saturating narrowing from unsigned source to unsigned destination */
1870 /* WIDENING -- sign or zero extend each element of the argument
1871 vector to the twice original size. The resulting vector consists of
1872 the same number of elements but each element and the vector itself
1873 are twice as wide.
1874 All operations are I64->V128.
1875 Example
1876 Iop_Widen32Sto64x2( [a, b] ) = [c, d]
1877 where c = Iop_32Sto64(a) and d = Iop_32Sto64(b) */
1881 /* INTERLEAVING */
1882 /* Interleave lanes from low or high halves of
1883 operands. Most-significant result lane is from the left
1884 arg. */
1889 /* Interleave odd/even lanes of operands. Most-significant result lane
1890 is from the left arg. */
1895 /* Pack even/odd lanes. */
1900 /* CONCATENATION -- build a new value by concatenating either
1901 the even or odd lanes of both operands. Note that
1902 Cat{Odd,Even}Lanes64x2 are identical to Interleave{HI,LO}64x2
1903 and so are omitted. */
1907 /* GET elements of VECTOR
1908 GET is binop (V128, I8) -> I<elem_size>
1909 SET is triop (V128, I8, I<elem_size>) -> V128 */
1910 /* Note: the arm back-end handles only constant second argument. */
1914 /* DUPLICATING -- copy value to all lanes */
1917 /* SLICE -- produces the lowest 128 bits of (arg1:arg2) >> (8 * arg3).
1918 arg3 is a shift amount in bytes and may be between 0 and 16
1919 inclusive. When 0, the result is arg2; when 16, the result is arg1.
1920 Not all back ends handle all values. The arm64 back
1921 end handles only immediate arg3 values. */
1924 /* REVERSE the order of chunks in vector lanes. Chunks must be
1925 smaller than the vector lanes (obviously) and so may be 8-,
1926 16- and 32-bit in size. See definitions of 64-bit SIMD
1927 versions above for examples. */
1928 Iop_Reverse8sIn16_x8,
1933 /* PERMUTING -- copy src bytes to dst,
1934 as indexed by control vector bytes:
1935 for i in 0 .. 15 . result[i] = argL[ argR[i] ]
1936 argR[i] values may only be in the range 0 .. 15, else behaviour
1937 is undefined. That is, argR[i][7:4] must be zero. */
1938 Iop_Perm8x16,
1941 /* PERMUTING with optional zeroing:
1942 for i in 0 .. 15 . result[i] = if argR[i] bit 7 is set
1943 then zero else argL[ argR[i] ]
1944 argR[i][6:4] must be zero, else behaviour is undefined.
1945 */
1946 Iop_PermOrZero8x16,
1948 /* same, but Triop (argL consists of two 128-bit parts) */
1949 /* correct range for argR values is 0..31 */
1950 /* (V128, V128, V128) -> V128 */
1951 /* (ArgL_first, ArgL_second, ArgR) -> result */
1952 Iop_Perm8x16x2,
1954 /* MISC CONVERSION -- get high bits of each byte lane, a la
1955 x86/amd64 pmovmskb */
1958 /* Vector Reciprocal Estimate and Vector Reciprocal Square Root Estimate
1959 See floating-point equivalents for details. */
1962 /* 128-bit multipy by 10 instruction, result is lower 128-bits */
1963 Iop_MulI128by10,
1965 /* 128-bit multipy by 10 instruction, result is carry out from the MSB */
1966 Iop_MulI128by10Carry,
1968 /* 128-bit multipy by 10 instruction, result is lower 128-bits of the
1969 * source times 10 plus the carry in
1970 */
1971 Iop_MulI128by10E,
1973 /* 128-bit multipy by 10 instruction, result is carry out from the MSB
1974 * of the source times 10 plus the carry in
1975 */
1976 Iop_MulI128by10ECarry,
1978 /* 128-bit carry out from ((U64 * U64 -> U128) + (U64 * U64 -> U128)) */
1979 Iop_2xMultU64Add128CarryOut,
1981 /* ------------------ 256-bit SIMD Integer. ------------------ */
1983 /* Pack/unpack */
1985 Iop_V256to64_1,
1986 Iop_V256to64_2,
1990 // first arg is most significant lane
1996 Iop_AndV256,
1997 Iop_OrV256,
1998 Iop_XorV256,
1999 Iop_NotV256,
2001 /* MISC (vector integer cmp != 0) */
2029 Iop_Perm32x8,
2031 /* (V128, V128) -> V128 */
2035 /* Hash instructions, Federal Information Processing Standards
2036 * Publication 180-3 Secure Hash Standard. */
2037 /* (V128, I8) -> V128; The I8 input arg is (ST | SIX), where ST and
2038 * SIX are fields from the insn. See ISA 2.07 description of
2039 * vshasigmad and vshasigmaw insns.*/
2042 /* ------------------ 256-bit SIMD FP. ------------------ */
2044 /* ternary :: IRRoundingMode(I32) x V256 x V256 -> V256 */
2054 Iop_Sqrt32Fx8,
2055 Iop_Sqrt64Fx4,
2056 Iop_RSqrtEst32Fx8,
2057 Iop_RecipEst32Fx8,
2062 Iop_LAST /* must be the last enumerator */
2063 }
2064 IROp;
2066 /* Pretty-print an op. */
2069 /* For a given operand return the types of its arguments and its result. */
2074 /* Might the given primop trap (eg, attempt integer division by zero)? If in
2075 doubt returns True. However, the vast majority of primops will never
2076 trap. */
2079 /* Encoding of IEEE754-specified rounding modes.
2080 Note, various front and back ends rely on the actual numerical
2081 values of these, so do not change them. */
2082 typedef
2090 // precision
2093 }
2094 IRRoundingMode;
2096 /* Binary floating point comparison result values.
2097 This is also derived from what IA32 does. */
2098 typedef
2104 }
2105 IRCmpFResult;
2111 /* Decimal floating point result values. */
2116 /* ------------------ Expressions ------------------ */
2122 /* The different kinds of expressions. Their meaning is explained below
2123 in the comments for IRExpr. */
2124 typedef
2127 Iex_Get,
2128 Iex_GetI,
2129 Iex_RdTmp,
2130 Iex_Qop,
2131 Iex_Triop,
2132 Iex_Binop,
2133 Iex_Unop,
2134 Iex_Load,
2135 Iex_Const,
2136 Iex_ITE,
2137 Iex_CCall,
2138 Iex_VECRET,
2139 Iex_GSPTR
2140 }
2141 IRExprTag;
2143 /* An expression. Stored as a tagged union. 'tag' indicates what kind
2144 of expression this is. 'Iex' is the union that holds the fields. If
2145 an IRExpr 'e' has e.tag equal to Iex_Load, then it's a load
2146 expression, and the fields can be accessed with
2147 'e.Iex.Load.<fieldname>'.
2149 For each kind of expression, we show what it looks like when
2150 pretty-printed with ppIRExpr().
2151 */
2152 typedef
2153 struct _IRExpr
2154 IRExpr;
2157 IRExprTag tag;
2159 /* Used only in pattern matching within Vex. Should not be seen
2160 outside of Vex. */
2162 Int binder;
2165 /* Read a guest register, at a fixed offset in the guest state.
2166 ppIRExpr output: GET:<ty>(<offset>), eg. GET:I32(0)
2167 */
2173 /* Read a guest register at a non-fixed offset in the guest
2174 state. This allows circular indexing into parts of the guest
2175 state, which is essential for modelling situations where the
2176 identity of guest registers is not known until run time. One
2177 example is the x87 FP register stack.
2179 The part of the guest state to be treated as a circular array
2180 is described in the IRRegArray 'descr' field. It holds the
2181 offset of the first element in the array, the type of each
2182 element, and the number of elements.
2184 The array index is indicated rather indirectly, in a way
2185 which makes optimisation easy: as the sum of variable part
2186 (the 'ix' field) and a constant offset (the 'bias' field).
2188 Since the indexing is circular, the actual array index to use
2189 is computed as (ix + bias) % num-of-elems-in-the-array.
2191 Here's an example. The description
2193 (96:8xF64)[t39,-7]
2195 describes an array of 8 F64-typed values, the
2196 guest-state-offset of the first being 96. This array is
2197 being indexed at (t39 - 7) % 8.
2199 It is important to get the array size/type exactly correct
2200 since IR optimisation looks closely at such info in order to
2201 establish aliasing/non-aliasing between seperate GetI and
2202 PutI events, which is used to establish when they can be
2203 reordered, etc. Putting incorrect info in will lead to
2204 obscure IR optimisation bugs.
2206 ppIRExpr output: GETI<descr>[<ix>,<bias]
2207 eg. GETI(128:8xI8)[t1,0]
2208 */
2215 /* The value held by a temporary.
2216 ppIRExpr output: t<tmp>, eg. t1
2217 */
2222 /* A quaternary operation.
2223 ppIRExpr output: <op>(<arg1>, <arg2>, <arg3>, <arg4>),
2224 eg. MAddF64r32(t1, t2, t3, t4)
2225 */
2230 /* A ternary operation.
2231 ppIRExpr output: <op>(<arg1>, <arg2>, <arg3>),
2232 eg. MulF64(1, 2.0, 3.0)
2233 */
2238 /* A binary operation.
2239 ppIRExpr output: <op>(<arg1>, <arg2>), eg. Add32(t1,t2)
2240 */
2247 /* A unary operation.
2248 ppIRExpr output: <op>(<arg>), eg. Neg8(t1)
2249 */
2255 /* A load from memory -- a normal load, not a load-linked.
2256 Load-Linkeds (and Store-Conditionals) are instead represented
2257 by IRStmt.LLSC since Load-Linkeds have side effects and so
2258 are not semantically valid IRExpr's.
2259 ppIRExpr output: LD<end>:<ty>(<addr>), eg. LDle:I32(t1)
2260 */
2267 /* A constant-valued expression.
2268 ppIRExpr output: <con>, eg. 0x4:I32
2269 */
2274 /* A call to a pure (no side-effects) helper C function.
2276 With the 'cee' field, 'name' is the function's name. It is
2277 only used for pretty-printing purposes. The address to call
2278 (host address, of course) is stored in the 'addr' field
2279 inside 'cee'.
2281 The 'args' field is a NULL-terminated array of arguments.
2282 The stated return IRType, and the implied argument types,
2283 must match that of the function being called well enough so
2284 that the back end can actually generate correct code for the
2285 call.
2287 The called function **must** satisfy the following:
2289 * no side effects -- must be a pure function, the result of
2290 which depends only on the passed parameters.
2292 * it may not look at, nor modify, any of the guest state
2293 since that would hide guest state transitions from
2294 instrumenters
2296 * it may not access guest memory, since that would hide
2297 guest memory transactions from the instrumenters
2299 * it must not assume that arguments are being evaluated in a
2300 particular order. The oder of evaluation is unspecified.
2302 This is restrictive, but makes the semantics clean, and does
2303 not interfere with IR optimisation.
2305 If you want to call a helper which can mess with guest state
2306 and/or memory, instead use Ist_Dirty. This is a lot more
2307 flexible, but you have to give a bunch of details about what
2308 the helper does (and you better be telling the truth,
2309 otherwise any derived instrumentation will be wrong). Also
2310 Ist_Dirty inhibits various IR optimisations and so can cause
2311 quite poor code to be generated. Try to avoid it.
2313 In principle it would be allowable to have the arg vector
2314 contain an IRExpr_VECRET(), although not IRExpr_GSPTR(). However,
2315 at the moment there is no requirement for clean helper calls to
2316 be able to return V128 or V256 values. Hence this is not allowed.
2318 ppIRExpr output: <cee>(<args>):<retty>
2319 eg. foo{0x80489304}(t1, t2):I32
2320 */
2327 /* A ternary if-then-else operator. It returns iftrue if cond is
2328 nonzero, iffalse otherwise. Note that it is STRICT, ie. both
2329 iftrue and iffalse are evaluated in all cases.
2331 ppIRExpr output: ITE(<cond>,<iftrue>,<iffalse>),
2332 eg. ITE(t6,t7,t8)
2333 */
2340 };
2342 /* Expression auxiliaries: a ternary expression. */
2348 };
2350 /* Expression auxiliaries: a quarternary expression. */
2357 };
2360 /* Two special kinds of IRExpr, which can ONLY be used in
2361 argument lists for dirty helper calls (IRDirty.args) and in NO
2362 OTHER PLACES. And then only in very limited ways. */
2364 /* Denotes an argument which (in the helper) takes a pointer to a
2365 (naturally aligned) V128 or V256, into which the helper is expected
2366 to write its result. Use of IRExpr_VECRET() is strictly
2367 controlled. If the helper returns a V128 or V256 value then
2368 IRExpr_VECRET() must appear exactly once in the arg list, although
2369 it can appear anywhere, and the helper must have a C 'void' return
2370 type. If the helper returns any other type, IRExpr_VECRET() may
2371 not appear in the argument list. */
2373 /* Denotes an void* argument which is passed to the helper, which at
2374 run time will point to the thread's guest state area. This can
2375 only appear at most once in an argument list, and it may not appear
2376 at all in argument lists for clean helper calls. */
2380 }
2383 /* Expression constructors. */
2401 /* Deep-copy an IRExpr. */
2404 /* Pretty-print an IRExpr. */
2407 /* NULL-terminated IRExpr vector constructors, suitable for
2408 use as arg lists in clean/dirty helper calls. */
2415 IRExpr* );
2428 /* IRExpr copiers:
2429 - shallowCopy: shallow-copy (ie. create a new vector that shares the
2430 elements with the original).
2431 - deepCopy: deep-copy (ie. create a completely new vector). */
2435 /* Make a constant expression from the given host word taking into
2436 account (of course) the host word size. */
2439 /* Convenience function for constructing clean helper calls. */
2440 extern
2446 /* Convenience functions for atoms (IRExprs which are either Iex_Tmp or
2447 * Iex_Const). */
2450 }
2452 /* Are these two IR atoms identical? Causes an assertion
2453 failure if they are passed non-atoms. */
2457 /* ------------------ Jump kinds ------------------ */
2459 /* This describes hints which can be passed to the dispatcher at guest
2460 control-flow transfer points.
2462 Re Ijk_InvalICache and Ijk_FlushDCache: the guest state _must_ have
2463 two pseudo-registers, guest_CMSTART and guest_CMLEN, which specify
2464 the start and length of the region to be invalidated. CM stands
2465 for "Cache Management". These are both the size of a guest word.
2466 It is the responsibility of the relevant toIR.c to ensure that
2467 these are filled in with suitable values before issuing a jump of
2468 kind Ijk_InvalICache or Ijk_FlushDCache.
2470 Ijk_InvalICache requests invalidation of translations taken from
2471 the requested range. Ijk_FlushDCache requests flushing of the D
2472 cache for the specified range.
2474 Re Ijk_EmWarn and Ijk_EmFail: the guest state must have a
2475 pseudo-register guest_EMNOTE, which is 32-bits regardless of the
2476 host or guest word size. That register should be made to hold a
2477 VexEmNote value to indicate the reason for the exit.
2479 In the case of Ijk_EmFail, the exit is fatal (Vex-generated code
2480 cannot continue) and so the jump destination can be anything.
2482 Re Ijk_Sys_ (syscall jumps): the guest state must have a
2483 pseudo-register guest_IP_AT_SYSCALL, which is the size of a guest
2484 word. Front ends should set this to be the IP at the most recently
2485 executed kernel-entering (system call) instruction. This makes it
2486 very much easier (viz, actually possible at all) to back up the
2487 guest to restart a syscall that has been interrupted by a signal.
2489 Re Ijk_Extension: the guest state must have the pseudo-register
2490 guest_IP_AT_SYSCALL, which is also used for Ijk_Sys_*. Front ends
2491 must set this to the current instruction address before jumping to
2492 an extension handler.
2493 */
2494 typedef
2516 /* Unfortunately, various guest-dependent syscall kinds. They
2517 all mean: do a syscall before continuing. */
2526 invalid at the point this happens. */
2528 }
2529 IRJumpKind;
2534 /* ------------------ Dirty helper calls ------------------ */
2536 /* A dirty call is a flexible mechanism for calling (possibly
2537 conditionally) a helper function or procedure. The helper function
2538 may read, write or modify client memory, and may read, write or
2539 modify client state. It can take arguments and optionally return a
2540 value. It may return different results and/or do different things
2541 when called repeatedly with the same arguments, by means of storing
2542 private state.
2544 If a value is returned, it is assigned to the nominated return
2545 temporary.
2547 Dirty calls are statements rather than expressions for obvious
2548 reasons. If a dirty call is marked as writing guest state, any
2549 pre-existing values derived from the written parts of the guest
2550 state are invalid. Similarly, if the dirty call is stated as
2551 writing memory, any pre-existing loaded values are invalidated by
2552 it.
2554 In order that instrumentation is possible, the call must state, and
2555 state correctly:
2557 * Whether it reads, writes or modifies memory, and if so where.
2559 * Whether it reads, writes or modifies guest state, and if so which
2560 pieces. Several pieces may be stated, and their extents must be
2561 known at translation-time. Each piece is allowed to repeat some
2562 number of times at a fixed interval, if required.
2564 Normally, code is generated to pass just the args to the helper.
2565 However, if IRExpr_GSPTR() is present in the argument list (at most
2566 one instance is allowed), then the guest state pointer is passed for
2567 that arg, so that the callee can access the guest state. It is
2568 invalid for .nFxState to be zero but IRExpr_GSPTR() to be present,
2569 since .nFxState==0 is a claim that the call does not access guest
2570 state.
2572 IMPORTANT NOTE re GUARDS: Dirty calls are strict, very strict. The
2573 arguments and 'mFx' are evaluated REGARDLESS of the guard value.
2574 The order of argument evaluation is unspecified. The guard
2575 expression is evaluated AFTER the arguments and 'mFx' have been
2576 evaluated. 'mFx' is expected (by Memcheck) to be a defined value
2577 even if the guard evaluates to false.
2578 */
2582 /* Effects on resources (eg. registers, memory locations) */
2583 typedef
2589 }
2590 IREffect;
2592 /* Pretty-print an IREffect */
2595 typedef
2597 /* What to call, and details of args/results. .guard must be
2598 non-NULL. If .tmp is not IRTemp_INVALID, then the call
2599 returns a result which is placed in .tmp. If at runtime the
2600 guard evaluates to false, .tmp has an 0x555..555 bit pattern
2601 written to it. Hence conditional calls that assign .tmp are
2602 allowed. */
2605 /* The args vector may contain IRExpr_GSPTR() and/or
2606 IRExpr_VECRET(), in both cases, at most once. */
2610 /* Mem effects; we allow only one R/W/M region to be stated */
2615 /* Guest state effects; up to N allowed */
2619 UShort offset;
2620 UShort size;
2621 UChar nRepeats;
2622 UChar repeatLen;
2624 /* The access can be repeated, as specified by nRepeats and
2625 repeatLen. To describe only a single access, nRepeats and
2626 repeatLen should be zero. Otherwise, repeatLen must be a
2627 multiple of size and greater than size. */
2628 /* Overall, the parts of the guest state denoted by (offset,
2629 size, nRepeats, repeatLen) is
2630 [offset, +size)
2631 and, if nRepeats > 0,
2632 for (i = 1; i <= nRepeats; i++)
2633 [offset + i * repeatLen, +size)
2634 A convenient way to enumerate all segments is therefore
2635 for (i = 0; i < 1 + nRepeats; i++)
2636 [offset + i * repeatLen, +size)
2637 */
2638 }
2639 IRDirty;
2641 /* Pretty-print a dirty call */
2644 /* Allocate an uninitialised dirty call */
2647 /* Deep-copy a dirty call */
2650 /* A handy function which takes some of the tedium out of constructing
2651 dirty helper calls. The called function impliedly does not return
2652 any value and has a constant-True guard. The call is marked as
2653 accessing neither guest state nor memory (hence the "unsafe"
2654 designation) -- you can change this marking later if need be. A
2655 suitable IRCallee is constructed from the supplied bits. */
2656 extern
2660 /* Similarly, make a zero-annotation dirty call which returns a value,
2661 and assign that to the given temp. */
2662 extern
2668 /* --------------- Memory Bus Events --------------- */
2670 typedef
2673 /* Needed only on ARM. It cancels a reservation made by a
2674 preceding Linked-Load, and needs to be handed through to the
2675 back end, just as LL and SC themselves are. */
2676 Imbe_CancelReservation
2677 }
2678 IRMBusEvent;
2683 /* --------------- Compare and Swap --------------- */
2685 /* This denotes an atomic compare and swap operation, either
2686 a single-element one or a double-element one.
2688 In the single-element case:
2690 .addr is the memory address.
2691 .end is the endianness with which memory is accessed
2693 If .addr contains the same value as .expdLo, then .dataLo is
2694 written there, else there is no write. In both cases, the
2695 original value at .addr is copied into .oldLo.
2697 Types: .expdLo, .dataLo and .oldLo must all have the same type.
2698 It may be any integral type, viz: I8, I16, I32 or, for 64-bit
2699 guests, I64.
2701 .oldHi must be IRTemp_INVALID, and .expdHi and .dataHi must
2702 be NULL.
2704 In the double-element case:
2706 .addr is the memory address.
2707 .end is the endianness with which memory is accessed
2709 The operation is the same:
2711 If .addr contains the same value as .expdHi:.expdLo, then
2712 .dataHi:.dataLo is written there, else there is no write. In
2713 both cases the original value at .addr is copied into
2714 .oldHi:.oldLo.
2716 Types: .expdHi, .expdLo, .dataHi, .dataLo, .oldHi, .oldLo must
2717 all have the same type, which may be any integral type, viz: I8,
2718 I16, I32 or, for 64-bit guests, I64.
2720 The double-element case is complicated by the issue of
2721 endianness. In all cases, the two elements are understood to be
2722 located adjacently in memory, starting at the address .addr.
2724 If .end is Iend_LE, then the .xxxLo component is at the lower
2725 address and the .xxxHi component is at the higher address, and
2726 each component is itself stored little-endianly.
2728 If .end is Iend_BE, then the .xxxHi component is at the lower
2729 address and the .xxxLo component is at the higher address, and
2730 each component is itself stored big-endianly.
2732 This allows representing more cases than most architectures can
2733 handle. For example, x86 cannot do DCAS on 8- or 16-bit elements.
2735 How to know if the CAS succeeded?
2737 * if .oldLo == .expdLo (resp. .oldHi:.oldLo == .expdHi:.expdLo),
2738 then the CAS succeeded, .dataLo (resp. .dataHi:.dataLo) is now
2739 stored at .addr, and the original value there was .oldLo (resp
2740 .oldHi:.oldLo).
2742 * if .oldLo != .expdLo (resp. .oldHi:.oldLo != .expdHi:.expdLo),
2743 then the CAS failed, and the original value at .addr was .oldLo
2744 (resp. .oldHi:.oldLo).
2746 Hence it is easy to know whether or not the CAS succeeded.
2747 */
2748 typedef
2751 IRTemp oldLo;
2758 }
2759 IRCAS;
2771 /* ------------------ Circular Array Put ------------------ */
2773 typedef
2789 /* --------------- Guarded loads and stores --------------- */
2791 /* Conditional stores are straightforward. They are the same as
2792 normal stores, with an extra 'guard' field :: Ity_I1 that
2793 determines whether or not the store actually happens. If not,
2794 memory is unmodified.
2796 The semantics of this is that 'addr' and 'data' are fully evaluated
2797 even in the case where 'guard' evaluates to zero (false).
2798 */
2799 typedef
2805 }
2806 IRStoreG;
2808 /* Conditional loads are a little more complex. 'addr' is the
2809 address, 'guard' is the guarding condition. If the load takes
2810 place, the loaded value is placed in 'dst'. If it does not take
2811 place, 'alt' is copied to 'dst'. However, the loaded value is not
2812 placed directly in 'dst' -- it is first subjected to the conversion
2813 specified by 'cvt'.
2815 For example, imagine doing a conditional 8-bit load, in which the
2816 loaded value is zero extended to 32 bits. Hence:
2817 * 'dst' and 'alt' must have type I32
2818 * 'cvt' must be a unary op which converts I8 to I32. In this
2819 example, it would be ILGop_8Uto32.
2821 There is no explicit indication of the type at which the load is
2822 done, since that is inferrable from the arg type of 'cvt'. Note
2823 that the types of 'alt' and 'dst' and the result type of 'cvt' must
2824 all be the same.
2826 Semantically, 'addr' is evaluated even in the case where 'guard'
2827 evaluates to zero (false), and 'alt' is evaluated even when 'guard'
2828 evaluates to one (true). That is, 'addr' and 'alt' are always
2829 evaluated.
2830 */
2831 typedef
2840 ILGop_8Sto32 /* 8 bit load, S-widen to 32 */
2841 }
2842 IRLoadGOp;
2844 typedef
2852 }
2853 IRLoadG;
2870 /* ------------------ Statements ------------------ */
2872 /* The different kinds of statements. Their meaning is explained
2873 below in the comments for IRStmt.
2875 Those marked META do not represent code, but rather extra
2876 information about the code. These statements can be removed
2877 without affecting the functional behaviour of the code, however
2878 they are required by some IR consumers such as tools that
2879 instrument the code.
2880 */
2882 typedef
2887 Ist_Put,
2888 Ist_PutI,
2889 Ist_WrTmp,
2890 Ist_Store,
2891 Ist_LoadG,
2892 Ist_StoreG,
2893 Ist_CAS,
2894 Ist_LLSC,
2895 Ist_Dirty,
2896 Ist_MBE,
2897 Ist_Exit
2898 }
2899 IRStmtTag;
2901 /* A statement. Stored as a tagged union. 'tag' indicates what kind
2902 of expression this is. 'Ist' is the union that holds the fields.
2903 If an IRStmt 'st' has st.tag equal to Iex_Store, then it's a store
2904 statement, and the fields can be accessed with
2905 'st.Ist.Store.<fieldname>'.
2907 For each kind of statement, we show what it looks like when
2908 pretty-printed with ppIRStmt().
2909 */
2910 typedef
2912 IRStmtTag tag;
2914 /* A no-op (usually resulting from IR optimisation). Can be
2915 omitted without any effect.
2917 ppIRStmt output: IR-NoOp
2918 */
2922 /* META: instruction mark. Marks the start of the statements
2923 that represent a single machine instruction (the end of
2924 those statements is marked by the next IMark or the end of
2925 the IRSB). Contains the address and length of the
2926 instruction.
2928 It also contains a delta value. The delta must be
2929 subtracted from a guest program counter value before
2930 attempting to establish, by comparison with the address
2931 and length values, whether or not that program counter
2932 value refers to this instruction. For x86, amd64, ppc32,
2933 ppc64 and arm, the delta value is zero. For Thumb
2934 instructions, the delta value is one. This is because, on
2935 Thumb, guest PC values (guest_R15T) are encoded using the
2936 top 31 bits of the instruction address and a 1 in the lsb;
2937 hence they appear to be (numerically) 1 past the start of
2938 the instruction they refer to. IOW, guest_R15T on ARM
2939 holds a standard ARM interworking address.
2941 ppIRStmt output: ------ IMark(<addr>, <len>, <delta>) ------,
2942 eg. ------ IMark(0x4000792, 5, 0) ------,
2943 */
2948 - delta */
2951 /* META: An ABI hint, which says something about this
2952 platform's ABI.
2954 At the moment, the only AbiHint is one which indicates
2955 that a given chunk of address space, [base .. base+len-1],
2956 has become undefined. This is used on amd64-linux and
2957 some ppc variants to pass stack-redzoning hints to whoever
2958 wants to see them. It also indicates the address of the
2959 next (dynamic) instruction that will be executed. This is
2960 to help Memcheck to origin tracking.
2962 ppIRStmt output: ====== AbiHint(<base>, <len>, <nia>) ======
2963 eg. ====== AbiHint(t1, 16, t2) ======
2964 */
2971 /* Write a guest register, at a fixed offset in the guest state.
2972 ppIRStmt output: PUT(<offset>) = <data>, eg. PUT(60) = t1
2973 */
2979 /* Write a guest register, at a non-fixed offset in the guest
2980 state. See the comment for GetI expressions for more
2981 information.
2983 ppIRStmt output: PUTI<descr>[<ix>,<bias>] = <data>,
2984 eg. PUTI(64:8xF64)[t5,0] = t1
2985 */
2990 /* Assign a value to a temporary. Note that SSA rules require
2991 each tmp is only assigned to once. IR sanity checking will
2992 reject any block containing a temporary which is not assigned
2993 to exactly once.
2995 ppIRStmt output: t<tmp> = <data>, eg. t1 = 3
2996 */
3002 /* Write a value to memory. This is a normal store, not a
3003 Store-Conditional. To represent a Store-Conditional,
3004 instead use IRStmt.LLSC.
3005 ppIRStmt output: ST<end>(<addr>) = <data>, eg. STle(t1) = t2
3006 */
3013 /* Guarded store. Note that this is defined to evaluate all
3014 expression fields (addr, data) even if the guard evaluates
3015 to false.
3016 ppIRStmt output:
3017 if (<guard>) ST<end>(<addr>) = <data> */
3022 /* Guarded load. Note that this is defined to evaluate all
3023 expression fields (addr, alt) even if the guard evaluates
3024 to false.
3025 ppIRStmt output:
3026 t<tmp> = if (<guard>) <cvt>(LD<end>(<addr>)) else <alt> */
3031 /* Do an atomic compare-and-swap operation. Semantics are
3032 described above on a comment at the definition of IRCAS.
3034 ppIRStmt output:
3035 t<tmp> = CAS<end>(<addr> :: <expected> -> <new>)
3036 eg
3037 t1 = CASle(t2 :: t3->Add32(t3,1))
3038 which denotes a 32-bit atomic increment
3039 of a value at address t2
3041 A double-element CAS may also be denoted, in which case <tmp>,
3042 <expected> and <new> are all pairs of items, separated by
3043 commas.
3044 */
3049 /* Either Load-Linked or Store-Conditional, depending on
3050 STOREDATA.
3052 If STOREDATA is NULL then this is a Load-Linked, meaning
3053 that data is loaded from memory as normal, but a
3054 'reservation' for the address is also lodged in the
3055 hardware.
3057 result = Load-Linked(addr, end)
3059 The data transfer type is the type of RESULT (I32, I64,
3060 etc). ppIRStmt output:
3062 result = LD<end>-Linked(<addr>), eg. LDbe-Linked(t1)
3064 If STOREDATA is not NULL then this is a Store-Conditional,
3065 hence:
3067 result = Store-Conditional(addr, storedata, end)
3069 The data transfer type is the type of STOREDATA and RESULT
3070 has type Ity_I1. The store may fail or succeed depending
3071 on the state of a previously lodged reservation on this
3072 address. RESULT is written 1 if the store succeeds and 0
3073 if it fails. eg ppIRStmt output:
3075 result = ( ST<end>-Cond(<addr>) = <storedata> )
3076 eg t3 = ( STbe-Cond(t1, t2) )
3078 In all cases, the address must be naturally aligned for
3079 the transfer type -- any misaligned addresses should be
3080 caught by a dominating IR check and side exit. This
3081 alignment restriction exists because on at least some
3082 LL/SC platforms (ppc), stwcx. etc will trap w/ SIGBUS on
3083 misaligned addresses, and we have to actually generate
3084 stwcx. on the host, and we don't want it trapping on the
3085 host.
3087 Summary of rules for transfer type:
3088 STOREDATA == NULL (LL):
3089 transfer type = type of RESULT
3090 STOREDATA != NULL (SC):
3091 transfer type = type of STOREDATA, and RESULT :: Ity_I1
3092 */
3094 IREndness end;
3095 IRTemp result;
3100 /* Call (possibly conditionally) a C function that has side
3101 effects (ie. is "dirty"). See the comments above the
3102 IRDirty type declaration for more information.
3104 ppIRStmt output:
3105 t<tmp> = DIRTY <guard> <effects>
3106 ::: <callee>(<args>)
3107 eg.
3108 t1 = DIRTY t27 RdFX-gst(16,4) RdFX-gst(60,4)
3109 ::: foo{0x380035f4}(t2)
3110 */
3115 /* A memory bus event - a fence, or acquisition/release of the
3116 hardware bus lock. IR optimisation treats all these as fences
3117 across which no memory references may be moved.
3118 ppIRStmt output: MBusEvent-Fence,
3119 MBusEvent-BusLock, MBusEvent-BusUnlock.
3120 */
3122 IRMBusEvent event;
3125 /* Conditional exit from the middle of an IRSB.
3126 ppIRStmt output: if (<guard>) goto {<jk>} <dst>
3127 eg. if (t69) goto {Boring} 0x4000AAA:I32
3128 If <guard> is true, the guest state is also updated by
3129 PUT-ing <dst> at <offsIP>. This is done because a
3130 taken exit must update the guest program counter.
3131 */
3139 }
3140 IRStmt;
3142 /* Statement constructors. */
3160 Int offsIP );
3162 /* Deep-copy an IRStmt. */
3165 /* Pretty-print an IRStmt. */
3169 /* ------------------ Basic Blocks ------------------ */
3171 /* Type environments: a bunch of statements, expressions, etc, are
3172 incomplete without an environment indicating the type of each
3173 IRTemp. So this provides one. IR temporaries are really just
3174 unsigned ints and so this provides an array, 0 .. n_types_used-1 of
3175 them.
3176 */
3177 typedef
3180 Int types_size;
3181 Int types_used;
3182 }
3183 IRTypeEnv;
3185 /* Obtain a new IRTemp */
3188 /* Deep-copy a type environment */
3191 /* Pretty-print a type environment */
3195 /* Code blocks, which in proper compiler terminology are superblocks
3196 (single entry, multiple exit code sequences) contain:
3198 - A table giving a type for each temp (the "type environment")
3199 - An expandable array of statements
3200 - An expression of type 32 or 64 bits, depending on the
3201 guest's word size, indicating the next destination if the block
3202 executes all the way to the end, without a side exit
3203 - An indication of any special actions (JumpKind) needed
3204 for this final jump.
3205 - Offset of the IP field in the guest state. This will be
3206 updated before the final jump is done.
3208 "IRSB" stands for "IR Super Block".
3209 */
3210 typedef
3214 Int stmts_size;
3215 Int stmts_used;
3217 IRJumpKind jumpkind;
3218 Int offsIP;
3219 }
3220 IRSB;
3222 /* Allocate a new, uninitialised IRSB */
3225 /* Deep-copy an IRSB */
3228 /* Deep-copy an IRSB, except for the statements list, which set to be
3229 a new, empty, list of statements. */
3232 /* Pretty-print an IRSB */
3235 /* Append an IRStmt to an IRSB */
3239 /*---------------------------------------------------------------*/
3240 /*--- Helper functions for the IR ---*/
3241 /*---------------------------------------------------------------*/
3243 /* For messing with IR type environments */
3246 /* What is the type of this expression? */
3251 /* What are the arg and result type for this IRLoadGOp? */
3256 /* Sanity check a BB of IR */
3259 Bool require_flatness,
3260 IRType guest_word_size );
3264 /* Is this any value actually in the enumeration 'IRType' ? */
3268 /*---------------------------------------------------------------*/
3269 /*--- IR injection ---*/
3270 /*---------------------------------------------------------------*/
3277 /*---------------------------------------------------------------*/
3278 /*--- libvex_ir.h ---*/
3279 /*---------------------------------------------------------------*/