dberlin

 static void
 compute_dominance_frontiers_1 (bitmap_head *frontiers)
 {
   edge p;
   edge_iterator ei;
   basic_block b;
   FOR_EACH_BB_FN (b, cfun)
     {
       if (EDGE_COUNT (b->preds) >= 2)
     {

dberlin

// simple test run
#include "quadtree.h"

int main(){
	quadtree<int>* tree = new quadtree(rectangle(0, 0, 100, 100)); // initialize a quadtree occupying the square with size 100
	// blah blah tree->insert(integer, x, y);

	// we need to get the list of all points in a particular region
	std::list<qdatum<int>>  list = tree->to_list(region);

dberlin

diff --git a/lib/Basic/SourceManager.cpp b/lib/Basic/SourceManager.cpp
index b78e9f5..f6aa264 100644
--- a/lib/Basic/SourceManager.cpp
+++ b/lib/Basic/SourceManager.cpp
@@ -1200,8 +1200,11 @@ unsigned SourceManager::getPresumedColumnNumber(SourceLocation Loc,
   if (isInvalid(Loc, Invalid)) return 0;
   return getPresumedLoc(Loc).getColumn();
 }
-
-#ifdef __SSE2__