Home | History | Annotate | Download | only in aarch64

Lines Matching full:reg_count

14038 // supports (where a reg_count argument would otherwise be provided).
14043 // * Push <reg_count> registers with size <reg_size>.
14045 // * Pop <reg_count> registers to restore the original contents.
14050 static void PushPopSimpleHelper(int reg_count,
14062 if (reg_count == kPushPopUseMaxRegCount) {
14063 reg_count = CountSetBits(allowed, kNumberOfRegisters);
14069 PopulateRegisterArray(NULL, x, r, reg_size, reg_count, allowed);
14090 for (i = 0; i < reg_count; i++) {
14102 for (i = reg_count; i >= 4; i -= 4) {
14132 for (i = 0; i <= (reg_count - 4); i += 4) {
14136 switch (reg_count - i) {
14147 VIXL_ASSERT(i == reg_count);
14171 for (int i = 0; i < reg_count; i++) {
14281 // supports (where a reg_count argument would otherwise be provided).
14286 // * Push <reg_count> FP registers with size <reg_size>.
14288 // * Pop <reg_count> FP registers to restore the original contents.
14293 static void PushPopFPSimpleHelper(int reg_count,
14305 if (reg_count == kPushPopFPUseMaxRegCount) {
14306 reg_count = CountSetBits(allowed, kNumberOfFPRegisters);
14312 PopulateFPRegisterArray(NULL, d, v, reg_size, reg_count, allowed);
14340 for (i = 0; i < reg_count; i++) {
14354 for (i = reg_count; i >= 4; i -= 4) {
14384 for (i = 0; i <= (reg_count - 4); i += 4) {
14388 switch (reg_count - i) {
14399 VIXL_ASSERT(i == reg_count);
14423 for (int i = 0; i < reg_count; i++) {
14638 static void PushPopWXOverlapHelper(int reg_count, int claim) {
14644 if (reg_count == kPushPopUseMaxRegCount) {
14645 reg_count = CountSetBits(allowed, kNumberOfRegisters);
14650 RegList list = PopulateRegisterArray(w, x, NULL, 0, reg_count, allowed);
14653 // between W and X registers, so we need reg_count*1.5 W-sized slots.
14654 int const requested_w_slots = reg_count + reg_count / 2;
14684 for (int i = 0; i < reg_count; i++) {
14725 VIXL_ASSERT(i < reg_count);
14775 bool next_is_64 = !(reg_count & 1);
14776 for (int i = reg_count - 1; i >= 0; i--) {
14800 for (int i = 0; i < reg_count; i++) {