| /external/llvm-project/clang-tools-extra/clangd/index/ |
| D | ProjectAware.cpp | 53 void relations(const RelationsRequest &Req,
107 void ProjectAwareIndex::relations( in relations() function in clang::clangd::__anonc1793c800111::ProjectAwareIndex
112 return Idx->relations(Req, Callback); in relations()
|
| D | Index.cpp | 73 void SwapIndex::relations( in relations() function in clang::clangd::SwapIndex
76 return snapshot()->relations(R, CB); in relations()
|
| D | Index.h | 119 virtual void relations(
144 void relations(const RelationsRequest &,
|
| D | Merge.cpp | 130 void MergedIndex::relations( in relations() function in clang::clangd::MergedIndex
139 Dynamic->relations(Req, [&](const SymbolID &Subject, const Symbol &Object) { in relations()
146 Static->relations(Req, [&](const SymbolID &Subject, const Symbol &Object) { in relations()
|
| D | Merge.h | 45 void relations(const RelationsRequest &,
|
| D | MemIndex.h | 61 void relations(const RelationsRequest &Req,
|
| D | MemIndex.cpp | 91 void MemIndex::relations( in relations() function in clang::clangd::MemIndex
|
| /external/llvm-project/polly/lib/External/isl/ |
| D | README | 1 isl is a thread-safe C library for manipulating sets and relations
3 the sets and relations may involve both parameters and existentially
|
| /external/llvm/test/Analysis/BasicAA/ |
| D | 2003-11-04-SimpleCases.ll | 1 ; This testcase consists of alias relations which should be completely
|
| D | 2003-12-11-ConstExprGEP.ll | 1 ; This testcase consists of alias relations which should be completely
|
| /external/llvm/test/Analysis/CFLAliasAnalysis/Steensgaard/ |
| D | simple.ll | 1 ; This testcase consists of alias relations which should be completely
|
| D | const-expr-gep.ll | 1 ; This testcase consists of alias relations which should be completely
|
| /external/llvm-project/llvm/test/Analysis/CFLAliasAnalysis/Steensgaard/ |
| D | simple.ll | 1 ; This testcase consists of alias relations which should be completely
|
| D | const-expr-gep.ll | 1 ; This testcase consists of alias relations which should be completely
|
| /external/llvm-project/llvm/test/Analysis/BasicAA/ |
| D | 2003-11-04-SimpleCases.ll | 1 ; This testcase consists of alias relations which should be completely
|
| D | 2003-12-11-ConstExprGEP.ll | 1 ; This testcase consists of alias relations which should be completely
|
| D | 128-bit-ptr.ll | 1 ; This testcase consists of alias relations on 128-bit pointers that
|
| /external/llvm-project/clang-tools-extra/clangd/index/dex/ |
| D | Dex.h | 83 void relations(const RelationsRequest &Req,
|
| /external/llvm-project/clang-tools-extra/clangd/test/ |
| D | memory_tree.test | 33 # CHECK-NEXT: "relations": {
|
| /external/llvm-project/polly/lib/External/isl/doc/ |
| D | isl.bib | 334 of statement instances, the access relations, the dependences and
336 relations of sequences of integers bounded by (quasi-)affine constraints.
337 When these sets and relations are represented in disjunctive normal form,
473 …keywords = {Polyhedral compilation, Presburger relations, code generation, index set splitting, un…
|
| D | implementation.tex | 28 $R$ is a finite union of basic relations
76 $S \in \Z^n \to 2^{\Z^{d_2+d_3}}$ be two relations,
393 {\tt isl} performs such simplifications on all sets and relations.
519 sets and relations in {\tt isl}. Instead, {\tt isl} represents
828 expressions in the internal representation of sets and relations
921 relations in $R$ as simply adding one or more offsets to a domain element
948 the same as the number of basic relations in $R$.
1003 The path that consists of only identity relations is removed
1006 that the relations we compose in \eqref{eq:transitive:decompose}
1007 each consist of two basic relations. If there are $m$
[all …]
|
| /external/llvm-project/clang-tools-extra/clangd/index/remote/ |
| D | Client.cpp | 105 relations(const clangd::RelationsRequest &Request, in relations() function in clang::clangd::remote::__anon64f54a130111::IndexClient
|
| D | Index.proto | 127 // SymbolIndex::relations callback.
|
| /external/llvm-project/llvm/docs/Proposals/ |
| D | VectorizationPlan.rst | 118 control-flow relations with other VPBlocks. Note that in contrast to the IR
149 The base of VPlan's def-use relations class hierarchy. When instantiated, it
199 it needs to model the relevant instructions along with their def/use relations.
|
| /external/llvm-project/llvm/test/TableGen/ |
| D | ConcatenatedSubregs.td | 2 // Checks that tablegen correctly and completely infers subregister relations.
|