Foundation for Quick LLVM compiler
Ready for review - probably better get this cleaned up and
checked in even though much work remains.
Basic conversion from MIR to GreenlandIR and from GreenlandIR
back to LIR. Support sufficient to run Fibonacci test.
Note some structural changes in MIR to support this work:
o retaining incoming label for phi nodes
o constant propagation
o include object reference detection in type inference pass
Change-Id: I8ba63c73e76d071aa40cae0f744e598b96f68699
diff --git a/src/compiler.cc b/src/compiler.cc
index 477b6cc..2e17c9b 100644
--- a/src/compiler.cc
+++ b/src/compiler.cc
@@ -1668,7 +1668,7 @@
compiled_method->SetGcMap(*gc_map);
}
-#if defined(ART_USE_LLVM_COMPILER)
+#if defined(ART_USE_LLVM_COMPILER) || defined(ART_USE_QUICK_COMPILER)
void Compiler::SetBitcodeFileName(std::string const& filename) {
typedef void (*SetBitcodeFileNameFn)(Compiler&, std::string const&);
@@ -1679,7 +1679,9 @@
set_bitcode_file_name(*this, filename);
}
+#endif
+#if defined(ART_USE_LLVM_COMPILER)
void Compiler::EnableAutoElfLoading() {
compiler_enable_auto_elf_loading_(*this);
}