projects
/
babeltrace.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
lib: make symbols in prio-head hidden
[babeltrace.git]
/
src
/
lib
/
prio-heap
/
prio-heap.h
diff --git
a/src/lib/prio-heap/prio-heap.h
b/src/lib/prio-heap/prio-heap.h
index bbf1b3bfe0c13e01c1e76e0d3bdc77819fc89016..59fddb84ace25cfd0943b970e8d25c68245d2397 100644
(file)
--- a/
src/lib/prio-heap/prio-heap.h
+++ b/
src/lib/prio-heap/prio-heap.h
@@
-65,6
+65,7
@@
static inline void *bt_heap_maximum(const struct ptr_heap *heap)
*
* Returns -ENOMEM if out of memory.
*/
*
* Returns -ENOMEM if out of memory.
*/
+BT_HIDDEN
extern int bt_heap_init(struct ptr_heap *heap,
size_t alloc_len,
int gt(void *a, void *b));
extern int bt_heap_init(struct ptr_heap *heap,
size_t alloc_len,
int gt(void *a, void *b));
@@
-73,6
+74,7
@@
extern int bt_heap_init(struct ptr_heap *heap,
* bt_heap_free - free the heap
* @heap: the heap to free
*/
* bt_heap_free - free the heap
* @heap: the heap to free
*/
+BT_HIDDEN
extern void bt_heap_free(struct ptr_heap *heap);
/**
extern void bt_heap_free(struct ptr_heap *heap);
/**
@@
-84,6
+86,7
@@
extern void bt_heap_free(struct ptr_heap *heap);
*
* Returns -ENOMEM if out of memory.
*/
*
* Returns -ENOMEM if out of memory.
*/
+BT_HIDDEN
extern int bt_heap_insert(struct ptr_heap *heap, void *p);
/**
extern int bt_heap_insert(struct ptr_heap *heap, void *p);
/**
@@
-93,6
+96,7
@@
extern int bt_heap_insert(struct ptr_heap *heap, void *p);
* Returns the largest element in the heap. It removes this element from the
* heap. Returns NULL if the heap is empty.
*/
* Returns the largest element in the heap. It removes this element from the
* heap. Returns NULL if the heap is empty.
*/
+BT_HIDDEN
extern void *bt_heap_remove(struct ptr_heap *heap);
/**
extern void *bt_heap_remove(struct ptr_heap *heap);
/**
@@
-104,6
+108,7
@@
extern void *bt_heap_remove(struct ptr_heap *heap);
* return NULL. This algorithm has a complexity of O(n), which is higher than
* O(log(n)) provided by the rest of this API.
*/
* return NULL. This algorithm has a complexity of O(n), which is higher than
* O(log(n)) provided by the rest of this API.
*/
+BT_HIDDEN
extern void *bt_heap_cherrypick(struct ptr_heap *heap, void *p);
/**
extern void *bt_heap_cherrypick(struct ptr_heap *heap, void *p);
/**
@@
-118,6
+123,7
@@
extern void *bt_heap_cherrypick(struct ptr_heap *heap, void *p);
* This is the equivalent of calling bt_heap_remove() and then bt_heap_insert(), but
* it only rebalances the heap once. It never allocates memory.
*/
* This is the equivalent of calling bt_heap_remove() and then bt_heap_insert(), but
* it only rebalances the heap once. It never allocates memory.
*/
+BT_HIDDEN
extern void *bt_heap_replace_max(struct ptr_heap *heap, void *p);
/**
extern void *bt_heap_replace_max(struct ptr_heap *heap, void *p);
/**
@@
-127,6
+133,7
@@
extern void *bt_heap_replace_max(struct ptr_heap *heap, void *p);
*
* Returns -ENOMEM if out of memory.
*/
*
* Returns -ENOMEM if out of memory.
*/
+BT_HIDDEN
extern int bt_heap_copy(struct ptr_heap *dst, struct ptr_heap *src);
#endif /* _BABELTRACE_PRIO_HEAP_H */
extern int bt_heap_copy(struct ptr_heap *dst, struct ptr_heap *src);
#endif /* _BABELTRACE_PRIO_HEAP_H */
This page took
0.023883 seconds
and
4
git commands to generate.