Lines Matching refs:node
120 struct timeOutQueue *ptr, *node, *prev;
123 /* create a node */
124 node = (struct timeOutQueue *)malloc(sizeof(struct timeOutQueue));
125 if (node == 0) {
129 node->func = action;
130 node->data = data;
131 node->time = delay;
132 node->next = 0;
133 node->id = ++id;
137 /* insert node in the queue */
139 /* if the queue is empty, insert the node and return */
141 queue = node;
147 // We found the correct node
148 node->next = ptr;
150 queue = node;
153 prev->next = node;
155 ptr->time -= node->time;
158 node->id, i, node->time);
162 return node->id;
165 delay -= ptr->time; node->time = delay;
171 prev->next = node;
175 node->id, i, node->time);
180 return node->id;
215 * find the right node, delete it. the subsequent node's time
222 /* got the right node */
230 /* increment next node if any */