queue.c
changeset 2953 4d933ef9a41f
parent 2799 739481fa6cb9
child 3010 96b8e2841f8c
equal deleted inserted replaced
2952:58522ed8f0f1 2953:4d933ef9a41f
   180 	if (q->data.inssort.first == NULL || q->data.inssort.first->priority >= priority) {
   180 	if (q->data.inssort.first == NULL || q->data.inssort.first->priority >= priority) {
   181 		newnode->next = q->data.inssort.first;
   181 		newnode->next = q->data.inssort.first;
   182 		q->data.inssort.first = newnode;
   182 		q->data.inssort.first = newnode;
   183 	} else {
   183 	} else {
   184 		InsSortNode* node = q->data.inssort.first;
   184 		InsSortNode* node = q->data.inssort.first;
   185 		while( node != NULL ) {
   185 		while (node != NULL) {
   186 			if (node->next == NULL || node->next->priority >= priority) {
   186 			if (node->next == NULL || node->next->priority >= priority) {
   187 				newnode->next = node->next;
   187 				newnode->next = node->next;
   188 				node->next = newnode;
   188 				node->next = newnode;
   189 				break;
   189 				break;
   190 			}
   190 			}