Home
last modified time | relevance | path

Searched refs:relation (Results 1 – 25 of 211) sorted by relevance

123456789

/netbsd-src/usr.bin/rpcgen/
H A Drpc_parse.h50 enum relation { enum
56 typedef enum relation relation; typedef
61 relation rel;
82 relation rel;
H A Drpc_util.h113 int isvectordef(const char *, relation);
132 void emit_single_in_line(declaration *, int, relation);
H A Drpc_cout.c67 static void print_ifstat(int, const char *, const char *, relation,
227 print_ifstat(int indent, const char *prefix, const char *type, relation rel, in print_ifstat()
615 relation rel = def->def.ty.rel; in emit_typedef()
627 relation rel = dec->rel; in print_stat()
669 emit_single_in_line(declaration *decl, int flag, relation rel) in emit_single_in_line()
H A Drpc_util.c206 isvectordef(const char *type, relation rel) in isvectordef()
H A Drpc_hout.c427 relation rel = def->def.ty.rel; in ptypedef()
/netbsd-src/external/apache2/llvm/dist/llvm/docs/
H A DHowToUseInstrMappings.rst27 describe all the instructions using that model. TableGen parses all the relation
28 models and uses the information to construct relation tables which relate
37 // relation model.
41 // a row of the relation table. Think of this as a set of properties shared
46 // in a column of the relation table.
51 // using this relation model.
55 // each column in the relation table. These are the instructions a key
81 // row in the resulting relation table.
90 // for a relation. Key instruction is passed as an argument
91 // to the function used for querying relation tables. Column instructions
[all …]
/netbsd-src/external/mpl/dhcp/bind/dist/lib/dns/
H A Dnsec.c319 dns_namereln_t relation; in dns_nsec_noexistnodata() local
338 relation = dns_name_fullcompare(name, nsecname, &order, &olabels); in dns_nsec_noexistnodata()
391 if (relation == dns_namereln_subdomain && in dns_nsec_noexistnodata()
405 if (relation == dns_namereln_subdomain && in dns_nsec_noexistnodata()
417 relation = dns_name_fullcompare(&nsec.next, name, &order, &nlabels); in dns_nsec_noexistnodata()
435 if (order > 0 && relation == dns_namereln_subdomain) { in dns_nsec_noexistnodata()
/netbsd-src/external/mpl/bind/dist/lib/dns/
H A Dnsec.c346 dns_namereln_t relation; in dns_nsec_noexistnodata()
375 relation = dns_name_fullcompare(name, nsecname, &order, &olabels); in dns_nsec_noexistnodata()
428 if (relation == dns_namereln_subdomain && in dns_nsec_noexistnodata()
442 if (relation == dns_namereln_subdomain && in dns_nsec_noexistnodata()
454 relation = dns_name_fullcompare(&nsec.next, name, &order, &nlabels); in dns_nsec_noexistnodata()
472 if (order > 0 && relation == dns_namereln_subdomain) { in dns_nsec_noexistnodata()
347 dns_namereln_t relation; dns_nsec_noexistnodata() local
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dgimple-range-fold.cc931 relation_kind relation = src.query_relation (arg0, arg1); in range_of_builtin_ubsan_call() local
937 op->fold_range (r, type, ir0, ir1, relation); in range_of_builtin_ubsan_call()
1482 relation_kind relation = handler->op1_op2_relation (e0_range); in register_outgoing_edges() local
1483 if (relation != VREL_NONE) in register_outgoing_edges()
1484 register_relation (e0, relation, ssa1, ssa2); in register_outgoing_edges()
1488 relation_kind relation = handler->op1_op2_relation (e1_range); in register_outgoing_edges() local
1489 if (relation != VREL_NONE) in register_outgoing_edges()
1490 register_relation (e1, relation, ssa1, ssa2); in register_outgoing_edges()
1517 relation_kind relation = handler->op1_op2_relation (r); in register_outgoing_edges() local
1518 if (relation != VREL_NONE) in register_outgoing_edges()
[all …]
H A Dvalue-relation.cc996 const value_relation &relation) in register_transitives() argument
1000 switch (relation.kind ()) in register_transitives()
1011 const_bitmap equiv1 = equiv_set (relation.op1 (), root_bb); in register_transitives()
1012 const_bitmap equiv2 = equiv_set (relation.op2 (), root_bb); in register_transitives()
1061 r1 = relation.op1 (); in register_transitives()
1063 r2 = relation.op2 (); in register_transitives()
1065 value_relation nr (relation.kind (), r1, r2); in register_transitives()
/netbsd-src/external/mpl/bind/dist/tests/dns/
H A Dname_test.c51 dns_namereln_t relation; in ISC_RUN_TEST_IMPL()
57 dns_namereln_t relation; in ISC_RUN_TEST_IMPL()
109 relation = dns_name_fullcompare(name1, name1, &order, &nlabels); in ISC_RUN_TEST_IMPL()
110 assert_int_equal(relation, dns_namereln_equal); in ISC_RUN_TEST_IMPL()
118 relation = dns_name_fullcompare(name1, name2, &order, &nlabels); in ISC_RUN_TEST_IMPL()
119 assert_int_equal(relation, data[i].relation); in ISC_RUN_TEST_IMPL()
52 dns_namereln_t relation; ISC_RUN_TEST_IMPL() local
58 dns_namereln_t relation; ISC_RUN_TEST_IMPL() member
/netbsd-src/external/mit/isl/dist/doc/
H A Dimplementation.tex27 A {\em polyhedral relation}\index{polyhedral relation}
48 Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation.
54 Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation.
64 Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation.
92 Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation.
108 basic set or basic relation that contains a given set or relation.
520 the constraints of a set or relation in disjunctive normal form.
840 Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation and
842 a positive number, then power $k$ of relation $R$ is defined as
856 Let $R \in \Z^n \to 2^{\Z^{d+d}}$ be a relation,
[all …]
H A Duser.pod77 is now expressed as the domain of the resulting relation.
133 Note that the space of an C<isl_aff> is that of relation.
226 Note that the may dependence relation returned by
1029 Whenever a new set, relation or similar object is created from scratch,
1062 for a relation, the space
1964 the domain or range of a relation can be a nested relation.
2159 A basic set or relation can be converted to a set or relation
2193 union set or relation is known to contain elements in exactly one
2241 from a universe set or relation, adding equality and/or
2347 A basic set or relation can also be constructed from two matrices
[all …]
/netbsd-src/external/apache2/llvm/dist/libcxx/include/
H A Dconcepts117 // [concept.relation], concept relation
119 concept relation = see below;
431 // [concept.relation]
433 concept relation =
439 concept equivalence_relation = relation<_Rp, _Tp, _Up>;
443 concept strict_weak_order = relation<_Rp, _Tp, _Up>;
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/std/
H A Dconcepts347 /// [concept.relation], concept relation
349 concept relation
355 concept equivalence_relation = relation<_Rel, _Tp, _Up>;
359 concept strict_weak_order = relation<_Rel, _Tp, _Up>;
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/std/
H A Dconcepts347 /// [concept.relation], concept relation
349 concept relation
355 concept equivalence_relation = relation<_Rel, _Tp, _Up>;
359 concept strict_weak_order = relation<_Rel, _Tp, _Up>;
/netbsd-src/external/mit/isl/dist/test_inputs/codegen/
H A Dempty.in2 # executed relation and fail to detect this emptiness.
/netbsd-src/external/lgpl3/mpc/dist/tests/
H A Dtan.dat109 # [conj] gives no new relation since nan has no sign
110 # [odd] gives no new relation since we already considered y < 0
/netbsd-src/external/bsd/openldap/dist/doc/guide/admin/
H A Dappendix-ldap-result-codes.sdf11 We have expanded the description of each error in relation to the OpenLDAP
50 relation to other operations (of same or different type).
/netbsd-src/usr.sbin/altq/libaltq/
H A Dqop.c1005 * when a new filter is added, we check the relation to the existing filters
1039 int relation; in add_filter_rule() local
1051 relation = filt_check_relation(&front->fltr, &back->fltr); in add_filter_rule()
1053 switch (relation) { in add_filter_rule()
/netbsd-src/external/gpl3/gcc/dist/gcc/doc/
H A Dloop.texi210 relation, and breath-first search order, respectively.
521 inserts a single @code{chrec_dont_know} in the dependence relation
590 The structure describing the relation between two data references is
601 set to @code{NULL_TREE} if there exist a dependence relation between the
602 data references, and the description of this dependence relation is
605 @item a boolean that determines whether the dependence relation can be
/netbsd-src/external/gpl3/gcc.old/dist/gcc/doc/
H A Dloop.texi209 relation, and breath-first search order, respectively.
520 inserts a single @code{chrec_dont_know} in the dependence relation
589 The structure describing the relation between two data references is
600 set to @code{NULL_TREE} if there exist a dependence relation between the
601 data references, and the description of this dependence relation is
604 @item a boolean that determines whether the dependence relation can be
/netbsd-src/external/apache2/llvm/dist/clang/docs/analyzer/developer-docs/
H A DInitializerLists.rst200 class for that if we eg. want it typed). The problem is that the relation
202 immaterial, similarly to the relation between ``SymbolRegionValue`` and its parent
257 all. For ghost member variables, the relation with their parent region (which
/netbsd-src/external/bsd/am-utils/dist/
H A Dldap-id.ms41 relation between this schema and the automount schema elements in [HOWARD]
H A Dldap-id.txt25 are prefixed by amdSchema-id to be assigned later. The relation between this

123456789