fca9606fc84a73273a4a3e54f96c9d8e0dedd98d
[gem5.git] / src / mem / packet_access.hh
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;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Authors: Ali Saidi
29 * Nathan Binkert
30 */
31
32 #include "arch/isa_traits.hh"
33 #include "base/bigint.hh"
34 #include "config/the_isa.hh"
35 #include "mem/packet.hh"
36 #include "sim/byteswap.hh"
37
38 #ifndef __MEM_PACKET_ACCESS_HH__
39 #define __MEM_PACKET_ACCESS_HH__
40 // The memory system needs to have an endianness. This is the easiest
41 // way to deal with it for now. At some point, we will have to remove
42 // these functions and make the users do their own byte swapping since
43 // the memory system does not in fact have an endianness.
44
45 /** return the value of what is pointed to in the packet. */
46 template <typename T>
47 inline T
48 Packet::get()
49 {
50 assert(flags.isSet(STATIC_DATA|DYNAMIC_DATA));
51 assert(sizeof(T) <= size);
52 return TheISA::gtoh(*(T*)data);
53 }
54
55 /** set the value in the data pointer to v. */
56 template <typename T>
57 inline void
58 Packet::set(T v)
59 {
60 assert(flags.isSet(STATIC_DATA|DYNAMIC_DATA));
61 assert(sizeof(T) <= size);
62 *(T*)data = TheISA::htog(v);
63 }
64
65 #endif //__MEM_PACKET_ACCESS_HH__