Gecko [ 122.154.134.11 ]

Name	Size	Permission
linux	[ DIR ]	drwxr-xr-x
transport	[ DIR ]	drwxr-xr-x
unwind	[ DIR ]	drwxr-xr-x
addr-map.c	498 B	-rw-r--r--
alloc.c	498 B	-rw-r--r--
arith.c	483 B	-rw-r--r--
common_probe_context.h	5.2 KB	-rw-r--r--
common_session_state.h	378 B	-rw-r--r--
compatdefs.h	2.72 KB	-rw-r--r--
copy.c	585 B	-rw-r--r--
debug.h	485 B	-rw-r--r--
io.c	508 B	-rw-r--r--
k_syms.h	182 B	-rw-r--r--
loc2c-runtime.h	8.69 KB	-rw-r--r--
map-gen.c	20.59 KB	-rw-r--r--
map-stat.c	3.58 KB	-rw-r--r--
map.c	13.2 KB	-rw-r--r--
map.h	5.45 KB	-rw-r--r--
mempool.c	2.55 KB	-rw-r--r--
namespaces.h	487 B	-rw-r--r--
pmap-gen.c	7.17 KB	-rw-r--r--
print.c	486 B	-rw-r--r--
print.h	680 B	-rw-r--r--
print_flush.c	4.3 KB	-rw-r--r--
probe_lock.h	498 B	-rw-r--r--
proc_fs_compatibility.h	2.22 KB	-rw-r--r--
procfs-probes.c	3.88 KB	-rw-r--r--
procfs.c	7.51 KB	-rw-r--r--
ptrace_compatibility.h	1.48 KB	-rw-r--r--
regs.c	3.78 KB	-rw-r--r--
regs.h	2 KB	-rw-r--r--
runtime.h	905 B	-rw-r--r--
runtime_context.h	669 B	-rw-r--r--
runtime_defines.h	3.5 KB	-rw-r--r--
stack-arm.c	1.65 KB	-rw-r--r--
stack-ia64.c	1.06 KB	-rw-r--r--
stack-s390.c	1.92 KB	-rw-r--r--
stack.c	17.69 KB	-rw-r--r--
stat-common.c	7.55 KB	-rw-r--r--
stat.c	5.27 KB	-rw-r--r--
stat.h	1.44 KB	-rw-r--r--
stp_helper_lock.h	3.16 KB	-rw-r--r--
stp_string.c	5 KB	-rw-r--r--
stp_string.h	2.17 KB	-rw-r--r--
stp_task_work.c	2.75 KB	-rw-r--r--
stp_utrace.c	76.06 KB	-rw-r--r--
stp_utrace.h	13.68 KB	-rw-r--r--
sym.c	34.44 KB	-rw-r--r--
sym.h	5.83 KB	-rw-r--r--
syscall.h	13.06 KB	-rw-r--r--
task_finder_vma.c	11.4 KB	-rw-r--r--
time.c	12.19 KB	-rw-r--r--
timer.c	481 B	-rw-r--r--
timer.h	482 B	-rw-r--r--
uidgid_compatibility.h	603 B	-rw-r--r--
unwind.c	46.04 KB	-rw-r--r--
utrace_compatibility.h	3.07 KB	-rw-r--r--
vma.c	8.76 KB	-rw-r--r--
vsprintf.c	22.66 KB	-rw-r--r--
vsprintf.h	1.47 KB	-rw-r--r--

Code Editor : map-stat.c

/* -*- linux-c -*- 
 * map functions to handle statistics
 * Copyright (C) 2005, 2012 Red Hat Inc.
 *
 * This file is part of systemtap, and is free software.  You can
 * redistribute it and/or modify it under the terms of the GNU General
 * Public License (GPL); either version 2, or (at your option) any
 * later version.
 */

/** @file map-stat.c
 * @brief Map functions to handle statistics.
 */

#include "stat-common.c"

static void _stp_map_print_histogram (MAP map, stat_data *sd)
{
	_stp_stat_print_histogram (&map->hist, sd);
}

static MAP _stp_map_new_hstat (unsigned max_entries, int wrap, int node_size)
{
	MAP m = _stp_map_new (max_entries, wrap, node_size, -1);
	if (m) {
		m->hist.type = HIST_NONE;
	}
	return m;
}

