queue.h File Reference

#include <sys/types.h>
#include "class.h"
#include "commons.h"

Include dependency graph for queue.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros
#define	queueEmpty(this)   (0 >= (this)->nmsg)

Functions
	CLASS (Queue)
void	queuePut (Queue, void *)
void *	queueGet (Queue)

Detailed Description

Holds requests ready for processing.

Todo:

change this to a real queue.

Author

Georg Hopp

Copyright

Copyright © 2012 Georg Hopp

This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.

Definition in file queue.h.

Macro Definition Documentation

#define queueEmpty

(

this

)

(0 >= (this)->nmsg)

Definition at line 55 of file queue.h.

Referenced by httpWorkerProcess(), and httpWriterWrite().

Function Documentation

CLASS

(

Queue

)

first and last are only available in the initial queue element (the root). This elelment does not contain any message and exists only for organizational purpose.

Todo:

next and first always have to be the same...so get rid of first.

Definition at line 35 of file queue.h.

             {
    void * msg;
    Queue  next;

    /**
     * first and last are only available in the initial queue
     * element (the root). This elelment does not contain any message
     * and exists only for organizational purpose.
     *
     * \todo next and first always have to be the same...so get rid
     * of first.
     */
    Queue  first;
    Queue  last;
    size_t nmsg;
};

void* queueGet

(

Queue

)

Definition at line 27 of file queue/get.c.

Referenced by httpWorkerAddComputedHeader(), httpWorkerProcess(), and httpWriterWrite().

{
    Queue   first;
    void  * msg;

    if (NULL == this->first) {
        return NULL;
    }

    msg   = this->first->msg;
    first = this->first->next;

    if (this->first == this->last) {
        this->last = NULL;
    }
    delete(this->first);

    this->next  = first;
    this->first = first;
    this->nmsg--;

    return msg;
}

Here is the caller graph for this function:

void queuePut	(	Queue	,
		void *
	)

Definition at line 27 of file queue/put.c.

Referenced by applicationAdapterHttpUpdate(), httpParserParse(), and httpWorkerProcess().

{
    Queue node = (this->last)? this->last : this;

    node->next = new(Queue);
    this->last = node->next;

    if (node == this) {
        this->first = node->next;
    }

    node->next->msg = msg;
    this->nmsg++;
}

Here is the caller graph for this function: