pc_event.cc revision 11793:ef606668d247
14484Sbinkertn@umich.edu/*
24484Sbinkertn@umich.edu * Copyright (c) 2002-2005 The Regents of The University of Michigan
34484Sbinkertn@umich.edu * All rights reserved.
44484Sbinkertn@umich.edu *
54484Sbinkertn@umich.edu * Redistribution and use in source and binary forms, with or without
64484Sbinkertn@umich.edu * modification, are permitted provided that the following conditions are
74484Sbinkertn@umich.edu * met: redistributions of source code must retain the above copyright
84484Sbinkertn@umich.edu * notice, this list of conditions and the following disclaimer;
94484Sbinkertn@umich.edu * redistributions in binary form must reproduce the above copyright
104484Sbinkertn@umich.edu * notice, this list of conditions and the following disclaimer in the
114484Sbinkertn@umich.edu * documentation and/or other materials provided with the distribution;
124484Sbinkertn@umich.edu * neither the name of the copyright holders nor the names of its
134484Sbinkertn@umich.edu * contributors may be used to endorse or promote products derived from
144484Sbinkertn@umich.edu * this software without specific prior written permission.
154484Sbinkertn@umich.edu *
164484Sbinkertn@umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
174484Sbinkertn@umich.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
184484Sbinkertn@umich.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
194484Sbinkertn@umich.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
204484Sbinkertn@umich.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
214484Sbinkertn@umich.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
224484Sbinkertn@umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
234484Sbinkertn@umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
244484Sbinkertn@umich.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
254484Sbinkertn@umich.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
264484Sbinkertn@umich.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
274484Sbinkertn@umich.edu *
284484Sbinkertn@umich.edu * Authors: Nathan Binkert
294484Sbinkertn@umich.edu *          Steve Reinhardt
304494Ssaidi@eecs.umich.edu */
314494Ssaidi@eecs.umich.edu
324494Ssaidi@eecs.umich.edu#include "cpu/pc_event.hh"
334484Sbinkertn@umich.edu
344484Sbinkertn@umich.edu#include <algorithm>
354484Sbinkertn@umich.edu#include <string>
364484Sbinkertn@umich.edu#include <utility>
374484Sbinkertn@umich.edu
384484Sbinkertn@umich.edu#include "base/debug.hh"
394484Sbinkertn@umich.edu#include "base/trace.hh"
404484Sbinkertn@umich.edu#include "cpu/base.hh"
414484Sbinkertn@umich.edu#include "cpu/thread_context.hh"
424484Sbinkertn@umich.edu#include "debug/PCEvent.hh"
434484Sbinkertn@umich.edu#include "sim/core.hh"
444484Sbinkertn@umich.edu#include "sim/system.hh"
454484Sbinkertn@umich.edu
464484Sbinkertn@umich.eduusing namespace std;
474484Sbinkertn@umich.edu
484484Sbinkertn@umich.eduPCEventQueue::PCEventQueue()
494484Sbinkertn@umich.edu{}
504484Sbinkertn@umich.edu
514484Sbinkertn@umich.eduPCEventQueue::~PCEventQueue()
524484Sbinkertn@umich.edu{}
534484Sbinkertn@umich.edu
544484Sbinkertn@umich.edubool
554484Sbinkertn@umich.eduPCEventQueue::remove(PCEvent *event)
564484Sbinkertn@umich.edu{
574484Sbinkertn@umich.edu    int removed = 0;
584484Sbinkertn@umich.edu    range_t range = equal_range(event);
594484Sbinkertn@umich.edu    iterator i = range.first;
604484Sbinkertn@umich.edu    while (i != range.second &&
614484Sbinkertn@umich.edu           i != pc_map.end()) {
624484Sbinkertn@umich.edu        if (*i == event) {
634484Sbinkertn@umich.edu            DPRINTF(PCEvent, "PC based event removed at %#x: %s\n",
644484Sbinkertn@umich.edu                    event->pc(), event->descr());
654484Sbinkertn@umich.edu            i = pc_map.erase(i);
664484Sbinkertn@umich.edu            ++removed;
674484Sbinkertn@umich.edu        } else {
684484Sbinkertn@umich.edu            i++;
694484Sbinkertn@umich.edu        }
704484Sbinkertn@umich.edu
714484Sbinkertn@umich.edu    }
724484Sbinkertn@umich.edu
734484Sbinkertn@umich.edu    return removed > 0;
744484Sbinkertn@umich.edu}
754484Sbinkertn@umich.edu
764484Sbinkertn@umich.edubool
774484Sbinkertn@umich.eduPCEventQueue::schedule(PCEvent *event)
784484Sbinkertn@umich.edu{
794484Sbinkertn@umich.edu    pc_map.push_back(event);
804484Sbinkertn@umich.edu    sort(pc_map.begin(), pc_map.end(), MapCompare());
814484Sbinkertn@umich.edu
824484Sbinkertn@umich.edu    DPRINTF(PCEvent, "PC based event scheduled for %#x: %s\n",
834484Sbinkertn@umich.edu            event->pc(), event->descr());
844484Sbinkertn@umich.edu
854484Sbinkertn@umich.edu    return true;
864484Sbinkertn@umich.edu}
874484Sbinkertn@umich.edu
884484Sbinkertn@umich.edubool
894484Sbinkertn@umich.eduPCEventQueue::doService(ThreadContext *tc)
904484Sbinkertn@umich.edu{
914484Sbinkertn@umich.edu    // This will fail to break on Alpha PALcode addresses, but that is
924484Sbinkertn@umich.edu    // a rare use case.
934484Sbinkertn@umich.edu    Addr pc = tc->instAddr();
944484Sbinkertn@umich.edu    int serviced = 0;
954484Sbinkertn@umich.edu    range_t range = equal_range(pc);
964484Sbinkertn@umich.edu    for (iterator i = range.first; i != range.second; ++i) {
974484Sbinkertn@umich.edu        // Make sure that the pc wasn't changed as the side effect of
984484Sbinkertn@umich.edu        // another event.  This for example, prevents two invocations
994484Sbinkertn@umich.edu        // of the SkipFuncEvent.  Maybe we should have separate PC
1004484Sbinkertn@umich.edu        // event queues for each processor?
1014484Sbinkertn@umich.edu        if (pc != tc->instAddr())
1024484Sbinkertn@umich.edu            continue;
1034484Sbinkertn@umich.edu
1044484Sbinkertn@umich.edu        DPRINTF(PCEvent, "PC based event serviced at %#x: %s\n",
1054484Sbinkertn@umich.edu                (*i)->pc(), (*i)->descr());
1064484Sbinkertn@umich.edu
1074484Sbinkertn@umich.edu        (*i)->process(tc);
1084484Sbinkertn@umich.edu        ++serviced;
1094484Sbinkertn@umich.edu    }
1104484Sbinkertn@umich.edu
1114484Sbinkertn@umich.edu    return serviced > 0;
1124484Sbinkertn@umich.edu}
1134484Sbinkertn@umich.edu
1144484Sbinkertn@umich.eduvoid
1154484Sbinkertn@umich.eduPCEventQueue::dump() const
1164484Sbinkertn@umich.edu{
1174484Sbinkertn@umich.edu    const_iterator i = pc_map.begin();
1184484Sbinkertn@umich.edu    const_iterator e = pc_map.end();
1194484Sbinkertn@umich.edu
1204484Sbinkertn@umich.edu    for (; i != e; ++i)
1214484Sbinkertn@umich.edu        cprintf("%d: event at %#x: %s\n", curTick(), (*i)->pc(),
1224484Sbinkertn@umich.edu                (*i)->descr());
1234484Sbinkertn@umich.edu}
1244484Sbinkertn@umich.edu
1254484Sbinkertn@umich.eduPCEventQueue::range_t
1264484Sbinkertn@umich.eduPCEventQueue::equal_range(Addr pc)
1274484Sbinkertn@umich.edu{
1284484Sbinkertn@umich.edu    return std::equal_range(pc_map.begin(), pc_map.end(), pc, MapCompare());
1294484Sbinkertn@umich.edu}
1304484Sbinkertn@umich.edu
1314484Sbinkertn@umich.eduBreakPCEvent::BreakPCEvent(PCEventQueue *q, const std::string &desc, Addr addr,
1324484Sbinkertn@umich.edu                           bool del)
1334484Sbinkertn@umich.edu    : PCEvent(q, desc, addr), remove(del)
1344484Sbinkertn@umich.edu{
1354484Sbinkertn@umich.edu}
1364484Sbinkertn@umich.edu
1374484Sbinkertn@umich.eduvoid
1384484Sbinkertn@umich.eduBreakPCEvent::process(ThreadContext *tc)
1394484Sbinkertn@umich.edu{
1404484Sbinkertn@umich.edu    StringWrap name(tc->getCpuPtr()->name() + ".break_event");
1414484Sbinkertn@umich.edu    DPRINTFN("break event %s triggered\n", descr());
1424484Sbinkertn@umich.edu    Debug::breakpoint();
1434484Sbinkertn@umich.edu    if (remove)
1444484Sbinkertn@umich.edu        delete this;
1454484Sbinkertn@umich.edu}
1464484Sbinkertn@umich.edu
1474484Sbinkertn@umich.eduvoid
1484484Sbinkertn@umich.edusched_break_pc_sys(System *sys, Addr addr)
1494484Sbinkertn@umich.edu{
1504484Sbinkertn@umich.edu    new BreakPCEvent(&sys->pcEventQueue, "debug break", addr, true);
1514484Sbinkertn@umich.edu}
1524484Sbinkertn@umich.edu
1534484Sbinkertn@umich.eduvoid
1544484Sbinkertn@umich.edusched_break_pc(Addr addr)
1554484Sbinkertn@umich.edu{
1564484Sbinkertn@umich.edu     for (vector<System *>::iterator sysi = System::systemList.begin();
1574484Sbinkertn@umich.edu          sysi != System::systemList.end(); ++sysi) {
1584484Sbinkertn@umich.edu         sched_break_pc_sys(*sysi, addr);
1594484Sbinkertn@umich.edu    }
1604484Sbinkertn@umich.edu
1614484Sbinkertn@umich.edu}
1624484Sbinkertn@umich.edu
1634484Sbinkertn@umich.eduPanicPCEvent::PanicPCEvent(PCEventQueue *q, const std::string &desc, Addr pc)
1644484Sbinkertn@umich.edu    : PCEvent(q, desc, pc)
1654484Sbinkertn@umich.edu{
1664484Sbinkertn@umich.edu}
1674484Sbinkertn@umich.edu
1684484Sbinkertn@umich.eduvoid
1694484Sbinkertn@umich.eduPanicPCEvent::process(ThreadContext *tc)
1704484Sbinkertn@umich.edu{
1714484Sbinkertn@umich.edu    StringWrap name(tc->getCpuPtr()->name() + ".panic_event");
1724484Sbinkertn@umich.edu    panic(descr());
1734484Sbinkertn@umich.edu}
1744484Sbinkertn@umich.edu