static MAP _stp_map_new_hstat_log (unsigned max_entries, int wrap, int node_size)
{
	MAP m;

/* the node already has stat_data, just add size for buckets */
	node_size += HIST_LOG_BUCKETS * sizeof(int64_t);
	m = _stp_map_new (max_entries, wrap, node_size, -1);
	if (m) {
		m->hist.type = HIST_LOG;
		m->hist.buckets = HIST_LOG_BUCKETS;
	}
	return m;
}

static MAP
_stp_map_new_hstat_linear (unsigned max_entries, int wrap, int node_size,
			   int start, int stop, int interval)
{
	MAP m;
	int buckets = _stp_stat_calc_buckets(stop, start, interval);
	if (!buckets)
		return NULL;

/* the node already has stat_data, just add size for buckets */
	node_size += buckets * sizeof(int64_t);

m = _stp_map_new (max_entries, wrap, node_size, -1);
	if (m) {
		m->hist.type = HIST_LINEAR;
		m->hist.start = start;
		m->hist.stop = stop;
		m->hist.interval = interval;
		m->hist.buckets = buckets;
	}
	return m;
}

static PMAP
_stp_pmap_new_hstat_linear (unsigned max_entries, int wrap, int node_size,
			    int start, int stop, int interval)
{
	PMAP pmap;
	int buckets = _stp_stat_calc_buckets(stop, start, interval);
	if (!buckets)
		return NULL;

/* the node already has stat_data, just add size for buckets */
	node_size += buckets * sizeof(int64_t);

pmap = _stp_pmap_new (max_entries, wrap, node_size);
	if (pmap) {
		int i;
		MAP m;

for_each_possible_cpu(i) {
			m = _stp_pmap_get_map (pmap, i);
			MAP_LOCK(m);
			m->hist.type = HIST_LINEAR;
			m->hist.start = start;
			m->hist.stop = stop;
			m->hist.interval = interval;
			m->hist.buckets = buckets;
			MAP_UNLOCK(m);
		}
		/* now set agg map params */
		m = _stp_pmap_get_agg(pmap);
		MAP_LOCK(m);
		m->hist.type = HIST_LINEAR;
		m->hist.start = start;
		m->hist.stop = stop;
		m->hist.interval = interval;
		m->hist.buckets = buckets;
		MAP_UNLOCK(m);
	}
	return pmap;
}

static PMAP
_stp_pmap_new_hstat_log (unsigned max_entries, int wrap, int node_size)
{
	PMAP pmap;

/* the node already has stat_data, just add size for buckets */
	node_size += HIST_LOG_BUCKETS * sizeof(int64_t);
	pmap = _stp_pmap_new (max_entries, wrap, node_size);
	if (pmap) {
		int i;
		MAP m;
		for_each_possible_cpu(i) {
			m = _stp_pmap_get_map (pmap, i);
			MAP_LOCK(m);
			m->hist.type = HIST_LOG;
			m->hist.buckets = HIST_LOG_BUCKETS;
			MAP_UNLOCK(m);
		}
		/* now set agg map params */
		m = _stp_pmap_get_agg(pmap);
		MAP_LOCK(m);
		m->hist.type = HIST_LOG;
		m->hist.buckets = HIST_LOG_BUCKETS;
		MAP_UNLOCK(m);
	}
	return pmap;
}

static PMAP
_stp_pmap_new_hstat (unsigned max_entries, int wrap, int node_size)
{
	PMAP pmap = _stp_pmap_new (max_entries, wrap, node_size);
	if (pmap) {
		int i;
		MAP m;
		for_each_possible_cpu(i) {
			m = _stp_pmap_get_map (pmap, i);
			MAP_LOCK(m);
			m->hist.type = HIST_NONE;
			MAP_UNLOCK(m);
		}
		/* now set agg map params */
		m = _stp_pmap_get_agg(pmap);
		MAP_LOCK(m);
		m->hist.type = HIST_NONE;
		MAP_UNLOCK(m);
	}
	return pmap;
}

${this.title}

Code Editor : map-stat.c