| /bionic/libc/kernel/uapi/linux/netfilter/ |
| nfnetlink_compat.h | 36 #define NFA_OK(nfa,len) ((len) > 0 && (nfa)->nfa_len >= sizeof(struct nfattr) && (nfa)->nfa_len <= (len))
37 #define NFA_NEXT(nfa,attrlen) ((attrlen) -= NFA_ALIGN((nfa)->nfa_len), (struct nfattr *) (((char *) (nfa)) + NFA_ALIGN((nfa)->nfa_len)))
40 #define NFA_DATA(nfa) ((void *) (((char *) (nfa)) + NFA_LENGTH(0)))
41 #define NFA_PAYLOAD(nfa) ((int) ((nfa)->nfa_len) - NFA_LENGTH(0)
[all...] |
| /external/kernel-headers/original/uapi/linux/netfilter/ |
| nfnetlink_compat.h | 39 #define NFA_OK(nfa,len) ((len) > 0 && (nfa)->nfa_len >= sizeof(struct nfattr) \
40 && (nfa)->nfa_len <= (len))
41 #define NFA_NEXT(nfa,attrlen) ((attrlen) -= NFA_ALIGN((nfa)->nfa_len), \
42 (struct nfattr *)(((char *)(nfa)) + NFA_ALIGN((nfa)->nfa_len)))
45 #define NFA_DATA(nfa) ((void *)(((char *)(nfa)) + NFA_LENGTH(0)))
46 #define NFA_PAYLOAD(nfa) ((int)((nfa)->nfa_len) - NFA_LENGTH(0)
[all...] |
| /external/libnfnetlink/include/libnfnetlink/ |
| linux_nfnetlink_compat.h | 36 #define NFA_OK(nfa,len) ((len) > 0 && (nfa)->nfa_len >= sizeof(struct nfattr) \
37 && (nfa)->nfa_len <= (len))
38 #define NFA_NEXT(nfa,attrlen) ((attrlen) -= NFA_ALIGN((nfa)->nfa_len), \
39 (struct nfattr *)(((char *)(nfa)) + NFA_ALIGN((nfa)->nfa_len)))
42 #define NFA_DATA(nfa) ((void *)(((char *)(nfa)) + NFA_LENGTH(0)))
43 #define NFA_PAYLOAD(nfa) ((int)((nfa)->nfa_len) - NFA_LENGTH(0)
[all...] |
| libnfnetlink.h | 57 int (*call)(struct nlmsghdr *nlh, struct nfattr *nfa[], void *data);
197 #define nfnl_parse_nested(tb, max, nfa) \
198 nfnl_parse_attr((tb), (max), NFA_DATA((nfa)), NFA_PAYLOAD((nfa)))
206 extern void nfnl_build_nfa_iovec(struct iovec *iov, struct nfattr *nfa,
|
| /external/libnl/include/linux-private/linux/netfilter/ |
| nfnetlink_compat.h | 38 #define NFA_OK(nfa,len) ((len) > 0 && (nfa)->nfa_len >= sizeof(struct nfattr) \
39 && (nfa)->nfa_len <= (len))
40 #define NFA_NEXT(nfa,attrlen) ((attrlen) -= NFA_ALIGN((nfa)->nfa_len), \
41 (struct nfattr *)(((char *)(nfa)) + NFA_ALIGN((nfa)->nfa_len)))
44 #define NFA_DATA(nfa) ((void *)(((char *)(nfa)) + NFA_LENGTH(0)))
45 #define NFA_PAYLOAD(nfa) ((int)((nfa)->nfa_len) - NFA_LENGTH(0)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/netfilter/ |
| nfnetlink_compat.h | 37 #define NFA_OK(nfa,len) ((len) > 0 && (nfa)->nfa_len >= sizeof(struct nfattr) \
38 && (nfa)->nfa_len <= (len))
39 #define NFA_NEXT(nfa,attrlen) ((attrlen) -= NFA_ALIGN((nfa)->nfa_len), \
40 (struct nfattr *)(((char *)(nfa)) + NFA_ALIGN((nfa)->nfa_len)))
43 #define NFA_DATA(nfa) ((void *)(((char *)(nfa)) + NFA_LENGTH(0)))
44 #define NFA_PAYLOAD(nfa) ((int)((nfa)->nfa_len) - NFA_LENGTH(0)
[all...] |
| /external/skia/src/sksl/lex/ |
| RegexNode.cpp | 10 #include "NFA.h"
12 std::vector<int> RegexNode::createStates(NFA* nfa, const std::vector<int>& accept) const {
16 result.push_back(nfa->addState(NFAState(fPayload.fChar, accept)));
38 result.push_back(nfa->addState(NFAState(fPayload.fBool, chars, accept)));
42 std::vector<int> right = fChildren[1].createStates(nfa, accept);
43 result = fChildren[0].createStates(nfa, right);
47 result.push_back(nfa->addState(NFAState(NFAState::kDot_Kind, accept)));
50 std::vector<int> states = fChildren[0].createStates(nfa, accept);
52 states = fChildren[1].createStates(nfa, accept)
[all...] |
| /external/skqp/src/sksl/lex/ |
| RegexNode.cpp | 10 #include "NFA.h"
12 std::vector<int> RegexNode::createStates(NFA* nfa, const std::vector<int>& accept) const {
16 result.push_back(nfa->addState(NFAState(fPayload.fChar, accept)));
38 result.push_back(nfa->addState(NFAState(fPayload.fBool, chars, accept)));
42 std::vector<int> right = fChildren[1].createStates(nfa, accept);
43 result = fChildren[0].createStates(nfa, right);
47 result.push_back(nfa->addState(NFAState(NFAState::kDot_Kind, accept)));
50 std::vector<int> states = fChildren[0].createStates(nfa, accept);
52 states = fChildren[1].createStates(nfa, accept)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| LL1DFA.java | 54 nfa = decisionStartState.nfa;
55 nAlts = nfa.grammar.getNumberOfAltsForDecisionNFA(decisionStartState);
80 nfa = decisionStartState.nfa;
81 nAlts = nfa.grammar.getNumberOfAltsForDecisionNFA(decisionStartState);
107 s.cachedUniquelyPredicatedAlt = NFA.INVALID_ALT_NUMBER;
119 NFAState altLeftEdge = nfa.grammar.getNFAStateForAltOfDecision(decisionStartState, walkAlt);
121 SemanticContext ctx = nfa.grammar.ll1Analyzer.getPredicates(altStartState);
158 nfa.grammar.getNFAStateForAltOfDecision(decisionStartState, walkAlt)
[all...] |
| NFAState.java | 34 /** A state within an NFA. At most 2 transitions emanate from any NFA state. */
36 // I need to distinguish between NFA decision states for (...)* and (...)+
37 // during NFA interpretation.
50 /** For o-A->o type NFA tranitions, record the label that leads to this
56 /** Which NFA are we in? */
57 public NFA nfa = null; field in class:NFAState
63 * the NFA created for them. They both have a loop-exit-or-stay-in
108 public NFAState(NFA nfa)
[all...] |
| DecisionProbe.java | 43 * The information is collected during NFA->DFA conversion and, while
75 * By reaching the same DFA state, a path through the NFA for some input
76 * is able to reach the same NFA state by starting at more than one
155 /** Used while finding a path through an NFA whose edge labels match
271 /** Return all DFA states in this DFA that have NFA configurations that
320 Grammar g = dfa.nfa.grammar;
333 * find the path of NFA states associated with the labels sequence.
334 * Useful tracing where in the NFA, a single input sequence can be
335 * matched. For different alts, you should get different NFA paths.
337 * The first NFA state for all NFA paths will be the same: the startin
[all...] |
| /external/libnfnetlink/src/ |
| libnfnetlink.c | 101 struct nfattr *nfa = NFM_NFA(NLMSG_DATA(nlh)); local
109 nfa, ((void *)nfa - (void *)nlh));
115 while (NFA_OK(nfa, len)) {
116 printf(" nfa@%p: nfa_type=%u, nfa_len=%u\n",
117 nfa, NFA_TYPE(nfa), nfa->nfa_len);
118 nfa = NFA_NEXT(nfa,len)
879 struct nfattr *nfa; local
1312 struct nfattr *nfa[ssh->cb[type].attr_count]; local
[all...] |
| /external/libpcap/ |
| pcap-netfilter-linux.c | 274 struct nfattr *nfa = (struct nfattr *) (buf + NLMSG_ALIGN(nlh->nlmsg_len)); local
276 nfa->nfa_type = mynfa->nfa_type;
277 nfa->nfa_len = NFA_LENGTH(mynfa->nfa_len);
278 memcpy(NFA_DATA(nfa), mynfa->data, mynfa->nfa_len);
279 nlh->nlmsg_len = NLMSG_ALIGN(nlh->nlmsg_len) + NFA_ALIGN(nfa->nfa_len);
339 struct my_nfattr nfa; local
343 nfa.data = &msg;
344 nfa.nfa_type = NFULA_CFG_CMD;
345 nfa.nfa_len = sizeof(msg);
347 return nflog_send_config_msg(handle, family, group_id, &nfa);
354 struct my_nfattr nfa; local
370 struct my_nfattr nfa; local
392 struct my_nfattr nfa; local
408 struct my_nfattr nfa; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Parser/ |
| pgen.c | 17 /* PART ONE -- CONSTRUCT NFA -- Cf. Algorithm 3.2 from [Aho&Ullman 77] */
35 } nfa;
typedef in typeref:struct:_nfa
39 nfa *nf, node *n, int *pa, int *pb);
41 nfa *nf, node *n, int *pa, int *pb);
43 nfa *nf, node *n, int *pa, int *pb);
45 nfa *nf, node *n, int *pa, int *pb);
48 addnfastate(nfa *nf)
63 addnfaarc(nfa *nf, int from, int to, int lbl)
78 static nfa *
81 nfa *nf;
[all...] |
| /external/python/cpython2/Parser/ |
| pgen.c | 17 /* PART ONE -- CONSTRUCT NFA -- Cf. Algorithm 3.2 from [Aho&Ullman 77] */
35 } nfa; typedef in typeref:struct:_nfa
39 nfa *nf, node *n, int *pa, int *pb);
41 nfa *nf, node *n, int *pa, int *pb);
43 nfa *nf, node *n, int *pa, int *pb);
45 nfa *nf, node *n, int *pa, int *pb);
48 addnfastate(nfa *nf)
63 addnfaarc(nfa *nf, int from, int to, int lbl)
78 static nfa *
81 nfa *nf
[all...] |
| /external/libnetfilter_conntrack/src/ |
| callback.c | 32 int __callback(struct nlmsghdr *nlh, struct nfattr *nfa[], void *data)
55 __parse_conntrack(nlh, nfa, ct);
69 __parse_expect(nlh, nfa, exp);
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarUnreachableAltsMessage.java | 59 String fileName = probe.dfa.nfa.grammar.getFileName();
74 probe.dfa.nfa.grammar.getRuleStartState(tokenName);
|
| Interpreter.java | 114 /** For a given input char stream, try to match against the NFA
116 * it is using an NFA because it uses DFAs at each decision point to
210 /** Fill a list of all NFA states visited during the parse */
222 actions.enterRule(s.nfa.grammar.getFileName(), start.enclosingRule.name);
231 s.nfa.grammar.getTokenDisplayName(t));
234 if ( s.getDecisionNumber()>0 && s.nfa.grammar.getNumberOfAltsForDecisionNFA(s)>1 ) {
236 DFA dfa = s.nfa.grammar.getLookaheadDFA(s.getDecisionNumber());
238 if ( s.nfa.grammar.type!=Grammar.LEXER ) {
241 " input="+s.nfa.grammar.getTokenDisplayName(t));
246 if ( predictedAlt == NFA.INVALID_ALT_NUMBER )
[all...] |
| NFAFactory.java | 43 * will help with speed of conversion and make it easier to view NFA. For
47 /** This factory is attached to a specifc NFA that it is building.
48 * The NFA will be filled up with states and transitions.
50 NFA nfa = null; field in class:NFAFactory
62 public NFAFactory(NFA nfa) {
63 nfa.setFactory(this);
64 this.nfa = nfa;
[all...] |
| GrammarAnalysisAbortedMessage.java | 48 String fileName = probe.dfa.nfa.grammar.getFileName();
|
| GrammarNonDeterminismMessage.java | 63 String fileName = probe.dfa.nfa.grammar.getFileName();
82 probe.dfa.nfa.grammar.getRuleStartState(tokenName);
94 // all state paths have to begin with same NFA state
|
| GrammarDanglingStateMessage.java | 57 String fileName = probe.dfa.nfa.grammar.getFileName();
|
| /external/python/cpython3/Parser/ |
| pgen.c | 17 /* PART ONE -- CONSTRUCT NFA -- Cf. Algorithm 3.2 from [Aho&Ullman 77] */
35 } nfa; typedef in typeref:struct:_nfa
39 nfa *nf, node *n, int *pa, int *pb);
41 nfa *nf, node *n, int *pa, int *pb);
43 nfa *nf, node *n, int *pa, int *pb);
45 nfa *nf, node *n, int *pa, int *pb);
48 addnfastate(nfa *nf)
63 addnfaarc(nfa *nf, int from, int to, int lbl)
78 static nfa *
81 nfa *nf
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| dot.stg | 34 digraph NFA {
42 nfa(decisionRanks,states,edges,rankdir,startState) ::= <<
43 digraph NFA {
|
| /packages/apps/Nfc/nci/jni/ |
| Android.mk | 2 NFA := $(VOB_COMPONENTS)/nfa
24 $(NFA)/include \
25 $(NFA)/brcm \
|
