Lines Matching defs:resolved_p
767 bool resolved_p;
769 sd_next_list (insn, &list_types, &list, &resolved_p);
785 bool resolved_p;
787 sd_next_list (insn, &list_types, &list, &resolved_p);
831 Search through resolved dependency lists if RESOLVED_P is true.
836 sd_find_dep_between_no_cache (rtx pro, rtx con, bool resolved_p,
845 if (resolved_p)
892 Search through resolved dependency lists if RESOLVED_P is true.
895 sd_find_dep_between (rtx pro, rtx con, bool resolved_p)
911 return sd_find_dep_between_no_cache (pro, con, resolved_p, NULL);
925 maybe_add_or_update_dep_1 (dep_t dep, bool resolved_p, rtx mem1, rtx mem2)
942 return add_or_update_dep_1 (dep, resolved_p, mem1, mem2);
1215 add_or_update_dep_1 (dep_t new_dep, bool resolved_p,
1237 resolved_p, &sd_it);
1267 resolved_p, &sd_it);
1289 sd_add_dep (new_dep, resolved_p);
1295 FORW_LIST_PTR with producer's forward list. If RESOLVED_P is true
1298 get_back_and_forw_lists (dep_t dep, bool resolved_p,
1304 if (!resolved_p)
1321 If RESOLVED_P is true treat the dependence as a resolved one. */
1323 sd_add_dep (dep_t dep, bool resolved_p)
1339 get_back_and_forw_lists (dep, resolved_p, &con_back_deps, &pro_forw_deps);
1358 sd_add_or_update_dep (dep_t dep, bool resolved_p)
1360 return add_or_update_dep_1 (dep, resolved_p, NULL_RTX, NULL_RTX);
1406 If RESOLVED_P is true add dependencies to the resolved lists. */
1408 sd_copy_back_deps (rtx_insn *to, rtx_insn *from, bool resolved_p)
1414 list_type = resolved_p ? SD_LIST_RES_BACK : SD_LIST_BACK;
1422 sd_add_dep (new_dep, resolved_p);
1452 get_back_and_forw_lists (dep, sd_it.resolved_p,
3850 Delete INSN's (RESOLVED_P) backward dependencies. */
3852 delete_dep_nodes_in_back_deps (rtx_insn *insn, bool resolved_p)
3858 if (resolved_p)
3871 get_back_and_forw_lists (dep, resolved_p, &back_list, &forw_list);
3877 /* Delete (RESOLVED_P) dependencies between HEAD and TAIL together with
3880 sched_free_deps (rtx_insn *head, rtx_insn *tail, bool resolved_p)
3892 if (resolved_p)
3901 delete_dep_nodes_in_back_deps (insn, resolved_p);