Lines Matching defs: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
3602 // 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 have been bound, exit the inner loop and finalise the
3863 all_bound = all_bound && labels[i].IsBound();
3877 delete[] labels;
4938 Label labels[kLabelsCount];
4955 __ Cbz(r0, &labels[j]);
4966 // Bind all the used labels.
4968 __ Bind(&labels[j]);
4972 // Now that all the labels have been bound, we have no more veneers.
4999 Label labels[kLabelsCount];
5011 __ Cbz(r0, &labels[i]);
5030 // Bind all the used labels.
5032 __ Bind(&labels[j]);
5036 // Now that all the labels have been bound, we have no more veneers.
5059 Label labels[kLabelsCount];
5065 __ B(ne, &labels[i]);
5076 __ Bind(&labels[i]);
5159 Label labels[kTestCount];
5180 __ Cbz(r1, &labels[test_num]);
5186 __ Bind(&labels[test_num]);
5860 Label labels[kLabelsCount];
5865 __ B(&labels[i], kNear);
5870 __ Bind(&labels[i]);
6303 // We can now safely bind the labels.