struct queued_entry_t* new_queued_entry(uint32_t log_read_size_max);
void free_queued_entry(struct queued_entry_t* entry);
void free_queued_entry_list(struct queued_entry_t *queue);
-int read_queued_entry_from_dev(int fd, struct queued_entry_t *entry,
- uint32_t log_read_size_max);
-struct queued_entry_t* pop_queued_entry(struct queued_entry_t** queue);
+int read_queued_entry_from_dev(int fd, struct queued_entry_t *entry, uint32_t log_read_size_max);
int cmp(struct queued_entry_t* a, struct queued_entry_t* b);
-void enqueue(struct queued_entry_t** queue, struct queued_entry_t* entry);
#else
void free_queued_entry(struct queued_entry_t* entry);
void free_queued_entry_list(struct queued_entry_t *queue);
int read_queued_entry_from_dev(int fd, struct queued_entry_t *entry, uint32_t for_compatibility);
-struct queued_entry_t* pop_queued_entry(struct queued_entry_t** queue);
int cmp(struct queued_entry_t* a, struct queued_entry_t* b);
-void enqueue(struct queued_entry_t** queue, struct queued_entry_t* entry);
#endif
#define RQER_EPIPE 4
//TODO: consider enum
+struct queued_entry_t* pop_queued_entry(struct queued_entry_t** queue);
+void enqueue(struct queued_entry_t** queue, struct queued_entry_t* entry);
+
#endif /* _QUEUED_ENTRY_H */
return RQER_SUCCESS;
}
-struct queued_entry_t* pop_queued_entry(struct queued_entry_t** queue)
-{
- struct queued_entry_t *entry = *queue;
- *queue = (*queue)->next;
- return entry;
-}
-
int cmp(struct queued_entry_t* a, struct queued_entry_t* b)
{
if (a->entry.ts_usec < b->entry.ts_usec)
return 0;
}
-void enqueue(struct queued_entry_t** queue, struct queued_entry_t* entry)
-{
- if (*queue == NULL) {
- *queue = entry;
- } else {
- struct queued_entry_t** e = queue;
- while (*e && cmp(entry, *e) >= 0 ) {
- e = &((*e)->next);
- }
- entry->next = *e;
- *e = entry;
- }
-}
-
#else
struct queued_entry_t* new_queued_entry(uint32_t for_compatibility)
return 0;
}
-struct queued_entry_t* pop_queued_entry(struct queued_entry_t** queue)
-{
- struct queued_entry_t *entry = *queue;
- *queue = (*queue)->next;
- return entry;
-}
-
int cmp(struct queued_entry_t* a, struct queued_entry_t* b)
{
int n = a->entry.sec - b->entry.sec;
return a->entry.nsec - b->entry.nsec;
}
+#endif
+
+struct queued_entry_t* pop_queued_entry(struct queued_entry_t** queue)
+{
+ struct queued_entry_t *entry = *queue;
+ *queue = (*queue)->next;
+ return entry;
+}
+
void enqueue(struct queued_entry_t** queue, struct queued_entry_t* entry)
{
if (*queue == NULL) {
}
}
-#endif