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

  /src/external/gpl3/gcc/dist/gcc/
cse.cc 357 through the `next_same_hash' and `prev_same_hash' fields.
397 struct table_elt *next_same_hash; member in struct:table_elt
835 while (last->next_same_hash != NULL)
836 last = last->next_same_hash;
841 last->next_same_hash = free_element_chain;
1389 struct table_elt *next = elt->next_same_hash;
1395 prev->next_same_hash = next;
1424 elt->next_same_hash = free_element_chain;
1455 for (p = table[hash]; p; p = p->next_same_hash)
1477 for (p = table[hash]; p; p = p->next_same_hash)
    [all...]
cprop.cc 73 struct cprop_expr *next_same_hash;
84 `next_same_hash' and `bitmap_index' wouldn't be necessary. However, it is
188 cur_expr = cur_expr->next_same_hash)
208 last_expr->next_same_hash = cur_expr;
216 cur_expr->next_same_hash = NULL;
348 for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
496 expr = expr->next_same_hash;
507 expr = expr->next_same_hash;
608 for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
72 struct cprop_expr *next_same_hash; member in struct:cprop_expr
gcse.cc 264 struct gcse_expr *next_same_hash;
312 `next_same_hash' and `bitmap_index' wouldn't be necessary. However, it is
695 for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
1153 cur_expr = cur_expr->next_same_hash;
1165 last_expr->next_same_hash = cur_expr;
1170 cur_expr->next_same_hash = NULL;
1414 for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
1726 for (expr = expr_hash_table.table[ui]; expr; expr = expr->next_same_hash)
2332 for (expr = expr_hash_table.table[i]; expr; expr = expr->next_same_hash)
2491 for (expr = expr_hash_table.table[i]; expr; expr = expr->next_same_hash)
263 struct gcse_expr *next_same_hash; member in struct:gcse_expr
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
cse.cc 359 through the `next_same_hash' and `prev_same_hash' fields.
399 struct table_elt *next_same_hash; member in struct:table_elt
831 while (last->next_same_hash != NULL)
832 last = last->next_same_hash;
837 last->next_same_hash = free_element_chain;
1382 struct table_elt *next = elt->next_same_hash;
1388 prev->next_same_hash = next;
1417 elt->next_same_hash = free_element_chain;
1448 for (p = table[hash]; p; p = p->next_same_hash)
1470 for (p = table[hash]; p; p = p->next_same_hash)
    [all...]
cprop.cc 73 struct cprop_expr *next_same_hash;
84 `next_same_hash' and `bitmap_index' wouldn't be necessary. However, it is
188 cur_expr = cur_expr->next_same_hash)
208 last_expr->next_same_hash = cur_expr;
216 cur_expr->next_same_hash = NULL;
348 for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
496 expr = expr->next_same_hash;
507 expr = expr->next_same_hash;
608 for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
72 struct cprop_expr *next_same_hash; member in struct:cprop_expr
gcse.cc 264 struct gcse_expr *next_same_hash;
312 `next_same_hash' and `bitmap_index' wouldn't be necessary. However, it is
695 for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
1152 cur_expr = cur_expr->next_same_hash;
1164 last_expr->next_same_hash = cur_expr;
1169 cur_expr->next_same_hash = NULL;
1413 for (expr = table->table[i]; expr != NULL; expr = expr->next_same_hash)
1725 for (expr = expr_hash_table.table[ui]; expr; expr = expr->next_same_hash)
2317 for (expr = expr_hash_table.table[i]; expr; expr = expr->next_same_hash)
2477 for (expr = expr_hash_table.table[i]; expr; expr = expr->next_same_hash)
263 struct gcse_expr *next_same_hash; member in struct:gcse_expr
    [all...]

Completed in 28 milliseconds