This file is indexed.

/usr/include/publib/queue.h is in publib-dev 0.40-3.

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
/* Part of publib.

   Copyright (c) 1994-2006 Lars Wirzenius.  All rights reserved.

   Redistribution and use in source and binary forms, with or without
   modification, are permitted provided that the following conditions
   are met:

   1. Redistributions of source code must retain the above copyright
      notice, this list of conditions and the following disclaimer.

   2. 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.

   THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*/
/*
 * File:	queue.h
 * Purpose:	Declarations for Publib's queue abstract data type.
 * Description:	A queue is a list-like data structure where all additions
 *		are done at one end (the behind of the queue) all deletions at
 *		the other end (the front of the queue).  It is very similar
 *		to a queue in a large food store, except that no-one tries
 *		to get in the queue anywhere except at the behind.
 * Note:	This Publib module reserves all names beginning with
 *		``queue'' or ``Queue''.
 * Author:	Lars Wirzenius
 * Version:	"@(#)publib:$Id: queue.h,v 1.1.1.1 1996/01/18 15:44:03 liw Exp $"
 */


#ifndef __publib_queue_h_included
#define __publib_queue_h_included

#include <stddef.h>
typedef struct queue Queue;

Queue *queue_create(void);
void queue_destroy(Queue *);
void *queue_front(Queue *);
void *queue_remove(Queue *);
int queue_is_empty(Queue *);
int queue_add(Queue *, const void *, size_t);

#ifdef __publib__
	struct queue_node {
		void *queue_data;
		struct queue_node *queue_previous;
	};
	
	struct queue {
		struct queue_node *queue_front, *queue_behind;
	};
#endif

#endif