mirror of
https://github.com/Motorhead1991/qemu.git
synced 2025-08-11 03:24:58 -06:00
3ce3dd8ca9
We will want to be able to search the set of mappings. For this patch, the two users iterate the tree in order. Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
44 lines
737 B
C
44 lines
737 B
C
/*
|
|
* Utility functions to read our own memory map
|
|
*
|
|
* Copyright (c) 2020 Linaro Ltd
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later
|
|
*/
|
|
|
|
#ifndef SELFMAP_H
|
|
#define SELFMAP_H
|
|
|
|
#include "qemu/interval-tree.h"
|
|
|
|
typedef struct {
|
|
IntervalTreeNode itree;
|
|
|
|
/* flags */
|
|
bool is_read;
|
|
bool is_write;
|
|
bool is_exec;
|
|
bool is_priv;
|
|
|
|
uint64_t offset;
|
|
uint64_t inode;
|
|
const char *path;
|
|
char dev[];
|
|
} MapInfo;
|
|
|
|
/**
|
|
* read_self_maps:
|
|
*
|
|
* Read /proc/self/maps and return a tree of MapInfo structures.
|
|
*/
|
|
IntervalTreeRoot *read_self_maps(void);
|
|
|
|
/**
|
|
* free_self_maps:
|
|
* @info: an interval tree
|
|
*
|
|
* Free a tree of MapInfo structures.
|
|
*/
|
|
void free_self_maps(IntervalTreeRoot *root);
|
|
|
|
#endif /* SELFMAP_H */
|