1/*
2 * Copyright (c) 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;
9 * redistributions in binary form must reproduce the above copyright

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

52 static const int Max_Conf = INT_MAX;
53 static const int Min_Conf = INT_MIN;
54
55 class StrideEntry
56 {
57 public:
58 Addr instAddr;
59 Addr missAddr;
60 int stride;
61 int confidence;
62 };
63
64 Addr *lastMissAddr[Max_Contexts];
65
66 std::list<StrideEntry*> table[Max_Contexts];
67
68 public:
69
70 StridePrefetcher(const Params *p)
71 : BasePrefetcher(p)
72 {
73 }
74
75 ~StridePrefetcher() {}
76
77 void calculatePrefetch(PacketPtr &pkt, std::list<Addr> &addresses,
78 std::list<Cycles> &delays);
79};
80
81#endif // __MEM_CACHE_PREFETCH_STRIDE_PREFETCHER_HH__