contrib/gcc/modulo-sched.c

97 /* The minimum (absolute) cycle that a node of ps was scheduled in.  */
100 /* The maximum (absolute) cycle that a node of ps was scheduled in.  */
115   ddg_node_ptr node;
118      Same as SCHED_TIME (node).  */
125   /* The number of nodes in the same row that come after this node.  */
167 						ddg_node_ptr node, int cycle,
205 /* The scheduling parameters held for each node.  */
213      of the register defined by this node.  This register-move copies the
214      original register defined by the node.  */
224   /* The column of a node inside the ps.  If nodes u, v are on the same row,
348 /* Points to the array that contains the sched data for each node.  */
351 /* Allocate sched_params for each node and initialize it.  Assumes that
352    the aux field of each node contain the asap bound (computed earlier),
359   /* Allocate for each node in the DDG a place to hold the "sched_data".  */
365   /* Set the pointer of the general data of the node to point to the
403    longest latency edge for each node.  Reset based on experiments.  */
474       /* Every use of the register defined by node may require a different
600   /* Don't include the closing branch assuming that it is the last node.  */
614 /* Set SCHED_COLUMN of each node according to its position in PS.  */
626 	SCHED_COLUMN (cur_insn->node) = column++;
642       if (PREV_INSN (last) != ps_ij->node->insn)
643       	reorder_insns_nobb (ps_ij->node->first_note, ps_ij->node->insn,
679 	ddg_node_ptr u_node = ps_ij->node;
1290 	     the node ordering phase.
1296 			     Add the node/instruction u to the partial schedule
1307    3. for each node u in O in pre-computed order
1353    cycles in which we can schedule the node with the given index I.
1356    because the sched window of a node is empty    due to tight data-deps. In
1564 	    fprintf(dump_file, "Trying to schedule node %d in (%d .. %d) step %d\n",
1615 	} /* Continue with next node.  */
1684    NODE_ORDER.  Also set aux.count of each node to ASAP.
1729   /* Perfrom the node ordering starting from the SCC with the highest recMII.
1771   /* Allocate a place to hold ordering params for each node in the DDG.  */
1778   /* Set the aux pointer of each node to point to its order_params structure.  */
1783      calculate ASAP, ALAP, mobility, distance, and height for each node
2088 		   INSN_UID (ps_i->node->insn));
2096 create_ps_insn (ddg_node_ptr node, int rest_count, int cycle)
2100   ps_i->node = node;
2111    node is not found in the partial schedule, else returns true.  */
2161      and insert the node immediately after the must precede
2167       if (TEST_BIT (must_follow, next_ps_i->node->cuid)
2170       if (TEST_BIT (must_precede, next_ps_i->node->cuid))
2172           /* If we have already met a node that must follow, then
2181   /* Now insert the node after INSERT_AFTER_PSI.  */
2205    the node with cuid N must be come after the node pointed to by
2223   next_node = ps_i->next_in_row->node;
2254    set in MUST_PRECEDE/MUST_FOLLOW if the node with cuid N must be come
2255    before/after (respectively) the node pointed to by PS_I when scheduled
2258 add_node_to_ps (partial_schedule_ptr ps, ddg_node_ptr node, int cycle,
2272   ps_i = create_ps_insn (node, rest_count, cycle);
2373 	  rtx insn = crr_insn->node->insn;
2404 /* Checks if the given node causes resource conflicts when added to PS at
2405    cycle C.  If not the node is added to PS and returned; otherwise zero
2406    is returned.  Bit N is set in MUST_PRECEDE/MUST_FOLLOW if the node with
2407    cuid N must be come before/after (respectively) the node pointed to by
2417   /* First add the node to the PS, if this succeeds check for
2420     return NULL; /* Failed to insert the node at the given cycle.  */
2428   /* Try different issue slots to find one that the given node can be
2480 /* Remove the node N from the partial schedule PS; because we restart the DFA
2482    unscheduling the node N.  */
2493        ps_i &&  ps_i->node != n;