Lines Matching defs:link
64 /* Create a du or ud chain from SRC to DST and link it into SRC. */
70 struct df_link *link = pool_alloc (dflow->block_pool);;
72 DF_REF_CHAIN (src) = link;
73 link->next = head;
74 link->ref = dst;
75 return link;
81 deleted. If LINK is not NULL it must be a link off of ref. In
85 df_chain_unlink (struct dataflow *dflow, struct df_ref *ref, struct df_link *link)
88 if (link)
91 if (chain == link)
92 DF_REF_CHAIN (ref) = link->next;
99 if (chain == link)
108 pool_free (dflow->block_pool, link);
115 link. */
204 df_chain_dump (struct df_link *link, FILE *file)
207 for (; link; link = link->next)
210 DF_REF_REG_DEF_P (link->ref) ? 'd' : 'u',
211 DF_REF_ID (link->ref),
212 DF_REF_BBNO (link->ref),
213 DF_REF_INSN (link->ref) ? DF_REF_INSN_UID (link->ref) : -1);
3001 /* Now scan the uses and link them up with the defs that remain
3225 rtx link = *pprev;
3227 while (link)
3229 switch (REG_NOTE_KIND (link))
3233 if (df_ignore_stack_reg (REGNO (XEXP (link, 0))))
3234 REG_N_DEATHS (REGNO (XEXP (link, 0)))++;
3238 if (!df_ignore_stack_reg (REGNO (XEXP (link, 0))))
3240 rtx next = XEXP (link, 1);
3242 print_note ("deleting: ", insn, link);
3244 free_EXPR_LIST_node (link);
3245 *pprev = link = next;
3250 pprev = &XEXP (link, 1);
3251 link = *pprev;