plist_node
static inline void plist_node_init(struct plist_node *node, int prio)
extern void plist_add(struct plist_node *node, struct plist_head *head);
extern void plist_del(struct plist_node *node, struct plist_head *head);
extern void plist_requeue(struct plist_node *node, struct plist_head *head);
static inline int plist_node_empty(const struct plist_node *node)
static inline struct plist_node *plist_first(const struct plist_head *head)
struct plist_node, node_list);
static inline struct plist_node *plist_last(const struct plist_head *head)
struct plist_node, node_list);
struct plist_node pnode;
int pm_qos_update_target(struct pm_qos_constraints *c, struct plist_node *node,
struct plist_node node;
struct plist_node pnode;
struct plist_node pushable_tasks;
struct plist_node list; /* entry in swap_active_head */
struct plist_node avail_list; /* entry in swap_avail_head */
struct plist_node list;
int pm_qos_update_target(struct pm_qos_constraints *c, struct plist_node *node,
struct plist_node, prio_list);
struct plist_node, prio_list);
void plist_del(struct plist_node *node, struct plist_head *head)
struct plist_node *next;
struct plist_node, node_list);
void plist_requeue(struct plist_node *node, struct plist_head *head)
struct plist_node *iter;
iter = list_entry(iter->prio_list.next, struct plist_node,
static struct plist_node __initdata test_node[241];
struct plist_node *first, *prio_pos, *node_pos;
static void __init plist_test_requeue(struct plist_node *node)
void plist_add(struct plist_node *node, struct plist_head *head)
struct plist_node *first, *iter, *prev = NULL, *last, *reverse_iter;
last = reverse_iter = list_entry(first->prio_list.prev, struct plist_node, prio_list);
struct plist_node, prio_list);