Lines Matching defs:WeightedLeaf

1801 struct WeightedLeaf {
1806   WeightedLeaf() {}
1808   WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) :
1813   static bool Compare(const WeightedLeaf &A, const WeightedLeaf &B) {
1825   SmallVector<WeightedLeaf, 8> Q;
1827   WeightedLeaf ConstElt;
1843   const WeightedLeaf &top() {
1849   WeightedLeaf pop() {
1854     std::pop_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
1858   void push(WeightedLeaf L, bool SeparateConst=true) {
1871       std::push_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
1877   void pushToBottom(WeightedLeaf L) {
1884   WeightedLeaf findSHL(uint64_t MaxAmount);
1886   WeightedLeaf findMULbyConst();
1893 WeightedLeaf LeafPrioQueue::findSHL(uint64_t MaxAmount) {
1895   WeightedLeaf Result;
1898     const WeightedLeaf &L = Q[Pos];
1914     std::make_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
1920 WeightedLeaf LeafPrioQueue::findMULbyConst() {
1922   WeightedLeaf Result;
1925     const WeightedLeaf &L = Q[Pos];
1941     std::make_heap(Q.begin(), Q.end(), WeightedLeaf::Compare);
2102   WeightedLeaf Mul1, Mul2;
2104   WeightedLeaf GA;
2152           Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++);
2155           Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++);
2165         Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++));
2174         GA = WeightedLeaf(Child, Weight, InsertionOrder++);
2176         Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++));
2228     Leaves.push(WeightedLeaf(New, Weight, Mul1.InsertionOrder));
2279     WeightedLeaf SHL = Leaves.findSHL(31);
2305     WeightedLeaf L0 = Leaves.pop();
2309     WeightedLeaf L1 = Leaves.findMULbyConst();
2355     Leaves.push(WeightedLeaf(NewNode, Weight, L0.InsertionOrder));