Merge branch 'development' into f-FixIDEEdgeFunctions

Author: pdschubert

include/phasar/PhasarLLVM/DataFlowSolver/IfdsIde/Problems/IDEInstInteractionAnalysis.h

@@ -0,0 +1,131 @@
+/******************************************************************************
+ * Copyright (c) 2019 Philipp Schubert, Richard Leer, and Florian Sattler.
+ * All rights reserved. This program and the accompanying materials are made
+ * available under the terms of LICENSE.txt.
+ *
+ * Contributors:
+ *     Philipp Schubert and others
+ *****************************************************************************/
+
+#include "phasar/PhasarLLVM/DataFlowSolver/IfdsIde/Problems/IDEInstInteractionAnalysis.h"
+
+#include "llvm/IR/Instruction.h"
+#include "llvm/IR/Instructions.h"
+#include "llvm/IR/Value.h"
+#include "llvm/Support/Casting.h"
+#include "llvm/Support/ErrorHandling.h"
+
+#include <algorithm>
+#include <memory>
+#include <tuple>
+
+using namespace psr;
+
+IDEIIAFlowFact::IDEIIAFlowFact(const llvm::Value *BaseVal) : BaseVal(BaseVal) {}
+
+IDEIIAFlowFact::IDEIIAFlowFact(
+    const llvm::Value *BaseVal,
+    llvm::SmallVector<const llvm::GetElementPtrInst *, KLimit> FieldDesc)
+    : BaseVal(BaseVal), FieldDesc(std::move(FieldDesc)) {
+  assert(FieldDesc.size() <= getKLimit() &&
+         "Field descriptor exceeds k-limit!");
+}
+
+IDEIIAFlowFact IDEIIAFlowFact::create(const llvm::Value *BaseVal) {
+  if (const auto *Alloca = llvm::dyn_cast<llvm::AllocaInst>(BaseVal)) {
+    return {BaseVal};
+  }
+  if (const auto *Gep = llvm::dyn_cast<llvm::GetElementPtrInst>(BaseVal)) {
+    // Construct field descriptor
+    llvm::SmallVector<const llvm::GetElementPtrInst *, KLimit> FieldDesc;
+    FieldDesc.push_back(Gep);
+    const auto *NextGep = Gep->getPointerOperand();
+    while (llvm::isa_and_nonnull<llvm::GetElementPtrInst>(NextGep)) {
+      Gep = llvm::dyn_cast<llvm::GetElementPtrInst>(NextGep);
+      if (FieldDesc.size() >= KLimit) {
+        // do a left shift to make space
+        if (FieldDesc.size() == 1) {
+          FieldDesc.pop_back();
+        } else {
+          for (size_t Idx = 0; Idx < FieldDesc.size() - 1; ++Idx) {
+            FieldDesc[Idx] = FieldDesc[Idx + 1];
+          }
+          FieldDesc.pop_back();
+        }
+      }
+      FieldDesc.push_back(Gep);
+      NextGep = Gep->getPointerOperand();
+    }
+    std::reverse(FieldDesc.begin(), FieldDesc.end());
+    // Get base variable
+    if (llvm::isa_and_nonnull<llvm::AllocaInst>(NextGep)) {
+      BaseVal = NextGep;
+    }
+    assert(BaseVal && "BaseVal cannot be nullptr!");
+    if (KLimit == 0) {
+      return {BaseVal};
+    }
+    return {BaseVal, FieldDesc};
+  }
+  llvm::report_fatal_error("Unexpected instruction!");
+}
+
+bool IDEIIAFlowFact::flowFactEqual(const IDEIIAFlowFact &Other) const {
+  return *this == Other;
+}
+
+void IDEIIAFlowFact::print(llvm::raw_ostream &OS,
+                           [[maybe_unused]] bool IsForDebug) const {
+  OS << "IDEIIAFlowFact { ";
+  if (!BaseVal) {
+    OS << "nullptr";
+  } else {
+    OS << *BaseVal;
+  }
+  if (FieldDesc.empty()) {
+    OS << " }";
+  } else {
+    OS << ",\n\t[\n\t\t";
+    for (const auto *Gep : FieldDesc) {
+      OS << *Gep;
+      if (Gep != FieldDesc.back()) {
+        OS << ",\n\t\t";
+      }
+    }
+    OS << "\n\t]\n}";
+  }
+}
+
+bool IDEIIAFlowFact::operator==(const IDEIIAFlowFact &Other) const {
+  if (BaseVal != Other.BaseVal) {
+    return false;
+  }
+  if (FieldDesc.size() != Other.FieldDesc.size()) {
+    return false;
+  }
+  auto EqualGEPDescriptor = [](const llvm::GetElementPtrInst *Lhs,
+                               const llvm::GetElementPtrInst *Rhs) {
+    const auto *LhsI = llvm::dyn_cast<llvm::Instruction>(Lhs);
+    const auto *RhsI = llvm::dyn_cast<llvm::Instruction>(Rhs);
+    return LhsI->isSameOperationAs(RhsI);
+  };
+  for (unsigned Idx = 0; Idx < FieldDesc.size(); ++Idx) {
+    if (!EqualGEPDescriptor(FieldDesc[Idx], Other.FieldDesc[Idx])) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool IDEIIAFlowFact::operator!=(const IDEIIAFlowFact &Other) const {
+  return !(*this == Other);
+}
+
+bool IDEIIAFlowFact::operator<(const IDEIIAFlowFact &Other) const {
+  return std::tie(BaseVal, FieldDesc) <
+         std::tie(Other.BaseVal, Other.FieldDesc);
+}
+
+bool IDEIIAFlowFact::operator==(const llvm::Value *V) const {
+  return BaseVal == V && FieldDesc.empty();
+}

lib/PhasarLLVM/DataFlowSolver/IfdsIde/Problems/IDEInstInteractionAnalysis.cpp

@@ -1,4 +1,7 @@
 set(Sources
+  array_01.cpp
+  array_02.cpp
+  array_03.cpp
   basic_01.cpp
   basic_02.cpp
   basic_03.cpp
@@ -24,6 +27,7 @@ set(Sources
   return_01.cpp
   rvo_01.cpp
   struct_01.cpp
+  struct_02.cpp
 )
 
 set(SourcesOpt

test/llvm_test_code/inst_interaction/CMakeLists.txt

@@ -0,0 +1,11 @@
+int main() {
+  int i = 13;
+  int j = 42;
+  int buffer[16] = {0};
+  buffer[0] = i;
+  buffer[10] = j;
+  int x = buffer[0];
+  int y = buffer[10];
+  int z = buffer[1];
+  return 0;
+}

test/llvm_test_code/inst_interaction/array_01.cpp

@@ -0,0 +1,6 @@
+int main() {
+  int buffer[10][10];
+  buffer[0][0] = 1;
+  int i = buffer[0][0];
+  return i;
+}

test/llvm_test_code/inst_interaction/array_02.cpp

@@ -0,0 +1,6 @@
+int main() {
+  int buffer[3][3][3];
+  buffer[1][1][1] = 42;
+  int i = buffer[1][1][1];
+  return i;
+}

test/llvm_test_code/inst_interaction/array_03.cpp

@@ -1,12 +1,19 @@
-
-struct X {
-  int i;
-  int j;
-  X(int i, int j) : i(i), j(j) {}
+struct S {
+  int a;
+  int b;
+  int c;
 };
 
 int main() {
-  X x(10, 20);
-  int a = x.i;
-  return a;
+  int i = 1;
+  int j = 2;
+  int k = 3;
+  S l;
+  l.a = i;
+  l.b = j;
+  l.c = k;
+  int x = l.a;
+  int y = l.b;
+  int z = l.c;
+  return 0;
 }

test/llvm_test_code/inst_interaction/struct_01.cpp

@@ -0,0 +1,18 @@
+
+struct X {
+  int i;
+};
+
+struct Y {
+  X x;
+  int j;
+};
+
+int main() {
+  Y b;
+  b.x.i = 1000;
+  b.j = 2000;
+  int k = b.x.i;
+  int l = b.j;
+  return 0;
+}