HomeSort by: relevance | last modified time | path
    Searched defs:Reverse (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/AST/
ExternalASTMerger.cpp 95 /// - It maintains a reverse importer for use with names. This allows lookup of
102 ASTImporter Reverse;
121 Reverse(S.getASTContext(), S.getFileManager(), ToContext, ToFileManager,
244 ASTImporter &GetReverse() { return Reverse; }
291 ASTImporter &Reverse =
293 if (auto SourceDC = LookupSameContext(SourceTU, DC, Reverse)) {
295 if (Callback(*Importer, Reverse, SourceDC))
310 ForEachMatchingDC(Tag, [&](ASTImporter &Forward, ASTImporter &Reverse,
328 Interface, [&](ASTImporter &Forward, ASTImporter &Reverse,
349 [&](ASTImporter &Forward, ASTImporter &Reverse,
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/TableGen/
SetTheory.cpp 125 const bool Reverse;
127 RotOp(bool Rev) : Reverse(Rev) {}
131 if (Reverse)
  /xsrc/external/mit/brotli/dist/c/enc/
entropy_encode.c 152 static void Reverse(uint8_t* v, size_t start, size_t end) {
203 Reverse(tree, start, *tree_size);
204 Reverse(extra_bits_data, start, *tree_size);
239 Reverse(tree, start, *tree_size);
240 Reverse(extra_bits_data, start, *tree_size);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
VectorUtils.h 374 /// This is the reverse process of widening shuffle mask elements, but it always
392 /// This is the reverse process of narrowing shuffle mask elements if it
584 InterleaveGroup(uint32_t Factor, bool Reverse, Align Alignment)
585 : Factor(Factor), Reverse(Reverse), Alignment(Alignment),
593 Reverse = Stride < 0;
597 bool isReverse() const { return Reverse; }
698 bool Reverse;
822 // The access's stride. It is negative for a reverse access.

Completed in 23 milliseconds