1/*
2 * Copyright (c) 2002-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;

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

58/** The request should not cause a page fault. */
59const unsigned NO_FAULT = 0x020;
60/** The request should be prefetched into the exclusive state. */
61const unsigned PF_EXCLUSIVE = 0x100;
62/** The request should be marked as LRU. */
63const unsigned EVICT_NEXT = 0x200;
64/** The request should ignore unaligned access faults */
65const unsigned NO_ALIGN_FAULT = 0x400;
66
67class Request
68{
69 private:
70 /**
71 * The physical address of the request. Valid only if validPaddr
72 * is set. */
73 Addr paddr;

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

223 int getThreadNum() { assert(validCpuAndThreadNums); return threadNum; }
224
225 /** Accessor function for pc.*/
226 Addr getPC() { assert(validPC); return pc; }
227
228 /** Accessor Function to Check Cacheability. */
229 bool isUncacheable() { return getFlags() & UNCACHEABLE; }
230
231 friend class Packet;
232};
233
234#endif // __MEM_REQUEST_HH__