| /branches/network/uspace/lib/libc/include/libadt/list.h |
|---|
| 112,6 → 112,18 |
| head->prev = link; |
| } |
| /** Insert item before another item in doubly-linked circular list. */ |
| static inline void list_insert_before(link_t *l, link_t *r) |
| { |
| list_append(l, r); |
| } |
| /** Insert item after another item in doubly-linked circular list. */ |
| static inline void list_insert_after(link_t *r, link_t *l) |
| { |
| list_prepend(l, r); |
| } |
| /** Remove item from doubly-linked circular list |
| * |
| * Remove item from doubly-linked circular list. |
| /branches/network/uspace/lib/libc/include/libadt/hash_table.h |
|---|
| 86,6 → 86,7 |
| extern void hash_table_insert(hash_table_t *, unsigned long [], link_t *); |
| extern link_t *hash_table_find(hash_table_t *, unsigned long []); |
| extern void hash_table_remove(hash_table_t *, unsigned long [], hash_count_t); |
| extern void hash_table_destroy(hash_table_t *); |
| #endif |