mirror of
https://github.com/radareorg/radare2.git
synced 2024-12-03 19:01:31 +00:00
88 lines
2.1 KiB
C
88 lines
2.1 KiB
C
#ifndef R_INTERVAL_H
|
|
#define R_INTERVAL_H
|
|
|
|
#include <r_types.h>
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
// An interval in 64-bit address space which is aware of address space wraparound
|
|
// Precondition: 0 <= size < 2**64 and addr + size <= 2**64
|
|
// range is [], [10, 5) => 10 <= x < (10 + 5)
|
|
typedef struct r_interval_t {
|
|
// public:
|
|
ut64 addr;
|
|
ut64 size;
|
|
} RInterval;
|
|
|
|
typedef RInterval r_itv_t;
|
|
|
|
static inline RInterval *r_itv_new(ut64 addr, ut64 size) {
|
|
RInterval *itv = R_NEW (RInterval);
|
|
if (itv) {
|
|
itv->addr = addr;
|
|
itv->size = size;
|
|
}
|
|
return itv;
|
|
}
|
|
|
|
static inline void r_itv_free(RInterval *itv) {
|
|
free (itv);
|
|
}
|
|
|
|
static inline ut64 r_itv_begin(RInterval itv) {
|
|
return itv.addr;
|
|
}
|
|
|
|
static inline ut64 r_itv_size(RInterval itv) {
|
|
return itv.size;
|
|
}
|
|
|
|
static inline ut64 r_itv_end(RInterval itv) {
|
|
return itv.addr + itv.size;
|
|
}
|
|
|
|
// Returns true if itv equals itv2
|
|
static inline bool r_itv_eq(RInterval itv, RInterval itv2) {
|
|
return itv.addr == itv2.addr && itv.size == itv2.size;
|
|
}
|
|
|
|
// Returns true if itv contained addr
|
|
static inline bool r_itv_contain(RInterval itv, ut64 addr) {
|
|
const ut64 end = itv.addr + itv.size;
|
|
return itv.addr <= addr && (!end || addr < end);
|
|
}
|
|
|
|
// Returns true if x is a subset of itv
|
|
static inline bool r_itv_include(RInterval itv, RInterval x) {
|
|
const ut64 end = itv.addr + itv.size;
|
|
return itv.addr <= x.addr && (!end || (x.addr + x.size && x.addr + x.size <= end));
|
|
}
|
|
|
|
// Returns true if itv and x overlap (implying they are non-empty)
|
|
static inline bool r_itv_overlap(RInterval itv, RInterval x) {
|
|
const ut64 end = itv.addr + itv.size, end1 = x.addr + x.size;
|
|
return (!end1 || itv.addr < end1) && (!end || x.addr < end);
|
|
}
|
|
|
|
static inline bool r_itv_overlap2(RInterval itv, ut64 addr, ut64 size) {
|
|
RInterval rai = {addr, size};
|
|
return r_itv_overlap (itv, rai);
|
|
}
|
|
|
|
// Precondition: itv and x overlap
|
|
// Returns the intersection of itv and x
|
|
static inline RInterval r_itv_intersect(RInterval itv, RInterval x) {
|
|
const ut64 addr = R_MAX (itv.addr, x.addr);
|
|
const ut64 end = R_MIN (itv.addr + itv.size - 1, x.addr + x.size - 1) + 1;
|
|
RInterval rai = {addr, end - addr};
|
|
return rai;
|
|
}
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif // R_INTERVAL_H
|