litmus-rt.git - The LITMUS^RT kernel.

The LITMUS^RT kernel.

Bjoern Brandenburg

about summary refs log tree commit diff stats

diff options

author	viro@zenIV.linux.org.uk <viro@zenIV.linux.org.uk>	2005-09-02 15:15:29 -0400
committer	Linus Torvalds <torvalds@g5.osdl.org>	2005-09-07 20:16:52 -0400
commit	8ae418cf85b92cae7bce3d810b6aaf354e77be84 (patch)
tree	c893eef06ec20385780919dc8d9134689f81a42d /include/linux/msg.h
parent	24c83d45d76303db8325b8553a05c69c838ef370 (diff)

[PATCH] s2io u64 use for uintptr_t

u64 is not uintptr_t; unsigned long is... Signed-off-by: Al Viro <viro@zeniv.linux.org.uk> Signed-off-by: Linus Torvalds <torvalds@osdl.org>

Diffstat (limited to 'include/linux/msg.h')

0 files changed, 0 insertions, 0 deletions

lass="hl kwb">bool list_lru_del(struct list_lru *lru, struct list_head *item); /** * list_lru_count_node: return the number of objects currently held by @lru * @lru: the lru pointer. * @nid: the node id to count from. * * Always return a non-negative number, 0 for empty lists. There is no * guarantee that the list is not updated while the count is being computed. * Callers that want such a guarantee need to provide an outer lock. */ unsigned long list_lru_count_node(struct list_lru *lru, int nid); static inline unsigned long list_lru_count(struct list_lru *lru) { long count = 0; int nid; for_each_node_mask(nid, lru->active_nodes) count += list_lru_count_node(lru, nid); return count; } typedef enum lru_status (*list_lru_walk_cb)(struct list_head *item, spinlock_t *lock, void *cb_arg); /** * list_lru_walk_node: walk a list_lru, isolating and disposing freeable items. * @lru: the lru pointer. * @nid: the node id to scan from. * @isolate: callback function that is resposible for deciding what to do with * the item currently being scanned * @cb_arg: opaque type that will be passed to @isolate * @nr_to_walk: how many items to scan. * * This function will scan all elements in a particular list_lru, calling the * @isolate callback for each of those items, along with the current list * spinlock and a caller-provided opaque. The @isolate callback can choose to * drop the lock internally, but *must* return with the lock held. The callback * will return an enum lru_status telling the list_lru infrastructure what to * do with the object being scanned. * * Please note that nr_to_walk does not mean how many objects will be freed, * just how many objects will be scanned. * * Return value: the number of objects effectively removed from the LRU. */ unsigned long list_lru_walk_node(struct list_lru *lru, int nid, list_lru_walk_cb isolate, void *cb_arg, unsigned long *nr_to_walk); static inline unsigned long list_lru_walk(struct list_lru *lru, list_lru_walk_cb isolate, void *cb_arg, unsigned long nr_to_walk) { long isolated = 0; int nid; for_each_node_mask(nid, lru->active_nodes) { isolated += list_lru_walk_node(lru, nid, isolate, cb_arg, &nr_to_walk); if (nr_to_walk <= 0) break; } return isolated; } #endif /* _LRU_LIST_H */


context:
space:
mode: