| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| ThreadSafetyLogical.cpp | 17 // Implication. We implement De Morgan's Laws by maintaining LNeg and RNeg
18 // to keep track of whether LHS and RHS are negated.
22 // Calculates the logical AND implication operator.
44 case LExpr::And:
46 // C => A & B [if] C => A and C => B
49 return RNeg ? RightOrOperator(cast<And>(RHS))
50 : RightAndOperator(cast<And>(RHS));
55 // C => !(A | B) [if] C => !A & !B [===] C => !A and C => !B
69 case LExpr::And:
73 // !(A & B) => C [if] !A | !B => C [===] !A => C and !B =>
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Basic/ |
| OperatorPrecedence.h | 10 /// Defines and computes precedence levels for binary/ternary operators.
35 And = 8, // &
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| GuardUtils.cpp | 8 // Utils that are used to perform analyzes related to guards and their
80 // 1) br (i1 (and A, WC())), label %IfTrue, label %IfFalse
81 // 2) br (i1 (and WC(), B)), label %IfTrue, label %IfFalse
82 // We do not check for more generalized and trees as we should canonicalize
87 auto *And = dyn_cast<Instruction>(Cond);
88 if (!And)
94 WC = &And->getOperandUse(0);
95 C = &And->getOperandUse(1);
101 WC = &And->getOperandUse(1);
102 C = &And->getOperandUse(0)
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 25 And,
68 class And : public BinOp {
70 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
72 static bool classof(const LExpr *E) { return E->kind() == LExpr::And; }
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| SIOptimizeExecMaskingPreRA.cpp | 81 // See if there is a def between \p AndIdx and \p SelIdx that needs to live
92 const MachineInstr &Sel, const MachineInstr &And) {
93 SlotIndex AndIdx = LIS->getInstructionIndex(And);
132 auto *And =
134 if (!And || And->getOpcode() != AndOpc ||
135 !And->getOperand(1).isReg() || !And->getOperand(2).isReg())
138 MachineOperand *AndCC = &And->getOperand(1);
142 AndCC = &And->getOperand(2)
[all...] |
| SILowerControlFlow.cpp | 13 /// All control flow is handled using predicated instructions and
19 /// Vector ALU) and then the ScalarALU will AND the VCC register with the
32 /// %sgpr0 = S_AND_SAVEEXEC_B64 %vcc // Save and update the exec mask
108 // Skip to the next instruction, ignoring debug instructions, and trivial
110 // and the successor has one predecessor.
209 // If there is only one use of save exec register and that use is SI_END_CF,
233 MachineInstr *And =
238 setImpSCCDefDead(*And, true);
271 // Replace with and so we don't need to fix the live interval for conditio
[all...] |
| AMDGPUAtomicOptimizer.cpp | 127 case AtomicRMWInst::And:
141 // operation on a different address, and we cannot optimize that.
150 // we have DPP available on our subtarget, and the atomic operation is 32
184 Op = AtomicRMWInst::And;
224 // we have DPP available on our subtarget, and the atomic operation is 32
260 case AtomicRMWInst::And:
261 return B.CreateBinOp(Instruction::And, LHS, RHS);
314 // Pick an arbitrary lane from 0..31 and an arbitrary lane from 32..63 and
355 // Combine lane 15 into lanes 16..31 (and, for wave 64, lane 47 into lane
[all...] |
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| traits.h | 5 This program is free software; you can redistribute it and/or modify
93 because "and/or", etc. are reserved keywords. */
121 struct And;
124 struct And<> : public std::true_type
128 struct And<B1> : public B1
132 struct And<B1, B2>
137 struct And<B1, B2, B3, Bn...>
138 : public std::conditional<B1::value, And<B2, B3, Bn...>, B1>::type
|
| poison.h | 7 This program is free software; you can redistribute it and/or modify
39 and old code was initializing S objects like this:
52 gdb::And<std::is_standard_layout<T>, std::is_trivial<T>>>
59 /* Similarly, poison memcpy and memmove of non trivially-copyable
70 /* True if both source and destination are relocatable. */
74 = gdb::And<IsRelocatable<D>, IsRelocatable<S>>;
84 /* Poison XNEW and friends to catch usages of malloc-style allocations on
|
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| traits.h | 5 This program is free software; you can redistribute it and/or modify
93 because "and/or", etc. are reserved keywords. */
121 struct And;
124 struct And<> : public std::true_type
128 struct And<B1> : public B1
132 struct And<B1, B2>
137 struct And<B1, B2, B3, Bn...>
138 : public std::conditional<B1::value, And<B2, B3, Bn...>, B1>::type
|
| poison.h | 7 This program is free software; you can redistribute it and/or modify
39 and old code was initializing S objects like this:
52 gdb::And<std::is_standard_layout<T>, std::is_trivial<T>>>
59 /* Similarly, poison memcpy and memmove of non trivially-copyable
70 /* True if both source and destination are relocatable. */
74 = gdb::And<IsRelocatable<D>, IsRelocatable<S>>;
84 /* Poison XNEW and friends to catch usages of malloc-style allocations on
|
| /src/external/gpl2/gettext/dist/gettext-tools/tests/ |
| xgettext-2 | 17 And even further on occasion
|
| xgettext-3 | 17 And even further on accasion
|
| xgettext-c-2 | 3 # Test C support: comments meant for xgettext, and whitespace.
16 And even further on accasion
|
| xgettext-csharp-2 | 22 // And now a comment with Русский and 日本語 and Unicode escapes: B\u00f6se B\u00fcbchen
74 #. And now a comment with Русский and 日本語 and Unicode escapes: B\u00f6se B\u00fcbchen
|
| /src/external/apache2/llvm/dist/clang/lib/Basic/ |
| OperatorPrecedence.cpp | 10 /// Defines and computes precedence levels for binary/ternary operators.
34 // taken as the end of the template-argument-list and completes
59 case tok::amp: return prec::And;
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| ReplaceConstant.cpp | 45 case Instruction::And:
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
| InstCombineAtomicRMW.cpp | 20 /// Return true if and only if the given instruction does not modify the memory
23 /// TODO: Common w/ the version in AtomicExpandPass, and change the term used.
46 case AtomicRMWInst::And:
84 case AtomicRMWInst::And:
100 // Volatile RMWs perform a load and a store, we cannot replace this by just a
137 // operation code and constant. This makes it easier for the rest of the
138 // optimizer to match easily. The choices of or w/0 and fadd w/-0.0 are
|
| InstCombineCompares.cpp | 9 // This file implements the visitICmp and visitFCmp functions.
74 /// to zero and updates the predicate accordingly.
130 // Check that indices after the variable are constants and in-range for the
161 // and 87 is the second (and last) index. FirstTrueElement is -2 when
163 // -2 when undefined, -3 when overdefined and >= 0 when that index is true.
173 /// This is -2 when undefined, -3 when overdefined, and otherwise the last
175 /// use relative comparisons and don't want 0-1 to match -1.
183 // Scan the array and see if one of our patterns matches.
379 /// "icmp ne i, 0". Note that, in general, indices can be complex, and scale
[all...] |
| /src/usr.bin/make/unit-tests/ |
| comment.mk | 13 on and on.
23 .endif # And after the closing directive.
52 .if ${VAR} != "\#" # And in the comparison.
|
| /src/sys/arch/x68k/stand/xxboot/ |
| boot.S | 8 | the boot partition to 0x3000. And jump to there.
11 | /boot from its filesystem to 0x6000. And jump to there.
43 | - must use RELOC() macro to access bss section (and first_kbyte as a jump
78 | This will be printed on boot_error. And it also roles
88 | Disklabel must be placed at 0x40 and the size is 404 bytes.
130 | Here the above "subw %a1,%d0" = 0x9049 and %d0.w = -1 at this
248 | There seems to be no interface or consensus about this and
255 | SCSI IPLs (genuine and SxSI):
337 | Print an error message, wait for key press, and reboot.
344 | Print an error message, wait for key press, and reboot
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/ |
| TruncInstCombine.cpp | 9 // TruncInstCombine - looks for expression dags post-dominated by TruncInst and
11 // the old expression with this new one and remove the old expression.
14 // 2. Supported leaves: ZExtInst, SExtInst, TruncInst and Constant value.
20 // The motivation for this optimization is that evaluating and expression using
47 /// Given an instruction and a container, it fills all the relevant operands of
61 case Instruction::And:
98 // Worklist and the Stack, and add it to the instruction info map.
127 case Instruction::And:
141 // 4. phi node(and loop handling
[all...] |
| AggressiveInstCombine.cpp | 49 /// This class provides both the logic to combine expression patterns and
87 // Match V to funnel shift left/right and capture the source operands and
117 // One phi operand must be a funnel/rotate operation, and the other phi
197 /// This is used by foldAnyOrAllBitsSet() to capture a source value (Root) and
199 /// of 'and' ops, then we also need to capture the fact that we saw an
200 /// "and X, 1", so that's an extra return value for that case.
213 /// chain of 'and' or 'or' instructions looking for shift ops of a common source
217 /// and (and (X >> 1), 1), (X >> 4
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| Instruction.h | 122 /// This method unlinks 'this' from the containing basic block and deletes it.
135 /// Unlink this instruction from its current basic block and insert it into
139 /// Unlink this instruction and insert into BB before I.
144 /// Unlink this instruction from its current basic block and insert it into
209 /// Determine if the Opcode is and/or/xor.
211 return Opcode == And || Opcode == Or || Opcode == Xor;
214 /// Return true if this is and/or/xor.
321 /// If the instruction has "branch_weights" MD_prof metadata and the MDNode
474 /// Convenience method to copy supported exact, fast-math, and (optionally)
478 /// Logical 'and' of any supported wrapping, exact, and fast-math flags o
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/ |
| MIPatternMatch.h | 117 // We might want to support taking in some MachineOperands and call getReg on
130 template <typename... Preds> struct And {
138 struct And<Pred, Preds...> : And<Preds...> {
140 And(Pred &&p, Preds &&... preds)
141 : And<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {
145 return P.match(MRI, src) && And<Preds...>::match(MRI, src);
167 template <typename... Preds> And<Preds...> m_all_of(Preds &&... preds) {
168 return And<Preds...>(std::forward<Preds>(preds)...);
467 // General helper for generic MI compares, i.e. G_ICMP and G_FCM
[all...] |
