HomeSort by: relevance | last modified time | path
    Searched defs:reg_eqv_table (Results 1 - 2 of 2) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
cse.cc 97 and `reg_eqv_table' members `next' and `prev' hold these chains.
269 If REG_QTY (N) == -N - 1, reg_eqv_table[N].next is undefined. */
278 static struct reg_eqv_elem *reg_eqv_table; variable in typeref:struct:reg_eqv_elem
867 eqv = &reg_eqv_table[reg];
908 reg_eqv_table[firstr].prev = new_reg;
909 reg_eqv_table[new_reg].next = firstr;
910 reg_eqv_table[new_reg].prev = -1;
919 while (lastr < FIRST_PSEUDO_REGISTER && reg_eqv_table[lastr].prev >= 0
922 lastr = reg_eqv_table[lastr].prev;
923 reg_eqv_table[new_reg].next = reg_eqv_table[lastr].next
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
cse.cc 97 and `reg_eqv_table' members `next' and `prev' hold these chains.
271 If REG_QTY (N) == -N - 1, reg_eqv_table[N].next is undefined. */
280 static struct reg_eqv_elem *reg_eqv_table; variable in typeref:struct:reg_eqv_elem
863 eqv = &reg_eqv_table[reg];
904 reg_eqv_table[firstr].prev = new_reg;
905 reg_eqv_table[new_reg].next = firstr;
906 reg_eqv_table[new_reg].prev = -1;
915 while (lastr < FIRST_PSEUDO_REGISTER && reg_eqv_table[lastr].prev >= 0
918 lastr = reg_eqv_table[lastr].prev;
919 reg_eqv_table[new_reg].next = reg_eqv_table[lastr].next
    [all...]

Completed in 58 milliseconds