jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 1 | /* |
| 2 | * OpenGGSN - Gateway GPRS Support Node |
jjako | 0fe0df0 | 2004-09-17 11:30:40 +0000 | [diff] [blame] | 3 | * Copyright (C) 2002, 2003, 2004 Mondru AB. |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 4 | * |
| 5 | * The contents of this file may be used under the terms of the GNU |
| 6 | * General Public License Version 2, provided that the above copyright |
| 7 | * notice and this permission notice is included in all copies or |
| 8 | * substantial portions of the software. |
| 9 | * |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 10 | */ |
| 11 | |
| 12 | /* |
| 13 | * Queue.c |
| 14 | * Reliable delivery of signalling messages |
| 15 | */ |
| 16 | |
jjako | 0fe0df0 | 2004-09-17 11:30:40 +0000 | [diff] [blame] | 17 | #include <../config.h> |
| 18 | #ifdef HAVE_STDINT_H |
| 19 | #include <stdint.h> |
| 20 | #endif |
| 21 | |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 22 | #include <stdlib.h> |
| 23 | #include <stdio.h> |
| 24 | #include <sys/types.h> |
| 25 | #include <sys/time.h> |
| 26 | #include <netinet/in.h> |
| 27 | #include <string.h> |
| 28 | #include "pdp.h" |
| 29 | #include "gtp.h" |
| 30 | #include "queue.h" |
| 31 | |
Harald Welte | bb47c35 | 2011-11-02 13:30:37 +0100 | [diff] [blame^] | 32 | static int queue_print(struct queue_t *queue) |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 33 | { |
| 34 | int n; |
Harald Welte | e65c739 | 2011-11-02 13:12:53 +0100 | [diff] [blame] | 35 | printf("Queue: %p Next: %d First: %d Last: %d\n", queue, |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 36 | queue->next, queue->first, queue->last); |
| 37 | printf("# State seq next prev timeout retrans\n"); |
| 38 | for (n = 0; n < QUEUE_SIZE; n++) { |
| 39 | printf("%d %d %d %d %d %d %d\n", |
| 40 | n, |
| 41 | queue->qmsga[n].state, |
| 42 | queue->qmsga[n].seq, |
| 43 | queue->qmsga[n].next, |
| 44 | queue->qmsga[n].prev, |
| 45 | (int)queue->qmsga[n].timeout, queue->qmsga[n].retrans); |
| 46 | } |
| 47 | return 0; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 48 | } |
| 49 | |
Harald Welte | bb47c35 | 2011-11-02 13:30:37 +0100 | [diff] [blame^] | 50 | static int queue_seqhash(struct sockaddr_in *peer, uint16_t seq) |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 51 | { |
| 52 | /* With QUEUE_HASH_SIZE = 2^16 this describes all possible |
| 53 | seq values. Thus we have perfect hash for the request queue. |
| 54 | For the response queue we might have collisions, but not very |
| 55 | often. |
| 56 | For performance optimisation we should remove the modulus |
| 57 | operator, but this is only valid for QUEUE_HASH_SIZE = 2^16 */ |
| 58 | return seq % QUEUE_HASH_SIZE; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 59 | } |
| 60 | |
Harald Welte | bb47c35 | 2011-11-02 13:30:37 +0100 | [diff] [blame^] | 61 | static int queue_seqset(struct queue_t *queue, struct qmsg_t *qmsg, |
| 62 | struct sockaddr_in *peer, uint16_t seq) |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 63 | { |
| 64 | int hash = queue_seqhash(peer, seq); |
| 65 | struct qmsg_t *qmsg2; |
| 66 | struct qmsg_t *qmsg_prev = NULL; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 67 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 68 | if (QUEUE_DEBUG) |
| 69 | printf("Begin queue_seqset seq = %d\n", (int)seq); |
| 70 | if (QUEUE_DEBUG) |
| 71 | printf("SIZEOF PEER %d, *PEER %d\n", sizeof(peer), |
| 72 | sizeof(*peer)); |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 73 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 74 | qmsg->seq = seq; |
| 75 | memcpy(&qmsg->peer, peer, sizeof(*peer)); |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 76 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 77 | for (qmsg2 = queue->hashseq[hash]; qmsg2; qmsg2 = qmsg2->seqnext) |
| 78 | qmsg_prev = qmsg2; |
| 79 | if (!qmsg_prev) |
| 80 | queue->hashseq[hash] = qmsg; |
| 81 | else |
| 82 | qmsg_prev->seqnext = qmsg; |
| 83 | if (QUEUE_DEBUG) |
| 84 | printf("End queue_seqset\n"); |
| 85 | return 0; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 86 | } |
jjako | 08d331d | 2003-10-13 20:33:30 +0000 | [diff] [blame] | 87 | |
Harald Welte | bb47c35 | 2011-11-02 13:30:37 +0100 | [diff] [blame^] | 88 | static int queue_seqdel(struct queue_t *queue, struct qmsg_t *qmsg) |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 89 | { |
| 90 | int hash = queue_seqhash(&qmsg->peer, qmsg->seq); |
| 91 | struct qmsg_t *qmsg2; |
| 92 | struct qmsg_t *qmsg_prev = NULL; |
| 93 | if (QUEUE_DEBUG) |
| 94 | printf("Begin queue_seqdel seq = %d\n", (int)qmsg->seq); |
jjako | 08d331d | 2003-10-13 20:33:30 +0000 | [diff] [blame] | 95 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 96 | for (qmsg2 = queue->hashseq[hash]; qmsg2; qmsg2 = qmsg2->seqnext) { |
| 97 | if (qmsg == qmsg) { |
| 98 | if (!qmsg_prev) |
| 99 | queue->hashseq[hash] = qmsg2->seqnext; |
| 100 | else |
| 101 | qmsg_prev->seqnext = qmsg2->seqnext; |
| 102 | if (QUEUE_DEBUG) |
| 103 | printf("End queue_seqset: SEQ found\n"); |
| 104 | return 0; |
| 105 | } |
| 106 | qmsg_prev = qmsg2; |
| 107 | } |
| 108 | printf("End queue_seqset: SEQ not found\n"); |
| 109 | return EOF; /* End of linked list and not found */ |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 110 | } |
| 111 | |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 112 | /* Allocates and initialises new queue structure */ |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 113 | int queue_new(struct queue_t **queue) |
| 114 | { |
| 115 | if (QUEUE_DEBUG) |
| 116 | printf("queue_new\n"); |
| 117 | *queue = calloc(1, sizeof(struct queue_t)); |
| 118 | (*queue)->next = 0; |
| 119 | (*queue)->first = -1; |
| 120 | (*queue)->last = -1; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 121 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 122 | if (QUEUE_DEBUG) |
| 123 | queue_print(*queue); |
| 124 | if (*queue) |
| 125 | return 0; |
| 126 | else |
| 127 | return EOF; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 128 | } |
| 129 | |
| 130 | /* Deallocates queue structure */ |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 131 | int queue_free(struct queue_t *queue) |
| 132 | { |
| 133 | if (QUEUE_DEBUG) |
| 134 | printf("queue_free\n"); |
| 135 | if (QUEUE_DEBUG) |
| 136 | queue_print(queue); |
| 137 | free(queue); |
| 138 | return 0; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 139 | } |
| 140 | |
| 141 | int queue_newmsg(struct queue_t *queue, struct qmsg_t **qmsg, |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 142 | struct sockaddr_in *peer, uint16_t seq) |
| 143 | { |
| 144 | if (QUEUE_DEBUG) |
| 145 | printf("queue_newmsg %d\n", (int)seq); |
| 146 | if (queue->qmsga[queue->next].state == 1) { |
| 147 | return EOF; /* Queue is full */ |
| 148 | } else { |
| 149 | *qmsg = &queue->qmsga[queue->next]; |
| 150 | queue_seqset(queue, *qmsg, peer, seq); |
| 151 | (*qmsg)->state = 1; /* Space taken */ |
| 152 | (*qmsg)->this = queue->next; |
| 153 | (*qmsg)->next = -1; /* End of the queue */ |
| 154 | (*qmsg)->prev = queue->last; /* Link to the previous */ |
| 155 | if (queue->last != -1) |
| 156 | queue->qmsga[queue->last].next = queue->next; /* Link previous to us */ |
| 157 | queue->last = queue->next; /* End of queue */ |
| 158 | if (queue->first == -1) |
| 159 | queue->first = queue->next; |
| 160 | queue->next = (queue->next + 1) % QUEUE_SIZE; /* Increment */ |
| 161 | if (QUEUE_DEBUG) |
| 162 | queue_print(queue); |
| 163 | return 0; |
| 164 | } |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 165 | } |
| 166 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 167 | int queue_freemsg(struct queue_t *queue, struct qmsg_t *qmsg) |
| 168 | { |
| 169 | if (QUEUE_DEBUG) |
| 170 | printf("queue_freemsg\n"); |
| 171 | if (qmsg->state != 1) { |
| 172 | return EOF; /* Not in queue */ |
| 173 | } |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 174 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 175 | queue_seqdel(queue, qmsg); |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 176 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 177 | if (qmsg->next == -1) /* Are we the last in queue? */ |
| 178 | queue->last = qmsg->prev; |
| 179 | else |
| 180 | queue->qmsga[qmsg->next].prev = qmsg->prev; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 181 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 182 | if (qmsg->prev == -1) /* Are we the first in queue? */ |
| 183 | queue->first = qmsg->next; |
| 184 | else |
| 185 | queue->qmsga[qmsg->prev].next = qmsg->next; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 186 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 187 | memset(qmsg, 0, sizeof(struct qmsg_t)); /* Just to be safe */ |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 188 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 189 | if (QUEUE_DEBUG) |
| 190 | queue_print(queue); |
| 191 | |
| 192 | return 0; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 193 | } |
| 194 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 195 | int queue_back(struct queue_t *queue, struct qmsg_t *qmsg) |
| 196 | { |
| 197 | if (QUEUE_DEBUG) |
| 198 | printf("queue_back\n"); |
| 199 | if (qmsg->state != 1) { |
| 200 | return EOF; /* Not in queue */ |
| 201 | } |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 202 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 203 | /* Insert stuff to maintain hash table */ |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 204 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 205 | if (qmsg->next != -1) { /* Only swop if there are others */ |
| 206 | queue->qmsga[qmsg->next].prev = qmsg->prev; |
| 207 | queue->first = qmsg->next; |
| 208 | |
| 209 | qmsg->next = -1; |
| 210 | qmsg->prev = queue->last; |
| 211 | if (queue->last != -1) |
| 212 | queue->qmsga[queue->last].next = qmsg->this; |
| 213 | queue->last = qmsg->this; |
| 214 | } |
| 215 | if (QUEUE_DEBUG) |
| 216 | queue_print(queue); |
| 217 | return 0; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 218 | } |
| 219 | |
| 220 | /* Get the element with a particular sequence number */ |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 221 | int queue_getfirst(struct queue_t *queue, struct qmsg_t **qmsg) |
| 222 | { |
| 223 | /*printf("queue_getfirst\n"); */ |
| 224 | if (queue->first == -1) { |
| 225 | *qmsg = NULL; |
| 226 | return EOF; /* End of queue = queue is empty. */ |
| 227 | } |
| 228 | *qmsg = &queue->qmsga[queue->first]; |
| 229 | if (QUEUE_DEBUG) |
| 230 | queue_print(queue); |
| 231 | return 0; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 232 | } |
| 233 | |
| 234 | int queue_getseqx(struct queue_t *queue, struct qmsg_t **qmsg, |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 235 | struct sockaddr_in *peer, uint16_t seq) |
| 236 | { |
| 237 | int n; |
| 238 | if (QUEUE_DEBUG) |
| 239 | printf("queue_getseq, %d\n", (int)seq); |
| 240 | if (QUEUE_DEBUG) |
| 241 | queue_print(queue); |
| 242 | for (n = 0; n < QUEUE_SIZE; n++) { |
| 243 | if ((queue->qmsga[n].seq == seq) && |
| 244 | (!memcmp(&queue->qmsga[n].peer, peer, sizeof(*peer)))) { |
| 245 | *qmsg = &queue->qmsga[n]; |
| 246 | return 0; |
| 247 | } |
| 248 | } |
| 249 | return EOF; /* Not found */ |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 250 | } |
| 251 | |
| 252 | int queue_seqget(struct queue_t *queue, struct qmsg_t **qmsg, |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 253 | struct sockaddr_in *peer, uint16_t seq) |
| 254 | { |
| 255 | int hash = queue_seqhash(peer, seq); |
| 256 | struct qmsg_t *qmsg2; |
| 257 | if (QUEUE_DEBUG) |
| 258 | printf("Begin queue_seqget seq = %d\n", (int)seq); |
| 259 | for (qmsg2 = queue->hashseq[hash]; qmsg2; qmsg2 = qmsg2->seqnext) { |
| 260 | if ((qmsg2->seq == seq) && |
| 261 | (!memcmp(&qmsg2->peer, peer, sizeof(*peer)))) { |
| 262 | *qmsg = qmsg2; |
| 263 | if (QUEUE_DEBUG) |
| 264 | printf("End queue_seqget. Found\n"); |
| 265 | return 0; |
| 266 | } |
| 267 | } |
| 268 | if (QUEUE_DEBUG) |
| 269 | printf("End queue_seqget. Not found\n"); |
| 270 | return EOF; /* End of linked list and not found */ |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 271 | } |
| 272 | |
Harald Welte | bed35df | 2011-11-02 13:06:18 +0100 | [diff] [blame] | 273 | int queue_freemsg_seq(struct queue_t *queue, struct sockaddr_in *peer, |
| 274 | uint16_t seq, uint8_t * type, void **cbp) |
| 275 | { |
| 276 | struct qmsg_t *qmsg; |
| 277 | if (queue_seqget(queue, &qmsg, peer, seq)) { |
| 278 | *cbp = NULL; |
| 279 | *type = 0; |
| 280 | return EOF; |
| 281 | } |
| 282 | *cbp = qmsg->cbp; |
| 283 | *type = qmsg->type; |
| 284 | if (queue_freemsg(queue, qmsg)) { |
| 285 | return EOF; |
| 286 | } |
| 287 | return 0; |
jjako | 52c2414 | 2002-12-16 13:33:51 +0000 | [diff] [blame] | 288 | } |