Lines Matching refs:Index
50 unsigned Index = Storage.size();
52 if (Index == 0) return;
56 unsigned Target = (Index + 1) / 2 - 1;
57 if (!Precedes(data[Index], data[Target])) return;
58 std::swap(data[Index], data[Target]);
60 Index = Target;
78 unsigned Index = 0;
80 // With a 1-based index, the children would be Index*2 and Index*2+1.
81 unsigned R = (Index + 1) * 2;
89 // Otherwise, test whether we should swap L and Index.
90 if (Precedes(Storage[L], Storage[Index]))
91 std::swap(Storage[L], Storage[Index]);
99 // If Index is >= the min of L and R, then heap ordering is restored.
100 if (!Precedes(Storage[IndexToTest], Storage[Index]))
104 std::swap(Storage[IndexToTest], Storage[Index]);
105 Index = IndexToTest;
519 unsigned Index = 1;
520 for (BasicBlock::iterator LI = LStart; LI != LE; ++LI, ++Index) {
522 Next[Index] = Cur[Index-1];
523 Next[Index].Cost += MatchCost;
524 Next[Index].Path.push_back(DC_match);
526 } else if (Next[Index-1].Cost <= Cur[Index].Cost) {
527 Next[Index] = Next[Index-1];
528 Next[Index].Cost += LeftCost;
529 Next[Index].Path.push_back(DC_left);
531 Next[Index] = Cur[Index];
532 Next[Index].Cost += RightCost;
533 Next[Index].Path.push_back(DC_right);
