| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | P10InstrResources.td | 629 // 4 Cycles ALU2 operations, 0 input operands 635 // 4 Cycles ALU2 operations, 1 input operands 705 // 4 Cycles ALU2 operations, 2 input operands 864 // 2 Cycles ALU operations, 1 input operands 871 // 3 Cycles ALU operations, 0 input operands 881 // 3 Cycles ALU operations, 1 input operands 966 // 3 Cycles ALU operations, 2 input operands 1109 // 3 Cycles ALU operations, 3 input operands 1120 // 3 Cycles ALU operations, 0 input operands 1133 // 3 Cycles ALU operations, 1 input operands [all …]
|
| H A D | PPCBoolRetToInt.cpp | 84 for (auto &Op : CurrUser->operands()) in findAllDefs() 149 const auto &Operands = P->operands(); in getPromotablePHINodes() 168 const auto &Operands = P->operands(); in getPromotablePHINodes() 210 for (auto &U : CI->operands()) in runOnFunction()
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/ |
| H A D | SimplifyConstraints.cpp | 39 substitute(*F.operands()[0], Substitutions, arena), in substitute() 40 substitute(*F.operands()[1], Substitutions, arena)); in substitute() 93 if (Constraint->operands()[0]->kind() == Formula::AtomRef) in simplifyConstraints() 94 FalseAtoms.insert(Constraint->operands()[0]->getAtom()); in simplifyConstraints() 97 ArrayRef<const Formula *> operands = Constraint->operands(); in simplifyConstraints() local 98 if (operands[0]->kind() == Formula::AtomRef && in simplifyConstraints() 99 operands[1]->kind() == Formula::AtomRef) { in simplifyConstraints() 100 EquivalentAtoms.unionSets(operands[0]->getAtom(), in simplifyConstraints() 101 operands[1]->getAtom()); in simplifyConstraints() 141 NewConstraints.insert(NewConstraint.operands()[0]); in simplifyConstraints() [all …]
|
| H A D | WatchedLiteralsSolver.cpp | 286 for (const Formula *F : Val->operands()) in buildCNF() 329 const Variable LHS = GetVar(Val->operands()[0]); in buildCNF() 330 const Variable RHS = GetVar(Val->operands()[1]); in buildCNF() 349 const Variable LHS = GetVar(Val->operands()[0]); in buildCNF() 350 const Variable RHS = GetVar(Val->operands()[1]); in buildCNF() 369 const Variable Operand = GetVar(Val->operands()[0]); in buildCNF() 379 const Variable LHS = GetVar(Val->operands()[0]); in buildCNF() 380 const Variable RHS = GetVar(Val->operands()[1]); in buildCNF() 392 const Variable LHS = GetVar(Val->operands()[0]); in buildCNF() 393 const Variable RHS = GetVar(Val->operands()[1]); in buildCNF() [all …]
|
| H A D | Formula.cpp | 80 operands()[0]->print(OS, Names); in print() 84 operands()[0]->print(OS, Names); in print() 86 operands()[1]->print(OS, Names); in print()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | OperandTraits.h | 40 static unsigned operands(const User*) { in operands() function 54 static unsigned operands(const User *U) { in operands() function 78 static unsigned operands(const User *U) { in operands() function 102 static unsigned operands(const User *U) { in operands() function 139 assert(i_nocapture < OperandTraits<CLASS>::operands(this) \ 145 assert(i_nocapture < OperandTraits<CLASS>::operands(this) \ 150 return OperandTraits<CLASS>::operands(this); \
|
| /freebsd-14.2/contrib/bmake/unit-tests/ |
| H A D | cond-cmp-string.exp | 5 make: "cond-cmp-string.mk" line 118: Comparison with '<' requires both operands 'string' and 'strin… 6 make: "cond-cmp-string.mk" line 126: Comparison with '<=' requires both operands 'string' and 'stri… 7 make: "cond-cmp-string.mk" line 134: Comparison with '>' requires both operands 'string' and 'strin… 8 make: "cond-cmp-string.mk" line 142: Comparison with '>=' requires both operands 'string' and 'stri…
|
| H A D | cond-cmp-numeric.exp | 2 make: "cond-cmp-numeric.mk" line 15: Comparison with '>' requires both operands 'INF' and '1e100' t… 4 make: "cond-cmp-numeric.mk" line 21: Comparison with '>' requires both operands 'NaN' and 'NaN' to … 12 make: "cond-cmp-numeric.mk" line 54: Comparison with '<' requires both operands '123 ' and '124' to…
|
| /freebsd-14.2/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | X86DisassemblerShared.h | 19 operands[llvm::X86Disassembler::X86_MAX_OPERANDS]; member 26 memset(operands, 0, sizeof(operands)); in InstructionSpecifier()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/IR/ |
| H A D | TypeFinder.cpp | 61 for (const Use &U : FI.operands()) in run() 75 for (const auto &O : I.operands()) in run() 95 for (const auto *MDOp : NMD.operands()) in run() 165 for (const auto &I : U->operands()) in incorporateValue() 177 for (Metadata *Op : V->operands()) { in incorporateMDNode()
|
| H A D | ReplaceConstant.cpp | 32 for (auto [Idx, Op] : enumerate(C->operands())) { in expandUser() 39 for (auto [Idx, Op] : enumerate(C->operands())) { in expandUser() 82 for (Use &U : I->operands()) { in convertUsersOfConstantsToInstructions()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolutionExpressions.h | 218 ArrayRef<const SCEV *> operands() const { in operands() function 697 for (const auto *Op : S->operands()) { in visitAll() 804 for (const auto *Op : Expr->operands()) { in visitAddExpr() 814 for (const auto *Op : Expr->operands()) { in visitMulExpr() 831 for (const auto *Op : Expr->operands()) { in visitAddRecExpr() 843 for (const auto *Op : Expr->operands()) { in visitSMaxExpr() 853 for (const auto *Op : Expr->operands()) { in visitUMaxExpr() 863 for (const auto *Op : Expr->operands()) { in visitSMinExpr() 873 for (const auto *Op : Expr->operands()) { in visitUMinExpr() 883 for (const auto *Op : Expr->operands()) { in visitSequentialUMinExpr() [all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanValue.h | 242 for (VPValue *Op : operands()) in ~VPUser() 279 operand_range operands() { return operand_range(op_begin(), op_end()); } in operands() function 280 const_operand_range operands() const { in operands() function 287 assert(is_contained(operands(), Op) && in usesScalars() 295 assert(is_contained(operands(), Op) && in onlyFirstLaneUsed() 303 assert(is_contained(operands(), Op) && in onlyFirstPartUsed()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ReachingDefAnalysis.cpp | 128 for (auto &MO : MI->operands()) { in processDefs() 344 for (auto &MO : MI->operands()) { in getReachingLocalUses() 360 for (auto &MO : MI.operands()) { in getLiveInUses() 518 for (auto &MO : Last->operands()) in isReachingDefLiveOut() 538 for (auto &MO : Last->operands()) in getLocalLiveOutMIDef() 562 for (auto &MO : From->operands()) { in isSafeToMove() 577 for (auto &MO : I->operands()) in isSafeToMove() 630 for (auto &MO : MI->operands()) { in isSafeToRemove() 656 for (auto &MO : Def->operands()) { in collectKilledOperands() 671 for (auto &MO : MI->operands()) { in collectKilledOperands() [all …]
|
| H A D | LiveRegUnits.cpp | 46 for (const MachineOperand &MOP : MI.operands()) { in stepBackward() 60 for (const MachineOperand &MOP : MI.operands()) { in stepBackward() 71 for (const MachineOperand &MOP : MI.operands()) { in accumulate()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUUnifyMetadata.cpp | 61 for (auto *VersionMD : NamedMD->operands()) { in unifyVersionMD() 94 for (auto *MD : NamedMD->operands()) in unifyExtensionMD() 95 for (const auto &Op : MD->operands()) in unifyExtensionMD()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyInstrFormats.td | 43 // We have 2 sets of operands (oops & iops) for the register and stack 45 // The register versions have virtual-register operands which correspond to wasm 47 // implicit local.get / local.set or access of stack operands in wasm. These 49 // instructions do not have register operands (they implicitly operate on the
|
| H A D | README.txt | 62 ordering dependencies on instructions with stack operands. This is pessimistic; 131 example, a binary operator will stackify with its user before its operands. 133 its operands can't be moved to, it would be better to leave it in place, or 134 perhaps move it up, so that it can stackify its operands. A binary operator 135 has two operands and one result, so in such cases there could be a net win by 136 preferring the operands.
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVLIWPacketizer.cpp | 151 for (auto &MO : FirstI.operands()) { in hasWriteToReadDep() 435 for (auto &MO : MJ.operands()) in canPromoteToDotCur() 583 for (auto &MO : MI.operands()) in getPostIncrementOperand() 587 for (auto &MO : MI.operands()) in getPostIncrementOperand() 722 for (auto &MO : MI.operands()) { in canPromoteToNewValueStore() 771 for (auto &MO : MI.operands()) in canPromoteToNewValueStore() 809 for (auto &MO : MI.operands()) { in canPromoteToNewValueStore() 837 for (auto &MO : I.operands()) { in isImplicitDependency() 954 for (auto &Op : MI.operands()) { in getPredicatedRegister() 1217 for (auto &MO : I.operands()) { in hasDeadDependence() [all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/MC/ |
| H A D | MCInstrDesc.h | 222 (operands()[OpNum].Constraints & (1 << Constraint))) { in getOperandConstraint() 224 return (int)(operands()[OpNum].Constraints >> ValuePos) & 0x0f; in getOperandConstraint() 239 ArrayRef<MCOperandInfo> operands() const { in operands() function 612 if (operands()[i].isPredicate()) in findFirstPredOperandIdx()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/DirectX/DXILWriter/ |
| H A D | DXILValueEnumerator.cpp | 91 for (const Value *Op : C->operands()) in orderValue() 126 for (const Use &U : F.operands()) in orderModule() 145 for (const Value *V : I.operands()) { in orderModule() 190 for (const Value *Op : I.operands()) in orderModule() 290 for (const Value *Op : C->operands()) in predictValueUseListOrder() 323 for (const Value *Op : I.operands()) in predictUseListOrder() 353 for (const Use &U : F.operands()) in predictUseListOrder() 412 for (const Use &U : F.operands()) in ValueEnumerator() 980 for (const Value *Op : C->operands()) { in EnumerateOperandType() 1050 for (const Use &OI : I.operands()) { in incorporateFunction() [all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | Thumb2SizeReduction.cpp | 298 for (const MachineOperand &MO : CPSRDef->operands()) { in canAddPseudoFlagDep() 307 for (const MachineOperand &MO : Use->operands()) { in canAddPseudoFlagDep() 528 for (const MachineOperand &MO : llvm::drop_begin(MI->operands(), 4)) in ReduceLoadStore() 839 if (i < NumOps && MCID.operands()[i].isOptionalDef()) in ReduceTo2Addr() 841 if (SkipPred && MCID.operands()[i].isPredicate()) in ReduceTo2Addr() 875 if (MCID.operands()[i].isPredicate()) in ReduceToNarrow() 884 } else if (MO.isImm() && !MCID.operands()[i].isPredicate()) { in ReduceToNarrow() 945 if (i < NumOps && MCID.operands()[i].isOptionalDef()) in ReduceToNarrow() 955 bool isPred = (i < NumOps && MCID.operands()[i].isPredicate()); in ReduceToNarrow() 981 for (const MachineOperand &MO : MI.operands()) { in UpdateCPSRDef() [all …]
|
| /freebsd-14.2/contrib/ntp/sntp/ag-tpl/0-old/ |
| H A D | mdoc-synopsis.tlib | 62 The operands that this program operates on may be specified either 75 Options may be interleaved with operands both on the command 76 line and when operands are read from standard input.[+:
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Bitcode/Writer/ |
| H A D | ValueEnumerator.cpp | 83 for (const Value *Op : C->operands()) in orderValue() 138 for (const Value *V : I.operands()) { in orderModule() 155 for (const Value *Op : I.operands()) in orderModule() 239 for (const Value *Op : C->operands()) in predictValueUseListOrder() 272 for (const Value *Op : I.operands()) { in predictUseListOrder() 311 for (const Use &U : F.operands()) in predictUseListOrder() 374 for (const Use &U : F.operands()) in ValueEnumerator() 412 for (const Use &Op : I.operands()) { in ValueEnumerator() 976 for (const Value *Op : C->operands()) { in EnumerateOperandType() 1045 for (const Use &OI : I.operands()) { in incorporateFunction() [all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | LegalizerInfo.cpp | 336 ArrayRef<MCOperandInfo> OpInfo = MI.getDesc().operands(); in getAction() 385 MCID.operands().begin(), MCID.operands().end(), 0U, in verify() 392 MCID.operands().begin(), MCID.operands().end(), 0U, in verify()
|