mirror of
				https://github.com/c64scene-ar/llvm-6502.git
				synced 2025-10-30 16:17:05 +00:00 
			
		
		
		
	framework. It's purpose is not to improve register allocation per se, but to make it easier to develop powerful live range splitting. I call it the basic allocator because it is as simple as a global allocator can be but provides the building blocks for sophisticated register allocation with live range splitting. A minimal implementation is provided that trivially spills whenever it runs out of registers. I'm checking in now to get high-level design and style feedback. I've only done minimal testing. The next step is implementing a "greedy" allocation algorithm that does some register reassignment and makes better splitting decisions. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@117174 91177308-0d34-0410-b5e6-96231b3b80d8
		
			
				
	
	
		
			59 lines
		
	
	
		
			2.2 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			59 lines
		
	
	
		
			2.2 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| //===- llvm/Codegen/LinkAllCodegenComponents.h ------------------*- C++ -*-===//
 | |
| //
 | |
| //                      The LLVM Compiler Infrastructure
 | |
| //
 | |
| // This file is distributed under the University of Illinois Open Source
 | |
| // License. See LICENSE.TXT for details.
 | |
| //
 | |
| //===----------------------------------------------------------------------===//
 | |
| //
 | |
| // This header file pulls in all codegen related passes for tools like lli and
 | |
| // llc that need this functionality.
 | |
| //
 | |
| //===----------------------------------------------------------------------===//
 | |
| 
 | |
| #ifndef LLVM_CODEGEN_LINKALLCODEGENCOMPONENTS_H
 | |
| #define LLVM_CODEGEN_LINKALLCODEGENCOMPONENTS_H
 | |
| 
 | |
| #include "llvm/CodeGen/Passes.h"
 | |
| #include "llvm/CodeGen/SchedulerRegistry.h"
 | |
| #include "llvm/CodeGen/GCs.h"
 | |
| #include "llvm/Target/TargetMachine.h"
 | |
| #include <cstdlib>
 | |
| 
 | |
| namespace {
 | |
|   struct ForceCodegenLinking {
 | |
|     ForceCodegenLinking() {
 | |
|       // We must reference the passes in such a way that compilers will not
 | |
|       // delete it all as dead code, even with whole program optimization,
 | |
|       // yet is effectively a NO-OP. As the compiler isn't smart enough
 | |
|       // to know that getenv() never returns -1, this will do the job.
 | |
|       if (std::getenv("bar") != (char*) -1)
 | |
|         return;
 | |
| 
 | |
|       (void) llvm::createDeadMachineInstructionElimPass();
 | |
| 
 | |
|       (void) llvm::createFastRegisterAllocator();
 | |
|       (void) llvm::createBasicRegisterAllocator();
 | |
|       (void) llvm::createLinearScanRegisterAllocator();
 | |
|       (void) llvm::createDefaultPBQPRegisterAllocator();
 | |
| 
 | |
|       (void) llvm::createSimpleRegisterCoalescer();
 | |
|       
 | |
|       llvm::linkOcamlGC();
 | |
|       llvm::linkShadowStackGC();
 | |
|       
 | |
|       (void) llvm::createBURRListDAGScheduler(NULL, llvm::CodeGenOpt::Default);
 | |
|       (void) llvm::createTDRRListDAGScheduler(NULL, llvm::CodeGenOpt::Default);
 | |
|       (void) llvm::createSourceListDAGScheduler(NULL,llvm::CodeGenOpt::Default);
 | |
|       (void) llvm::createHybridListDAGScheduler(NULL,llvm::CodeGenOpt::Default);
 | |
|       (void) llvm::createTDListDAGScheduler(NULL, llvm::CodeGenOpt::Default);
 | |
|       (void) llvm::createFastDAGScheduler(NULL, llvm::CodeGenOpt::Default);
 | |
|       (void) llvm::createDefaultScheduler(NULL, llvm::CodeGenOpt::Default);
 | |
| 
 | |
|     }
 | |
|   } ForceCodegenLinking; // Force link by creating a global definition.
 | |
| }
 | |
| 
 | |
| #endif
 |