This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Commoning the control and Data Dependence
- From: Ajit Kumar Agarwal <ajit dot kumar dot agarwal at xilinx dot com>
- To: Jeff Law <law at redhat dot com>, Richard Biener <richard dot guenther at gmail dot com>, "gcc at gcc dot gnu dot org" <gcc at gcc dot gnu dot org>
- Cc: Vinod Kathail <vinodk at xilinx dot com>, Shail Aditya Gupta <shailadi at xilinx dot com>, Vidhumouli Hunsigida <vidhum at xilinx dot com>, "Nagaraju Mekala" <nmekala at xilinx dot com>
- Date: Tue, 1 Sep 2015 17:58:33 +0000
- Subject: Commoning the control and Data Dependence
- Authentication-results: sourceware.org; auth=none
- Authentication-results: spf=pass (sender IP is 149.199.60.83) smtp.mailfrom=xilinx.com; gcc.gnu.org; dkim=none (message not signed) header.d=none;gcc.gnu.org; dmarc=bestguesspass action=none header.from=xilinx.com;
- Spamdiagnosticmetadata: NSPM
- Spamdiagnosticoutput: 1:23
All:
The Data Dependency graph augmented with control dependence can be common out based on the dominator info.
The instruction I1 dominates all the uses say instruction I2 and I3. Then I2 and I3 depends on I1. Thus the Graph can be
Formed from the dominator tree of all the instructions and the edges represent the dominator info. There is an edge
From I1 - I2 and I1-I3 if I1 dominates I2 and I3.
Such representation can be common out with Data and control dependence and the common data structure can be
Formed with the tree based graph on dominator info. This will take care of both the Data Dependence and the control
Dependence with the common representation of the graph on dominator tree info based out of instructions.
Such representation can be augmented with DDG augmented with Control dependence used in Loop distribution pass
To form the partitions to distribute the Loops?
Thanks & Regards
Ajit