Lines Matching full:info
327 if (strcmp(h->info.name, "filter") == 0) {
328 assert(h->info.valid_hooks
334 assert(h->info.hook_entry[NF_IP_LOCAL_IN] == 0);
338 assert(h->info.hook_entry[NF_IP_FORWARD] == n);
342 assert(h->info.hook_entry[NF_IP_LOCAL_OUT] == n);
344 user_offset = h->info.hook_entry[NF_IP_LOCAL_OUT];
345 } else if (strcmp(h->info.name, "nat") == 0) {
346 assert((h->info.valid_hooks
350 (h->info.valid_hooks
356 assert(h->info.hook_entry[NF_IP_PRE_ROUTING] == 0);
361 assert(h->info.hook_entry[NF_IP_POST_ROUTING] == n);
365 assert(h->info.hook_entry[NF_IP_LOCAL_OUT] == n);
366 user_offset = h->info.hook_entry[NF_IP_LOCAL_OUT];
368 if (h->info.valid_hooks & (1 << NF_IP_LOCAL_IN)) {
371 assert(h->info.hook_entry[NF_IP_LOCAL_IN] == n);
372 user_offset = h->info.hook_entry[NF_IP_LOCAL_IN];
375 } else if (strcmp(h->info.name, "mangle") == 0) {
379 assert((h->info.valid_hooks
382 (h->info.valid_hooks
390 assert(h->info.hook_entry[NF_IP_PRE_ROUTING] == 0);
394 if (h->info.valid_hooks & (1 << NF_IP_LOCAL_IN)) {
396 assert(h->info.hook_entry[NF_IP_LOCAL_IN] == n);
400 if (h->info.valid_hooks & (1 << NF_IP_FORWARD)) {
402 assert(h->info.hook_entry[NF_IP_FORWARD] == n);
407 assert(h->info.hook_entry[NF_IP_LOCAL_OUT] == n);
408 user_offset = h->info.hook_entry[NF_IP_LOCAL_OUT];
410 if (h->info.valid_hooks & (1 << NF_IP_POST_ROUTING)) {
413 assert(h->info.hook_entry[NF_IP_POST_ROUTING] == n);
414 user_offset = h->info.hook_entry[NF_IP_POST_ROUTING];
416 } else if (strcmp(h->info.name, "raw") == 0) {
417 assert(h->info.valid_hooks
422 assert(h->info.hook_entry[NF_IP_PRE_ROUTING] == 0);
426 assert(h->info.hook_entry[NF_IP_LOCAL_OUT] == n);
428 user_offset = h->info.hook_entry[NF_IP_LOCAL_OUT];
431 } else if (strcmp(h->info.name, "drop") == 0) {
432 assert(h->info.valid_hooks == (1 << NF_IP_DROPPING));
435 assert(h->info.hook_entry[NF_IP_DROPPING] == 0);
439 fprintf(stderr, "Unknown table `%s'\n", h->info.name);
453 if (!(h->info.valid_hooks & (1 << i)))
455 assert(h->info.underflow[i]
456 == get_chain_end(h, h->info.hook_entry[i]));
458 e = get_entry(h, get_chain_end(h, h->info.hook_entry[i]));
469 entry2index(h, get_entry(h, h->info.hook_entry[i]));
470 entry2index(h, get_entry(h, h->info.underflow[i]));
473 assert(h->info.size
474 >= h->info.num_entries * (sizeof(STRUCT_ENTRY)
481 assert(strcmp(h->info.name, h->entries.name) == 0);
