contrib/gcc/modulo-sched.c

106 /* The number of different iterations the nodes in ps span, assuming
125   /* The number of nodes in the same row that come after this node.  */
224   /* The column of a node inside the ps.  If nodes u, v are on the same row,
370       node_sched_params[i].asap = g->nodes[i].aux.count;
371       g->nodes[i].aux.info = &node_sched_params[i];
412       ddg_node_ptr u = &g->nodes[i];
445       ddg_node_ptr u = &g->nodes[i];
476 	 Set a bitmap vector, telling which nodes use each copy of this
520 	      rep->insn = g->nodes[i_use].insn;
532 	      replace_rtx (g->nodes[i_use].insn, old_reg, new_reg);
554       ddg_node_ptr u = &ps->g->nodes[i];
590 /* Bump the SCHED_TIMEs of all nodes to start from zero.  Set the values
603       ddg_node_ptr u = &g->nodes[i];
658     if (last == ps->g->nodes[i].insn
659 	|| last == ps->g->nodes[i].first_note)
661     else if (PREV_INSN (last) != ps->g->nodes[i].insn)
662       reorder_insns_nobb (ps->g->nodes[i].first_note, ps->g->nodes[i].insn,
667    nodes whose stages are between FROM_STAGE and TO_STAGE (inclusive
1195 	     row.  Otherwise, we are free to schedule the branch, and we let nodes
1282    'PS' is the partial schedule; it holds the currently scheduled nodes with
1368   ddg_node_ptr u_node = &ps->g->nodes[u];
1522   	  ddg_node_ptr u_node = &ps->g->nodes[u];
1549 		  ps_unschedule_node (ps, &ps->g->nodes[nodes_order[j - 1]]);
1568 	     of nodes within the cycle.  */
1633 /* This page implements the algorithm for ordering the nodes of a DDG
1683 /* Order the nodes of G for scheduling and pass the result in
1704       ddg_node_ptr v = &g->nodes[i];
1730      For each SCC order the nodes according to their ASAP/ALAP/HEIGHT etc.  */
1735       /* Add nodes on paths from previous SCCs to the current SCC.  */
1736       find_nodes_on_paths (on_path, g, prev_sccs, scc->nodes);
1737       sbitmap_a_or_b (tmp, scc->nodes, on_path);
1739       /* Add nodes on paths from the current SCC to previous SCCs.  */
1740       find_nodes_on_paths (on_path, g, scc->nodes, prev_sccs);
1743       /* Remove nodes of previous SCCs from current extended SCC.  */
1750   /* Handle the remaining nodes that do not belong to any scc.  Each call
1780     g->nodes[u].aux.info = &node_order_params_arr[u];
1786   /* We assume that the nodes in the array are in topological order.  */
1791       ddg_node_ptr u_node = &g->nodes[u];
1803       ddg_node_ptr u_node = &g->nodes[u];
1821 find_max_asap (ddg_ptr g, sbitmap nodes)
1828   EXECUTE_IF_SET_IN_SBITMAP (nodes, 0, u, sbi)
1830       ddg_node_ptr u_node = &g->nodes[u];
1842 find_max_hv_min_mob (ddg_ptr g, sbitmap nodes)
1850   EXECUTE_IF_SET_IN_SBITMAP (nodes, 0, u, sbi)
1852       ddg_node_ptr u_node = &g->nodes[u];
1871 find_max_dv_min_mob (ddg_ptr g, sbitmap nodes)
1879   EXECUTE_IF_SET_IN_SBITMAP (nodes, 0, u, sbi)
1881       ddg_node_ptr u_node = &g->nodes[u];
1899 /* Places the nodes of SCC into the NODE_ORDER array starting
1901    NODES_ORDERED (in&out parameter) holds the bitset of all nodes in
1955 	      v_node = &g->nodes[v];
1976 	      v_node = &g->nodes[v];