Rename bt_ctf_X -> bt_X, maintain backward compat. for pre-2.0 CTF writer
[babeltrace.git] / include / babeltrace / graph / clock-class-priority-map-internal.h
CommitLineData
8c0b8894
PP
1#ifndef BABELTRACE_GRAPH_CLOCK_CLASS_PRIORITY_MAP_INTERNAL_H
2#define BABELTRACE_GRAPH_CLOCK_CLASS_PRIORITY_MAP_INTERNAL_H
3
4/*
5 * Copyright 2017 Philippe Proulx <pproulx@efficios.com>
6 *
7 * Permission is hereby granted, free of charge, to any person obtaining a copy
8 * of this software and associated documentation files (the "Software"), to deal
9 * in the Software without restriction, including without limitation the rights
10 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
11 * copies of the Software, and to permit persons to whom the Software is
12 * furnished to do so, subject to the following conditions:
13 *
14 * The above copyright notice and this permission notice shall be included in
15 * all copies or substantial portions of the Software.
16 *
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
20 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
23 * SOFTWARE.
24 *
25 * The Common Trace Format (CTF) Specification is available at
26 * http://www.efficios.com/ctf
27 */
28
29#include <stdint.h>
30#include <stddef.h>
fe650ea4 31#include <assert.h>
8c0b8894
PP
32#include <babeltrace/ctf-ir/clock-class.h>
33#include <babeltrace/object-internal.h>
c55a9f58 34#include <babeltrace/types.h>
8c0b8894
PP
35#include <glib.h>
36
37struct bt_clock_class_priority_map {
38 struct bt_object base;
39
50842bdc 40 /* Array of struct bt_clock_class *, owned by this */
8c0b8894
PP
41 GPtrArray *entries;
42
50842bdc 43 /* struct bt_clock_class * (weak) to priority (uint64_t *) */
8c0b8894
PP
44 GHashTable *prios;
45
46 /* Clock class (weak) with the currently highest priority */
50842bdc 47 struct bt_clock_class *highest_prio_cc;
fe650ea4 48
c55a9f58 49 bt_bool frozen;
8c0b8894
PP
50};
51
fe650ea4
PP
52static inline
53void bt_clock_class_priority_map_freeze(
54 struct bt_clock_class_priority_map *cc_prio_map)
55{
56 assert(cc_prio_map);
c55a9f58 57 cc_prio_map->frozen = BT_TRUE;
fe650ea4
PP
58}
59
8c0b8894 60#endif /* BABELTRACE_GRAPH_CLOCK_CLASS_PRIORITY_MAP_INTERNAL_H */
This page took 0.033168 seconds and 4 git commands to generate.