mirror of
				https://github.com/c64scene-ar/llvm-6502.git
				synced 2025-10-31 08:16:47 +00:00 
			
		
		
		
	This change is the first in a series of changes improving LLVM's Block Frequency propogation implementation to not lose probability mass in branchy code when propogating block frequency information from a basic block to its successors. This patch is a simple infrastructure improvement that does not actually modify the block frequency algorithm. The specific changes are: 1. Changes the division algorithm used when scaling block frequencies by branch probabilities to a short division algorithm. This gives us the remainder for free as well as provides a nice speed boost. When I benched the old routine and the new routine on a Sandy Bridge iMac with disabled turbo mode performing 8192 iterations on an array of length 32768, I saw ~600% increase in speed in mean/median performance. 2. Exposes a scale method that returns a remainder. This is important so we can ensure that when we scale a block frequency by some branch probability BP = N/D, the remainder from the division by D can be retrieved and propagated to other children to ensure no probability mass is lost (more to come on this). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@194950 91177308-0d34-0410-b5e6-96231b3b80d8
		
			
				
	
	
		
			90 lines
		
	
	
		
			2.8 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			90 lines
		
	
	
		
			2.8 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| //===-------- BlockFrequency.h - Block Frequency Wrapper --------*- C++ -*-===//
 | |
| //
 | |
| //                     The LLVM Compiler Infrastructure
 | |
| //
 | |
| // This file is distributed under the University of Illinois Open Source
 | |
| // License. See LICENSE.TXT for details.
 | |
| //
 | |
| //===----------------------------------------------------------------------===//
 | |
| //
 | |
| // This file implements Block Frequency class.
 | |
| //
 | |
| //===----------------------------------------------------------------------===//
 | |
| 
 | |
| #ifndef LLVM_SUPPORT_BLOCKFREQUENCY_H
 | |
| #define LLVM_SUPPORT_BLOCKFREQUENCY_H
 | |
| 
 | |
| #include "llvm/Support/DataTypes.h"
 | |
| 
 | |
| namespace llvm {
 | |
| 
 | |
| class raw_ostream;
 | |
| class BranchProbability;
 | |
| 
 | |
| // This class represents Block Frequency as a 64-bit value.
 | |
| class BlockFrequency {
 | |
| 
 | |
|   uint64_t Frequency;
 | |
|   static const int64_t ENTRY_FREQ = 1 << 14;
 | |
| 
 | |
|   /// \brief Scale the given BlockFrequency by N/D. Return the remainder from
 | |
|   /// the division by D. Upon overflow, the routine will saturate and
 | |
|   /// additionally will return the remainder set to D.
 | |
|   uint32_t scale(uint32_t N, uint32_t D);
 | |
| 
 | |
| public:
 | |
|   BlockFrequency(uint64_t Freq = 0) : Frequency(Freq) { }
 | |
| 
 | |
|   /// \brief Returns the frequency of the entry block of the function.
 | |
|   static uint64_t getEntryFrequency() { return ENTRY_FREQ; }
 | |
| 
 | |
|   /// \brief Returns the maximum possible frequency, the saturation value.
 | |
|   static uint64_t getMaxFrequency() { return -1ULL; }
 | |
| 
 | |
|   /// \brief Returns the frequency as a fixpoint number scaled by the entry
 | |
|   /// frequency.
 | |
|   uint64_t getFrequency() const { return Frequency; }
 | |
| 
 | |
|   /// \brief Multiplies with a branch probability. The computation will never
 | |
|   /// overflow.
 | |
|   BlockFrequency &operator*=(const BranchProbability &Prob);
 | |
|   const BlockFrequency operator*(const BranchProbability &Prob) const;
 | |
| 
 | |
|   /// \brief Divide by a non-zero branch probability using saturating
 | |
|   /// arithmetic.
 | |
|   BlockFrequency &operator/=(const BranchProbability &Prob);
 | |
|   BlockFrequency operator/(const BranchProbability &Prob) const;
 | |
| 
 | |
|   /// \brief Adds another block frequency using saturating arithmetic.
 | |
|   BlockFrequency &operator+=(const BlockFrequency &Freq);
 | |
|   const BlockFrequency operator+(const BlockFrequency &Freq) const;
 | |
| 
 | |
|   /// \brief Scale the given BlockFrequency by N/D. Return the remainder from
 | |
|   /// the division by D. Upon overflow, the routine will saturate.
 | |
|   uint32_t scale(const BranchProbability &Prob);
 | |
| 
 | |
|   bool operator<(const BlockFrequency &RHS) const {
 | |
|     return Frequency < RHS.Frequency;
 | |
|   }
 | |
| 
 | |
|   bool operator<=(const BlockFrequency &RHS) const {
 | |
|     return Frequency <= RHS.Frequency;
 | |
|   }
 | |
| 
 | |
|   bool operator>(const BlockFrequency &RHS) const {
 | |
|     return Frequency > RHS.Frequency;
 | |
|   }
 | |
| 
 | |
|   bool operator>=(const BlockFrequency &RHS) const {
 | |
|     return Frequency >= RHS.Frequency;
 | |
|   }
 | |
| 
 | |
|   void print(raw_ostream &OS) const;
 | |
| };
 | |
| 
 | |
| raw_ostream &operator<<(raw_ostream &OS, const BlockFrequency &Freq);
 | |
| 
 | |
| }
 | |
| 
 | |
| #endif
 |