linux-imx

/*

 * builtin-timechart.c - make an svg timechart of system activity

 *

 * (C) Copyright 2009 Intel Corporation

 *

 * Authors:

 *     Arjan van de Ven <arjan@linux.intel.com>

 *

 * This program 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

 * of the License.

 */

​

#include <errno.h>

#include <inttypes.h>

#include <traceevent/event-parse.h>

​

#include "builtin.h"

​

#include "util/util.h"

​

#include "util/color.h"

#include <linux/list.h>

#include "util/cache.h"

#include "util/evlist.h"

#include "util/evsel.h"

#include <linux/kernel.h>

#include <linux/rbtree.h>

#include <linux/time64.h>

#include "util/symbol.h"

#include "util/thread.h"

#include "util/callchain.h"

​

#include "perf.h"

#include "util/header.h"

#include <subcmd/parse-options.h>

#include "util/parse-events.h"

#include "util/event.h"

#include "util/session.h"

#include "util/svghelper.h"

#include "util/tool.h"

#include "util/data.h"

#include "util/debug.h"

​

#ifdef LACKS_OPEN_MEMSTREAM_PROTOTYPE

FILE *open_memstream(char **ptr, size_t *sizeloc);

#endif

​

#define SUPPORT_OLD_POWER_EVENTS 1

#define PWR_EVENT_EXIT -1

​

struct per_pid;

struct power_event;

struct wake_event;

​

struct timechart {

    struct perf_tool    tool;

    struct per_pid      *all_data;

    struct power_event  *power_events;

    struct wake_event   *wake_events;

    int         proc_num;

    unsigned int        numcpus;

    u64         min_freq,   /* Lowest CPU frequency seen */

                max_freq,   /* Highest CPU frequency seen */

                turbo_frequency,

                first_time, last_time;

    bool            power_only,

                tasks_only,

                with_backtrace,

                topology;

    bool            force;

    /* IO related settings */

    bool            io_only,

                skip_eagain;

    u64         io_events;

    u64         min_time,

                merge_dist;

};

​

struct per_pidcomm;

struct cpu_sample;

struct io_sample;

​

/*

 * Datastructure layout:

 * We keep an list of "pid"s, matching the kernels notion of a task struct.

 * Each "pid" entry, has a list of "comm"s.

 *  this is because we want to track different programs different, while

 *  exec will reuse the original pid (by design).

 * Each comm has a list of samples that will be used to draw

 * final graph.