From 2a2752adb4b32715926d3e565444fe2ea959f597 Mon Sep 17 00:00:00 2001
From: Tuowen Zhao <ztuowen@gmail.com>
Date: Sun, 9 Oct 2016 20:11:37 -0600
Subject: clean up

---
 include/chillAST/chillASTs.hh | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'include/chillAST/chillASTs.hh')

diff --git a/include/chillAST/chillASTs.hh b/include/chillAST/chillASTs.hh
index 25e6855..4b50479 100644
--- a/include/chillAST/chillASTs.hh
+++ b/include/chillAST/chillASTs.hh
@@ -514,9 +514,9 @@ public:
     // ADD MYSELF!
     loops.push_back(this);
 
-    int n = getBody()->children.size();
+    int n = getBody()->getNumChildren();
     for (int i = 0; i < n; i++) {
-      getBody()->children[i]->get_deep_loops(loops);
+      getBody()->getChild(i)->get_deep_loops(loops);
     }
   }
 
@@ -524,10 +524,10 @@ public:
   void find_deepest_loops(std::vector<chillAST_ForStmt *> &loops) {
     std::vector<chillAST_ForStmt *> b; // deepest loops below me
 
-    int n = getBody()->children.size();
+    int n = getBody()->getNumChildren();
     for (int i = 0; i < n; i++) {
       std::vector<chillAST_ForStmt *> l; // deepest loops below one child
-      getBody()->children[i]->find_deepest_loops(l);
+      getBody()->getChild(i)->find_deepest_loops(l);
       if (l.size() > b.size()) { // a deeper nesting than we've seen
         b = l;
       }
-- 
cgit v1.2.3-70-g09d2