No estaba reseteando el grafo.

asmline.cpp

@@ -47,4 +47,4 @@ void Asmline::setLabelsToJump(std::list<std::string> labelsToJumpGiven) {
     labelsToJumpGiven.pop_front();
     labelsToJump = labelsToJumpGiven;
   }
-}
+}

asmline.h

@@ -28,4 +28,4 @@ class Asmline {
   bool esCortante();
 };
 
-#endif  // ASMLINE_H_
+#endif  // ASMLINE_H_

eBPF.cpp

@@ -10,9 +10,7 @@
 #include "parser.h"
 #include "results.h"
 
-void EBPF::init(std::string& filename) {
-  std::ifstream reader;
-  reader.open(filename, std::ifstream::in);
+void EBPF::init(std::ifstream& reader) {
   int i = 1;
   while (reader.good()) {
     std::string myText;
@@ -22,7 +20,6 @@ void EBPF::init(std::string& filename) {
     i++;
   }
   this->connectLostTags();
-  reader.close();
 }
 
 EBPF::EBPF(Results& r, FileFountain& f) : results(r), fileFountain(f) {
@@ -33,15 +30,25 @@ EBPF::EBPF(Results& r, FileFountain& f) : results(r), fileFountain(f) {
 void EBPF::run() {
   std::string filename;
   while (!(filename = fileFountain.getNext()).empty()) {
-    this->init(filename);
-    bool hasCycles = this->hasCycle();
-    if (hasCycles)
-      results.addResult(filename, true, false);
-    else
-      results.addResult(filename, false, this->hasUnusedInstruction());
+    std::ifstream reader;
+    Graph opGraph;
+    reader.open(filename, std::ifstream::in);
+    this->init(reader);
+    reader.close();
+    bool cycle = this->hasCycle();
+    bool unused = this->hasUnusedInstruction();
+    this->restart();
+    results.addResult(filename, cycle, unused);
   }
 }
 
+void EBPF::restart() {
+  referenciasColgadas.clear();
+  referenciasReconocidas.clear();
+  aristaACortar.clear();
+  opGraph.clear();
+}
+
 void EBPF::connectLostTags() {
   for (int i : aristaACortar) {
     opGraph.disconnectNext(i);

eBPF.h

@@ -3,6 +3,7 @@
 
 #include <list>
 #include <map>
+#include <mutex>
 #include <string>
 
 #include "fileFountain.h"
@@ -20,14 +21,15 @@ class EBPF : public Thread {
   Graph opGraph;
   Parser parser;
   FileFountain& fileFountain;
-  void init(std::string& filename);
+  void init(std::ifstream& reader);
 
  public:
   EBPF(Results& r, FileFountain& f);
   void run();
   void addInstructionToGraph(std::string line, int lineNumber);
   void connectLostTags();
   bool hasCycle();
+  void restart();
   ~EBPF() {}
   bool hasUnusedInstruction();
 };

fileFountain.cpp

@@ -12,7 +12,7 @@ void FileFountain::sortFiles() {
   std::reverse(files.begin(), files.end());
 }
 */
-FileFountain::FileFountain(int argc, char* argv[]) : alreadyRead(0) {
+FileFountain::FileFountain(int argc, char* argv[]) {
   for (int i = argc - 1; i > 1; i--) {
     std::string file(argv[i]);
     files.push_back(file);
@@ -24,8 +24,7 @@ int FileFountain::getNumberOfFiles() { return files.size(); }
 
 std::string FileFountain::getNext() {
   std::unique_lock<std::mutex> lock(m);
-  if (files.size() == 0) return {};
-  ++alreadyRead;
+  if (files.size() == 0) return "";
   std::string file = files.back();
   files.pop_back();
   return file;

fileFountain.h

@@ -8,7 +8,6 @@
 class FileFountain {
  private:
   std::vector<std::string> files;
-  size_t alreadyRead;
   size_t toRead;
   std::mutex m;
 

graph.cpp

@@ -5,7 +5,7 @@
 #include <map>
 #include <string>
 
-bool Graph::hasBeenFound(int node) {
+bool Graph::hasBeenFound(int node, std::list<int>& found) {
   for (int i : found) {
     if (node == i) return true;
   }
@@ -23,7 +23,7 @@ void Graph::addEdge(int from, int to) {
 int Graph::size() { return nodes.size(); }
 
 bool Graph::isIn(int node) {
-  for (auto& i : nodes) {
+  for (auto i : nodes) {
     if (node == i.first) return true;
   }
   return false;
@@ -35,20 +35,22 @@ void Graph::addIfItsNotIn(int node) {
   }
 }
 
-bool Graph::_isCyclic(int start) {
-  if (hasBeenFound(start)) return true;
+bool Graph::_isCyclic(int start, std::list<int>& found) {
+  if (hasBeenFound(start, found)) return true;
   found.push_front(start);
   for (int i : nodes.at(start)) {
-    if (Graph::_isCyclic(i)) return true;
+    if (Graph::_isCyclic(i, found)) return true;
   }
   found.remove(start);
   return false;
 }
 
+void Graph::clear() { nodes.clear(); }
+
 bool Graph::isCyclic() {
-  found = {};
-  for (auto& it : nodes) {
-    if (this->_isCyclic(it.first)) {
+  std::list<int> found;
+  for (auto it : nodes) {
+    if (this->_isCyclic(it.first, found)) {
       found.clear();
       return true;
     }
@@ -60,16 +62,17 @@ bool Graph::isCyclic() {
 void Graph::connectLast(int to) { this->addEdge(nodes.size() - 1, to); }
 
 void Graph::dfs(int start, std::list<int>& found) {
-  if (hasBeenFound(start)) return;
+  if (hasBeenFound(start, found)) return;
   found.push_front(start);
   for (int i : nodes[start]) {
-    if (!(hasBeenFound(i))) {
+    if (!(hasBeenFound(i, found))) {
       Graph::dfs(i, found);
     }
   }
 }
 
 bool Graph::hasUnusedInstructions() {
+  std::list<int> found;
   if (nodes.size() == 0) return false;
   dfs(1, found);
   long unsigned int amountFound = found.size();
@@ -87,4 +90,4 @@ void Graph::disconnectNext(int nodo) {
   }
 }
 
-void Graph::connect(int from, int to) { nodes[from].push_front(to); }
+void Graph::connect(int from, int to) { nodes[from].push_front(to); }

graph.h

@@ -8,23 +8,23 @@
 class Graph {
  private:
   std::map<int, std::list<int>> nodes;
-  std::list<int> found;
 
  public:
   Graph() {}
   void addVertex(int node);
-  bool hasBeenFound(int node);
+  bool hasBeenFound(int node, std::list<int>& found);
   int size();
   bool isIn(int node);
   void addIfItsNotIn(int node);
   void addEdge(int from, int to);
-  bool _isCyclic(int start);
+  bool _isCyclic(int start, std::list<int>& found);
   bool isCyclic();
   void dfs(int start, std::list<int>& found);
   void connect(int from, int to);
   void connectLast(int to);
   bool hasUnusedInstructions();
   void disconnectNext(int nodo);
+  void clear();
 };
 
 #endif  // GRAPH_H_

main.cpp

@@ -15,10 +15,6 @@ static int work(int numberOfThreads, FileFountain& files) {
   std::vector<EBPF*> holders;
   Results results;
 
-  numberOfThreads = numberOfThreads > files.getNumberOfFiles()
-                        ? files.getNumberOfFiles()
-                        : numberOfThreads;
-
   holders.reserve(numberOfThreads);
 
   for (int i = 0; i < numberOfThreads; i++) {

thread.cpp

@@ -1,5 +1,7 @@
 #include "thread.h"
 
+#include <utility>
+
 Thread::Thread() {}
 
 Thread::~Thread() {}
@@ -13,4 +15,4 @@ Thread::Thread(Thread&& other) { this->thread = std::move(other.thread); }
 Thread& Thread::operator=(Thread&& other) {
   this->thread = std::move(other.thread);
   return *this;
-}
+}

thread.h

@@ -19,4 +19,4 @@ class Thread {
   std::thread thread;
 };
 
-#endif  // THREAD_H_
+#endif  // THREAD_H_