36 	struct rq_entry *e;  in dlm_add_requestqueue()  local
39 	e = kmalloc(sizeof(struct rq_entry) + length, GFP_NOFS);  in dlm_add_requestqueue()
40 	if (!e) {  in dlm_add_requestqueue()
45 	e->recover_seq = ls->ls_recover_seq & 0xFFFFFFFF;  in dlm_add_requestqueue()
46 	e->nodeid = nodeid;  in dlm_add_requestqueue()
47 	memcpy(&e->request, ms, ms->m_header.h_length);  in dlm_add_requestqueue()
50 	list_add_tail(&e->list, &ls->ls_requestqueue);  in dlm_add_requestqueue()
67 	struct rq_entry *e;  in dlm_process_requestqueue()  local
79 		e = list_entry(ls->ls_requestqueue.next, struct rq_entry, list);  in dlm_process_requestqueue()
82 		ms = &e->request;  in dlm_process_requestqueue()
88 			  e->recover_seq);  in dlm_process_requestqueue()
90 		dlm_receive_message_saved(ls, &e->request, e->recover_seq);  in dlm_process_requestqueue()
93 		list_del(&e->list);  in dlm_process_requestqueue()
94 		kfree(e);  in dlm_process_requestqueue()
158 	struct rq_entry *e, *safe;  in dlm_purge_requestqueue()  local
161 	list_for_each_entry_safe(e, safe, &ls->ls_requestqueue, list) {  in dlm_purge_requestqueue()
162 		ms =  &e->request;  in dlm_purge_requestqueue()
164 		if (purge_request(ls, ms, e->nodeid)) {  in dlm_purge_requestqueue()
165 			list_del(&e->list);  in dlm_purge_requestqueue()
166 			kfree(e);  in dlm_purge_requestqueue()