void add_char_item_node	(	unsigned int	_id,
		CharItem *	_char_item
	)

Definition at line 4056 of file feeserver.c.

References charNodesAmount, cleanUp(), lastCharNode, and Memory::malloc().

Referenced by publishChar().

                                                                {
    //create new node with enough memory
    CharItemNode* newNode = 0;

    newNode = (CharItemNode*) malloc(sizeof(CharItemNode));
    if (newNode == 0) {
        //no memory available!
#       ifdef __DEBUG
        printf("no memory available while adding CharItemNode!\n");
        fflush(stdout);
#       endif
        cleanUp();
        exit(201);
    }
    //initialize "members" of node
    newNode->prev = 0;
    newNode->next = 0;
    newNode->id = _id;
    newNode->charItem = _char_item;

#       ifdef __DEBUG
    // complete debug display of added charItem
/*
    printf("CharItem ID: %d\n", _id);
        printf("CharItem name: %s\n", _char_item->name);
    printf("CharItem user_routine: %p\n", _char_item->user_routine);
        printf("CharItem tag: %d\n", _char_item->tag);
*/
#       endif

#   ifdef __DEBUG
    // short debug display of added Item
    printf("init of %s (char) with ID %d; user_routine at: %p\n", 
                        newNode->charItem->name, newNode->id, 
                        newNode->charItem->user_routine);
    fflush(stdout);
#   endif

    ++charNodesAmount;
    //redirect pointers of doubly linked list (char)
    if (firstCharNode != 0) {
        lastCharNode->next = newNode;
        newNode->prev = lastCharNode;
        lastCharNode = newNode;
    } else {
        firstCharNode = newNode;
        lastCharNode = newNode;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function: