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>
14 extern char *malloc();
19 register struct save_queue *sq;
21 sq = (struct save_queue *)malloc(sizeof (struct save_queue));
28 sq_save_data(sq, data)
29 register struct save_queue *sq;
32 register struct save_queue *q;
34 q = (struct save_queue *)malloc(sizeof (struct save_queue));
36 q->q_prev = sq->q_prev;
37 sq->q_prev->q_next = q;
42 sq_save_args(argc, argv, sq)
43 register struct save_queue *sq;
45 register char *argv[];
47 register char **argv_copy;
51 argv_copy = (char **)malloc(argc * sizeof (char *));
52 for (i = 0; i < argc; i++) {
53 n = strlen(argv[i]) + 1;
54 argv_copy[i] = (char *)malloc(n);
55 memcpy(argv_copy[i], argv[i], n);
58 sq_save_data(sq, (char *)argv_copy);
61 sq_save_unique_data(sq, data)
62 register struct save_queue *sq;
65 register struct save_queue *q;
67 for (q = sq->q_next; q != sq; q = q->q_next)
68 if (q->q_data == data) return;
70 sq_save_data(sq, data);
73 sq_save_unique_string(sq, data)
74 register struct save_queue *sq;
77 register struct save_queue *q;
79 for (q = sq->q_next; q != sq; q = q->q_next)
80 if (!strcmp(q->q_data, data)) return;
82 sq_save_data(sq, data);
86 register struct save_queue *sq;
89 if (sq->q_lastget == (struct save_queue *)0) {
90 sq->q_lastget = sq->q_next;
92 sq->q_lastget = sq->q_lastget->q_next;
95 if (sq->q_lastget == sq) return(0);
96 *data = sq->q_lastget->q_data;
100 sq_remove_data(sq, data)
101 register struct save_queue *sq;
102 register char **data;
104 if (sq->q_next != sq) {
105 *data = sq->q_next->q_data;
106 sq->q_next = sq->q_next->q_next;
107 free(sq->q_next->q_prev);
108 sq->q_next->q_prev = sq;
115 register struct save_queue *sq;
117 if (sq->q_next == sq)
124 register struct save_queue *sq;
126 register struct save_queue *q;
128 for (q = sq->q_next; q != sq; q = sq->q_next) {
129 sq->q_next = q->q_next;