/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | DAGISelMatcher.cpp | 96 const TreePredicateFn &pred, const SmallVectorImpl<unsigned> &Ops) 97 : Matcher(CheckPredicate), Pred(pred.getOrigPatFragRecord()), 95 CheckPredicateMatcher( const TreePredicateFn &pred, const SmallVectorImpl<unsigned> &Ops) argument
|
/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/ |
H A D | kmp_dispatch.h | 277 pred - predicate function to perform binary comparison of some sort 290 kmp_uint32 (*pred)(UT, UT) USE_ITT_BUILD_ARG(void *obj)) { 295 kmp_uint32 (*f)(UT, UT) = pred; 289 __kmp_wait(volatile UT *spinner, UT checker, kmp_uint32 (*pred)(UT, UT) USE_ITT_BUILD_ARG(void *obj)) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | DependenceAnalysis.h | 190 void setNextPredecessor(const Dependence *pred) { NextPredecessor = pred; } argument
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | left_child_next_sibling_heap_.hpp | 278 prune(Pred pred);
|
/freebsd-11-stable/contrib/libpcap/ |
H A D | gencode.h | 239 struct block *pred; member in struct:edge
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/ |
H A D | UninitializedValues.cpp | 847 const CFGBlock *pred = *I; local 848 if (!pred) 850 if (wasAnalyzed[pred->getBlockID()]) { 851 vals.mergeIntoScratch(vals.getValueVector(pred), isFirst);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | InstrTypes.h | 769 CmpInst(Type *ty, Instruction::OtherOps op, Predicate pred, 774 CmpInst(Type *ty, Instruction::OtherOps op, Predicate pred, 837 /// @returns the inverse predicate for predicate provided in \p pred. 839 static Predicate getInversePredicate(Predicate pred); 854 static Predicate getSwappedPredicate(Predicate pred); 869 static Predicate getFlippedStrictnessPredicate(Predicate pred); 879 /// @returns the non-strict version of comparison provided in \p pred. 880 /// If \p pred is not a strict comparison predicate, returns \p pred. 882 static Predicate getNonStrictPredicate(Predicate pred); [all...] |
H A D | Constants.h | 1138 static Constant *getCompare(unsigned short pred, Constant *C1, Constant *C2, 1144 static Constant *getICmp(unsigned short pred, Constant *LHS, Constant *RHS, 1146 static Constant *getFCmp(unsigned short pred, Constant *LHS, Constant *RHS,
|
H A D | Instructions.h | 1181 Predicate pred, ///< The predicate to use for the comparison 1186 Instruction::ICmp, pred, LHS, RHS, NameStr, 1196 Predicate pred, ///< The predicate to use for the comparison 1201 Instruction::ICmp, pred, LHS, RHS, NameStr, 1210 Predicate pred, ///< The predicate to use for the comparison 1215 Instruction::ICmp, pred, LHS, RHS, NameStr) { 1231 static Predicate getSignedPredicate(Predicate pred); 1243 static Predicate getUnsignedPredicate(Predicate pred); 1321 Predicate pred, ///< The predicate to use for the comparison 1326 Instruction::FCmp, pred, LH 1179 ICmpInst( Instruction *InsertBefore, Predicate pred, Value *LHS, Value *RHS, const Twine &NameStr = � ) argument 1194 ICmpInst( BasicBlock &InsertAtEnd, Predicate pred, Value *LHS, Value *RHS, const Twine &NameStr = � ) argument 1209 ICmpInst( Predicate pred, Value *LHS, Value *RHS, const Twine &NameStr = � ) argument 1319 FCmpInst( Instruction *InsertBefore, Predicate pred, Value *LHS, Value *RHS, const Twine &NameStr = � ) argument 1332 FCmpInst( BasicBlock &InsertAtEnd, Predicate pred, Value *LHS, Value *RHS, const Twine &NameStr = � ) argument [all...] |
/freebsd-11-stable/usr.bin/diff/ |
H A D | diffreg.c | 142 * k-candidate is chained (via pred) to the current 169 int pred; member in struct:cand 699 newcand(int x, int y, int pred) argument 710 q->pred = pred; 747 for (q = clist + p; q->y != 0; q = clist + q->pred)
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | Instructions.cpp | 3530 CmpInst::Predicate CmpInst::getInversePredicate(Predicate pred) { argument 3531 switch (pred) { 3595 ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) { argument 3596 switch (pred) { 3600 return pred; 3608 ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) { argument 3609 switch (pred) { 3613 return pred; 3621 CmpInst::Predicate CmpInst::getFlippedStrictnessPredicate(Predicate pred) { argument 3622 switch (pred) { 3644 getSwappedPredicate(Predicate pred) argument 3674 getNonStrictPredicate(Predicate pred) argument 3688 getSignedPredicate(Predicate pred) argument [all...] |
H A D | Constants.cpp | 2133 Constant *ConstantExpr::getICmp(unsigned short pred, Constant *LHS, argument 2136 assert(CmpInst::isIntPredicate((CmpInst::Predicate)pred) && 2139 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS)) 2148 const ConstantExprKeyType Key(Instruction::ICmp, ArgVec, pred); 2158 Constant *ConstantExpr::getFCmp(unsigned short pred, Constant *LHS, argument 2161 assert(CmpInst::isFPPredicate((CmpInst::Predicate)pred) && 2164 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS)) 2173 const ConstantExprKeyType Key(Instruction::FCmp, ArgVec, pred);
|
H A D | ConstantsContext.h | 272 unsigned short pred, Constant* LHS, Constant* RHS) 273 : ConstantExpr(ty, opc, &Op<0>(), 2), predicate(pred) { 271 CompareConstantExpr(Type *ty, Instruction::OtherOps opc, unsigned short pred, Constant* LHS, Constant* RHS) argument
|
/freebsd-11-stable/contrib/gcc/ |
H A D | expr.c | 1294 insn_operand_predicate_fn pred; 1305 && ((pred = insn_data[(int) code].operand[0].predicate) == 0 1306 || (*pred) (x, BLKmode)) 1307 && ((pred = insn_data[(int) code].operand[1].predicate) == 0 1308 || (*pred) (y, BLKmode)) 1309 && ((pred = insn_data[(int) code].operand[3].predicate) == 0 1310 || (*pred) (opalign, VOIDmode))) 1317 pred = insn_data[(int) code].operand[2].predicate; 1318 if (pred != 0 && ! (*pred) (op 1290 insn_operand_predicate_fn pred; local 2662 insn_operand_predicate_fn pred; local 3473 insn_operand_predicate_fn pred; local [all...] |
H A D | bt-load.c | 643 BB_IN = union over predecessors of BB_OUT(pred) 976 basic_block pred = e->src; 977 if (!bitmap_bit_p (live_range, pred->index)) 978 *tos++ = pred; 975 basic_block pred = e->src; local
|
H A D | gcse.c | 716 /* Initialize bytes_used to the space for the pred/succ lists, 3901 edge pred; 3904 FOR_EACH_EDGE (pred, ei, bb->preds) 3906 basic_block pred_bb = pred->src; 3908 if (pred->src == ENTRY_BLOCK_PTR 4793 edge pred; 4804 FOR_EACH_EDGE (pred, ei, bb->preds) 4806 basic_block pred_bb = pred->src; 4808 if (pred->src == ENTRY_BLOCK_PTR) 4833 return (pred 3886 edge pred; local 4776 edge pred; local [all...] |
H A D | tree-into-ssa.c | 389 basic_block pred = e->src; local 390 int pred_index = pred->index; 393 if (pred != ENTRY_BLOCK_PTR 397 *tos++ = pred;
|
H A D | basic-block.h | 566 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ))) 569 block which is either the pred or succ end of the indexed edge. */
|
H A D | global.c | 2385 basic_block pred = e->src; 2387 if (pred->index != ENTRY_BLOCK) 2388 bitmap_ior_into (bb_live_pavin, BB_INFO (pred)->live_pavout); 2370 basic_block pred = e->src; local
|
H A D | df.h | 668 struct web_entry *pred; 667 struct web_entry *pred; member in struct:web_entry
|
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/dtrace/ |
H A D | dtrace.c | 7236 dtrace_predicate_t *pred = ecb->dte_predicate; 7412 if (pred != NULL) { 7413 dtrace_difo_t *dp = pred->dtp_difo; 7425 ASSERT(cid == pred->dtp_cacheid); 10855 dtrace_predicate_t *pred; 10860 pred = kmem_zalloc(sizeof (dtrace_predicate_t), KM_SLEEP); 10861 pred->dtp_difo = dp; 10862 pred->dtp_refcnt = 1; 10865 return (pred); 10876 return (pred); [all...] |
/freebsd-11-stable/contrib/gcc/config/ia64/ |
H A D | lib1funcs.asm | 49 .pred.rel.mutex p6, p7 91 .pred.rel.mutex p6, p7 133 .pred.rel.mutex p6, p7
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/Process/gdb-remote/ |
H A D | GDBRemoteCommunication.cpp | 242 auto pred = [&] { return !m_packet_queue.empty() && IsConnected(); }; local 247 m_condition_queue_not_empty.wait(lock, pred); 249 if (!m_condition_queue_not_empty.wait_for(lock, *timeout, pred))
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/RetainCountChecker/ |
H A D | RetainCountChecker.cpp | 232 const ExplodedNode *pred = C.getPredecessor(); local 234 SVal V = pred->getSVal(Child); 250 state->getSVal(Ex, pred->getLocationContext()).getAsSymbol()) {
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_fs/ |
H A D | tree.c | 3691 const svn_fs_id_t *pred; 3692 SVN_ERR(svn_fs_fs__dag_get_predecessor_id(&pred, copy_dst_node)); 3693 if (! pred) 4736 dag_node_t *pred; 4738 SVN_ERR(svn_fs_fs__dag_get_node(&pred, fs, pred_id, iterpool)); 4739 SVN_ERR(svn_fs_fs__dag_get_predecessor_count(&pred_pred_count, pred)); 4745 stringify_node(pred, iterpool), 4832 /* Issue #4129: bogus pred-counts and minfo-cnt's on the root node-rev 3678 const svn_fs_id_t *pred; local 4721 dag_node_t *pred; local
|