#ifndef _CAN_QUEUE_H
#define _CAN_QUEUE_H
-#include "./can.h"
+#include "./canmsg.h"
#include "./constants.h"
#include "./can_sysdep.h"
* @flist: pointer to list of the free slots associated with queue
* @entry: pointer to the memory allocated for the list slots.
* @fifo_lock: the lock to ensure atomicity of slot manipulation operations.
- * @slotnr: number of allocated slots
+ * @slotsnr: number of allocated slots
*
* This structure represents CAN FIFO queue. It is implemented as
* a single linked list of slots prepared for processing. The empty slots
* with ready messages. The array is indexed by the edges priorities.
* @idle: the list of the edges directed to the ends structure with empty FIFOs.
* @inlist: the list of outgoing edges input sides.
+ * @outlist: the list of all incoming edges output sides. Each of there edges
+ * is listed on one of @active or @idle lists.
* @ends_lock: the lock synchronizing operations between threads accessing
* same ends structure.
* @notify: pointer to notify procedure. The next state changes are notified.
int canqueue_ends_kill_outlist(struct canque_ends_t *qends);
+int canqueue_ends_filt_conjuction(struct canque_ends_t *qends, struct canfilt_t *filt);
+
+int canqueue_ends_flush_inlist(struct canque_ends_t *qends);
+
+int canqueue_ends_flush_outlist(struct canque_ends_t *qends);
+
/* edge reference and traversal functions */
void canque_edge_do_dead(struct canque_edge_t *edge, int dead_fl);