Searched refs:BrokenHints (Results 1 – 3 of 3) sorted by relevance
159 unsigned BrokenHints; ///< Total number of broken hints. member162 EvictionCost(unsigned B = 0) : BrokenHints(B), MaxWeight(0) {} in EvictionCost()165 if (BrokenHints != O.BrokenHints) in operator <()166 return BrokenHints < O.BrokenHints; in operator <()560 Cost.BrokenHints += 10; in canEvictInterference()565 Cost.BrokenHints += BreaksHint; in canEvictInterference()626 BestCost.BrokenHints = 0; in tryEvict()
233 unsigned BrokenHints; ///< Total number of broken hints. member236 EvictionCost(): BrokenHints(0), MaxWeight(0) {} in EvictionCost()238 bool isMax() const { return BrokenHints == ~0u; } in isMax()240 void setMax() { BrokenHints = ~0u; } in setMax()242 void setBrokenHints(unsigned NHints) { BrokenHints = NHints; } in setBrokenHints()245 return std::tie(BrokenHints, MaxWeight) < in operator <()246 std::tie(O.BrokenHints, O.MaxWeight); in operator <()776 Cost.BrokenHints += 10; in canEvictInterference()781 Cost.BrokenHints += BreaksHint; in canEvictInterference()873 BestCost.BrokenHints = 0; in tryEvict()
277 unsigned BrokenHints = 0; ///< Total number of broken hints. member282 bool isMax() const { return BrokenHints == ~0u; } in isMax()284 void setMax() { BrokenHints = ~0u; } in setMax()286 void setBrokenHints(unsigned NHints) { BrokenHints = NHints; } in setBrokenHints()289 return std::tie(BrokenHints, MaxWeight) < in operator <()290 std::tie(O.BrokenHints, O.MaxWeight); in operator <()919 Cost.BrokenHints += 10; in canEvictInterference()924 Cost.BrokenHints += BreaksHint; in canEvictInterference()984 Cost.BrokenHints += BreaksHint; in canEvictInterferenceInRange()1110 BestCost.BrokenHints = 0; in tryEvict()