/usr/include/dnscore/basic-priority-queue.h is in libyadifa-dev 2.1.6-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 | /*------------------------------------------------------------------------------
*
* Copyright (c) 2011-2016, EURid. All rights reserved.
* The YADIFA TM software product is provided under the BSD 3-clause license:
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of EURid nor the names of its contributors may be
* used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
*------------------------------------------------------------------------------
*
*/
/** @defgroup collections Generic collections functions
* @ingroup dnscore
* @brief A node-based single linked list
*
* A node-based single linked list
*
* @{
*/
/*----------------------------------------------------------------------------*/
#pragma once
/* ------------------------------------------------------------
*
* INCLUDES
*/
#include <dnscore/sys_types.h>
/* ------------------------------------------------------------
*
* STRUCTS
*/
/**
* Linked list for interface data
*
* (looks like a no-header no-sentinel single-linked list of strings)
*
*
* head : the base structure of the list
* item : the concept of what is being stored in the list
* node : holds the item
* data : the reference to the item (which can be called data because it's type-less)
*
*/
typedef struct bpqueue_node_s bpqueue_node_s;
struct bpqueue_node_s
{
struct bpqueue_node_s *next;
void *data;
u32 priority;
};
typedef struct bpqueue_s bpqueue_s;
struct bpqueue_s
{
bpqueue_node_s *first;
bpqueue_node_s *last;
u32 size;
};
#define EMPTY_BPQUEUE {NULL, NULL, 0}
/* ------------------------------------------------------------
*
* PROTOTYPES
*/
/**
* Initialises a list.
*
* @param list
*/
void bpqueue_init(bpqueue_s *list);
/**
* Adds an item at the head of the list.
*
* @param list
* @param data
*/
void bpqueue_enqueue(bpqueue_s *list, void *data, u32 priority);
/**
* Remove the first item from the list.
* Deletes the node but not the data.
* The data is returned.
*
* @param list
* @return the data or NULL if the list is empty
*/
void *bpqueue_dequeue(bpqueue_s *list);
/**
* Remove all items from the list.
* Deletes the nodes but not the data.
*
* @param list
*/
void bpqueue_clear(bpqueue_s *list);
/**
*
* Returns the size of the list
*
* @param list
* @return the size of the list
*/
static inline u32
bpqueue_size(const bpqueue_s *list)
{
return list->size;
}
|