| /src/external/apache2/llvm/dist/llvm/tools/llvm-c-test/ |
| llvm-c-test.h | 27 LLVMModuleRef llvm_load_module(bool Lazy, bool New);
28 int llvm_module_dump(bool Lazy, bool New);
|
| module.c | 27 LLVMModuleRef llvm_load_module(bool Lazy, bool New) {
41 if (Lazy)
46 if (Lazy)
58 if (!Lazy)
64 int llvm_module_dump(bool Lazy, bool New) {
65 LLVMModuleRef M = llvm_load_module(Lazy, New);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| hash-table.h | 372 template <typename Descriptor, bool Lazy = false,
496 if (Lazy && m_entries == NULL)
644 template<typename Descriptor, bool Lazy,
646 hash_table<Descriptor, Lazy, Allocator>::hash_table (size_t size, bool ggc,
670 if (Lazy)
678 template<typename Descriptor, bool Lazy,
680 hash_table<Descriptor, Lazy, Allocator>::hash_table (const hash_table &h,
705 if (Lazy && h.m_entries == NULL)
726 template<typename Descriptor, bool Lazy,
728 hash_table<Descriptor, Lazy, Allocator>::~hash_table (
[all...] |
| hash-set.h | 34 template<typename KeyId, bool Lazy = false,
75 if (Lazy)
93 for (typename hash_table<Traits, Lazy>::iterator iter = m_table.begin ();
113 Lazy>::iterator &iter) :
135 typename hash_table<Traits, Lazy>::iterator m_iter;
153 hash_table<Traits, Lazy> m_table;
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| hash-table.h | 372 template <typename Descriptor, bool Lazy = false,
496 if (Lazy && m_entries == NULL)
602 template<typename Descriptor, bool Lazy,
604 hash_table<Descriptor, Lazy, Allocator>::hash_table (size_t size, bool ggc,
625 if (Lazy)
633 template<typename Descriptor, bool Lazy,
635 hash_table<Descriptor, Lazy, Allocator>::hash_table (const hash_table &h,
655 if (Lazy && h.m_entries == NULL)
674 template<typename Descriptor, bool Lazy,
676 hash_table<Descriptor, Lazy, Allocator>::~hash_table (
[all...] |
| hash-set.h | 34 template<typename KeyId, bool Lazy = false,
70 if (Lazy)
88 for (typename hash_table<Traits, Lazy>::iterator iter = m_table.begin ();
108 Lazy>::iterator &iter) :
130 typename hash_table<Traits, Lazy>::iterator m_iter;
148 hash_table<Traits, Lazy> m_table;
|
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| ASTUnresolvedSet.h | 37 void setLazy(bool Lazy) { setTag(Lazy); }
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DomTreeUpdater.cpp | 59 if (Strategy != UpdateStrategy::Lazy || !DT)
80 if (Strategy != UpdateStrategy::Lazy || !PDT)
104 // After calling deleteBB or callbackDeleteBB under Lazy UpdateStrategy,
131 // Lazy UpdateStrategy so we recalculate available trees immediately.
175 // UpdateStrategy is Lazy. When the UpdateStrategy is
179 if (Strategy == UpdateStrategy::Lazy) {
192 if (Strategy == UpdateStrategy::Lazy) {
234 if (Strategy == UpdateStrategy::Lazy) {
294 if (Strategy == UpdateStrategy::Lazy)
450 OS << "Lazy\n"
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| DomTreeUpdater.h | 30 enum class UpdateStrategy : unsigned char { Eager = 0, Lazy = 1 };
50 /// Returns true if the current strategy is Lazy.
51 bool isLazy() const { return Strategy == UpdateStrategy::Lazy; };
97 /// 2. Lazy UpdateStrategy: Updates are submitted but only flushed when you
109 /// The Eager Strategy flushes updates immediately while the Lazy Strategy
129 /// The Eager Strategy flushes updates immediately while the Lazy Strategy
154 /// Strategy flushes this update immediately while the Lazy Strategy queues
165 /// The Eager Strategy flushes this update immediately while the Lazy Strategy
175 /// Strategy flushes this update immediately while the Lazy Strategy queues
187 /// The Eager Strategy flushes this update immediately while the Lazy Strateg
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/IRTransforms/ |
| SimplifyCFG.cpp | 104 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
176 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
221 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
308 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LowerConstantIntrinsics.cpp | 97 DTU.emplace(DT, DomTreeUpdater::UpdateStrategy::Lazy);
|
| PartiallyInlineLibCalls.cpp | 108 DTU.emplace(DT, DomTreeUpdater::UpdateStrategy::Lazy);
|
| CallSiteSplitting.cpp | 506 DomTreeUpdater DTU(&DT, DomTreeUpdater::UpdateStrategy::Lazy);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFUnit.h | 150 DWARFSectionKind SectionKind, bool Lazy = false);
174 bool IsDWO, bool Lazy, DWARFSectionKind SectionKind);
|
| DWARFContext.h | 103 /// If \p Lazy is true, set up to parse but don't actually parse them.
105 void parseDWOUnits(bool Lazy = false);
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| IndirectBrExpandPass.cpp | 99 DTU.emplace(DTWP->getDomTree(), DomTreeUpdater::UpdateStrategy::Lazy);
|
| DwarfEHPrepare.cpp | 261 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
|
| ShadowStackGCLowering.cpp | 310 DTU.emplace(DTWP->getDomTree(), DomTreeUpdater::UpdateStrategy::Lazy);
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| DWARFUnit.cpp | 49 bool Lazy) {
54 D.getLineDWOSection(), C.isLittleEndian(), true, Lazy,
63 bool Lazy, DWARFSectionKind SectionKind) {
65 // Lazy initialization of Parser, now that we have all section info.
98 if (Lazy)
104 // even if we do lazy parsing.
|
| DWARFContext.cpp | 980 void DWARFContext::parseDWOUnits(bool Lazy) {
984 DWOUnits.addUnitsForDWOSection(*this, S, DW_SECT_INFO, Lazy);
988 DWOUnits.addUnitsForDWOSection(*this, S, DW_SECT_EXT_TYPES, Lazy);
|
| /src/external/apache2/llvm/dist/llvm/lib/LTO/ |
| ThinLTOCodeGenerator.cpp | 189 bool Lazy,
194 Lazy ? Mod.getLazyModule(Context,
205 if (!Lazy)
218 /*Lazy=*/true, /*IsImporting*/ true);
|
| /src/external/apache2/llvm/dist/llvm/tools/obj2yaml/ |
| macho2yaml.cpp | 37 ArrayRef<uint8_t> OpcodeBuffer, bool Lazy = false);
395 ArrayRef<uint8_t> OpcodeBuffer, bool Lazy) {
440 // Lazy bindings have DONE opcodes between operations, so we need to keep
442 if (!Lazy && BindOp.Opcode == MachO::BIND_OPCODE_DONE)
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/ |
| package.d | 168 Lazy version - stops as early as possible.)
172 Lazy version - stops as early as possible.)
176 Lazy version - stops as early as possible.)
181 Lazy version - stops as early as possible.)
185 Lazy version - stops as early as possible, but no less then n times.)
1047 in the given `input`. The result is a lazy range of matches generated
1533 A lazy range of strings
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 647 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
765 DomTreeUpdater LocalDTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Object/ |
| MachO.h | 213 enum class Kind { Regular, Lazy, Weak };
401 /// For use iterating over all lazy bind table entries.
|
