el Struct Reference

Collaboration diagram for el:

[legend]

Data Fields
edge	e
el *	next

---

Detailed Description

Steps #5 and #6 of the above algorithm are best implemented by walking
   all the incoming edges which thread to the same destination edge at
   the same time.  That avoids lots of table lookups to get information
   for the destination edge.

   To realize that implementation we create a list of incoming edges
   which thread to the same outgoing edge.  Thus to implement steps
   #5 and #6 we traverse our hash table of outgoing edge information.
   For each entry we walk the list of incoming edges which thread to
   the current outgoing edge.   

Definition at line 97 of file tree-ssa-threadupdate.c.

---

Field Documentation

edge el::e

Definition at line 99 of file tree-ssa-threadupdate.c. Referenced by create_edge_and_update_destination_phis(), lookup_redirection_data(), redirect_edges(), and thread_block().

struct el* el::next

Definition at line 100 of file tree-ssa-threadupdate.c. Referenced by lookup_redirection_data(), and redirect_edges().

---

The documentation for this struct was generated from the following file:

• tree-ssa-threadupdate.c

---