1157 void recycle_rp_inst(struct kretprobe_instance *ri,  in recycle_rp_inst()  argument
1160 	struct kretprobe *rp = ri->rp;  in recycle_rp_inst()
1163 	hlist_del(&ri->hlist);  in recycle_rp_inst()
1164 	INIT_HLIST_NODE(&ri->hlist);  in recycle_rp_inst()
1167 		hlist_add_head(&ri->hlist, &rp->free_instances);  in recycle_rp_inst()
1171 		hlist_add_head(&ri->hlist, head);  in recycle_rp_inst()
1226 	struct kretprobe_instance *ri;  in kprobe_flush_task()  local
1239 	hlist_for_each_entry_safe(ri, tmp, head, hlist) {  in kprobe_flush_task()
1240 		if (ri->task == tk)  in kprobe_flush_task()
1241 			recycle_rp_inst(ri, &empty_rp);  in kprobe_flush_task()
1244 	hlist_for_each_entry_safe(ri, tmp, &empty_rp, hlist) {  in kprobe_flush_task()
1245 		hlist_del(&ri->hlist);  in kprobe_flush_task()
1246 		kfree(ri);  in kprobe_flush_task()
1253 	struct kretprobe_instance *ri;  in free_rp_inst()  local
1256 	hlist_for_each_entry_safe(ri, next, &rp->free_instances, hlist) {  in free_rp_inst()
1257 		hlist_del(&ri->hlist);  in free_rp_inst()
1258 		kfree(ri);  in free_rp_inst()
1265 	struct kretprobe_instance *ri;  in cleanup_rp_inst()  local
1273 		hlist_for_each_entry_safe(ri, next, head, hlist) {  in cleanup_rp_inst()
1274 			if (ri->rp == rp)  in cleanup_rp_inst()
1275 				ri->rp = NULL;  in cleanup_rp_inst()
1841 	struct kretprobe_instance *ri;  in pre_handler_kretprobe()  local
1858 		ri = hlist_entry(rp->free_instances.first,  in pre_handler_kretprobe()
1860 		hlist_del(&ri->hlist);  in pre_handler_kretprobe()
1863 		ri->rp = rp;  in pre_handler_kretprobe()
1864 		ri->task = current;  in pre_handler_kretprobe()
1866 		if (rp->entry_handler && rp->entry_handler(ri, regs)) {  in pre_handler_kretprobe()
1868 			hlist_add_head(&ri->hlist, &rp->free_instances);  in pre_handler_kretprobe()
1873 		arch_prepare_kretprobe(ri, regs);  in pre_handler_kretprobe()
1876 		INIT_HLIST_NODE(&ri->hlist);  in pre_handler_kretprobe()
1878 		hlist_add_head(&ri->hlist, &kretprobe_inst_table[hash]);  in pre_handler_kretprobe()