Searched refs:Priorities (Results 1 – 5 of 5) sorted by relevance
83 DenseMap<const CallBase *, PriorityT> Priorities; variable95 const auto I1 = Priorities.find(L); in hasLowerPriority()96 const auto I2 = Priorities.find(R); in hasLowerPriority()97 assert(I1 != Priorities.end() && I2 != Priorities.end()); in hasLowerPriority()103 void update(const CallBase *CB) override { Priorities[CB] = evaluate(CB); }; in update()106 auto It = Priorities.find(CB); in updateAndCheckDecreased()
281 Priorities = {0, INT_MAX}; in HeaderIncludes()283 Priorities.insert(Category.Priority); in HeaderIncludes()308 auto Highest = Priorities.begin(); in HeaderIncludes()319 for (auto I = ++Priorities.begin(), E = Priorities.end(); I != E; ++I) in HeaderIncludes()
126 std::set<int> Priorities; variable
691 unsigned Priorities[] = { in getFeaturePriority() local695 std::array<unsigned, array_lengthof(Priorities) - 1> HelperList; in getFeaturePriority()698 std::begin(Priorities), in getFeaturePriority()699 std::prev(std::end(Priorities))) && in getFeaturePriority()
117 Priorities outside of that range are reserved for use by the implementation. A