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 "mem/packet.hh"
  35 #include "sim/byteswap.hh"
  36
  37 #ifndef __MEM_PACKET_ACCESS_HH__
  38 #define __MEM_PACKET_ACCESS_HH__
  39 // The memory system needs to have an endianness. This is the easiest
  40 // way to deal with it for now. At some point, we will have to remove
  41 // these functions and make the users do their own byte swapping since
  42 // the memory system does not in fact have an endianness.
  43
  44 /** return the value of what is pointed to in the packet. */
  45 template <typename T>
  46 inline T
  47 Packet::get()
  48 {
  49     assert(staticData || dynamicData);
  50     assert(sizeof(T) <= size);
  51     return TheISA::gtoh(*(T*)data);
  52 }
  53
  54 /** set the value in the data pointer to v. */
  55 template <typename T>
  56 inline void
  57 Packet::set(T v)
  58 {
  59     assert(sizeof(T) <= size);
  60     *(T*)data = TheISA::htog(v);
  61 }
  62
  63 #endif //__MEM_PACKET_ACCESS_HH__