diagnostic.h

Go to the documentation of this file.

#ifndef BDWY_DIAGNOSTIC_CHAIN_H
#define BDWY_DIAGNOSTIC_CHAIN_H

#include "c_breeze.h"
#include "pointers.h"
#include "broadway.h"


class Diagnostic {
private:
  typedef map<memoryDef*, memoryuse_set> def2uses;

  REF  enumPropertyAnn        *_property;
  TREE enumvalue_set           _diagnostic_values;
  TREE map<Location*,def2uses> _def2uses;

public:
  Diagnostic(enumPropertyAnn *property) : _property(property) {}

  inline bool is_diagnostic_value(enumValueAnn *v) {
    return v && _diagnostic_values.test(v->id());
  }

  inline void add_diagnostic_value(enumValueAnn *v) {
    if(v && ! is_diagnostic_value(v)) _diagnostic_values.insert(v);
  }

  inline bool contain_diagnostic_value(enumvalue_set values) const {
    return (_diagnostic_values & values).any();
  }

  inline void add_defuse(Location *loc, memoryDef *lhs, memoryUse *rhs) {
    if(loc && lhs && rhs) _def2uses[loc][lhs].insert(rhs);
  }

  inline void reset(Location *loc) { _def2uses.erase(loc); }
  inline void reset() { _def2uses.clear();  }

  void trace(ostream & out, Location *loc, pointerValue &pv);

private:
  typedef pair<Location*,memoryDef*>  Location_pair;

  class                              Segment; // holds an ordered list of Location

  typedef list<Segment*>             Segments;

  Segments  segments;

  Segments  starts;

  map<Location_pair,Segment*>  segment_path;

  Segment *trace(Location *from, memoryDef *def);

  Segment *trace(Location *from, Location *to);

  int detect_cycle(Segment *cur, Segments & visited, bool specific=false);

  void find_shortest(Segment *cur, Segments path, Segments &shortest);
};

#endif