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

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

51
52//Coherence Flags
53#define NACKED_LINE 1 << 0
54#define SATISFIED 1 << 1
55#define SHARED_LINE 1 << 2
56#define CACHE_LINE_FILL 1 << 3
57#define COMPRESSED 1 << 4
58#define NO_ALLOCATE 1 << 5
59
60//For statistics we need max number of commands, hard code it at
61//20 for now. @todo fix later
62#define NUM_MEM_CMDS 1 << 9
63
64/**
65 * A Packet is used to encapsulate a transfer between two objects in
66 * the memory system (e.g., the L1 and L2 cache). (In contrast, a

--- 308 unchanged lines hidden ---