File: addr.h

package info (click to toggle)
kcachegrind 4%3A20.12.0-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 8,012 kB
  • sloc: cpp: 28,864; perl: 325; xml: 310; python: 235; sh: 9; makefile: 6
file content (66 lines) | stat: -rw-r--r-- 2,202 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
/* This file is part of KCachegrind.
   Copyright (c) 2002-2016 Josef Weidendorfer <Josef.Weidendorfer@gmx.de>

   KCachegrind is free software; you can redistribute it and/or
   modify it under the terms of the GNU General Public
   License as published by the Free Software Foundation, version 2.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; see the file COPYING.  If not, write to
   the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
   Boston, MA 02110-1301, USA.
*/

#ifndef ADDR_H
#define ADDR_H

#include <QString>

#include "utils.h"

/**
 * Addresses are 64bit values like costs to be able
 * to always load profile data produced on 64bit
 * architectures.
 */
class Addr
{
public:
    Addr() { _v=0; }
    // no "explicit": we want implicit conversion
    Addr(uint64 v) { _v = v; }

    // Interprets char data at s as hex (without "0x" prefix)
    // and return number of interpreted chars.
    int set(const char *s);
    bool set(FixString& s);
    QString toString() const;
    // similar to toString(), but adds a space every 4 digits
    QString pretty() const;

    // returns true if this address is in [a-distance;a+distance]
    bool isInRange(Addr a, int distance);

    bool operator==(const Addr& a) const { return (_v == a._v); }
    bool operator!=(const Addr& a) const { return (_v != a._v); }
    bool operator>(const Addr& a) const { return _v > a._v; }
    bool operator>=(const Addr& a) const { return _v >= a._v; }
    bool operator<(const Addr& a) const { return _v < a._v; }
    bool operator<=(const Addr& a) const { return _v <= a._v; }

    Addr operator+(int d) const { return Addr(_v + d); }
    Addr operator-(int d) const { return Addr(_v - d); }

    // return decremented address until it is a multiple of <a>, a power of 2
    Addr alignedDown(int a) { return Addr(_v & ~( ((uint64)a) -1)); }

private:
    uint64 _v;
};

#endif // ADDR_H