62 	struct qentry *item;  in enqueue()  local
64 	item = grep_malloc(sizeof(struct qentry));  in enqueue()
65 	item->data.dat = grep_malloc(sizeof(char) * x->len);  in enqueue()
66 	item->data.len = x->len;  in enqueue()
67 	item->data.line_no = x->line_no;  in enqueue()
68 	item->data.off = x->off;  in enqueue()
69 	memcpy(item->data.dat, x->dat, x->len);  in enqueue()
70 	item->data.file = x->file;  in enqueue()
72 	STAILQ_INSERT_TAIL(&queue, item, list);  in enqueue()
75 		item = dequeue();  in enqueue()
76 		free(item->data.dat);  in enqueue()
77 		free(item);  in enqueue()
84 	struct qentry *item;  in dequeue()  local
86 	item = STAILQ_FIRST(&queue);  in dequeue()
87 	if (item == NULL)  in dequeue()
92 	return (item);  in dequeue()
98 	struct qentry *item;  in printqueue()  local
100 	while ((item = dequeue()) != NULL) {  in printqueue()
101 		printline(&item->data, '-', NULL, 0);  in printqueue()
102 		free(item->data.dat);  in printqueue()
103 		free(item);  in printqueue()
110 	struct qentry *item;  in clearqueue()  local
112 	while ((item = dequeue()) != NULL) {  in clearqueue()
113 		free(item->data.dat);  in clearqueue()
114 		free(item);  in clearqueue()