Searched refs:Priorities (Results 1 – 10 of 10) sorted by relevance
204 const auto I1 = Priorities.find(L); in hasLowerPriority()205 const auto I2 = Priorities.find(R); in hasLowerPriority()206 assert(I1 != Priorities.end() && I2 != Priorities.end()); in hasLowerPriority()211 auto It = Priorities.find(CB); in updateAndCheckDecreased()248 Priorities[CB] = PriorityT(CB, FAM, Params); in push()275 DenseMap<const CallBase *, PriorityT> Priorities; member in __anon8b2eb5460111::PriorityInlineOrder
283 Priorities = {0, INT_MAX}; in HeaderIncludes()285 Priorities.insert(Category.Priority); in HeaderIncludes()312 auto Highest = Priorities.begin(); in HeaderIncludes()323 for (auto I = ++Priorities.begin(), E = Priorities.end(); I != E; ++I) in HeaderIncludes()
138 std::set<int> Priorities; variable
755 unsigned Priorities[] = { in getFeaturePriority() local758 std::array<unsigned, std::size(Priorities)> HelperList; in getFeaturePriority()761 std::begin(Priorities), std::end(Priorities)) && in getFeaturePriority()
96 * Priorities can be OSSL_LIB_CTX_METHOD_DEFAULT_PRIORITY,
1322 if (SM_STRCASEEQ(p, Priorities[i].pri_name))1323 return Priorities[i].pri_val;
722 Priorities[NumPriorities].pri_name = newstr(&bp[1]);723 Priorities[NumPriorities].pri_val = atoi(++p);
1271 EXTERN struct priority Priorities[MAXPRIORITIES]; variable
289 Priorities are used by UCL parser to manage the policy of objects rewriting during including other …
126 Priorities outside of that range are reserved for use by the implementation. A7548 Priorities outside of that range are reserved for use by the implementation. A