275 	struct deflect_struc *ds, *ds1 = NULL;  in insertrule()  local
278 	if (!(ds = kmalloc(sizeof(struct deflect_struc), GFP_KERNEL)))  in insertrule()
281 	ds->rule = *newrule; /* set rule */  in insertrule()
295 		ds->prev = table_tail; /* previous entry */  in insertrule()
296 		ds->next = NULL; /* end of chain */  in insertrule()
297 		if (ds->prev)  in insertrule()
298 			ds->prev->next = ds; /* last forward */  in insertrule()
300 			table_head = ds; /* is first entry */  in insertrule()
301 		table_tail = ds; /* end of queue */  in insertrule()
303 		ds->next = ds1; /* next entry */  in insertrule()
304 		ds->prev = ds1->prev; /* prev entry */  in insertrule()
305 		ds1->prev = ds; /* backward chain old element */  in insertrule()
306 		if (!ds->prev)  in insertrule()
307 			table_head = ds; /* first element */  in insertrule()
319 	struct deflect_struc *ds, *ds1;  in deleterule()  local
324 		ds = table_head;  in deleterule()
328 		while (ds) {  in deleterule()
329 			ds1 = ds;  in deleterule()
330 			ds = ds->next;  in deleterule()
337 	ds = table_head;  in deleterule()
339 	while ((ds) && (idx > 0)) {  in deleterule()
341 		ds = ds->next;  in deleterule()
344 	if (!ds) {  in deleterule()
349 	if (ds->next)  in deleterule()
350 		ds->next->prev = ds->prev; /* backward chain */  in deleterule()
352 		table_tail = ds->prev; /* end of chain */  in deleterule()
354 	if (ds->prev)  in deleterule()
355 		ds->prev->next = ds->next; /* forward chain */  in deleterule()
357 		table_head = ds->next; /* start of chain */  in deleterule()
360 	kfree(ds);  in deleterule()
369 	struct deflect_struc *ds = table_head;  in getruleptr()  local
372 	while ((ds) && (idx >= 0)) {  in getruleptr()
374 			return (&ds->rule);  in getruleptr()
377 		ds = ds->next;  in getruleptr()