static_inst.cc (8229:78bf55f23338) static_inst.cc (8541:27aaee8ec7cc)
1/*
2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
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;

--- 22 unchanged lines hidden (view full) ---

31
32#include <iostream>
33
34#include "cpu/static_inst.hh"
35#include "sim/core.hh"
36
37StaticInstPtr StaticInst::nullStaticInstPtr;
38
1/*
2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
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;

--- 22 unchanged lines hidden (view full) ---

31
32#include <iostream>
33
34#include "cpu/static_inst.hh"
35#include "sim/core.hh"
36
37StaticInstPtr StaticInst::nullStaticInstPtr;
38
39// Define the decode cache hash map.
40StaticInst::DecodeCache StaticInst::decodeCache;
41StaticInst::AddrDecodeCache StaticInst::addrDecodeCache;
42StaticInst::cacheElement StaticInst::recentDecodes[2];
43
44using namespace std;
45
46StaticInst::~StaticInst()
47{
48 if (cachedDisassembly)
49 delete cachedDisassembly;
50}
51
39using namespace std;
40
41StaticInst::~StaticInst()
42{
43 if (cachedDisassembly)
44 delete cachedDisassembly;
45}
46
52void
53StaticInst::dumpDecodeCacheStats()
54{
55 cerr << "Decode hash table stats @ " << curTick() << ":" << endl;
56 cerr << "\tnum entries = " << decodeCache.size() << endl;
57 cerr << "\tnum buckets = " << decodeCache.bucket_count() << endl;
58 vector<int> hist(100, 0);
59 int max_hist = 0;
60 for (int i = 0; i < decodeCache.bucket_count(); ++i) {
61 int count = decodeCache.elems_in_bucket(i);
62 if (count > max_hist)
63 max_hist = count;
64 hist[count]++;
65 }
66 for (int i = 0; i <= max_hist; ++i) {
67 cerr << "\tbuckets of size " << i << " = " << hist[i] << endl;
68 }
69}
70
71bool
72StaticInst::hasBranchTarget(const TheISA::PCState &pc, ThreadContext *tc,
73 TheISA::PCState &tgt) const
74{
75 if (isDirectCtrl()) {
76 tgt = branchTarget(pc);
77 return true;
78 }

--- 40 unchanged lines hidden --- 		47bool
48StaticInst::hasBranchTarget(const TheISA::PCState &pc, ThreadContext *tc,
49 TheISA::PCState &tgt) const
50{
51 if (isDirectCtrl()) {
52 tgt = branchTarget(pc);
53 return true;
54 }

--- 40 unchanged lines hidden ---