Home
last modified time | relevance | path

Searched refs:matchp (Results 1 – 6 of 6) sorted by relevance

/external/iptables/iptables/
Dxshared.c116 struct xtables_rule_match *matchp; in command_default() local
128 for (matchp = cs->matches; matchp; matchp = matchp->next) { in command_default()
129 m = matchp->match; in command_default()
131 if (matchp->completed || in command_default()
134 if (cs->c < matchp->match->option_offset || in command_default()
135 cs->c >= matchp->match->option_offset + XT_OPTION_OFFSET_SCALE) in command_default()
Dip6tables.c726 const struct xtables_rule_match *matchp; in make_delete_mask() local
730 for (matchp = matches; matchp; matchp = matchp->next) in make_delete_mask()
731 size += XT_ALIGN(sizeof(struct xt_entry_match)) + matchp->match->size; in make_delete_mask()
740 for (matchp = matches; matchp; matchp = matchp->next) { in make_delete_mask()
743 + matchp->match->userspacesize); in make_delete_mask()
744 mptr += XT_ALIGN(sizeof(struct xt_entry_match)) + matchp->match->size; in make_delete_mask()
1192 struct xtables_rule_match *matchp; in generate_entry() local
1196 for (matchp = matches; matchp; matchp = matchp->next) in generate_entry()
1197 size += matchp->match->m->u.match_size; in generate_entry()
1205 for (matchp = matches; matchp; matchp = matchp->next) { in generate_entry()
[all …]
Diptables.c711 const struct xtables_rule_match *matchp; in make_delete_mask() local
715 for (matchp = matches; matchp; matchp = matchp->next) in make_delete_mask()
716 size += XT_ALIGN(sizeof(struct xt_entry_match)) + matchp->match->size; in make_delete_mask()
725 for (matchp = matches; matchp; matchp = matchp->next) { in make_delete_mask()
728 + matchp->match->userspacesize); in make_delete_mask()
729 mptr += XT_ALIGN(sizeof(struct xt_entry_match)) + matchp->match->size; in make_delete_mask()
1183 struct xtables_rule_match *matchp; in generate_entry() local
1187 for (matchp = matches; matchp; matchp = matchp->next) in generate_entry()
1188 size += matchp->match->m->u.match_size; in generate_entry()
1196 for (matchp = matches; matchp; matchp = matchp->next) { in generate_entry()
[all …]
/external/iptables/libxtables/
Dxtables.c1081 struct xtables_rule_match *matchp, *tmp; in xtables_rule_matches_free() local
1083 for (matchp = *matches; matchp;) { in xtables_rule_matches_free()
1084 tmp = matchp->next; in xtables_rule_matches_free()
1085 if (matchp->match->m) { in xtables_rule_matches_free()
1086 free(matchp->match->m); in xtables_rule_matches_free()
1087 matchp->match->m = NULL; in xtables_rule_matches_free()
1089 if (matchp->match == matchp->match->next) { in xtables_rule_matches_free()
1090 free(matchp->match); in xtables_rule_matches_free()
1091 matchp->match = NULL; in xtables_rule_matches_free()
1093 free(matchp); in xtables_rule_matches_free()
[all …]
/external/regex-re2/re2/
Dre2.cc552 StringPiece* matchp = &match; in Match() local
554 matchp = NULL; in Match()
615 matchp, &dfa_failed, NULL)) { in Match()
635 if (matchp == NULL) // Matched. Don't care where in Match()
/external/llvm/lib/Support/
Dregengine.inc779 const char *matchp; /* last p at which a match ended */
786 matchp = NULL;
827 matchp = p;
841 return(matchp);