Lines Matching full:last

24                                      unsigned First, unsigned Last) {
25   assert(Last >= First);
27   const APInt &HighCase = Clusters[Last].High->getValue();
38                                unsigned First, unsigned Last) {
39   assert(Last >= First);
40   assert(TotalCases[Last] >= TotalCases[First]);
42       TotalCases[Last] - (First == 0 ? 0 : TotalCases[First - 1]);
112   // LastElement[i] is the last element of the partition starting at i.
174   for (unsigned First = 0, Last; First < N; First = Last + 1) {
175     Last = LastElement[First];
176     assert(Last >= First);
178     unsigned NumClusters = Last - First + 1;
182         buildJumpTable(Clusters, First, Last, SI, SL, DefaultMBB, JTCluster)) {
185       for (unsigned I = First; I <= Last; ++I)
193                                               unsigned First, unsigned Last,
198   assert(First <= Last);
206   for (unsigned I = First; I <= Last; ++I)
209   for (unsigned I = First; I <= Last; ++I) {
232                                  Clusters[Last].High->getValue(), *DL)) {
233     // Clusters[First..Last] should be lowered as bit tests instead.
259                       Clusters[Last].High->getValue(), SI->getCondition(),
263   JTCluster = CaseCluster::jumpTable(Clusters[First].Low, Clusters[Last].High,
297   // LastElement[i] is the last element of the partition starting at i.
349   for (unsigned First = 0, Last; First < N; First = Last + 1) {
350     Last = LastElement[First];
351     assert(First <= Last);
355     if (buildBitTests(Clusters, First, Last, SI, BitTestCluster)) {
358       size_t NumClusters = Last - First + 1;
368                                              unsigned First, unsigned Last,
371   assert(First <= Last);
372   if (First == Last)
377   for (int64_t I = First; I <= Last; ++I) {
385   APInt High = Clusters[Last].High->getValue();
401   for (int64_t I = First + 1; I <= Last; ++I) {
421   for (unsigned i = First; i <= Last; ++i) {
462   BTCluster = CaseCluster::bitTests(Clusters[First].Low, Clusters[Last].High,
501                                                    CaseClusterIt Last) {
502   return std::count_if(First, Last + 1, [&](const CaseCluster &X) {
558         // Consider moving the last element on the left to the right side.