WebSVN – HelenOS-historic – Path Comparison – / – /kernel/trunk/generic/src/adt/ Rev 1779 and /kernel/trunk/generic/src/adt/ Rev 1780

Ignore whitespace Rev 1779 → Rev 1780

 /kernel/trunk/generic/src/adt/hash_table.c
 ,7 → 64,7
     if (!h->entry) {
         panic("cannot allocate memory for hash table\n");
     }
-    memsetb((__address) h->entry, m * sizeof(link_t), 0);
+    memsetb((uintptr_t) h->entry, m * sizeof(link_t), 0);
     for (i = 0; i < m; i++)
         list_initialize(&h->entry[i]);
 ,7 → 80,7
  * @param key Array of all keys necessary to compute hash index.
  * @param item Item to be inserted into the hash table.
  */
-void hash_table_insert(hash_table_t *h, __native key[], link_t *item)
+void hash_table_insert(hash_table_t *h, unative_t key[], link_t *item)
 {
     index_t chain;
 ,7 → 100,7
  *
  * @return Matching item on success, NULL if there is no such item.
  */
-link_t *hash_table_find(hash_table_t *h, __native key[])
+link_t *hash_table_find(hash_table_t *h, unative_t key[])
 {
     link_t *cur;
     index_t chain;
 ,7 → 130,7
  * @param key Array of keys that will be compared against items of the hash table.
  * @param keys Number of keys in the key array.
  */
-void hash_table_remove(hash_table_t *h, __native key[], count_t keys)
+void hash_table_remove(hash_table_t *h, unative_t key[], count_t keys)
 {
     index_t chain;
     link_t *cur;

 /kernel/trunk/generic/src/adt/bitmap.c
 ,7 → 55,7
  * @param map Address of the memory used to hold the map.
  * @param bits Number of bits stored in bitmap.
  */
-void bitmap_initialize(bitmap_t *bitmap, __u8 *map, count_t bits)
+void bitmap_initialize(bitmap_t *bitmap, uint8_t *map, count_t bits)
 {
     bitmap->map = map;
     bitmap->bits = bits;