1/* 2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; --- 53 unchanged lines hidden (view full) --- 62} 63 64void 65printSorted(ostream& out, int num_of_sequencers, const AddressMap &record_map, 66 string description, Profiler *profiler) 67{ 68 const int records_printed = 100; 69 |
70 uint64 misses = 0; |
71 std::vector<const AccessTraceForAddress *> sorted; 72 73 AddressMap::const_iterator i = record_map.begin(); 74 AddressMap::const_iterator end = record_map.end(); 75 for (; i != end; ++i) { 76 const AccessTraceForAddress* record = &i->second; 77 misses += record->getTotal(); 78 sorted.push_back(record); --- 11 unchanged lines hidden (view full) --- 90 << endl; 91 92 Histogram remaining_records(1, 100); 93 Histogram all_records(1, 100); 94 Histogram remaining_records_log(-1); 95 Histogram all_records_log(-1); 96 97 // Allows us to track how many lines where touched by n processors |
98 std::vector 99 std::vector |
100 m_touched_vec.resize(num_of_sequencers+1); 101 m_touched_weighted_vec.resize(num_of_sequencers+1); 102 for (int j = 0; j < m_touched_vec.size(); j++) { 103 m_touched_vec[j] = 0; 104 m_touched_weighted_vec[j] = 0; 105 } 106 107 int counter = 0; --- 223 unchanged lines hidden --- |