Searched refs:mem_refs (Results 1 - 4 of 4) sorted by relevance
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | tree-ssa-loop-im.cc | 2657 hoist_memory_references (class loop *loop, bitmap mem_refs, argument 2713 bitmap_copy (refs_not_in_seq, mem_refs); 2720 bitmap_clear (mem_refs); 2742 bitmap_and_compl_into (mem_refs, refs_not_supported); 2743 if (bitmap_empty_p (mem_refs)) 2756 EXECUTE_IF_SET_IN_BITMAP (mem_refs, 0, i, bi) 2765 = memory_accesses.refs_list[bitmap_first_set_bit (mem_refs)]; 2802 What matters is the order of the last stores to the mem_refs 2806 /* For each exit compute the store order, pruning from mem_refs 2820 bitmap_and_compl (refs_not_in_seq, mem_refs, refs_not_supporte [all...] |
H A D | tree-nested.cc | 195 hash_set<tree *> *mem_refs; member in struct:nesting_info 944 info->mem_refs = new hash_set<tree *>; 2047 info->mem_refs->add (tp); 3639 root->mem_refs->traverse<void *, fold_mem_refs> (NULL); 3695 delete node->mem_refs;
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | tree-nested.c | 95 hash_set<tree *> *mem_refs; member in struct:nesting_info 845 info->mem_refs = new hash_set<tree *>; 1916 info->mem_refs->add (tp); 3480 root->mem_refs->traverse<void *, fold_mem_refs> (NULL); 3536 delete node->mem_refs;
|
H A D | tree-ssa-loop-im.c | 2145 hoist_memory_references (class loop *loop, bitmap mem_refs, argument 2152 EXECUTE_IF_SET_IN_BITMAP (mem_refs, 0, i, bi)
|
Completed in 298 milliseconds