contrib/gcc/gcse.c

438    anything except itself. (i.e., loads and stores to a single location).
440    allowance. (all stores copy the same value to the reaching reg used
443    Store Motion uses this structure as an expression table to track stores
452   rtx stores;			/* INSN list of stores seen.  */
1770      redundant loads from due to stores to the same location.  */
5046     load towards the exit, and we end up with no loads or stores of 'i'
5091   ptr->stores       = NULL_RTX;
5108   free_INSN_LIST_list (& ptr->stores);
5158       if (ptr->stores)
5159 	print_rtl (file, ptr->stores);
5289    being defined as MEM loads and stores to symbols, with no side effects
5333 		  /* Check for stores. Don't worry about aliased ones, they
5346 			ptr->stores = alloc_INSN_LIST (insn, ptr->stores);
5408    a reaching register, and update any stores that are needed if
5421       /* We can try to find just the REACHED stores, but is shouldn't
5429       rtx list = mem_ptr->stores;
5468 #define AVAIL_STORE_LIST(x)		((x)->stores)
5642    The things are complicated a bit by fact that there already may be stores
5747 /* Find available and anticipatable stores.  */
5770   /* Find all the stores we care about.  */
5796       /* Now find the stores.  */
5814 	  /* Now that we've marked regs, look for stores.  */
5845   /* Remove the stores that are not available anywhere, as there will
5968       /* Check for memory stores to aliased objects.  */
6056    STORE_DATA, based on lists of available and anticipatable stores.  */
6225   /* We can't put stores in the front of blocks pointed to by abnormal
6470   /* Find all the available and anticipatable stores.  */
6490   /* Now we want to insert the new stores which are going to be needed.  */
6510       /* Now we want to insert the new stores which are going to be needed.  */