* - true if data was inserted.
* - false if data already existed and was not inserted.
*/
-bool fr_rb_expire_insert(fr_rb_expire_t *expire, void const *data, fr_time_t now)
+bool fr_rb_expire_insert(fr_rb_expire_t *expire, void *data, fr_time_t now)
{
fr_dlist_t *entry = fr_dlist_item_to_entry(expire->head.offset, data);
fr_rb_expire_node_t *re = (fr_rb_expire_node_t *) (((uintptr_t) entry) - offsetof(fr_rb_expire_node_t, entry));
fr_dlist_remove(&expire->head, entry);
}
- fr_dlist_insert_tail(&expire->head, entry);
+ fr_dlist_insert_tail(&expire->head, data);
- re->when = fr_time_add_time_delta(now, expire->lifetime);
+ re->when = fr_time_add_time_delta(now, expire->lifetime);
return true;
}
-void fr_rb_expire_update(fr_rb_expire_t *expire, void const *data, fr_time_t now)
+void fr_rb_expire_update(fr_rb_expire_t *expire, void *data, fr_time_t now)
{
fr_dlist_t *entry = fr_dlist_item_to_entry(expire->head.offset, data);
fr_rb_expire_node_t *re = (fr_rb_expire_node_t *) (((uintptr_t) entry) - offsetof(fr_rb_expire_node_t, entry));
- fr_dlist_remove(&expire->head, entry);
+ fr_dlist_remove(&expire->head, data);
- fr_dlist_insert_tail(&expire->head, entry);
- re->when = fr_time_add_time_delta(now, expire->lifetime);
+ fr_dlist_insert_tail(&expire->head, data);
+ re->when = fr_time_add_time_delta(now, expire->lifetime);
#if 0
/*
} fr_rb_expire_t;
/** dlist for expiring old entries
- *
- * This structure should be inside of the
+ *
+ * This structure should be inside of the
*/
typedef struct {
fr_rb_node_t node;
(_expire)->last_expiry = fr_time(); \
} while (0)
-bool fr_rb_expire_insert(fr_rb_expire_t *expire, void const *data, fr_time_t now) CC_HINT(nonnull);
+bool fr_rb_expire_insert(fr_rb_expire_t *expire, void *data, fr_time_t now) CC_HINT(nonnull);
-void fr_rb_expire_update(fr_rb_expire_t *expire, void const *data, fr_time_t now) CC_HINT(nonnull);
+void fr_rb_expire_update(fr_rb_expire_t *expire, void *data, fr_time_t now) CC_HINT(nonnull);
#ifdef __cplusplus
}