projects / babeltrace.git / blame
| Commit | Line | Data |
|---|---|---|
| 811644b8 PP |
1 | /* |
| 2 | * The MIT License (MIT) | |
| 3 | * | |
| 4 | * Copyright (c) 2017 Philippe Proulx <pproulx@efficios.com> | |
| 5 | * | |
| 6 | * Permission is hereby granted, free of charge, to any person obtaining a copy | |
| 7 | * of this software and associated documentation files (the "Software"), to deal | |
| 8 | * in the Software without restriction, including without limitation the rights | |
| 9 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
| 10 | * copies of the Software, and to permit persons to whom the Software is | |
| 11 | * furnished to do so, subject to the following conditions: | |
| 12 | * | |
| 13 | * The above copyright notice and this permission notice shall be included in | |
| 14 | * all copies or substantial portions of the Software. | |
| 15 | * | |
| 16 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | |
| 17 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | |
| 18 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | |
| 19 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | |
| 20 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | |
| 21 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN | |
| 22 | * THE SOFTWARE. | |
| 23 | */ | |
| 24 | ||
| 25 | %{ | |
| 26 | #include <babeltrace/graph/clock-class-priority-map.h> | |
| 27 | %} | |
| 28 | ||
| 29 | /* Type */ | |
| 30 | struct bt_clock_class_priority_map; | |
| 31 | ||
| 32 | /* Functions */ | |
| 33 | struct bt_clock_class_priority_map *bt_clock_class_priority_map_create(); | |
| 34 | int64_t bt_clock_class_priority_map_get_clock_class_count( | |
| 35 | struct bt_clock_class_priority_map *clock_class_priority_map); | |
| 36 | struct bt_ctf_clock_class * | |
| 37 | bt_clock_class_priority_map_get_clock_class_by_index( | |
| 38 | struct bt_clock_class_priority_map *clock_class_priority_map, | |
| 39 | uint64_t index); | |
| 40 | struct bt_ctf_clock_class * | |
| 41 | bt_clock_class_priority_map_get_clock_class_by_name( | |
| 42 | struct bt_clock_class_priority_map *clock_class_priority_map, | |
| 43 | const char *name); | |
| 44 | struct bt_ctf_clock_class * | |
| 45 | bt_clock_class_priority_map_get_highest_priority_clock_class( | |
| 46 | struct bt_clock_class_priority_map *clock_class_priority_map); | |
| 47 | int bt_clock_class_priority_map_get_clock_class_priority( | |
| 48 | struct bt_clock_class_priority_map *clock_class_priority_map, | |
| 49 | struct bt_ctf_clock_class *clock_class, uint64_t *OUTPUTINIT); | |
| 50 | int bt_clock_class_priority_map_add_clock_class( | |
| 51 | struct bt_clock_class_priority_map *clock_class_priority_map, | |
| 52 | struct bt_ctf_clock_class *clock_class, uint64_t priority); | |
| 53 | struct bt_clock_class_priority_map *bt_clock_class_priority_map_copy( | |
| 54 | struct bt_clock_class_priority_map *clock_class_priority_map); |