| 1 | |
| 2 |
|
| 3 | #ifndef _LINUX_MM_SLOT_H
|
| 4 | #define _LINUX_MM_SLOT_H
|
| 5 |
|
| 6 | #include <linux/hashtable.h>
|
| 7 | #include <linux/slab.h>
|
| 8 |
|
| 9 | |
| 10 | * struct mm_slot - hash lookup from mm to mm_slot
|
| 11 | * @hash: link to the mm_slots hash list
|
| 12 | * @mm_node: link into the mm_slots list
|
| 13 | * @mm: the mm that this information is valid for
|
| 14 |
|
| 15 | struct mm_slot {
|
| 16 | struct hlist_node hash;
|
| 17 | struct list_head mm_node;
|
| 18 | struct mm_struct *mm;
|
| 19 | };
|
| 20 |
|
| 21 | #define mm_slot_entry(ptr, type, member) \
|
| 22 | container_of(ptr, type, member)
|
| 23 |
|
| 24 | static inline void *mm_slot_alloc(struct kmem_cache *cache)
|
| 25 | {
|
| 26 | if (!cache)
|
| 27 | return NULL;
|
| 28 | return kmem_cache_zalloc(cache, GFP_KERNEL);
|
| 29 | }
|
| 30 |
|
| 31 | static inline void mm_slot_free(struct kmem_cache *cache, void *objp)
|
| 32 | {
|
| 33 | kmem_cache_free(cache, objp);
|
| 34 | }
|
| 35 |
|
| 36 | |
| 37 | * Note: mm_slot_lookup and mm_slot_insert cannot be converted to static inline
|
| 38 | * functions because the hash helpers (hash_for_each_possible and hash_add) rely
|
| 39 | * on the actual array argument 'hashtable' for sizeof() instead of pointers.
|
| 40 |
|
| 41 |
|
| 42 | #define mm_slot_lookup(_hashtable, _mm) \
|
| 43 | ({ \
|
| 44 | struct mm_slot *tmp_slot, *mm_slot = NULL; \
|
| 45 | \
|
| 46 | hash_for_each_possible(_hashtable, tmp_slot, hash, (unsigned long)_mm) \
|
| 47 | if (_mm == tmp_slot->mm) { \
|
| 48 | mm_slot = tmp_slot; \
|
| 49 | break; \
|
| 50 | } \
|
| 51 | \
|
| 52 | mm_slot; \
|
| 53 | })
|
| 54 |
|
| 55 | #define mm_slot_insert(_hashtable, _mm, _mm_slot) \
|
| 56 | ({ \
|
| 57 | _mm_slot->mm = _mm; \
|
| 58 | hash_add(_hashtable, &_mm_slot->hash, (unsigned long)_mm); \
|
| 59 | })
|
| 60 |
|
| 61 | static inline void mm_slot_remove(struct mm_slot *slot)
|
| 62 | {
|
| 63 | hash_del(&slot->hash);
|
| 64 | list_del(&slot->mm_node);
|
| 65 | }
|
| 66 | #endif
|