forked from luck/tmp_suning_uos_patched
2025cf9e19
Based on 1 normalized pattern(s): this program is free software you can redistribute it and or modify it under the terms and conditions of the gnu general public license version 2 as published by the free software foundation this program is distributed in the hope 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 extracted by the scancode license scanner the SPDX license identifier GPL-2.0-only has been chosen to replace the boilerplate/reference in 263 file(s). Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Reviewed-by: Allison Randal <allison@lohutok.net> Reviewed-by: Alexios Zavras <alexios.zavras@intel.com> Cc: linux-spdx@vger.kernel.org Link: https://lkml.kernel.org/r/20190529141901.208660670@linutronix.de Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
69 lines
1.8 KiB
C
69 lines
1.8 KiB
C
/* SPDX-License-Identifier: GPL-2.0-only */
|
|
/*
|
|
* call-path.h: Manipulate a tree data structure containing function call paths
|
|
* Copyright (c) 2014, Intel Corporation.
|
|
*/
|
|
|
|
#ifndef __PERF_CALL_PATH_H
|
|
#define __PERF_CALL_PATH_H
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <linux/types.h>
|
|
#include <linux/rbtree.h>
|
|
|
|
/**
|
|
* struct call_path - node in list of calls leading to a function call.
|
|
* @parent: call path to the parent function call
|
|
* @sym: symbol of function called
|
|
* @ip: only if sym is null, the ip of the function
|
|
* @db_id: id used for db-export
|
|
* @in_kernel: whether function is a in the kernel
|
|
* @rb_node: node in parent's tree of called functions
|
|
* @children: tree of call paths of functions called
|
|
*
|
|
* In combination with the call_return structure, the call_path structure
|
|
* defines a context-sensitve call-graph.
|
|
*/
|
|
struct call_path {
|
|
struct call_path *parent;
|
|
struct symbol *sym;
|
|
u64 ip;
|
|
u64 db_id;
|
|
bool in_kernel;
|
|
struct rb_node rb_node;
|
|
struct rb_root children;
|
|
};
|
|
|
|
#define CALL_PATH_BLOCK_SHIFT 8
|
|
#define CALL_PATH_BLOCK_SIZE (1 << CALL_PATH_BLOCK_SHIFT)
|
|
#define CALL_PATH_BLOCK_MASK (CALL_PATH_BLOCK_SIZE - 1)
|
|
|
|
struct call_path_block {
|
|
struct call_path cp[CALL_PATH_BLOCK_SIZE];
|
|
struct list_head node;
|
|
};
|
|
|
|
/**
|
|
* struct call_path_root - root of all call paths.
|
|
* @call_path: root call path
|
|
* @blocks: list of blocks to store call paths
|
|
* @next: next free space
|
|
* @sz: number of spaces
|
|
*/
|
|
struct call_path_root {
|
|
struct call_path call_path;
|
|
struct list_head blocks;
|
|
size_t next;
|
|
size_t sz;
|
|
};
|
|
|
|
struct call_path_root *call_path_root__new(void);
|
|
void call_path_root__free(struct call_path_root *cpr);
|
|
|
|
struct call_path *call_path__findnew(struct call_path_root *cpr,
|
|
struct call_path *parent,
|
|
struct symbol *sym, u64 ip, u64 ks);
|
|
|
|
#endif
|