3 * Generic Queue Routines
5 * (c) Copyright 1988 by the Massachusetts Institute of Technology.
6 * For copying and distribution information, please see the file
10 #include <mit-copyright.h>
15 struct save_queue *sq_create(void)
17 struct save_queue *sq;
19 sq = malloc(sizeof(struct save_queue));
28 int sq_save_data(struct save_queue *sq, char *data)
32 q = malloc(sizeof(struct save_queue));
36 q->q_prev = sq->q_prev;
37 sq->q_prev->q_next = q;
43 int sq_save_args(int argc, char *argv[], struct save_queue *sq)
48 argv_copy = malloc(argc * sizeof(char *));
51 for (i = 0; i < argc; i++)
53 n = strlen(argv[i]) + 1;
54 argv_copy[i] = malloc(n);
57 for (i--; i >= 0; i--)
62 memcpy(argv_copy[i], argv[i], n);
65 return sq_save_data(sq, (char *)argv_copy);
68 int sq_save_unique_data(struct save_queue *sq, char *data)
72 for (q = sq->q_next; q != sq; q = q->q_next)
74 if (q->q_data == data)
78 return sq_save_data(sq, data);
81 int sq_save_unique_string(struct save_queue *sq, char *data)
85 for (q = sq->q_next; q != sq; q = q->q_next)
87 if (!strcmp(q->q_data, data))
91 return sq_save_data(sq, data);
94 int sq_get_data(struct save_queue *sq, char **data)
96 if (sq->q_lastget == (struct save_queue *)0)
97 sq->q_lastget = sq->q_next;
99 sq->q_lastget = sq->q_lastget->q_next;
101 if (sq->q_lastget == sq)
103 *data = sq->q_lastget->q_data;
107 int sq_remove_data(struct save_queue *sq, char **data)
109 if (sq->q_next != sq)
111 *data = sq->q_next->q_data;
112 sq->q_next = sq->q_next->q_next;
113 free(sq->q_next->q_prev);
114 sq->q_next->q_prev = sq;
120 int sq_empty(struct save_queue *sq)
122 if (sq->q_next == sq)
128 sq_destroy(struct save_queue *sq)
130 struct save_queue *q;
132 for (q = sq->q_next; q != sq; q = sq->q_next)
134 sq->q_next = q->q_next;