55     struct rt_poll_node *node;  in _poll_add()  local
57     node = rt_malloc(sizeof(struct rt_poll_node));  in _poll_add()
58     if (node == RT_NULL)  in _poll_add()
63     node->wqn.key = req->_key;  in _poll_add()
64     rt_list_init(&(node->wqn.list));  in _poll_add()
65     node->wqn.polling_thread = pt->polling_thread;  in _poll_add()
66     node->wqn.wakeup = __wqueue_pollwake;  in _poll_add()
67     node->next = pt->nodes;  in _poll_add()
68     node->pt = pt;  in _poll_add()
69     pt->nodes = node;  in _poll_add()
70     rt_wqueue_add(wq, &node->wqn);  in _poll_add()
191     struct rt_poll_node *node, *next;  in poll_teardown()  local
196         node = next;  in poll_teardown()
197         rt_wqueue_remove(&node->wqn);  in poll_teardown()
198         next = node->next;  in poll_teardown()
199         rt_free(node);  in poll_teardown()