fd=%d error=%d merges=%d

// SPDX-License-Identifier: GPL-2.0-only /* * svghelper.c - helper functions for outputting svg * * (C) Copyright 2009 Intel Corporation * * Authors: * Arjan van de Ven */ #include #include #include #include #include #include #include #include #include #include #include #include "env.h" #include "svghelper.h" static u64 first_time, last_time; static u64 turbo_frequency, max_freq; #define SLOT_MULT 30.0 #define SLOT_HEIGHT 25.0 #define SLOT_HALF (SLOT_HEIGHT / 2) int svg_page_width = 1000; u64 svg_highlight; const char *svg_highlight_name; #define MIN_TEXT_SIZE 0.01 static u64 total_height; static FILE *svgfile; static double cpu2slot(int cpu) { return 2 * cpu + 1; } static int *topology_map; static double cpu2y(int cpu) { if (topology_map) return cpu2slot(topology_map[cpu]) * SLOT_MULT; else return cpu2slot(cpu) * SLOT_MULT; } static double time2pixels(u64 __time) { double X; X = 1.0 * svg_page_width * (__time - first_time) / (last_time - first_time); return X; } /* * Round text sizes so that the svg viewer only needs a discrete * number of renderings of the font */ static double round_text_size(double size) { int loop = 100; double target = 10.0; if (size >= 10.0) return size; while (loop--) { if (size >= target) return target; target = target / 2.0; } return size; } void open_svg(const char *filename, int cpus, int rows, u64 start, u64 end) { int new_width; svgfile = fopen(filename, "w"); if (!svgfile) { fprintf(stderr, "Cannot open %s for output\n", filename); return; } first_time = start; first_time = first_time / 100000000 * 100000000; last_time = end; /* * if the recording is short, we default to a width of 1000, but * for longer recordings we want at least 200 units of width per second */ new_width = (last_time - first_time) / 5000000; if (new_width > svg_page_width) svg_page_width = new_width; total_height = (1 + rows + cpu2slot(cpus)) * SLOT_MULT; fprintf(svgfile, " \n"); fprintf(svgfile, "\n"); fprintf(svgfile, "\n"); fclose(svgfile); svgfile = NULL; } } #define cpumask_bits(maskp) ((maskp)->bits) typedef struct { DECLARE_BITMAP(bits, MAX_NR_CPUS); } cpumask_t; struct topology { cpumask_t *sib_core; int sib_core_nr; cpumask_t *sib_thr; int sib_thr_nr; }; static void scan_thread_topology(int *map, struct topology *t, int cpu, int *pos, int nr_cpus) { int i; int thr; for (i = 0; i < t->sib_thr_nr; i++) { if (!test_bit(cpu, cpumask_bits(&t->sib_thr[i]))) continue; for_each_set_bit(thr, cpumask_bits(&t->sib_thr[i]), nr_cpus) if (map[thr] == -1) map[thr] = (*pos)++; } } static void scan_core_topology(int *map, struct topology *t, int nr_cpus) { int pos = 0; int i; int cpu; for (i = 0; i < t->sib_core_nr; i++) for_each_set_bit(cpu, cpumask_bits(&t->sib_core[i]), nr_cpus) scan_thread_topology(map, t, cpu, &pos, nr_cpus); } static int str_to_bitmap(char *s, cpumask_t *b, int nr_cpus) { int i; int ret = 0; struct perf_cpu_map *m; struct perf_cpu c; m = perf_cpu_map__new(s); if (!m) return -1; for (i = 0; i < perf_cpu_map__nr(m); i++) { c = perf_cpu_map__cpu(m, i); if (c.cpu >= nr_cpus) { ret = -1; break; } set_bit(c.cpu, cpumask_bits(b)); } perf_cpu_map__put(m); return ret; } int svg_build_topology_map(struct perf_env *env) { int i, nr_cpus; struct topology t; char *sib_core, *sib_thr; nr_cpus = min(env->nr_cpus_online, MAX_NR_CPUS); t.sib_core_nr = env->nr_sibling_cores; t.sib_thr_nr = env->nr_sibling_threads; t.sib_core = calloc(env->nr_sibling_cores, sizeof(cpumask_t)); t.sib_thr = calloc(env->nr_sibling_threads, sizeof(cpumask_t)); sib_core = env->sibling_cores; sib_thr = env->sibling_threads; if (!t.sib_core || !t.sib_thr) { fprintf(stderr, "topology: no memory\n"); goto exit; } for (i = 0; i < env->nr_sibling_cores; i++) { if (str_to_bitmap(sib_core, &t.sib_core[i], nr_cpus)) { fprintf(stderr, "topology: can't parse siblings map\n"); goto exit; } sib_core += strlen(sib_core) + 1; } for (i = 0; i < env->nr_sibling_threads; i++) { if (str_to_bitmap(sib_thr, &t.sib_thr[i], nr_cpus)) { fprintf(stderr, "topology: can't parse siblings map\n"); goto exit; } sib_thr += strlen(sib_thr) + 1; } topology_map = malloc(sizeof(int) * nr_cpus); if (!topology_map) { fprintf(stderr, "topology: no memory\n"); goto exit; } for (i = 0; i < nr_cpus; i++) topology_map[i] = -1; scan_core_topology(topology_map, &t, nr_cpus); return 0; exit: zfree(&t.sib_core); zfree(&t.sib_thr); return -1; }