send_t *sends = (send_t *)user_data;
return next_send(&sends[a]) < next_send(&sends[b]);
}
+
+void create_send(send_t *sleeping_sends, pheap_t *sleeps_heap,
+ uint32_t timestamp, u16_t seq) {
+ pheap_node_id_t i = ph_new_node(sleeps_heap);
+ if (i == 0) {
+ /* TODO: Don't drop new presses just because sleeps_heap is full of old
+ * presses. */
+ return;
+ }
+ sleeping_sends[i].timestamp = timestamp;
+ sleeping_sends[i].seq = seq;
+ sleeping_sends[i].send_count = 0;
+ ph_insert_node(sleeps_heap, i);
+}
bool next_send_less_than(void *user_data, pheap_node_id_t a, pheap_node_id_t b);
+void create_send(send_t *sleeping_sends, pheap_t *sleeps_heap,
+ uint32_t timestamp, u16_t seq);
+
#endif
queue_remove_blocking(&queue, &e);
switch (e.type) {
case BUTTONPRESS: {
- pheap_node_id_t i = ph_new_node(sleeps_heap);
- if (i == 0) {
- /* TODO: Don't drop new presses just because sleeps_heap is full of old
- * presses. */
- break;
- }
- sleeping_sends[i].timestamp = e.buttonpress.timestamp;
- sleeping_sends[i].seq = seq++;
- sleeping_sends[i].send_count = 0;
- ph_insert_node(sleeps_heap, i);
+ create_send(sleeping_sends, sleeps_heap, e.buttonpress.timestamp, seq++);
} break;
case SEND: {
/* OK, we're awake. Cool. Thanks! (We actually do the sends in the