88 	test_node_t node = NULL;  variable
94 		node = new test_node;
95 		T_QUIET; T_ASSERT_NOTNULL(node, NULL);
97 		priority_queue_entry_init(&node->ke);
98 		priority_queue_entry_set_sched_pri(&pq, &node->ke, priority_list[i], 0);
99 		priority_queue_insert(&pq, &node->ke);
103 	priority_queue_entry_set_sched_pri(&pq, &node->ke, increase_pri, 0);
104 	update_result = priority_queue_entry_increased(&pq, &node->ke);
110 	priority_queue_entry_set_sched_pri(&pq, &node->ke, decrease_pri, 0);
111 	update_result = priority_queue_entry_decreased(&pq, &node->ke);
124 	node = pqe_element_fast(k, test_node, ke);
130 		node = priority_queue_remove_max(&pq, test_node, ke);
131 		delete node;
150 	test_node_t node = NULL;  variable
164 		node = new test_node;
165 		T_QUIET; T_ASSERT_NOTNULL(node, NULL);
167 		priority_queue_entry_init(&node->e);
168 		node->node_key = priority_list[i];
169 		priority_queue_insert(&pq, &node->e);
173 	node->node_key = increase_pri;
174 	update_result = priority_queue_entry_increased(&pq, &node->e);
181 	node->node_key = decrease_pri;
182 	update_result = priority_queue_entry_decreased(&pq, &node->e);
226 	test_node_t node = NULL;  variable
232 		node = new test_node;
233 		T_QUIET; T_ASSERT_NOTNULL(node, NULL);
235 		priority_queue_entry_init(node);
236 		node->se.stamp = config[i].stamp;
237 		priority_queue_entry_set_sched_pri(&pq, &node->se,
239 		priority_queue_insert(&pq, &node->se);
266 		node = priority_queue_max(&pq, union test_node, se);
269 		auto pri = priority_queue_entry_sched_pri(&pq, &node->se);
272 		auto modifier = priority_queue_entry_sched_modifier(&pq, &node->se);
275 		T_ASSERT_EQ(node->se.stamp, config[i].stamp,
278 		delete node;