| /openbsd-src/usr.bin/rpcgen/ |
| H A D | rpc_parse.h | 53 enum relation { enum
59 typedef enum relation relation; typedef
64 relation rel;
85 relation rel;
|
| H A D | rpc_cout.c | 55 static void print_ifstat(int, char *, char *, relation, char *, char *, char *);
63 void emit_single_in_line(declaration *, int, relation);
229 relation rel;
638 relation rel = def->def.ty.rel;
652 relation rel = dec->rel;
694 relation rel;
|
| H A D | rpc_util.h | 110 int isvectordef(char *, relation);
|
| H A D | rpc_util.c | 207 relation rel;
|
| H A D | rpc_hout.c | 393 relation rel = def->def.ty.rel;
|
| /openbsd-src/gnu/llvm/llvm/docs/ |
| H A D | HowToUseInstrMappings.rst | 27 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 …]
|
| H A D | ConvergenceAndUniformity.rst | 132 *Converged-with* is a transitive symmetric relation over dynamic
167 relation). The resulting convergence order includes the edges ``P ->
171 constraint on the *converged-with* relation. It is trivially satisfied
176 *converged-with* relation imposed in LLVM IR.
187 2. The convergence-before relation is not
190 changes the convergence-before relation.
202 transforms. Constraints on the ``converged-with`` relation may
214 produce a *maximal converged-with* relation without violating the
216 relation is reasonable for real targets and is compatible with
219 The maximal converged-with relation is defined in terms of cycle
[all …]
|
| H A D | MergeFunctions.rst | 229 *strict and non-strict order relation properties*:
394 The main purpose of this method is to determine relation between such values.
445 but, in general, we need to implement antisymmetric relation. As mentioned
644 6. For some particular instructions, check equivalence (relation in our case) of
|
| H A D | MemorySSA.rst | 196 like the dominance relation between ``MemoryAccess``\ es, and get the
398 ``MemorySSA`` is meant to reason about the relation between memory
|
| H A D | AArch64SME.rst | 21 Below we describe the LLVM IR attributes and their relation to the C/C++
|
| /openbsd-src/gnu/llvm/libcxx/include/__concepts/ |
| H A D | relation.h | 26 concept relation = variable
33 concept equivalence_relation = relation<_Rp, _Tp, _Up>;
38 concept strict_weak_order = relation<_Rp, _Tp, _Up>;
|
| /openbsd-src/gnu/usr.bin/perl/cpan/Test-Simple/t/Test2/behavior/ |
| H A D | trace_signature.t | 37 is($e->related($events->[0]), undef, "Cannot check relation, invalid trace");
40 is($e->related($events->[0]), undef, "Cannot check relation, incomplete trace");
43 is($e->related($events->[0]), undef, "Cannot check relation, incomplete trace");
|
| /openbsd-src/gnu/llvm/libcxx/include/ |
| H A D | concepts | 117 // [concept.relation], concept relation
119 concept relation = see below;
150 #include <__concepts/relation.h>
|
| H A D | CMakeLists.txt | 270 __concepts/relation.h
|
| /openbsd-src/gnu/usr.bin/perl/cpan/CPAN-Meta/lib/CPAN/Meta/ |
| H A D | Converter.pm | 485 my ($relation, $key, $meta, $to_version) = @_;
486 return unless $relation && ref $relation eq 'HASH';
487 return _convert( $relation, $relation_spec, $to_version );
|
| H A D | Validator.pm | 88 name => \&relation,
963 sub relation { subroutine
|
| /openbsd-src/usr.bin/yacc/ |
| H A D | lalr.c | 533 digraph(short **relation) in digraph() argument
541 R = relation; in digraph()
|
| /openbsd-src/gnu/gcc/gcc/doc/ |
| H A D | loop.texi | 178 relation, and breath-first search order, respectively.
467 inserts a single @code{chrec_dont_know} in the dependence relation
536 The structure describing the relation between two data references is
547 set to @code{NULL_TREE} if there exist a dependence relation between the
548 data references, and the description of this dependence relation is
551 @item a boolean that determines whether the dependence relation can be
|
| /openbsd-src/gnu/llvm/clang/docs/analyzer/developer-docs/ |
| H A D | InitializerLists.rst | 200 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
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/ |
| H A D | HexagonInstrFormats.td | 178 // Fields used for relation models.
|
| H A D | Hexagon.td | 167 // Classes used for relation maps.
|
| /openbsd-src/gnu/llvm/clang/docs/ |
| H A D | DataFlowAnalysisIntro.md | 80 inclusion relation as ordering and set union as a join.
512 between failure states is determined by inclusion relation on the set of
514 between normal states is determined by reversed inclusion relation on the set of
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Target/ |
| H A D | Target.td | 1786 // instructions in a row of the relation table. Think of this as a set of
1789 // if we want to define a relation that maps 'Add' instruction to its
1802 // in a column of the relation table.
1811 // that models this relation) should be non-predicated.
1816 // each column in the relation table.
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/PowerPC/ |
| H A D | PPC.td | 463 // Classes used for relation maps.
|
| /openbsd-src/gnu/llvm/llvm/utils/gn/secondary/libcxx/include/ |
| H A D | BUILD.gn | 345 "__concepts/relation.h",
|