-static void load_handling(ir_node *load, env_t *env, set *repairs)
-{
- repairs_t key, *value;
- ir_node *load_ptr, *load_mem, *nods_block;
- unsigned i;
-
- nods_block = get_nodes_block(load);
- load_ptr = get_Load_ptr(load);
- load_mem = get_Load_mem(load);
- // DDMN(load);
- /* The pointer predecessor of Load muss be a Sel node. */
- if (get_irn_op(load_ptr) == op_Sel) {
- /* If the link field of sel's entity is set to "ADDRESS_TAKEN", that means this value
- can't be scalar replaced. It is nothing to do and load_handling() must be exited. */
- if (get_entity_link(get_Sel_entity(load_ptr)) == ADDRESS_TAKEN)
- return;
-
- key.irn = nods_block;
- value = set_find(repairs, &key, sizeof(key), HASH_PTR(nods_block));
-
- /* Load's pointer predecessor's link field contains the position in the block's link, where
- must be searched the predecessor of this Load. */
- i = (unsigned)get_irn_link(load_ptr);
-
- /* If the link of Load's block doesn't contains at position "i" a node or isn't calculated,
- than pred_search() must be called .*/
- if (value == NULL) {
- block_link(load, env, repairs);
- key.irn = nods_block;
- value = set_find(repairs, &key, sizeof(key), HASH_PTR(nods_block));
- pred_search(load, value, repairs, i, 0);
- } else if (value->link[i] == NULL)
- pred_search(load, value, repairs, i, 0);
-
- /* If after the pred_search() call the link of Load's block at position "i" is equal to NULL,
- that means the loaded value wasn't initialized and the load predecessor is set to Unknown */
- if (value->link[i] == NULL)
- value->link[i] = new_Unknown(env->modes[i]);
-
- /* The Load node can be turned into a tuple now. This tuple will be optimized later. */
- turn_into_tuple(load, pn_Load_max);
- set_Tuple_pred(load, pn_Load_M, load_mem);
- set_Tuple_pred(load, pn_Load_res, value->link[i]);
- set_Tuple_pred(load, pn_Load_X_except, new_Bad());
- }
-}
-
-/**
- * A walker along the memory edge. Load and Phi nodes muss be found for optimization
- *
- * @param node A node from the graph.
- * @param env Contains information about scalars number and mode.
- * @param repairs A set, that contains all blocks, that have a link, and all Phis, that
- * have copies to repair.
-*/
-static void memory_edge_walk2(ir_node *node, env_t *env, set *repairs)
-{
- int i, p, n = get_irn_arity(node);
- repairs_t key, *value, *value_block;
- ir_node *phi_pred;
- DDMN(node);
-
- for (i = 0; i < n; i++) {
- ir_node *pred = get_irn_n(node, i);
-
- if((get_irn_op(pred) == op_Proj &&
- get_irn_mode(pred) == mode_M) ||
- get_irn_mode(pred) == mode_T ||
- is_memop(pred) ||
- get_irn_op(pred) == op_Call ||
- get_irn_op(pred) == op_Alloc)
- memory_edge_walk2(pred, env, repairs);
-
- if(get_irn_op(pred) == op_Phi &&
- get_irn_mode(pred) == mode_M &&
- get_irn_link(pred) != NODE_VISITED){
- set_irn_link(pred, NODE_VISITED);
- memory_edge_walk2(pred, env, repairs);
- }
- }
-
- if (get_irn_op(node) == op_Load)
- load_handling(node, env, repairs);
-
- if (get_irn_op(node) == op_Phi && get_irn_mode(node) == mode_M){
- key.irn = node;
- value = set_find(repairs, &key, sizeof(key), HASH_PTR(key.irn));
- /* If the phi is in the set " repairs ", then must be handled.*/
- if (value != NULL){
- // DDMN(node);
- key.irn = get_nodes_block(node);
- value_block = set_find(repairs, &key, sizeof(key), HASH_PTR(key.irn));
- n = get_irn_arity(node);
- /* All predecessors of a Phi node muss be found.*/
- for(i = 0; i < env->nvals; i ++)
- for(p = 0; p < n; p ++){
- phi_pred = get_Phi_pred(value->irn, p);
- pred_search(phi_pred, value_block, repairs, i, p);
- }
- }
- }
- /* Reset the links, that have been used by the walk.*/
- if (get_irn_link(node) == NODE_VISITED)
- set_irn_link(node, NULL);
-}