void add_item_node	(	unsigned int	_id,
		Item *	_item
	)

Definition at line 1464 of file feeserver.c.

References calculateChecksum(), cleanUp(), lastNode, Memory::malloc(), and nodesAmount.

Referenced by publish().

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

        newNode = (ItemNode*) malloc(sizeof(ItemNode));
        if (newNode == 0) {
                //no memory available!
#               ifdef __DEBUG
                printf("no memory available while adding itemNode!\n");
#               endif
                // !!! unable to run FeeServer, write msg in kernel logger !!! (->Tobias)
                cleanUp();
                exit(201);
        }
        //initialize "members" of node
        newNode->prev = 0;
        newNode->next = 0;
        newNode->id = _id;
        newNode->item = _item;
        newNode->lastTransmittedValue = *(_item->location);
        //if default deadband is negative -> set threshold 0, otherwise set half of defaultDeadband
        newNode->threshold = (_item->defaultDeadband < 0) ? 0.0 : (_item->defaultDeadband / 2);
 /*
                if(_item->defaultDeadband < 0) {
                newNode->threshold = 0.0;
        } else {
                newNode->threshold = _item->defaultDeadband / 2;
        }
*/
        newNode->locBackup = _item->location;
        newNode->checksum = calculateChecksum((unsigned char*) &(_item->location),
                        sizeof(volatile float*));
        newNode->checksumBackup = newNode->checksum;

#ifdef __DEBUG
        // complete debug display of added Item
/*
        printf("Item: %d\n", _id);
        printf("location: %f, locBackup %f\n", *(_item->location), *(newNode->locBackup));
        printf("location addr: %p, locBackup addr %p\n", _item->location, newNode->locBackup);
        printf("checksum1: %d, checksum2: %d\n\n", newNode->checksum,
                        newNode->checksumBackup);
*/
#endif

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

        ++nodesAmount;
        //redirect pointers of doubly linked list
        if (firstNode != 0) {
                lastNode->next = newNode;
                newNode->prev = lastNode;
                lastNode = newNode;
        } else {
                firstNode = newNode;
                lastNode = newNode;
        }
}

Here is the call graph for this function:

Here is the caller graph for this function: