Lines Matching refs:labels
2559 // Force pool emission. If the labels are not sorted, the cbz will be out
2615 // Force pool emission. If the labels are not sorted, the cbz will be out
3603 // If all labels have been bound, exit the inner loop and finalise the
3636 Label* labels;
3679 labels = new Label[label_count];
3698 if (!labels[label_index].IsBound()) {
3699 __ Bind(&labels[label_index]);
3773 __ Cbz(r0, &labels[label_index]);
3780 __ Cbnz(r0, &labels[label_index]);
3787 __ B(ne, &labels[label_index], kNear);
3794 __ B(&labels[label_index], kNear);
3801 __ B(ne, &labels[label_index]);
3808 __ B(&labels[label_index]);
3815 __ Bl(&labels[label_index]);
3859 // If all labels
3863 allbound = allbound && labels[i].IsBound();
3877 delete[] labels;
4923 Label labels[kLabelsCount];
4940 __ Cbz(r0, &labels[j]);
4951 // Bind all the used labels.
4953 __ Bind(&labels[j]);
4957 // Now that all the labels have been bound, we have no more veneers.
4984 Label labels[kLabelsCount];
4996 __ Cbz(r0, &labels[i]);
5015 // Bind all the used labels.
5017 __ Bind(&labels[j]);
5021 // Now that all the labels have been bound, we have no more veneers.
5044 Label labels[kLabelsCount];
5050 __ B(ne, &labels[i]);
5061 __ Bind(&labels[i]);
5144 Label labels[kTestCount];
5165 __ Cbz(r1, &labels[test]);
5171 __ Bind(&labels[test]);
5845 Label labels[kLabelsCount];
5850 __ B(&labels[i], kNear);
5855 __ Bind(&labels[i]);
6288 // We can now safely bind the labels.
