30 	u64 orig_dl = cp->elements[idx].dl;  in cpudl_heapify_down()
45 						cp->elements[l].dl)) {  in cpudl_heapify_down()
47 			largest_dl = cp->elements[l].dl;  in cpudl_heapify_down()
50 						cp->elements[r].dl))  in cpudl_heapify_down()
58 		cp->elements[idx].dl = cp->elements[largest].dl;  in cpudl_heapify_down()
64 	cp->elements[idx].dl = orig_dl;  in cpudl_heapify_down()
73 	u64 orig_dl = cp->elements[idx].dl;  in cpudl_heapify_up()
80 		if (dl_time_before(orig_dl, cp->elements[p].dl))  in cpudl_heapify_up()
84 		cp->elements[idx].dl = cp->elements[p].dl;  in cpudl_heapify_up()
90 	cp->elements[idx].dl = orig_dl;  in cpudl_heapify_up()
96 	if (idx > 0 && dl_time_before(cp->elements[parent(idx)].dl,  in cpudl_heapify()
97 				cp->elements[idx].dl))  in cpudl_heapify()
119 	const struct sched_dl_entity *dl_se = &p->dl;  in cpudl_find()
154 		    dl_time_before(dl_se->deadline, cp->elements[0].dl)) {  in cpudl_find()
191 		cp->elements[old_idx].dl = cp->elements[cp->size - 1].dl;  in cpudl_clear()
213 void cpudl_set(struct cpudl *cp, int cpu, u64 dl)  in cpudl_set()  argument
226 		cp->elements[new_idx].dl = dl;  in cpudl_set()
232 		cp->elements[old_idx].dl = dl;  in cpudl_set()