File: addr.cpp

package info (click to toggle)
kcachegrind 4%3A25.04.0-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 9,964 kB
  • sloc: cpp: 32,149; xml: 403; perl: 325; python: 235; sh: 8; makefile: 6
file content (82 lines) | stat: -rw-r--r-- 1,534 bytes parent folder | download | duplicates (2)
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/*
    This file is part of KCachegrind.

    SPDX-FileCopyrightText: 2002-2016 Josef Weidendorfer <Josef.Weidendorfer@gmx.de>

    SPDX-License-Identifier: GPL-2.0-only
*/

#include "addr.h"

//---------------------------------------------------
// Addr

bool Addr::set(FixString& s)
{
    return s.stripUInt64(_v);
}

int Addr::set(const char *s)
{
    int n = 0;
    _v = 0;

    while((n<16) && *s) {
        if ((*s>='0') && (*s<='9'))
            _v = 16*_v + (*s-'0');
        else if ((*s>='a') && (*s<='f'))
            _v = 16*_v + 10 + (*s-'a');
        else if ((*s>='A') && (*s<='F'))
            _v = 16*_v + 10 + (*s-'A');
        else break;
        s++;
        n++;
    }

    return n;
}


QString Addr::toString() const
{
    if (_v == 0) return QStringLiteral("0");

    uint64 n = _v;
    QString hex;
    hex.reserve(16);

    while(n>0) {
        int d = (n & 15);
        hex = QChar((d<10) ? ('0'+d) : ('A'-10+d)) + hex;
        n /= 16;
    }

    return hex;
}

QString Addr::pretty() const
{
    if (_v == 0) return QStringLiteral("0");

    uint64 n = _v;
    int p = 0;
    QString hex;
    hex.reserve(20);

    while(n>0) {
        int d = (n & 15);
        if ((p>0) && ((p%4)==0)) hex = ' ' + hex;
        hex = QChar((d<10) ? ('0'+d) : ('A'-10+d)) + hex;
        n /= 16;
        p++;
    }

    return hex;
}

bool Addr::isInRange(Addr a, int distance)
{
    uint64 diff = (a._v > _v) ? (a._v - _v) : (_v - a._v);
    uint64 dist = (distance<0) ? distance : -distance;
    return (diff < dist);
}