Lines Matching full:before

63  *      -> Wait for current event to finish hoping it does before schedule item.
348 * 13 usecs before (this is important). in ble_ll_sched_master_new()
370 * before the window offset. Transmitting later is fine since we have the in ble_ll_sched_master_new()
371 * transmit window to do so. Transmitting before is bad, since the slave in ble_ll_sched_master_new()
474 /* We can insert if before entry in list */ in ble_ll_sched_master_new()
578 * 13 usecs before (this is important). in ble_ll_sched_master_new()
600 * before the window offset. Transmitting later is fine since we have the in ble_ll_sched_master_new()
601 * transmit window to do so. Transmitting before is bad, since the slave in ble_ll_sched_master_new()
660 /* We can insert if before entry in list */ in ble_ll_sched_master_new()
751 * does not matter if we turn on the receiver up to one tick before w in ble_ll_sched_slave_new()
780 /* Insert if event ends before next starts */ in ble_ll_sched_slave_new()
857 /* We can insert if before entry in list */ in ble_ll_sched_adv_new()
916 struct ble_ll_sched_item *before; in ble_ll_sched_adv_reschedule() local
929 before = NULL; in ble_ll_sched_adv_reschedule()
947 before = entry; in ble_ll_sched_adv_reschedule()
959 * If there is no overlap, we either insert before the 'before' entry in ble_ll_sched_adv_reschedule()
960 * or we insert at the end if there is no before entry. in ble_ll_sched_adv_reschedule()
963 if (before) { in ble_ll_sched_adv_reschedule()
964 TAILQ_INSERT_BEFORE(before, sch, link); in ble_ll_sched_adv_reschedule()
973 before = NULL; in ble_ll_sched_adv_reschedule()
981 before = entry; in ble_ll_sched_adv_reschedule()
982 TAILQ_INSERT_BEFORE(before, sch, link); in ble_ll_sched_adv_reschedule()
1440 /* We can insert if before entry in list */ in ble_ll_sched_aux_scan()
1498 /* We can insert if before entry in list */ in ble_ll_sched_dtm()
1552 * before any of the scheduler API are called.