types.hh revision 6712
12SN/A/* 21762SN/A * Copyright (c) 2003-2005 The Regents of The University of Michigan 32SN/A * All rights reserved. 42SN/A * 52SN/A * Redistribution and use in source and binary forms, with or without 62SN/A * modification, are permitted provided that the following conditions are 72SN/A * met: redistributions of source code must retain the above copyright 82SN/A * notice, this list of conditions and the following disclaimer; 92SN/A * redistributions in binary form must reproduce the above copyright 102SN/A * notice, this list of conditions and the following disclaimer in the 112SN/A * documentation and/or other materials provided with the distribution; 122SN/A * neither the name of the copyright holders nor the names of its 132SN/A * contributors may be used to endorse or promote products derived from 142SN/A * this software without specific prior written permission. 152SN/A * 162SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 172SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 182SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 192SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 202SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 212SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 222SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 232SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 242SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 252SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 262SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 272665SN/A * 282665SN/A * Authors: Nathan Binkert 292SN/A */ 302SN/A 312SN/A/** 322SN/A * @file 336214Snate@binkert.org * Defines global host-dependent types: 342SN/A * Counter, Tick, and (indirectly) {int,uint}{8,16,32,64}_t. 352SN/A */ 362SN/A 376214Snate@binkert.org#ifndef __BASE_TYPES_HH__ 386214Snate@binkert.org#define __BASE_TYPES_HH__ 392SN/A 402SN/A#include <inttypes.h> 412SN/A 422SN/A/** uint64_t constant */ 435543SN/A#define ULL(N) ((uint64_t)N##ULL) 442SN/A/** int64_t constant */ 455543SN/A#define LL(N) ((int64_t)N##LL) 462SN/A 472SN/A/** Statistics counter type. Not much excuse for not using a 64-bit 482SN/A * integer here, but if you're desperate and only run short 492SN/A * simulations you could make this 32 bits. 502SN/A */ 512SN/Atypedef int64_t Counter; 522SN/A 532SN/A/** 542SN/A * Clock cycle count type. 552SN/A * @note using an unsigned breaks the cache. 562SN/A */ 572SN/Atypedef int64_t Tick; 586712Snate@binkert.orgtypedef uint64_t UTick; 592SN/A 605600SN/Aconst Tick MaxTick = LL(0x7fffffffffffffff); 612667SN/A 622130SN/A/** 632130SN/A * Address type 642130SN/A * This will probably be moved somewhere else in the near future. 652130SN/A * This should be at least as big as the biggest address width in use 662130SN/A * in the system, which will probably be 64 bits. 672130SN/A */ 682130SN/Atypedef uint64_t Addr; 692130SN/A 702438SN/Aconst Addr MaxAddr = (Addr)-1; 712438SN/A 726221Snate@binkert.org/** 736221Snate@binkert.org * Thread index/ID type 746221Snate@binkert.org */ 756221Snate@binkert.orgtypedef int16_t ThreadID; 766221Snate@binkert.orgconst ThreadID InvalidThreadID = (ThreadID)-1; 776221Snate@binkert.org 786214Snate@binkert.org#endif // __BASE_TYPES_HH__ 79