4 * This file contains the management routines for the receive
5 * (incoming packet) queue. The actual packet handlers are in
12 * Grab a single command sequence off the socket, and enqueue
13 * it in the incoming event queue in a seperate struct.
15 int aim_get_command(struct aim_session_t *sess, struct aim_conn_t *conn)
18 struct command_rx_struct *newrx = NULL;
23 if (conn->fd < 3) /* can happen when people abuse the interface */
27 * Read FLAP header. Six bytes:
29 * 0 char -- Always 0x2a
30 * 1 char -- Channel ID. Usually 2 -- 1 and 4 are used during login.
31 * 2 short -- Sequence number
32 * 4 short -- Number of data bytes that follow.
34 faim_mutex_lock(&conn->active);
35 if (read(conn->fd, generic, 6) < 6){
37 faim_mutex_unlock(&conn->active);
40 faim_mutex_unlock(&conn->active);
43 * This shouldn't happen unless the socket breaks, the server breaks,
44 * or we break. We must handle it just in case.
46 if (generic[0] != 0x2a) {
47 faimdprintf(1, "Bad incoming data!");
51 /* allocate a new struct */
52 newrx = (struct command_rx_struct *)malloc(sizeof(struct command_rx_struct));
55 memset(newrx, 0x00, sizeof(struct command_rx_struct));
57 newrx->lock = 1; /* lock the struct */
59 /* store channel -- byte 2 */
60 newrx->type = (char) generic[1];
62 /* store seqnum -- bytes 3 and 4 */
63 newrx->seqnum = aimutil_get16(generic+2);
65 /* store commandlen -- bytes 5 and 6 */
66 newrx->commandlen = aimutil_get16(generic+4);
68 newrx->nofree = 0; /* free by default */
70 /* malloc for data portion */
71 newrx->data = (u_char *) malloc(newrx->commandlen);
77 /* read the data portion of the packet */
78 faim_mutex_lock(&conn->active);
79 if (read(conn->fd, newrx->data, newrx->commandlen) < newrx->commandlen){
83 faim_mutex_unlock(&conn->active);
86 faim_mutex_unlock(&conn->active);
90 newrx->next = NULL; /* this will always be at the bottom */
91 newrx->lock = 0; /* unlock */
93 /* enqueue this packet */
94 if (sess->queue_incoming == NULL) {
95 sess->queue_incoming = newrx;
97 struct command_rx_struct *cur;
100 * This append operation takes a while. It might be faster
101 * if we maintain a pointer to the last entry in the queue
102 * and just update that. Need to determine if the overhead
103 * to maintain that is lower than the overhead for this loop.
105 for (cur = sess->queue_incoming; cur->next; cur = cur->next)
110 newrx->conn->lastactivity = time(NULL);
116 * Purge recieve queue of all handled commands (->handled==1). Also
117 * allows for selective freeing using ->nofree so that the client can
118 * keep the data for various purposes.
120 * If ->nofree is nonzero, the frame will be delinked from the global list,
121 * but will not be free'ed. The client _must_ keep a pointer to the
122 * data -- libfaim will not! If the client marks ->nofree but
123 * does not keep a pointer, it's lost forever.
126 void aim_purge_rxqueue(struct aim_session_t *sess)
128 struct command_rx_struct *cur = NULL;
129 struct command_rx_struct *tmp;
131 if (sess->queue_incoming == NULL)
134 if (sess->queue_incoming->next == NULL) {
135 if (sess->queue_incoming->handled) {
136 tmp = sess->queue_incoming;
137 sess->queue_incoming = NULL;
148 for(cur = sess->queue_incoming; cur->next != NULL; ) {
149 if (cur->next->handled) {
151 cur->next = tmp->next;
161 * Be careful here. Because of the way we just
162 * manipulated the pointer, cur may be NULL and
163 * the for() will segfault doing the check unless
164 * we find this case first.