author Phil Ringnalda <>
Mon, 08 Dec 2014 20:53:07 -0800
changeset 218811 960303b07c909e69db87467d0b499351d65c82af
permissions -rw-r--r--
Backed out 10 changesets (bug 1091242) for Android/b2g non-unified build bustage CLOSED TREE Backed out changeset 7f72b55c5de7 (bug 1091242) Backed out changeset f1501aa24397 (bug 1091242) Backed out changeset 7fde5994aee5 (bug 1091242) Backed out changeset 59b415714087 (bug 1091242) Backed out changeset dadb65fedc08 (bug 1091242) Backed out changeset 21be81424e4e (bug 1091242) Backed out changeset 498fb1dafba5 (bug 1091242) Backed out changeset 8d0653eb85ab (bug 1091242) Backed out changeset c82d484e135a (bug 1091242) Backed out changeset 3e0c8932f1b1 (bug 1091242)

/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at */


 * Define the queue data type and a basic enqueue structure

typedef struct queuetype_ {
    void *qhead;                /* head of queue */
    void *qtail;                /* tail of queue */
    int count;                  /* possible count */
    int maximum;                /* maximum entries */
} queuetype;

typedef queuetype *queue_ptr_t;

typedef struct nexthelper_
    struct nexthelper_ *next;
    unsigned char data[4];
} queue_node, nexthelper, *node_ptr_t;

typedef enum get_node_status_ {
} get_node_status;

void queue_init(queuetype *q, int maximum);
void *peekqueuehead(queuetype* q);

/*Functions used by SIP */
int queryqueuedepth(queuetype const *q);
boolean checkqueue(queuetype *q, void *e);
void *p_dequeue(queuetype *qptr);
void p_enqueue(queuetype *qptr, void *eaddr);
void p_requeue(queuetype *qptr, void *eaddr);
void p_swapqueue(queuetype *qptr, void *enew, void *eold);
void p_unqueue(queuetype *q, void *e);
void p_unqueuenext(queuetype *q, void **prev);
void enqueue(queuetype *qptr, void *eaddr);
void *dequeue(queuetype *qptr);
void unqueue(queuetype *q, void *e);
void requeue(queuetype *qptr, void *eaddr);
void *remqueue(queuetype *qptr, void *eaddr, void *paddr);
void insqueue(queuetype *qptr, void *eaddr, void *paddr);
boolean queueBLOCK(queuetype *qptr);
boolean validqueue(queuetype *qptr, boolean print_message);

boolean queue_create_init(queue_ptr_t *queue);
void add_list(queue_ptr_t queue, node_ptr_t node);
get_node_status get_node(queue_ptr_t queue, node_ptr_t *node);
void queue_delete(queue_ptr_t queue);