summaryrefslogtreecommitdiff
path: root/chill/include/dep.hh
diff options
context:
space:
mode:
authorTuowen Zhao <ztuowen@gmail.com>2016-09-17 19:21:10 -0600
committerTuowen Zhao <ztuowen@gmail.com>2016-09-17 19:21:10 -0600
commitdffa5374ca560213452039fe569a70ca21b58a85 (patch)
treeb7ebb146cee60e9973b3f158196d56abd28c0f42 /chill/include/dep.hh
parentbdaf6dc251d98fc1c93165fa8579378204b395e1 (diff)
downloadchill-dffa5374ca560213452039fe569a70ca21b58a85.tar.gz
chill-dffa5374ca560213452039fe569a70ca21b58a85.tar.bz2
chill-dffa5374ca560213452039fe569a70ca21b58a85.zip
added file doc
Diffstat (limited to 'chill/include/dep.hh')
-rw-r--r--chill/include/dep.hh13
1 files changed, 13 insertions, 0 deletions
diff --git a/chill/include/dep.hh b/chill/include/dep.hh
index f1cc864..6c535ce 100644
--- a/chill/include/dep.hh
+++ b/chill/include/dep.hh
@@ -1,6 +1,19 @@
#ifndef DEP_HH
#define DEP_HH
+/*!
+ * \file
+ * \brief Data dependence vector and graph.
+ *
+ * All dependence vectors are normalized, i.e., the first non-zero distance
+ * must be positve. Thus the correct dependence meaning can be given based on
+ * source/destination pair's read/write type. Suppose for a dependence vector
+ * 1, 0~5, -3), we want to permute the first and the second dimension,
+ * the result would be two dependence vectors (0, 1, -3) and (1~5, 1, -3).
+ * All operations on dependence vectors are non-destructive, i.e., new
+ * dependence vectors are returned.
+ */
+
#include <omega.h>
#include "graph.hh"
#include "ir_code.hh"