Searched refs:Priorities (Results 1 – 8 of 8) sorted by relevance
207 const auto I1 = Priorities.find(L); in hasLowerPriority()208 const auto I2 = Priorities.find(R); in hasLowerPriority()209 assert(I1 != Priorities.end() && I2 != Priorities.end()); in hasLowerPriority()214 auto It = Priorities.find(CB); in updateAndCheckDecreased()251 Priorities[CB] = PriorityT(CB, FAM, Params); in push()278 DenseMap<const CallBase *, PriorityT> Priorities; member in __anon0e840d930111::PriorityInlineOrder
293 Priorities = {0, INT_MAX}; in HeaderIncludes()295 Priorities.insert(Category.Priority); in HeaderIncludes()322 auto Highest = Priorities.begin(); in HeaderIncludes()333 for (auto I = ++Priorities.begin(), E = Priorities.end(); I != E; ++I) in HeaderIncludes()
138 std::set<int> Priorities; variable
757 unsigned Priorities[] = { in getFeaturePriority() local760 std::array<unsigned, std::size(Priorities)> HelperList; in getFeaturePriority()763 for (size_t i = MaxPriority + 1; i != std::size(Priorities); ++i) in getFeaturePriority()766 std::begin(Priorities), std::end(Priorities)) && in getFeaturePriority()
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
126 Priorities outside of that range are reserved for use by the implementation. A7866 Priorities outside of that range are reserved for use by the implementation. A