| /external/iptables/include/linux/netfilter_ipv4/ |
| H A D | ipt_conntrack.h | 67 struct ip_conntrack_old_tuple tuple[IP_CT_DIR_MAX]; member in struct:ipt_conntrack_info
|
| /external/kernel-headers/original/linux/netfilter/ |
| H A D | xt_conntrack.h | 53 struct ip_conntrack_old_tuple tuple[IP_CT_DIR_MAX]; member in struct:xt_conntrack_info
|
| /external/kernel-headers/original/linux/netfilter_ipv4/ |
| H A D | ip_conntrack_tuple.h | 7 /* A `tuple' is a structure containing the information to uniquely
8 identify a connection. ie. if two packets have the same tuple, they
15 /* The protocol-specific manipulable parts of the tuple: always in
39 /* The manipulable part of the tuple. */
51 /* These are the parts of the tuple which are fixed. */
86 #define IP_CT_TUPLE_U_BLANK(tuple) \
88 (tuple)->src.u.all = 0; \
89 (tuple)->dst.u.all = 0; \
95 DEBUGP("tuple %p: %u %u.%u.%u.%u:%hu -> %u.%u.%u.%u:%hu\n", \
100 /* If we're the first tuple, i
108 struct ip_conntrack_tuple tuple; member in struct:ip_conntrack_tuple_hash
134 ip_ct_tuple_mask_cmp(const struct ip_conntrack_tuple *t, const struct ip_conntrack_tuple *tuple, const struct ip_conntrack_tuple *mask) argument
[all...] |
| H A D | ip_conntrack.h | 137 /* We expect this tuple, with the following mask */
138 struct ip_conntrack_tuple tuple, mask; member in struct:ip_conntrack_expect
175 tuplehash[hash->tuple.dst.dir]);
181 /* Alter reply tuple (maybe alter helper). */
186 /* Is this tuple taken? (ignoring any belonging to the given
189 ip_conntrack_tuple_taken(const struct ip_conntrack_tuple *tuple,
192 /* Return conntrack_info and tuple hash for given skb. */
258 ip_conntrack_helper_find_get(const struct ip_conntrack_tuple *tuple);
277 __ip_conntrack_expect_find(const struct ip_conntrack_tuple *tuple);
280 ip_conntrack_expect_find(const struct ip_conntrack_tuple *tuple);
[all...] |
| /external/gtest/include/gtest/internal/ |
| H A D | gtest-param-util-generated.h | 41 // by the maximum arity of the implementation of tr1::tuple which is
2670 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2> > {
2672 typedef ::std::tr1::tuple<T1, T2> ParamType;
2779 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3> > {
2781 typedef ::std::tr1::tuple<T1, T2, T3> ParamType;
2905 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4> > {
2907 typedef ::std::tr1::tuple<T1, T2, T3, T4> ParamType;
3050 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4, T5> > {
3052 typedef ::std::tr1::tuple<T1, T2, T3, T4, T5> ParamType;
3212 : public ParamGeneratorInterface< ::std::tr1::tuple<T
[all...] |
| /external/gtest/test/ |
| H A D | gtest-param-test_test.cc | 67 using ::std::tr1::tuple;
404 ::std::ostream& operator<<(::std::ostream& stream, const tuple<T1, T2>& value) { argument
411 const tuple<T1, T2, T3>& value) {
421 const tuple<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10>& value) {
434 const ParamGenerator<tuple<const char*, int> > gen =
437 tuple<const char*, int> expected_values[] = {
445 const ParamGenerator<tuple<int, int, int> > gen = Combine(Values(0, 1),
448 tuple<int, int, int> expected_values[] = {
460 const ParamGenerator<tuple<int, int> > gen = Combine(Values(42),
463 tuple<in
410 operator <<(::std::ostream& stream, const tuple<T1, T2, T3>& value) argument
419 operator <<( ::std::ostream& stream, const tuple<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10>& value) argument
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| H A D | encode.h | 51 Tuple(const Tuple& tuple) argument
52 : ilabel(tuple.ilabel), olabel(tuple.olabel), weight(tuple.weight) {}
113 const Tuple tuple(arc.ilabel,
116 typename EncodeHash::const_iterator it = encode_hash_.find(&tuple);
118 encode_tuples_.push_back(new Tuple(tuple));
137 const Tuple* tuple = encode_tuples_[i]; local
138 WriteType(strm, tuple->ilabel);
139 WriteType(strm, tuple
165 Tuple* tuple = new Tuple(); local
247 const typename EncodeTable<A>::Tuple* tuple = local
[all...] |
| H A D | replace.h | 242 const StateTuple& tuple = state_tuples_[s]; local
243 const StackPrefix& stack = stackprefix_array_[tuple.prefix_id];
244 const Fst<A>* fst = fst_array_[tuple.fst_id];
245 StateId fst_state = tuple.fst_state;
283 StateId FindState(const StateTuple& tuple) { argument
284 typename StateTupleHash::iterator it = state_hash_.find(tuple);
287 state_tuples_.push_back(tuple);
288 state_hash_[tuple] = new_state_id;
297 StateTuple tuple = state_tuples_[s]; local
298 const Fst<A>* fst = fst_array_[tuple
[all...] |
| H A D | compose.h | 185 // of state tuple lookup, i.e. a bijective mapping from triples of two
190 // to the value associated with x. If x is an unassigned tuple, the
195 // ComposeFstImpl. The value stored in the table is equal to tuple ID
197 // table[x] is equal to 0 if and only if x is an unassigned tuple (in
201 // ID))" if x is an unassigned tuple.
222 // NB: if 'tuple' is not in 'table_', the pair (tuple, StateId()) is
226 StateId &operator[](const StateTuple &tuple) { argument
227 return table_[tuple];
266 // State tuple looku
296 operator [](const StateTuple &tuple) argument
420 FindState(const StateTuple& tuple) argument
453 StateTuple &tuple = state_tuples_[s]; local
632 StateTuple &tuple = state_tuples_[s]; local
[all...] |