| 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> |
| 31 | #include <babeltrace/assert-internal.h> |
| 32 | #include <babeltrace/ctf-ir/clock-class.h> |
| 33 | #include <babeltrace/object-internal.h> |
| 34 | #include <babeltrace/types.h> |
| 35 | #include <glib.h> |
| 36 | |
| 37 | struct bt_clock_class_priority_map { |
| 38 | struct bt_object base; |
| 39 | |
| 40 | /* Array of struct bt_clock_class *, owned by this */ |
| 41 | GPtrArray *entries; |
| 42 | |
| 43 | /* struct bt_clock_class * (weak) to priority (uint64_t *) */ |
| 44 | GHashTable *prios; |
| 45 | |
| 46 | /* Clock class (weak) with the currently highest priority */ |
| 47 | struct bt_clock_class *highest_prio_cc; |
| 48 | |
| 49 | bt_bool frozen; |
| 50 | }; |
| 51 | |
| 52 | static inline |
| 53 | void _bt_clock_class_priority_map_freeze( |
| 54 | struct bt_clock_class_priority_map *cc_prio_map) |
| 55 | { |
| 56 | BT_ASSERT(cc_prio_map); |
| 57 | cc_prio_map->frozen = BT_TRUE; |
| 58 | } |
| 59 | |
| 60 | #ifdef BT_DEV_MODE |
| 61 | # define bt_clock_class_priority_map_freeze _bt_clock_class_priority_map_freeze |
| 62 | #else |
| 63 | # define bt_clock_class_priority_map_freeze(_cc_prio_map) |
| 64 | #endif /* BT_DEV_MODE */ |
| 65 | |
| 66 | #endif /* BABELTRACE_GRAPH_CLOCK_CLASS_PRIORITY_MAP_INTERNAL_H */ |