void add_int_item_node	(	unsigned int	_id,
		IntItem *	_int_item
	)

Definition at line 3317 of file feeserver.c.

References cleanUp(), intNodesAmount, lastIntNode, and Memory::malloc().

Referenced by publishInt().

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

        newNode = (IntItemNode*) malloc(sizeof(IntItemNode));
        if (newNode == 0) {
                //no memory available!
#               ifdef __DEBUG
                printf("no memory available while adding IntItemNode!\n");
                fflush(stdout);
#               endif
                cleanUp();
                exit(201);
        }
        //initialize "members" of node
        newNode->prev = 0;
        newNode->next = 0;
        newNode->id = _id;
        newNode->intItem = _int_item;
        newNode->lastTransmittedIntValue = *(_int_item->location);
        //if default deadband is negative -> set threshold 0, otherwise set half of defaultDeadband
        newNode->threshold = (_int_item->defaultDeadband < 0) ? 0.0 : (_int_item->defaultDeadband / 2);

        newNode->locBackup = _int_item->location;

        // Check if these feature have to be ported as well ??? !!!
//      newNode->checksum = calculateChecksum((unsigned char*) &(_item->location),
//                      sizeof(volatile float*));
//      newNode->checksumBackup = newNode->checksum;

#ifdef __DEBUG
        // complete debug display of added IntItem
/*
        printf("IntItem: %d\n", _id);
        printf("location: %f, locBackup %f\n", *(_int_item->location), *(newNode->locBackup));
        printf("location addr: %p, locBackup addr %p\n", _int_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 (int) with ID %d: %d\n", newNode->intItem->name,
                                newNode->id, newNode->lastTransmittedIntValue);
        fflush(stdout);
#       endif

        ++intNodesAmount;
        //redirect pointers of doubly linked list (int)
        if (firstIntNode != 0) {
                lastIntNode->next = newNode;
                newNode->prev = lastIntNode;
                lastIntNode = newNode;
        } else {
                firstIntNode = newNode;
                lastIntNode = newNode;
        }
}

Here is the call graph for this function:

Here is the caller graph for this function: