OpenCores
URL https://opencores.org/ocsvn/zipcpu/zipcpu/trunk

Subversion Repositories zipcpu

[/] [zipcpu/] [trunk/] [sim/] [verilator/] [pdump.cpp] - Diff between revs 204 and 209

Only display areas with differences | Details | Blame | View Log

Rev 204 Rev 209
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////
//
//
// Filename:    pdump.cpp
// Filename:    pdump.cpp
//
//
// Project:     Zip CPU -- a small, lightweight, RISC CPU core
// Project:     Zip CPU -- a small, lightweight, RISC CPU soft core
//
//
// Purpose:     Disassemble machine code files onto the stdout file.  Unlike
// Purpose:     Disassemble machine code files onto the stdout file.  Unlike
//              the zip-objdump program that is part of the binutils suite, this
//              the zip-objdump program that is part of the binutils suite, this
//      program takes the pfile.bin output of the bench test suite and adds
//      program takes the pfile.bin output of the bench test suite and adds
//      profiling information to the output.  It's useful for finding out where,
//      profiling information to the output.  It's useful for finding out where,
//      at least in simulation, your time is being spent.  It can also be used,
//      at least in simulation, your time is being spent.  It can also be used,
//      after the fact, to get a trace of what instructions the CPU executed.
//      after the fact, to get a trace of what instructions the CPU executed.
//
//
// Creator:     Dan Gisselquist, Ph.D.
// Creator:     Dan Gisselquist, Ph.D.
//              Gisselquist Technology, LLC
//              Gisselquist Technology, LLC
//
//
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////
//
//
// Copyright (C) 2015,2017, Gisselquist Technology, LLC
// Copyright (C) 2015,2017, Gisselquist Technology, LLC
//
//
// This program is free software (firmware): you can redistribute it and/or
// This program is free software (firmware): you can redistribute it and/or
// modify it under the terms of  the GNU General Public License as published
// modify it under the terms of  the GNU General Public License as published
// by the Free Software Foundation, either version 3 of the License, or (at
// by the Free Software Foundation, either version 3 of the License, or (at
// your option) any later version.
// your option) any later version.
//
//
// This program is distributed in the hope that it will be useful, but WITHOUT
// This program is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTIBILITY or
// ANY WARRANTY; without even the implied warranty of MERCHANTIBILITY or
// FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
// FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
// for more details.
// for more details.
//
//
// You should have received a copy of the GNU General Public License along
// You should have received a copy of the GNU General Public License along
// with this program.  (It's in the $(ROOT)/doc directory, run make with no
// with this program.  (It's in the $(ROOT)/doc directory.  Run make with no
// target there if the PDF file isn't present.)  If not, see
// target there if the PDF file isn't present.)  If not, see
// <http://www.gnu.org/licenses/> for a copy.
// <http://www.gnu.org/licenses/> for a copy.
//
//
// License:     GPL, v3, as defined and found on www.gnu.org,
// License:     GPL, v3, as defined and found on www.gnu.org,
//              http://www.gnu.org/licenses/gpl.html
//              http://www.gnu.org/licenses/gpl.html
//
//
//
//
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////
 
//
 
//
#include <algorithm>
#include <algorithm>
 
#include <map>
#include <stdio.h>
#include <stdio.h>
#include <unistd.h>
#include <unistd.h>
#include <ctype.h>
#include <ctype.h>
 
 
#include "zipelf.h"
#include "zipelf.h"
#include "zopcodes.h"
#include "zopcodes.h"
#include "byteswap.h"
#include "byteswap.h"
 
 
typedef uint32_t        ZIPI;   // A ZipCPU instruction word
typedef uint32_t        ZIPI;   // A ZipCPU instruction word
 
 
typedef struct  { unsigned clks, addr; } ALT;
typedef struct  { unsigned clks, addr; } ALT;
bool    altcmp(const ALT &a, const ALT &b) {
bool    altcmp(const ALT &a, const ALT &b) {
        return a.clks < b.clks;
        return a.clks < b.clks;
}
}
 
 
 
typedef struct { unsigned clks, hits, addr; } insn_stat;
 
 
 
typedef std::map<unsigned, insn_stat *> vcd_profile;
 
 
void    dump_file(const char *fn) {
void    dump_file(const char *fn) {
        const   int     NZIP = 4096;
        const   int     NZIP = 4096;
        char    lna[NZIP], lnb[NZIP];
        char    lna[NZIP], lnb[NZIP];
        FILE    *pf;
        FILE    *pf;
        unsigned        addr=0x0100000, mina = -1, maxa = 0,
        unsigned        addr=0x0100000;
                        *pfcnt = NULL, *pfclk = NULL;
        vcd_profile     vp;
 
 
        pf = fopen("pfile.bin","rb");
        pf = fopen("pfile.bin","rb");
        if (pf) {
        if (pf) {
                ALT     *pfalt;
                unsigned        buf[2];
                unsigned        buf[2], total_clks = 0;
 
                while(2 == fread(buf, sizeof(unsigned), 2, pf)) {
                while(2 == fread(buf, sizeof(unsigned), 2, pf)) {
                        if (mina > buf[0])
                        addr = buf[0];
                                mina = buf[0];
                        if (vp.count(addr)>0) {
                        if (maxa < buf[0])
                                vp[addr]->hits++;
                                maxa = buf[0];
                                vp[addr]->clks += buf[1];
 
                        } else {
 
                                insn_stat       *is;
 
 
 
                                is = new insn_stat;
 
                                is->hits = 1;
 
                                is->clks = buf[1];
 
                                is->addr = addr;
 
                                vp[addr] = is;
 
                        }
                }
                }
 
 
                addr = mina;
 
                pfcnt = new unsigned[(maxa+2-mina)];
 
                pfclk = new unsigned[(maxa+2-mina)];
 
                pfalt = new ALT[(maxa+2-mina)];
 
                unsigned ncnt = maxa+2-mina;
 
                for(int i=0; i<(int)ncnt; i++)
 
                        pfcnt[i] = pfclk[i] = 0;
 
                for(int i=0; i<(int)ncnt; i++)
 
                        pfalt[i].addr = pfalt[i].clks = 0;
 
 
 
                rewind(pf);
 
                while(2 == fread(buf, sizeof(unsigned), 2, pf)) {
 
                        pfcnt[buf[0]-addr]++;
 
                        pfclk[buf[0]-addr] += buf[1];
 
                        pfalt[buf[0]-addr].clks += buf[1];
 
                        pfalt[buf[0]-addr].addr = buf[0];
 
                        total_clks += buf[1];
 
 
 
                        printf("%08x\n", buf[0]);
 
                } fclose(pf);
 
 
 
                printf("%08x (%8d) total clocks\n", total_clks, total_clks);
 
 
 
                std::sort(&pfalt[0], &pfalt[ncnt], altcmp);
 
 
 
                for(int i=0; i<(int)ncnt; i++)
 
                        printf("%08x: %8d\n", pfalt[i].addr, pfalt[i].clks);
 
        }
        }
 
 
        printf("%s:\n", fn);
        printf("%s:\n", fn);
        if (iself(fn)) {
        if (iself(fn)) {
                ELFSECTION **secpp=NULL, *secp;
                ELFSECTION **secpp=NULL, *secp;
 
                double          cpi;
                unsigned entry;
                unsigned entry;
 
 
                elfread(fn, entry, secpp);
                elfread(fn, entry, secpp);
                for(int i=0; secpp[i]->m_len; i++) {
                for(int i=0; secpp[i]->m_len; i++) {
                        secp = secpp[i];
                        secp = secpp[i];
                        for(unsigned j=0; j<secp->m_len; j+=4) {
                        for(unsigned j=0; j<secp->m_len; j+=4) {
                                uint32_t        w, a;
                                uint32_t        w, a;
 
 
                                a = secp->m_start+(j<<2);
                                a = secp->m_vaddr+j;
                                w = buildword((const unsigned char *)&secp->m_data[(j<<2)]);
                                w = buildword((const unsigned char *)&secp->m_data[j]);
                                zipi_to_double_string(a, w, lna, lnb);
                                zipi_to_double_string(a, w, lna, lnb);
                                // printf("%s\n", ln);
                                // printf("%s\n", ln);
                                printf("%08x[%08x-%08x]: (0x%08x %c%c%c%c) ",
                                printf("%08x: (0x%08x %c%c%c%c) ", a, w,
                                        a, maxa, mina, w,
 
                                        isgraph((w>>24)&0x0ff)?((w>>24)&0x0ff) : '.',
                                        isgraph((w>>24)&0x0ff)?((w>>24)&0x0ff) : '.',
                                        isgraph((w>>16)&0x0ff)?((w>>16)&0x0ff) : '.',
                                        isgraph((w>>16)&0x0ff)?((w>>16)&0x0ff) : '.',
                                        isgraph((w>> 8)&0x0ff)?((w>> 8)&0x0ff) : '.',
                                        isgraph((w>> 8)&0x0ff)?((w>> 8)&0x0ff) : '.',
                                        isgraph((w    )&0x0ff)?((w    )&0x0ff) : '.'
                                        isgraph((w    )&0x0ff)?((w    )&0x0ff) : '.'
                                        );
                                        );
                                if ((a>=mina)&&(a<maxa)&&(pfcnt))
                                if (vp.count(a)>0) {
                                        printf("%8d %8d ", pfcnt[a-mina], pfclk[a-mina]);
                                        insn_stat *is = vp[a];
 
                                        cpi = is->clks / (double)is->hits;
 
 
 
                                        printf("%8d %8d %4.1f ", is->hits, is->clks, cpi);
 
                                } else
 
                                        printf("%23s", "");
 
 
                                printf("%s\n", lna);
                                printf("%s\n", lna);
                                if (lnb[0])
                                if (lnb[0])
                                        printf("-%24s%s\n", "", lnb);
                                        printf("-%50s%s\n", "", lnb);
                        }
                        }
                }
                }
        }
        }
}
}
 
 
int main(int argc, char **argv) {
int main(int argc, char **argv) {
        if (argc <= 1)
        if (argc <= 1)
                printf("USAGE: pdump <dump-file> | less\n");
                printf("USAGE: pdump <dump-file> | less\n");
        for(int argn=1; argn<argc; argn++) {
        for(int argn=1; argn<argc; argn++) {
                if(access(argv[argn], R_OK)==0)
                if(access(argv[argn], R_OK)==0)
                        dump_file(argv[argn]);
                        dump_file(argv[argn]);
        }
        }
 
 
        return 0;
        return 0;
}
}
 
 
 
 

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.