Lines Matching defs:second
468 allocno_hard_regs_node_t second)
475 for (node = second; node != NULL; node = node->parent)
478 return first_common_ancestor_node (second, first);
1386 another_allocno = cp->second;
1388 else if (cp->second == allocno)
1414 ALLOCNO_MODE (cp->second));
1418 cost = (cp->second == allocno
1554 another_allocno = cp->second;
1556 else if (cp->second == allocno)
2114 thread2 = ALLOCNO_COLOR_DATA (cp->second)->first_thread_allocno;
2124 ALLOCNO_NUM (cp->second), ALLOCNO_REGNO (cp->second),
2151 != ALLOCNO_COLOR_DATA (cp->second)->first_thread_allocno)
2176 else if (cp->second == a)
2199 another_a = cp->second;
2201 else if (cp->second == a)
2292 case such allocno has less priority than the second one and the
2293 hard register will be assigned to it after assignment to the second
2294 one. As the result of such assignment order, the second allocno
2862 if (ALLOCNO_HARD_REGNO (cp->second) != hard_regno)
2865 else if (cp->second == allocno)
3660 another_a = cp->second;
3662 else if (cp->second == a)
3931 regno = ALLOCNO_REGNO (cp->second);
3937 && ALLOCNO_ASSIGNED_P (cp->second)
3938 && ALLOCNO_HARD_REGNO (cp->second) < 0
3942 else if (cp->second == a)
3955 if (! coalesced_allocno_conflict_p (cp->first, cp->second))
3963 ALLOCNO_NUM (cp->second), ALLOCNO_REGNO (cp->second),
3965 merge_allocnos (cp->first, cp->second);
3975 != allocno_coalesce_data[ALLOCNO_NUM (cp->second)].first)
4653 another_allocno = cp->second;
4655 else if (cp->second == allocno)