31 	u64 orig_dl = cp->elements[idx].dl;  in cpudl_heapify_down()
46 						cp->elements[l].dl)) {  in cpudl_heapify_down()
48 			largest_dl = cp->elements[l].dl;  in cpudl_heapify_down()
51 						cp->elements[r].dl))  in cpudl_heapify_down()
59 		cp->elements[idx].dl = cp->elements[largest].dl;  in cpudl_heapify_down()
65 	cp->elements[idx].dl = orig_dl;  in cpudl_heapify_down()
74 	u64 orig_dl = cp->elements[idx].dl;  in cpudl_heapify_up()
81 		if (dl_time_before(orig_dl, cp->elements[p].dl))  in cpudl_heapify_up()
85 		cp->elements[idx].dl = cp->elements[p].dl;  in cpudl_heapify_up()
91 	cp->elements[idx].dl = orig_dl;  in cpudl_heapify_up()
97 	if (idx > 0 && dl_time_before(cp->elements[parent(idx)].dl,  in cpudl_heapify()
98 				cp->elements[idx].dl))  in cpudl_heapify()
120 	const struct sched_dl_entity *dl_se = &p->dl;  in cpudl_find()
155 		    dl_time_before(dl_se->deadline, cp->elements[0].dl)) {  in cpudl_find()
192 		cp->elements[old_idx].dl = cp->elements[cp->size - 1].dl;  in cpudl_clear()
214 void cpudl_set(struct cpudl *cp, int cpu, u64 dl)  in cpudl_set()  argument
227 		cp->elements[new_idx].dl = dl;  in cpudl_set()
233 		cp->elements[old_idx].dl = dl;  in cpudl_set()