base.cc revision 56
12330SN/A/* 22330SN/A * Copyright (c) 2003 The Regents of The University of Michigan 32330SN/A * All rights reserved. 42330SN/A * 52330SN/A * Redistribution and use in source and binary forms, with or without 62330SN/A * modification, are permitted provided that the following conditions are 72330SN/A * met: redistributions of source code must retain the above copyright 82330SN/A * notice, this list of conditions and the following disclaimer; 92330SN/A * redistributions in binary form must reproduce the above copyright 102330SN/A * notice, this list of conditions and the following disclaimer in the 112330SN/A * documentation and/or other materials provided with the distribution; 122330SN/A * neither the name of the copyright holders nor the names of its 132330SN/A * contributors may be used to endorse or promote products derived from 142330SN/A * this software without specific prior written permission. 152330SN/A * 162330SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 172330SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 182330SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 192330SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 202330SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 212330SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 222330SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 232330SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 242330SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 252330SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 262330SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 272689Sktlim@umich.edu */ 282689Sktlim@umich.edu 292330SN/A#include <string> 302292SN/A#include <sstream> 312292SN/A#include <iostream> 322292SN/A 332292SN/A#include "cpu/base_cpu.hh" 342980Sgblack@eecs.umich.edu#include "base/cprintf.hh" 352362SN/A#include "cpu/exec_context.hh" 362680Sktlim@umich.edu#include "base/misc.hh" 372292SN/A#include "sim/sim_events.hh" 382678Sktlim@umich.edu 392683Sktlim@umich.eduusing namespace std; 402678Sktlim@umich.edu 412683Sktlim@umich.eduvector<BaseCPU *> BaseCPU::cpuList; 422678Sktlim@umich.edu 432678Sktlim@umich.edu// This variable reflects the max number of threads in any CPU. Be 442292SN/A// careful to only use it once all the CPUs that you care about have 452292SN/A// been initialized 462292SN/Aint maxThreadsPerCPU = 1; 472292SN/A 482330SN/A#ifdef FULL_SYSTEM 492330SN/ABaseCPU::BaseCPU(const string &_name, int _number_of_threads, 502330SN/A Counter max_insts_any_thread, 512292SN/A Counter max_insts_all_threads, 522292SN/A System *_system, int num, Tick freq) 532862Sktlim@umich.edu : SimObject(_name), number(num), frequency(freq), 542862Sktlim@umich.edu number_of_threads(_number_of_threads), system(_system) 552330SN/A#else 562330SN/ABaseCPU::BaseCPU(const string &_name, int _number_of_threads, 572330SN/A Counter max_insts_any_thread, 582330SN/A Counter max_insts_all_threads) 592330SN/A : SimObject(_name), number_of_threads(_number_of_threads) 602330SN/A#endif 612292SN/A{ 622683Sktlim@umich.edu // add self to global list of CPUs 632683Sktlim@umich.edu cpuList.push_back(this); 642292SN/A 652683Sktlim@umich.edu if (number_of_threads > maxThreadsPerCPU) 662292SN/A maxThreadsPerCPU = number_of_threads; 672791Sktlim@umich.edu 682791Sktlim@umich.edu // allocate per-thread instruction-based event queues 692292SN/A comInsnEventQueue = new (EventQueue *)[number_of_threads]; 702683Sktlim@umich.edu for (int i = 0; i < number_of_threads; ++i) 712862Sktlim@umich.edu comInsnEventQueue[i] = new EventQueue("instruction-based event queue"); 722862Sktlim@umich.edu 732862Sktlim@umich.edu // 742862Sktlim@umich.edu // set up instruction-count-based termination events, if any 752683Sktlim@umich.edu // 762683Sktlim@umich.edu if (max_insts_any_thread != 0) 772683Sktlim@umich.edu for (int i = 0; i < number_of_threads; ++i) 782683Sktlim@umich.edu new SimExitEvent(comInsnEventQueue[i], max_insts_any_thread, 792683Sktlim@umich.edu "a thread reached the max instruction count"); 802683Sktlim@umich.edu 812683Sktlim@umich.edu if (max_insts_all_threads != 0) { 822683Sktlim@umich.edu // allocate & initialize shared downcounter: each event will 832683Sktlim@umich.edu // decrement this when triggered; simulation will terminate 842683Sktlim@umich.edu // when counter reaches 0 852683Sktlim@umich.edu int *counter = new int; 862683Sktlim@umich.edu *counter = number_of_threads; 872683Sktlim@umich.edu for (int i = 0; i < number_of_threads; ++i) 882683Sktlim@umich.edu new CountedExitEvent(comInsnEventQueue[i], 892683Sktlim@umich.edu "all threads reached the max instruction count", 902683Sktlim@umich.edu max_insts_all_threads, *counter); 912683Sktlim@umich.edu } 922683Sktlim@umich.edu 932683Sktlim@umich.edu#ifdef FULL_SYSTEM 942683Sktlim@umich.edu memset(interrupts, 0, sizeof(interrupts)); 952683Sktlim@umich.edu intstatus = 0; 962683Sktlim@umich.edu#endif 972683Sktlim@umich.edu} 982690Sktlim@umich.edu 992690Sktlim@umich.eduvoid 1002683Sktlim@umich.eduBaseCPU::regStats() 1012683Sktlim@umich.edu{ 1022690Sktlim@umich.edu int size = contexts.size(); 1032690Sktlim@umich.edu if (size > 1) { 1042683Sktlim@umich.edu for (int i = 0; i < size; ++i) { 1052683Sktlim@umich.edu stringstream namestr; 1062683Sktlim@umich.edu ccprintf(namestr, "%s.ctx%d", name(), i); 1072683Sktlim@umich.edu contexts[i]->regStats(namestr.str()); 1082683Sktlim@umich.edu } 1092683Sktlim@umich.edu } else if (size == 1) 1102683Sktlim@umich.edu contexts[0]->regStats(name()); 1112683Sktlim@umich.edu} 1122683Sktlim@umich.edu 1132683Sktlim@umich.edu#ifdef FULL_SYSTEM 1142678Sktlim@umich.eduvoid 1152292SN/ABaseCPU::post_interrupt(int int_num, int index) 1162683Sktlim@umich.edu{ 1172683Sktlim@umich.edu DPRINTF(Interrupt, "Interrupt %d:%d posted\n", int_num, index); 1182292SN/A 1192683Sktlim@umich.edu if (int_num < 0 || int_num >= NumInterruptLevels) 1202683Sktlim@umich.edu panic("int_num out of bounds\n"); 1212683Sktlim@umich.edu 1222683Sktlim@umich.edu if (index < 0 || index >= sizeof(uint8_t) * 8) 1232683Sktlim@umich.edu panic("int_num out of bounds\n"); 1242683Sktlim@umich.edu 1252683Sktlim@umich.edu AlphaISA::check_interrupts = 1; 1262683Sktlim@umich.edu interrupts[int_num] |= 1 << index; 1272683Sktlim@umich.edu intstatus |= (ULL(1) << int_num); 1282683Sktlim@umich.edu} 1292683Sktlim@umich.edu 1302683Sktlim@umich.eduvoid 1312683Sktlim@umich.eduBaseCPU::clear_interrupt(int int_num, int index) 1322683Sktlim@umich.edu{ 1332683Sktlim@umich.edu DPRINTF(Interrupt, "Interrupt %d:%d cleared\n", int_num, index); 1342683Sktlim@umich.edu 1352683Sktlim@umich.edu if (int_num < 0 || int_num >= NumInterruptLevels) 1362683Sktlim@umich.edu panic("int_num out of bounds\n"); 1372683Sktlim@umich.edu 1382683Sktlim@umich.edu if (index < 0 || index >= sizeof(uint8_t) * 8) 1392683Sktlim@umich.edu panic("int_num out of bounds\n"); 1402683Sktlim@umich.edu 1412683Sktlim@umich.edu interrupts[int_num] &= ~(1 << index); 1422683Sktlim@umich.edu if (interrupts[int_num] == 0) 1432683Sktlim@umich.edu intstatus &= ~(ULL(1) << int_num); 1442683Sktlim@umich.edu} 1452683Sktlim@umich.edu 1462683Sktlim@umich.eduvoid 1472683Sktlim@umich.eduBaseCPU::clear_interrupts() 1482683Sktlim@umich.edu{ 1492683Sktlim@umich.edu DPRINTF(Interrupt, "Interrupts all cleared\n"); 1502683Sktlim@umich.edu 1512683Sktlim@umich.edu memset(interrupts, 0, sizeof(interrupts)); 1522683Sktlim@umich.edu intstatus = 0; 1532683Sktlim@umich.edu} 1542683Sktlim@umich.edu 1552683Sktlim@umich.edu#endif // FULL_SYSTEM 1562683Sktlim@umich.edu 1572683Sktlim@umich.eduDEFINE_SIM_OBJECT_CLASS_NAME("BaseCPU", BaseCPU) 1582292SN/A