277 { struct deflect_struc *ds, *ds1 = NULL;  in insertrule()  local
280 	if (!(ds = kmalloc(sizeof(struct deflect_struc),  in insertrule()
284 	ds->rule = *newrule; /* set rule */  in insertrule()
298 	{ ds->prev = table_tail; /* previous entry */  in insertrule()
299 		ds->next = NULL; /* end of chain */  in insertrule()
300 		if (ds->prev)  in insertrule()
301 			ds->prev->next = ds; /* last forward */  in insertrule()
303 			table_head = ds; /* is first entry */  in insertrule()
304 		table_tail = ds; /* end of queue */  in insertrule()
307 	{ ds->next = ds1; /* next entry */  in insertrule()
308 		ds->prev = ds1->prev; /* prev entry */  in insertrule()
309 		ds1->prev = ds; /* backward chain old element */  in insertrule()
310 		if (!ds->prev)  in insertrule()
311 			table_head = ds; /* first element */  in insertrule()
322 { struct deflect_struc *ds, *ds1;  in deleterule()  local
327 		ds = table_head;  in deleterule()
331 		while (ds)  in deleterule()
332 		{ ds1 = ds;  in deleterule()
333 			ds = ds->next;  in deleterule()
340 	ds = table_head;  in deleterule()
342 	while ((ds) && (idx > 0))  in deleterule()
344 		ds = ds->next;  in deleterule()
347 	if (!ds)  in deleterule()
353 	if (ds->next)  in deleterule()
354 		ds->next->prev = ds->prev; /* backward chain */  in deleterule()
356 		table_tail = ds->prev; /* end of chain */  in deleterule()
358 	if (ds->prev)  in deleterule()
359 		ds->prev->next = ds->next; /* forward chain */  in deleterule()
361 		table_head = ds->next; /* start of chain */  in deleterule()
364 	kfree(ds);  in deleterule()
372 { struct deflect_struc *ds = table_head;  in getruleptr()  local
375 	while ((ds) && (idx >= 0))  in getruleptr()
377 		{ return (&ds->rule);  in getruleptr()
380 		ds = ds->next;  in getruleptr()