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.h b/src/compiler.h
index 5ae46d5..74d3205 100644
--- a/src/compiler.h
+++ b/src/compiler.h
@@ -142,9 +142,11 @@
bool target_is_direct,
size_t literal_offset);
-#if defined(ART_USE_LLVM_COMPILER)
+#if defined(ART_USE_LLVM_COMPILER) || defined(ART_USE_QUICK_COMPILER)
void SetBitcodeFileName(std::string const& filename);
+#endif
+#if defined(ART_USE_LLVM_COMPILER)
void EnableAutoElfLoading();
const void* GetMethodCodeAddr(const CompiledMethod* cm,