/data/refman/pasoursint/CMSSW_5_3_1/src/FWCore/Services/src/ProfParse.cc

Go to the documentation of this file.

#include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stdexcept>
#include <string>
#include <vector>

#include <dlfcn.h>
#include <unistd.h>

#include "VertexTracker.h"

//#include "FWCore/Utilities/interface/Algorithms.h"

#if 0
extern "C" {
  // options:
#define DMGL_AUTO    (1 << 8)
  extern char* cplus_demangle(const char *mangled, int options);
}
#endif

// ----------------- Path tracker class ---------------------

struct PathTracker
{
  PathTracker(): id_(),total_() { }

  mutable unsigned int id_;
  mutable unsigned int total_;
  ULVec tree_;

  bool operator<(const PathTracker& a) const;
  void setID() const { id_=next_id_++; }
  void incTotal() const { ++total_; }

  static unsigned int next_id_;
};

unsigned int PathTracker::next_id_ = 0;

bool PathTracker::operator<(const PathTracker& a) const
{
  return tree_ < a.tree_;
}

std::ostream& operator<<(std::ostream& ost, const PathTracker& a)
{
  ost << a.id_ << " " << a.total_ << " ";
  ULVec::const_iterator i(a.tree_.begin()),e(a.tree_.end());
  while(i!=e) { ost << (unsigned int)*i << " "; ++i; }
  return ost;
}

// ------------------- utilities --------------------------

void verifyFile(std::ostream& ost, const std::string& name)
{
  if(!ost) {
      std::cerr << "cannot open output file " << name << std::endl;
      throw std::runtime_error("failed to open output file");
  }
}


// ------------- more utilities ----------------

static bool symSort(const VertexSet::const_iterator& a,
                    const VertexSet::const_iterator& b)
{
  return a->total_as_leaf_ < b->total_as_leaf_;
}

static bool idSort(const VertexSet::const_iterator& a,
                    const VertexSet::const_iterator& b)
{
  return a->id_ < b->id_;
}

static bool idComp(unsigned int id,
                    const VertexSet::const_iterator& b)
{
  return id < b->id_;
}

static bool pathSort(const PathSet::const_iterator& a,
                    const PathSet::const_iterator& b)
{
  return a->total_ < b->total_;
}

// ------------------ main routine --------------------

class Reader
{
 public:
  explicit Reader(int fd):fd_(fd) { }
  bool nextSample(VoidVec& vv);
 private:
  int fd_;
};

bool Reader::nextSample(VoidVec& vv)
{
  unsigned int cnt;
  int sz = read(fd_,&cnt,sizeof(unsigned int));

  if(sz<0) {
      perror("Reader::nextSample: read count");
      std::cerr << "could not read next sample from profile data\n";
      return false;
  }
  if(sz == 0) return false;
  if((unsigned)sz<sizeof(unsigned int)) {
      std::cerr << "Reader::nextSample: "
           << "could not read the correct amount of profile data\n";
      return false;
  }
  if(cnt > 1000) {
      std::cerr << "Reader::nextSample: stack length is nonsense " << cnt << "\n";
      return false;
  }
  
  vv.resize(cnt);
  void** pos = &vv[0];
  int byte_cnt = cnt*sizeof(void*);

  while((sz = read(fd_,pos,byte_cnt)) < byte_cnt) {
      if(sz < 0) {
          perror("Reader::nextSample: read stack");
          std::cerr << "could not read stack\n";
          return false;
      }
      byte_cnt -= sz;
      pos += sz;
  }
  return true;
}

std::string make_name(Dl_info const& info, void* where,
                      std::string const& prefix)
{
  std::string object_name;
  if (info.dli_fname == 0 || info.dli_fname[0] == 0x0) {
      std::ostringstream oss;
      oss << "no_object_" << where;
      return oss.str();
  }
  if (info.dli_saddr) return info.dli_sname;
  std::ostringstream oss;
  oss << prefix << where;
  return oss.str();
}

