39 	swap(cp->elements[a].dl , cp->elements[b].dl );  in cpudl_exchange()
54 		if ((l < cp->size) && dl_time_before(cp->elements[idx].dl,  in cpudl_heapify()
55 							cp->elements[l].dl))  in cpudl_heapify()
57 		if ((r < cp->size) && dl_time_before(cp->elements[largest].dl,  in cpudl_heapify()
58 							cp->elements[r].dl))  in cpudl_heapify()
73 	if (dl_time_before(new_dl, cp->elements[idx].dl)) {  in cpudl_change_key()
74 		cp->elements[idx].dl = new_dl;  in cpudl_change_key()
77 		cp->elements[idx].dl = new_dl;  in cpudl_change_key()
78 		while (idx > 0 && dl_time_before(cp->elements[parent(idx)].dl,  in cpudl_change_key()
79 					cp->elements[idx].dl)) {  in cpudl_change_key()
103 	const struct sched_dl_entity *dl_se = &p->dl;  in cpudl_find()
110 			dl_time_before(dl_se->deadline, cp->elements[0].dl)) {  in cpudl_find()
132 void cpudl_set(struct cpudl *cp, int cpu, u64 dl, int is_valid)  in cpudl_set()  argument
152 		cp->elements[old_idx].dl = cp->elements[cp->size - 1].dl;  in cpudl_set()
158 				cp->elements[parent(old_idx)].dl,  in cpudl_set()
159 				cp->elements[old_idx].dl)) {  in cpudl_set()
171 		cp->elements[cp->size - 1].dl = 0;  in cpudl_set()
174 		cpudl_change_key(cp, cp->size - 1, dl);  in cpudl_set()
177 		cpudl_change_key(cp, old_idx, dl);  in cpudl_set()