1 /* $NetBSD: queue.c,v 1.5 2011/08/31 16:24:57 plunky Exp $ */
5 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
7 * Copyright (c) 1999 James Howard and Dag-Erling Coïdan Smørgrav
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * A really poor man's queue. It does only what it has to and gets out of
34 * Dodge. It is used in place of <sys/queue.h> to get a better performance.
37 #include <sys/cdefs.h>
38 __FBSDID("$FreeBSD$");
40 #include <sys/param.h>
41 #include <sys/queue.h>
49 STAILQ_ENTRY(qentry) list;
53 static STAILQ_HEAD(, qentry) queue = STAILQ_HEAD_INITIALIZER(queue);
54 static long long count;
56 static struct qentry *dequeue(void);
59 * Enqueue another line; return true if we've dequeued a line as a result
62 enqueue(struct str *x)
66 item = grep_malloc(sizeof(struct qentry));
67 item->data.dat = grep_malloc(sizeof(char) * x->len);
68 item->data.len = x->len;
69 item->data.line_no = x->line_no;
70 item->data.boff = x->boff;
71 item->data.off = x->off;
72 memcpy(item->data.dat, x->dat, x->len);
73 item->data.file = x->file;
75 STAILQ_INSERT_TAIL(&queue, item, list);
77 if (++count > Bflag) {
86 static struct qentry *
91 item = STAILQ_FIRST(&queue);
95 STAILQ_REMOVE_HEAD(&queue, list);
105 while ((item = dequeue()) != NULL) {
106 grep_printline(&item->data, '-');
107 free(item->data.dat);
117 while ((item = dequeue()) != NULL) {
118 free(item->data.dat);