void writeProfileData(int fd, const std::string& prefix)
{
  std::string output_tree(prefix+"_paths");
  std::string output_names(prefix+"_names");
  std::string output_totals(prefix+"_totals");

  std::ofstream nost(output_names.c_str());
  std::ofstream tost(output_tree.c_str());
  std::ofstream sost(output_totals.c_str());

  verifyFile(nost,output_names);
  verifyFile(tost,output_tree);
  verifyFile(sost,output_totals);

  VertexSet symset;
  PathSet pathset;
  std::pair<VertexSet::iterator,bool> irc,prev_irc;
  std::pair<PathSet::iterator,bool> prc;

  VoidVec v;
  int len=0;
  int total=0;
  int total_failed=0;
  int total_missing=0;
  //  int failure_count=0;
  Sym last_none_entry;
  Sym last_good_entry;
  Reader r(fd);
  std::string unk("unknown_name");

  while (r.nextSample(v)) {
      PathTracker ptrack;
      ++total;
      len = v.size();
      if(len==0) continue; // should never happen!
      VoidVec::reverse_iterator c(v.rbegin()),e(v.rend());
      bool first_pass=true;

      while(c != e) {
          Sym::address_type value = reinterpret_cast<Sym::address_type>(*c);

          const Sym* entry = 0;
          Dl_info info;
          void* addr = static_cast<void*>(value);

          if(dladdr(addr,&info) != 0) {
              std::string name = make_name(info, addr, "unknown_");

              last_good_entry.name_    = name;
              last_good_entry.library_ = info.dli_fname;
              last_good_entry.id_      = 0;
              void* function_address = info.dli_saddr;

              // If we find the address of this function, we make  a
              // unique VertexTracker for that function. If not,  we
              // make a unique VertexTracker for this exact address.
              last_good_entry.addr_  =   
                function_address ? function_address : value;

              entry = &last_good_entry;
          } else { // dladdr has failed
              /*
                std::cerr << "sample " << total
                   << ": dladdr failed for address: " << *c
                   << std::endl;
              */
              ++total_failed;
              std::ostringstream oss;
              oss << "lookup_failure_" << addr;
              last_none_entry.name_    = oss.str();
              last_none_entry.library_ = "unknown";
              last_none_entry.id_      = Sym::next_id_++;
              last_none_entry.addr_    = value;

              entry = &last_none_entry;
          }

          irc = symset.insert(VertexTracker(*entry));
          if(irc.second) {
              irc.first->setID();
          }
          irc.first->incTotal();
          ptrack.tree_.push_back(irc.first->id_);

          if(!first_pass) ++prev_irc.first->edges_[irc.first->id_];
          else first_pass=false;

          prev_irc = irc;
          ++c;
      }

      irc.first->incLeaf();
      prc = pathset.insert(ptrack);
      if(prc.second) {
          prc.first->setID();
      }
      prc.first->incTotal();
  }  

  // ------------------ copy the vertices for sorting and searching ------

  int setsize = symset.size();
  int edgesize = 0;
  Viter vsyms;
  vsyms.reserve(setsize);

  //cout << "------ symset -----" << std::endl;
  VertexSet::const_iterator isym(symset.begin()),esym(symset.end());
  while(isym!=esym) {
      //cout << "     " << *isym << std::endl;
      vsyms.push_back(isym);
      ++isym;
  }

  // ------ calculate samples for parents and percentages in vertices ------

  //edm::sort_all(vsyms,idSort);
  std::sort(vsyms.begin(), vsyms.end(), idSort);
  //Viter::iterator Vib(vsyms.begin()),Vie(vsyms.end());
  //std::cout << "sorted table --------------" << std::endl;
  //while(Vib!=Vie) { std::cout << "    " << *(*Vib) << std::endl; ++Vib; }

  PathSet::const_iterator pat_it_beg(pathset.begin()),
    pat_it_end(pathset.end());

  while(pat_it_beg!=pat_it_end) {
      // get set of unique IDs from the path
      ULVec pathcopy(pat_it_beg->tree_);
      //edm::sort_all(pathcopy);
      std::sort(pathcopy.begin(), pathcopy.end());
      ULVec::iterator iter = unique(pathcopy.begin(),pathcopy.end());
      ULVec::iterator cop_beg(pathcopy.begin());
      //cout << "length of unique = " << distance(cop_beg,iter) << std::endl;
      while(cop_beg!=iter) {
          //cout << "  entry " << *cop_beg << std::endl;
          Viter::iterator sym_iter = upper_bound(vsyms.begin(),vsyms.end(),
                                                 *cop_beg,idComp);
          if(sym_iter==vsyms.begin()) {
              ++total_missing;
              /*
              std::cerr << "found a missing sym entry for address " << *cop_beg
                   << std::endl;
              */
          } else {
              --sym_iter;
              //cout << " symiter " << *(*sym_iter) << std::endl;
              (*sym_iter)->incPath(pat_it_beg->total_);
          }
          ++cop_beg;
      }

      ++pat_it_beg;
  }

  VertexSet::iterator ver_iter(symset.begin()),ver_iter_end(symset.end());
  float ftotal = (total != 0 ? (float)total : 1.0); // Avoids possible divide by zero.
  while(ver_iter != ver_iter_end) {
      ver_iter->percent_leaf_ = (float)ver_iter->total_as_leaf_ / ftotal;
      ver_iter->percent_path_ = (float)ver_iter->in_path_ / ftotal;
      ++ver_iter;
  }

  // -------------- write out the vertices ----------------


  //edm::sort_all(vsyms,symSort);
  std::sort(vsyms.begin(), vsyms.end(), symSort);
  Viter::reverse_iterator vvi(vsyms.rbegin()),vve(vsyms.rend());
  while(vvi != vve) {
      nost << *(*vvi) << "\n";
      ++vvi;
  }


  // --------------- write out the paths ------------------ 

  int pathsize = pathset.size();
  Piter vpaths;
  vpaths.reserve(pathsize);

  PathSet::const_iterator ipath(pathset.begin()),epath(pathset.end());
  while(ipath != epath) {
      vpaths.push_back(ipath);
      ++ipath;
  }

  //edm::sort_all(vpaths,pathSort);
  std::sort(vpaths.begin(),vpaths.end(),pathSort);

  Piter::reverse_iterator ppi(vpaths.rbegin()),ppe(vpaths.rend());
  while(ppi != ppe) {
      tost << *(*ppi) << "\n";
      ++ppi;
  }

  // ------------ totals --------------------
  sost << "total_samples " << total << "\n"
       << "total_functions " << setsize << "\n"
       << "total_paths " << pathsize << "\n"
       << "total_edges " << edgesize << std::endl
       << "total_failed_lookups " << total_failed << std::endl
       << "total_missing_sym_entries " << total_missing << std::endl;

}

extern "C" {
  void writeProfileDataC(int fd, const std::string& prefix)
  {
    writeProfileData(fd,prefix);
  }
}