Home | History | Annotate | Download | only in priv

Lines Matching defs:of

7    This file is part of Valgrind, a dynamic binary instrumentation
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
19 WITHOUT ANY WARRANTY; without even the implied warranty of
23 You should have received a copy of the GNU General Public License
30 Neither the names of the U.S. Department of Energy nor the
31 University of California nor the names of its contributors may be
51 These calls are of course in the host machine code and
55 Only change the signatures of these helper functions very
68 /* Set to 1 to get detailed profiling info about use of the flag
195 { ULong cf, pf, af, zf, sf, of; \
205 of = lshift((argL ^ argR ^ -1) & (argL ^ res), \
207 return cf | pf | af | zf | sf | of; \
216 { ULong cf, pf, af, zf, sf, of; \
226 of = lshift((argL ^ argR) & (argL ^ res), \
228 return cf | pf | af | zf | sf | of; \
237 { ULong cf, pf, af, zf, sf, of; \
251 of = lshift((argL ^ argR ^ -1) & (argL ^ res), \
253 return cf | pf | af | zf | sf | of; \
262 { ULong cf, pf, af, zf, sf, of; \
276 of = lshift((argL ^ argR) & (argL ^ res), \
278 return cf | pf | af | zf | sf | of; \
287 { ULong cf, pf, af, zf, sf, of; \
293 of = 0; \
294 return cf | pf | af | zf | sf | of; \
303 { ULong cf, pf, af, zf, sf, of; \
313 of = ((res & DATA_MASK) == SIGN_MASK) << 11; \
314 return cf | pf | af | zf | sf | of; \
323 { ULong cf, pf, af, zf, sf, of; \
333 of = ((res & DATA_MASK) \
335 return cf | pf | af | zf | sf | of; \
344 { ULong cf, pf, af, zf, sf, of; \
350 /* of is defined if shift count == 1 */ \
351 of = lshift(CC_DEP2 ^ CC_DEP1, 12 - DATA_BITS) \
353 return cf | pf | af | zf | sf | of; \
362 { ULong cf, pf, af, zf, sf, of; \
368 /* of is defined if shift count == 1 */ \
369 of = lshift(CC_DEP2 ^ CC_DEP1, 12 - DATA_BITS) \
371 return cf | pf | af | zf | sf | of; \
377 /* ROL: cf' = lsb(result). of' = msb(result) ^ lsb(result). */
394 /* ROR: cf' = msb(result). of' = msb(result) ^ msb-1(result). */
415 { ULong cf, pf, af, zf, sf, of; \
430 of = cf << 11; \
431 return cf | pf | af | zf | sf | of; \
441 { ULong cf, pf, af, zf, sf, of; \
456 of = cf << 11; \
457 return cf | pf | af | zf | sf | of; \
466 { ULong cf, pf, af, zf, sf, of; \
474 of = cf << 11; \
475 return cf | pf | af | zf | sf | of; \
484 { ULong cf, pf, af, zf, sf, of; \
492 of = cf << 11; \
493 return cf | pf | af | zf | sf | of; \
502 { ULong cf, pf, af, zf, sf, of; \
508 of = 0; \
509 return cf | pf | af | zf | sf | of; \
518 { ULong cf, pf, af, zf, sf, of; \
524 of = 0; \
525 return cf | pf | af | zf | sf | of; \
534 { Long cf, pf, af, zf, sf, of; \
540 of = 0; \
541 return cf | pf | af | zf | sf | of; \
550 { ULong cf, pf, af, zf, sf, of; \
556 of = 0; \
557 return cf | pf | af | zf | sf | of; \
824 ULong of,sf,zf,cf,pf;
836 case AMD64CondO: /* OF == 1 */
837 of = rflags >> AMD64G_CC_SHIFT_O;
838 return 1 & (inv ^ of);
869 case AMD64CondL: /* (SF xor OF) == 1 */
871 of = rflags >> AMD64G_CC_SHIFT_O;
872 return 1 & (inv ^ (sf ^ of));
876 case AMD64CondLE: /* ((SF xor OF) or ZF) == 1 */
878 of = rflags >> AMD64G_CC_SHIFT_O;
880 return 1 & (inv ^ ((sf ^ of) | zf));
1039 the idiom "do a 32-bit add and jump to out-of-line code if
1184 the idiom "do a 32-bit subtract and jump to out-of-line
1417 /* byte sub/cmp of zero, then S --> test (dst-0 <s 0)
1421 top bit of a byte is 1 or 0. See also LOGICB/CondS below. */
1431 /* byte sub/cmp of zero, then NS --> test !(dst-0 <s 0)
1458 result and makes OF be zero. L computes SF ^ OF, but
1459 OF is zero, so this reduces to SF -- which will be 1 iff
1488 result and makes OF be zero. LE computes (SF ^ OF) | ZF, but
1489 OF is zero, so this reduces to SF | ZF -- which will be 1 iff
1547 bit of a byte register is set: eg testb %al,%al; js ..
1548 Since it just depends on the top bit of the byte, extract
1549 that bit and explicitly get rid of all the rest. This
1551 of the other bits in the byte are undefined. */
1569 /* 8-bit inc, then LE --> sign bit of the arg */
1608 /* This can happen, as a result of amd64 FP compares: "comisd ... ;
1870 of sync, in that it thinks all FP registers are defined by
2038 /* The only non-register parts of the SSE state are MXCSR and
2052 the result at the given address which represents a buffer of at
2069 /* That's the first 160 bytes of the image done. */
2115 /* Copy the x87 registers out of the image, into a temporary
2485 of sync, in that it thinks all FP registers are defined by
2520 /* Claim to be the following CPU, which is probably representative of
2879 these CPUID values should only try to use 3 of the 8 XSave-family
3048 values should only try to use 3 of the 8 XSave-family instructions:
3222 ULong cf=0, of=0, tempcf;
3227 of = ((arg >> 63) ^ cf) & 1;
3238 of = ((arg >> 31) ^ cf) & 1;
3249 of = ((arg >> 15) ^ cf) & 1;
3260 of = ((arg >> 7) ^ cf) & 1;
3273 of &= 1;
3275 rflags_in |= (cf << AMD64G_CC_SHIFT_C) | (of << AMD64G_CC_SHIFT_O);
3290 ULong cf=0, of=0, tempcf;
3301 of = ((arg >> 63) ^ cf) & 1;
3312 of = ((arg >> 31) ^ cf) & 1;
3323 of = ((arg >> 15) ^ cf) & 1;
3334 of = ((arg >> 7) ^ cf) & 1;
3341 of &= 1;
3343 rflags_in |= (cf << AMD64G_CC_SHIFT_C) | (of << AMD64G_CC_SHIFT_O);
3412 only because of the difficulty of returning 96 bits from a C
3450 break; /* note: no 64-bit version of insn exists */
3480 break; /* note: no 64-bit version of insn exists */
3678 lower half of a 64 bit word. */
3680 /* For dst we need to get hold of 56 bits (7 bytes) from a total of
3681 11 bytes. If calculating the low part of the result, need bytes
3768 accesses of memory, is a pure function.
3770 opc_and_imm contains (4th byte of opcode << 8) | the-imm8-byte so
3772 what the specific operation is. 4th byte of opcode is in the range
3784 For ESTRx variants, edxIN and eaxIN hold the values of those two
3787 In all cases, the bottom 16 bits of the result contain the new
3788 OSZACP %rflags values. For xSTRI variants, bits[31:16] of the
3886 // In all cases, the new OSZACP value is the lowest 16 of
4013 /* Multiplication of the finite fields elements of AES.
4323 /* Figure out if any part of the guest state contained in minoff
4375 /* Total size of the guest state, in bytes. */
4396 gdefs.h on meaning of thunk fields. */