RubySlicc_Util.hh revision 9507
16145Snate@binkert.org/* 26145Snate@binkert.org * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 36145Snate@binkert.org * All rights reserved. 46145Snate@binkert.org * 56145Snate@binkert.org * Redistribution and use in source and binary forms, with or without 66145Snate@binkert.org * modification, are permitted provided that the following conditions are 76145Snate@binkert.org * met: redistributions of source code must retain the above copyright 86145Snate@binkert.org * notice, this list of conditions and the following disclaimer; 96145Snate@binkert.org * redistributions in binary form must reproduce the above copyright 106145Snate@binkert.org * notice, this list of conditions and the following disclaimer in the 116145Snate@binkert.org * documentation and/or other materials provided with the distribution; 126145Snate@binkert.org * neither the name of the copyright holders nor the names of its 136145Snate@binkert.org * contributors may be used to endorse or promote products derived from 146145Snate@binkert.org * this software without specific prior written permission. 156145Snate@binkert.org * 166145Snate@binkert.org * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 176145Snate@binkert.org * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 186145Snate@binkert.org * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 196145Snate@binkert.org * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 206145Snate@binkert.org * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 216145Snate@binkert.org * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 226145Snate@binkert.org * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 236145Snate@binkert.org * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 246145Snate@binkert.org * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 256145Snate@binkert.org * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 266145Snate@binkert.org * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 276145Snate@binkert.org */ 286145Snate@binkert.org 296145Snate@binkert.org/* 307039Snate@binkert.org * These are the functions that exported to slicc from ruby. 316145Snate@binkert.org */ 326145Snate@binkert.org 337039Snate@binkert.org#ifndef __MEM_RUBY_SLICC_INTERFACE_RUBYSLICCUTIL_HH__ 347039Snate@binkert.org#define __MEM_RUBY_SLICC_INTERFACE_RUBYSLICCUTIL_HH__ 356145Snate@binkert.org 367832Snate@binkert.org#include <cassert> 377832Snate@binkert.org 389302Snilay@cs.wisc.edu#include "debug/RubySlicc.hh" 397039Snate@binkert.org#include "mem/ruby/common/Address.hh" 407039Snate@binkert.org#include "mem/ruby/slicc_interface/RubySlicc_ComponentMapping.hh" 419499Snilay@cs.wisc.edu#include "mem/packet.hh" 426145Snate@binkert.org 437039Snate@binkert.orginline int 447039Snate@binkert.orgrandom(int n) 456145Snate@binkert.org{ 466145Snate@binkert.org return random() % n; 476145Snate@binkert.org} 486145Snate@binkert.org 499507Snilay@cs.wisc.eduinline Cycles zero_time() { return Cycles(0); } 509499Snilay@cs.wisc.eduinline Cycles TimeToCycles(Time t) { return Cycles(t); } 519499Snilay@cs.wisc.edu 527039Snate@binkert.orginline NodeID 537039Snate@binkert.orgintToID(int nodenum) 546145Snate@binkert.org{ 557039Snate@binkert.org NodeID id = nodenum; 567039Snate@binkert.org return id; 576145Snate@binkert.org} 586145Snate@binkert.org 597039Snate@binkert.orginline int 607039Snate@binkert.orgIDToInt(NodeID id) 616145Snate@binkert.org{ 627039Snate@binkert.org int nodenum = id; 637039Snate@binkert.org return nodenum; 646145Snate@binkert.org} 656145Snate@binkert.org 666145Snate@binkert.org// Appends an offset to an address 677039Snate@binkert.orginline Address 687039Snate@binkert.orgsetOffset(Address addr, int offset) 696145Snate@binkert.org{ 707039Snate@binkert.org Address result = addr; 717039Snate@binkert.org result.setOffset(offset); 727039Snate@binkert.org return result; 736145Snate@binkert.org} 746145Snate@binkert.org 756145Snate@binkert.org// Makes an address into a line address 767039Snate@binkert.orginline Address 777039Snate@binkert.orgmakeLineAddress(Address addr) 786145Snate@binkert.org{ 797039Snate@binkert.org Address result = addr; 807039Snate@binkert.org result.makeLineAddress(); 817039Snate@binkert.org return result; 826145Snate@binkert.org} 836145Snate@binkert.org 847039Snate@binkert.orginline int 857039Snate@binkert.orgaddressOffset(Address addr) 866467Sdrh5@cs.wisc.edu{ 877039Snate@binkert.org return addr.getOffset(); 886467Sdrh5@cs.wisc.edu} 896467Sdrh5@cs.wisc.edu 908131SLisa.Hsu@amd.cominline int 918131SLisa.Hsu@amd.commod(int val, int mod) 928131SLisa.Hsu@amd.com{ 938131SLisa.Hsu@amd.com return val % mod; 948131SLisa.Hsu@amd.com} 958131SLisa.Hsu@amd.com 969466Snilay@cs.wisc.eduinline int max_tokens() 979466Snilay@cs.wisc.edu{ 989466Snilay@cs.wisc.edu return 1024; 999466Snilay@cs.wisc.edu} 1009466Snilay@cs.wisc.edu 1019302Snilay@cs.wisc.edu/** 1029302Snilay@cs.wisc.edu * This function accepts an address, a data block and a packet. If the address 1039302Snilay@cs.wisc.edu * range for the data block contains the address which the packet needs to 1049302Snilay@cs.wisc.edu * read, then the data from the data block is written to the packet. True is 1059302Snilay@cs.wisc.edu * returned if the data block was read, otherwise false is returned. 1069302Snilay@cs.wisc.edu */ 1079302Snilay@cs.wisc.eduinline bool 1089302Snilay@cs.wisc.edutestAndRead(Address addr, DataBlock& blk, Packet *pkt) 1099302Snilay@cs.wisc.edu{ 1109302Snilay@cs.wisc.edu Address pktLineAddr(pkt->getAddr()); 1119302Snilay@cs.wisc.edu pktLineAddr.makeLineAddress(); 1129302Snilay@cs.wisc.edu 1139302Snilay@cs.wisc.edu Address lineAddr = addr; 1149302Snilay@cs.wisc.edu lineAddr.makeLineAddress(); 1159302Snilay@cs.wisc.edu 1169302Snilay@cs.wisc.edu if (pktLineAddr == lineAddr) { 1179302Snilay@cs.wisc.edu uint8_t *data = pkt->getPtr<uint8_t>(true); 1189302Snilay@cs.wisc.edu unsigned int size_in_bytes = pkt->getSize(); 1199302Snilay@cs.wisc.edu unsigned startByte = pkt->getAddr() - lineAddr.getAddress(); 1209302Snilay@cs.wisc.edu 1219302Snilay@cs.wisc.edu for (unsigned i = 0; i < size_in_bytes; ++i) { 1229302Snilay@cs.wisc.edu data[i] = blk.getByte(i + startByte); 1239302Snilay@cs.wisc.edu } 1249302Snilay@cs.wisc.edu return true; 1259302Snilay@cs.wisc.edu } 1269302Snilay@cs.wisc.edu return false; 1279302Snilay@cs.wisc.edu} 1289302Snilay@cs.wisc.edu 1299302Snilay@cs.wisc.edu/** 1309302Snilay@cs.wisc.edu * This function accepts an address, a data block and a packet. If the address 1319302Snilay@cs.wisc.edu * range for the data block contains the address which the packet needs to 1329302Snilay@cs.wisc.edu * write, then the data from the packet is written to the data block. True is 1339302Snilay@cs.wisc.edu * returned if the data block was written, otherwise false is returned. 1349302Snilay@cs.wisc.edu */ 1359302Snilay@cs.wisc.eduinline bool 1369302Snilay@cs.wisc.edutestAndWrite(Address addr, DataBlock& blk, Packet *pkt) 1379302Snilay@cs.wisc.edu{ 1389302Snilay@cs.wisc.edu Address pktLineAddr(pkt->getAddr()); 1399302Snilay@cs.wisc.edu pktLineAddr.makeLineAddress(); 1409302Snilay@cs.wisc.edu 1419302Snilay@cs.wisc.edu Address lineAddr = addr; 1429302Snilay@cs.wisc.edu lineAddr.makeLineAddress(); 1439302Snilay@cs.wisc.edu 1449302Snilay@cs.wisc.edu if (pktLineAddr == lineAddr) { 1459302Snilay@cs.wisc.edu uint8_t *data = pkt->getPtr<uint8_t>(true); 1469302Snilay@cs.wisc.edu unsigned int size_in_bytes = pkt->getSize(); 1479302Snilay@cs.wisc.edu unsigned startByte = pkt->getAddr() - lineAddr.getAddress(); 1489302Snilay@cs.wisc.edu 1499302Snilay@cs.wisc.edu for (unsigned i = 0; i < size_in_bytes; ++i) { 1509302Snilay@cs.wisc.edu blk.setByte(i + startByte, data[i]); 1519302Snilay@cs.wisc.edu } 1529302Snilay@cs.wisc.edu return true; 1539302Snilay@cs.wisc.edu } 1549302Snilay@cs.wisc.edu return false; 1559302Snilay@cs.wisc.edu} 1569302Snilay@cs.wisc.edu 1577039Snate@binkert.org#endif // __MEM_RUBY_SLICC_INTERFACE_RUBYSLICCUTIL_HH__ 158