| /src/usr.bin/make/unit-tests/ |
| varmod-order-reverse.mk | 3 # Tests for the :Or variable modifier, which returns the words, sorted in
8 .if ${WORDS:Or} != "two three ten six seven one nine four five eight"
9 . error ${WORDS:Or}
|
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| ThreadSafetyLogical.cpp | 32 // Calculates the logical OR implication operator.
48 // C => !(A & B) [if] C => !A | !B [===] C => !A or C => !B
51 case LExpr::Or:
53 // C => (A | B) [if] C => A or C => B
56 return RNeg ? RightAndOperator(cast<Or>(RHS))
57 : RightOrOperator(cast<Or>(RHS));
71 // A & B => C [if] A => C or B => C
76 case LExpr::Or:
80 // !(A | B) => C [if] !A & !B => C [===] !A => C or !B => C
81 return LNeg ? LeftOrOperator(cast<Or>(LHS)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| BoundsChecking.cpp | 53 /// the result from the load or the value being stored. It is used to determine
99 Value *Or = IRB.CreateOr(Cmp2, Cmp3);
103 Or = IRB.CreateOr(Cmp1, Or);
106 return Or;
111 /// \p Or is the condition that should guard the trap.
115 static void insertBoundsCheck(Value *Or, BuilderTy &IRB, GetTrapBBT GetTrapBB) {
117 ConstantInt *C = dyn_cast_or_null<ConstantInt>(Or);
140 BranchInst::Create(GetTrapBB(IRB), Cont, Or, OldBB);
154 Value *Or = nullptr
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 26 Or,
75 class Or : public BinOp {
77 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {}
79 static bool classof(const LExpr *E) { return E->kind() == LExpr::Or; }
|
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| traits.h | 5 This program is free software; you can redistribute it and/or modify
7 the Free Software Foundation; either version 3 of the License, or
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
93 because "and/or", etc. are reserved keywords. */
100 struct Or;
103 struct Or<> : public std::false_type
107 struct Or<B1> : public B1
111 struct Or<B1, B2>
116 struct Or<B1, B2, B3, Bn...>
117 : public std::conditional<B1::value, B1, Or<B2, B3, Bn...>>::typ
[all...] |
| poison.h | 7 This program is free software; you can redistribute it and/or modify
9 the Free Software Foundation; either version 3 of the License, or
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
48 either void, or POD. */
51 : gdb::Or<std::is_void<T>,
63 I.e., T is either trivially copyable, or void. */
66 : gdb::Or<std::is_void<T>,
91 using IsFreeable = gdb::Or<std::is_trivially_destructible<T>, std::is_void<T>>;
137 non-POD data type. Use operator new[] (or std::vector) instead.");
149 non-POD data type. Use operator new[] (or std::vector) instead.")
[all...] |
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| traits.h | 5 This program is free software; you can redistribute it and/or modify
7 the Free Software Foundation; either version 3 of the License, or
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
93 because "and/or", etc. are reserved keywords. */
100 struct Or;
103 struct Or<> : public std::false_type
107 struct Or<B1> : public B1
111 struct Or<B1, B2>
116 struct Or<B1, B2, B3, Bn...>
117 : public std::conditional<B1::value, B1, Or<B2, B3, Bn...>>::typ
[all...] |
| poison.h | 7 This program is free software; you can redistribute it and/or modify
9 the Free Software Foundation; either version 3 of the License, or
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
48 either void, or POD. */
51 : gdb::Or<std::is_void<T>,
63 I.e., T is either trivially copyable, or void. */
66 : gdb::Or<std::is_void<T>,
91 using IsFreeable = gdb::Or<std::is_trivially_destructible<T>, std::is_void<T>>;
137 non-POD data type. Use operator new[] (or std::vector) instead.");
149 non-POD data type. Use operator new[] (or std::vector) instead.")
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
| InstCombineAtomicRMW.cpp | 22 /// ordering effects on nearby instructions, or be volatile.
43 case AtomicRMWInst::Or:
82 case AtomicRMWInst::Or:
101 // load or just a store. We chose not to canonicalize out of general paranoia
117 "AtomicRMWs don't make sense with Unordered or NotAtomic");
138 // optimizer to match easily. The choices of or w/0 and fadd w/-0.0 are
141 RMWI.getOperation() != AtomicRMWInst::Or) {
142 RMWI.setOperation(AtomicRMWInst::Or);
|
| InstCombineAndOrXor.cpp | 54 /// operands into either a constant true or false, or a brand new ICmp
66 /// operands into either a FCmp instruction, or a true/false constant.
79 /// Transform BITWISE_OP(BSWAP(A),BSWAP(B)) or
82 /// \return Pointer to node that must replace the original binary operator, or
119 /// whether to treat V, Lo, and Hi as signed or not.
147 /// described as the "AMask" or "BMask" part of the enum. If the enum contains
149 /// then it was proven that (A & C) == C. This is trivial if C == A or C == 0.
153 /// "AllOnes" declares that the comparison is true only if (A & B) == A or all
157 /// "AllZeros" declares that the comparison is true only if (A & B) == 0 or al
[all...] |
| /src/external/gpl2/groff/dist/contrib/mm/ |
| NOTES | 7 Implementation notes. (Or how to make your own national mm)
13 The arg is part of a filename in mm/*.MT or mm/*.cov.
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| ReplaceConstant.cpp | 46 case Instruction::Or:
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| VPlanPredicator.cpp | 41 // Set the intermediate value - this is either 'CBV', or 'not CBV'
80 // We pop a pair of values from the front (e.g. P1 and P2), generate an OR
98 // Create an OR of these values.
99 VPValue *Or = Builder.createOr(LHS, RHS);
101 // Push OR to the back of the worklist.
102 Worklist.push_back(Or);
115 // Return whether the edge FromBlock -> ToBlock is a TRUE_EDGE or FALSE_EDGE
179 // Logically OR all incoming predicates by building the Predicate Tree.
|
| /src/external/gpl3/gdb/dist/gdb/ |
| amd-dbgapi-target.h | 7 This program is free software; you can redistribute it and/or modify
9 the Free Software Foundation; either version 3 of the License, or
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
34 = gdb::Or<std::is_same<T, amd_dbgapi_address_class_id_t>,
|
| /src/external/gpl3/gdb.old/dist/gdb/ |
| amd-dbgapi-target.h | 7 This program is free software; you can redistribute it and/or modify
9 the Free Software Foundation; either version 3 of the License, or
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
34 = gdb::Or<std::is_same<T, amd_dbgapi_address_class_id_t>,
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/ |
| TruncInstCombine.cpp | 62 case Instruction::Or:
128 case Instruction::Or:
204 // bit-width, or for a smaller valid bit-width, then just keep the
358 case Instruction::Or:
|
| /src/crypto/external/apache2/openssl/dist/test/ |
| mldsa_wycheproof_parse.py | 6 # in the file LICENSE in the source distribution or at
26 from _ast import Or
47 if 'IncorrectPrivateKeyLength' in tst['flags'] or 'InvalidPrivateKey' in tst['flags']:
84 if 'IncorrectPublicKeyLength' in tst['flags'] or 'InvalidPublicKey' in tst['flags']:
129 print("# in the file LICENSE in the source distribution or at")
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| Instruction.h | 79 // or not.
98 /// or nullptr it the function does not have a module.
101 /// parent, or the parent basic block does not have a parent function.
199 /// Return true if this is a logical shift left or a logical shift right.
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.
311 /// or replaces metadata if already present, or removes it if Node is null.
351 /// Retrieve the raw weight values of a conditional branch or select
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| Reassociate.cpp | 125 if (I && (I->getOpcode() == Instruction::Or ||
136 isOr = (I->getOpcode() == Instruction::Or);
195 return 0; // Otherwise it's a global or constant, rank 0.
209 // If this is a 'not' or 'neg' instruction, do not count it for rank. This
303 /// operation is equivalent to X if LHS + RHS is odd, or 0 if LHS + RHS is even;
325 // weight of 1. Keeping weights at zero or one also means that wrapping is
347 // bit number x, since either x is odd in which case x^CM = 1, or x is even in
360 // For Bitwidth 4 or more the following sum does not overflow.
397 /// or use RewriteExprTree to put the values back in.
400 /// node 'I' (i.e. is not a binary operator at all, or is, but with a differen
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/ |
| MIPatternMatch.h | 149 template <typename... Preds> struct Or {
157 struct Or<Pred, Preds...> : Or<Preds...> {
159 Or(Pred &&p, Preds &&... preds)
160 : Or<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {}
163 return P.match(MRI, src) || Or<Preds...>::match(MRI, src);
171 template <typename... Preds> Or<Preds...> m_any_of(Preds &&... preds) {
172 return Or<Preds...>(std::forward<Preds>(preds)...);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPUAtomicOptimizer.cpp | 128 case AtomicRMWInst::Or:
189 Op = AtomicRMWInst::Or;
262 case AtomicRMWInst::Or:
263 return B.CreateBinOp(Instruction::Or, LHS, RHS);
353 // row operations we have to use permlane or readlane.
401 // row operations we have to use permlane or readlane.
434 case AtomicRMWInst::Or:
571 case AtomicRMWInst::Or:
668 case AtomicRMWInst::Or:
|
| /src/sys/external/bsd/acpica/dist/tests/misc/ |
| grammar.asl | 2 * Some or all of this work - Copyright (c) 2006 - 2020, Intel Corp.
5 * Redistribution and use in source and binary forms, with or without modification,
12 * and/or other materials provided with the distribution.
14 * may be used to endorse or promote products derived from this software
18 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
23 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON AN
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/RISCV/ |
| RISCVTargetTransformInfo.cpp | 57 case Instruction::Or:
125 // know whether the LoopVectorizer is safe to do or not.
|
| RISCVTargetTransformInfo.h | 159 case RecurKind::Or:
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/ |
| SystemZTDC.cpp | 22 // 9: or i1 (tdc X, M1), (tdc X, M2) -> tdc X, (M1 | M2)
31 // 2. All and/or/xor i1 instructions whose both operands have been already
87 // The queue of and/or/xor i1 instructions to be potentially folded.
98 // Tries to convert an i1 and/or/xor instruction, whose both operands
103 // any and/or/xor i1 users to the queue.
112 LI->getOpcode() == Instruction::Or ||
308 case Instruction::Or:
381 // If unused, or used and converted, remove it.
|
