Changeset 98000fb in mainline for kernel/generic/include/adt
- Timestamp:
- 2009-06-03T19:34:45Z (16 years ago)
- Branches:
- lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export
- Children:
- 301ff30
- Parents:
- 69e68e3
- Location:
- kernel/generic/include/adt
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/generic/include/adt/bitmap.h
r69e68e3 r98000fb 42 42 typedef struct { 43 43 uint8_t *map; 44 count_t bits;44 size_t bits; 45 45 } bitmap_t; 46 46 47 extern void bitmap_initialize(bitmap_t *bitmap, uint8_t *map, count_t bits);48 extern void bitmap_set_range(bitmap_t *bitmap, index_t start, count_t bits);49 extern void bitmap_clear_range(bitmap_t *bitmap, index_t start, count_t bits);50 extern void bitmap_copy(bitmap_t *dst, bitmap_t *src, count_t bits);47 extern void bitmap_initialize(bitmap_t *bitmap, uint8_t *map, size_t bits); 48 extern void bitmap_set_range(bitmap_t *bitmap, size_t start, size_t bits); 49 extern void bitmap_clear_range(bitmap_t *bitmap, size_t start, size_t bits); 50 extern void bitmap_copy(bitmap_t *dst, bitmap_t *src, size_t bits); 51 51 52 static inline int bitmap_get(bitmap_t *bitmap, index_t bit)52 static inline int bitmap_get(bitmap_t *bitmap, size_t bit) 53 53 { 54 54 if(bit >= bitmap->bits) 55 55 return 0; 56 56 57 return !! ((bitmap->map)[bit/8] & (1 << (bit & 7))); 57 58 } -
kernel/generic/include/adt/btree.h
r69e68e3 r98000fb 47 47 typedef struct btree_node { 48 48 /** Number of keys. */ 49 count_t keys;49 size_t keys; 50 50 51 51 /** -
kernel/generic/include/adt/fifo.h
r69e68e3 r98000fb 60 60 struct { \ 61 61 t fifo[(itms)]; \ 62 count_t items; \63 index_t head; \64 index_t tail; \62 size_t items; \ 63 size_t head; \ 64 size_t tail; \ 65 65 } name = { \ 66 66 .items = (itms), \ … … 81 81 struct { \ 82 82 t *fifo; \ 83 count_t items; \84 index_t head; \85 index_t tail; \83 size_t items; \ 84 size_t head; \ 85 size_t tail; \ 86 86 } name = { \ 87 87 .fifo = NULL, \ -
kernel/generic/include/adt/hash_table.h
r69e68e3 r98000fb 48 48 * @return Index into hash table. 49 49 */ 50 index_t (* hash)(unative_t key[]);50 size_t (* hash)(unative_t key[]); 51 51 52 52 /** Hash table item comparison function. … … 57 57 * @return true if the keys match, false otherwise. 58 58 */ 59 bool (*compare)(unative_t key[], count_t keys, link_t *item);59 bool (*compare)(unative_t key[], size_t keys, link_t *item); 60 60 61 61 /** Hash table item removal callback. … … 69 69 typedef struct { 70 70 link_t *entry; 71 count_t entries;72 count_t max_keys;71 size_t entries; 72 size_t max_keys; 73 73 hash_table_operations_t *op; 74 74 } hash_table_t; … … 77 77 list_get_instance((item), type, member) 78 78 79 extern void hash_table_create(hash_table_t *h, count_t m, count_t max_keys,79 extern void hash_table_create(hash_table_t *h, size_t m, size_t max_keys, 80 80 hash_table_operations_t *op); 81 81 extern void hash_table_insert(hash_table_t *h, unative_t key[], link_t *item); 82 82 extern link_t *hash_table_find(hash_table_t *h, unative_t key[]); 83 extern void hash_table_remove(hash_table_t *h, unative_t key[], count_t keys);83 extern void hash_table_remove(hash_table_t *h, unative_t key[], size_t keys); 84 84 85 85 #endif
Note:
See TracChangeset
for help on using the changeset viewer.