145 	struct chain_head **chain_index;   /* array for fast chain list access*/  member
361 	if (!handle->chain_index[pos]) {  in __iptcc_bsearch_chain_index()
367 	      pos, handle->chain_index[pos]->name);  in __iptcc_bsearch_chain_index()
372 		res = strcmp(name, handle->chain_index[pos]->name);  in __iptcc_bsearch_chain_index()
376 		      handle->chain_index[pos]->head_offset,  in __iptcc_bsearch_chain_index()
377 		      handle->chain_index[pos]->foot_offset);  in __iptcc_bsearch_chain_index()
378 		res = offset - handle->chain_index[pos]->head_offset;  in __iptcc_bsearch_chain_index()
389 	list_pos = &handle->chain_index[pos]->list;  in __iptcc_bsearch_chain_index()
417 			res = strcmp(name, handle->chain_index[pos+1]->name);  in __iptcc_bsearch_chain_index()
420 			res = offset - handle->chain_index[pos+1]->head_offset;  in __iptcc_bsearch_chain_index()
476 		list_pos = &handle->chain_index[0]->list;  in iptcc_linearly_search_chain_index()
481 		if (handle->chain_index[i]) {  in iptcc_linearly_search_chain_index()
482 			res = strcmp(handle->chain_index[i]->name, name);  in iptcc_linearly_search_chain_index()
485 			list_pos = &handle->chain_index[i]->list;  in iptcc_linearly_search_chain_index()
504 	array_mem   = sizeof(h->chain_index) * array_elems;  in iptcc_chain_index_alloc()
509 	h->chain_index = malloc(array_mem);  in iptcc_chain_index_alloc()
510 	if (h->chain_index == NULL && array_mem > 0) {  in iptcc_chain_index_alloc()
514 	memset(h->chain_index, 0, array_mem);  in iptcc_chain_index_alloc()
523 	free(h->chain_index);  in iptcc_chain_index_free()
534 		if (h->chain_index[i]) {  in iptcc_chain_index_dump()
536 				i, h->chain_index[i]->name);  in iptcc_chain_index_dump()
574 				h->chain_index[cindex] = c;  in iptcc_chain_index_build()
637 			h->chain_index[idx]=c2;  in iptcc_chain_index_delete_chain()
860 	if (i==0 && strcmp(c->name, h->chain_index[0]->name) <= 0) {  in iptc_insert_chain()
861 		h->chain_index[0] = c; /* Update chain index head */  in iptc_insert_chain()