6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-25 13:24:46 +00:00
Code Issues Projects Releases Wiki Activity

Renaming functions to match coding style guidelines

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@164238 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Michael Ilseman
2012-09-19 18:14:45 +00:00
parent 3856b07276
commit fc879791f2
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
lib/Transforms/Utils/IntegerDivision.cpp
View File

@@ -28,7 +28,7 @@ using namespace llvm;
/// instruction. This will generate a udiv in the process, and Builder's insert /// instruction. This will generate a udiv in the process, and Builder's insert
/// point will be pointing at the udiv (if present, i.e. not folded), ready to /// point will be pointing at the udiv (if present, i.e. not folded), ready to
/// be expanded if the user wishes. /// be expanded if the user wishes.
static Value *GenerateSignedDivisionCode(Value *Dividend, Value *Divisor, static Value *generateSignedDivisionCode(Value *Dividend, Value *Divisor,
IRBuilder<> &Builder) { IRBuilder<> &Builder) {
// Implementation taken from compiler-rt's __divsi3 // Implementation taken from compiler-rt's __divsi3
@@ -64,7 +64,7 @@ static Value *GenerateSignedDivisionCode(Value *Dividend, Value *Divisor,
/// Generates code to divide two unsigned scalar 32-bit integers. Returns the /// Generates code to divide two unsigned scalar 32-bit integers. Returns the
/// quotient, rounded towards 0. Builder's insert point should be pointing at /// quotient, rounded towards 0. Builder's insert point should be pointing at
/// the udiv instruction. /// the udiv instruction.
static Value *GenerateUnsignedDivisionCode(Value *Dividend, Value *Divisor, static Value *generateUnsignedDivisionCode(Value *Dividend, Value *Divisor,
IRBuilder<> &Builder) { IRBuilder<> &Builder) {
// The basic algorithm can be found in the compiler-rt project's // The basic algorithm can be found in the compiler-rt project's
// implementation of __udivsi3.c. Here, we do a lower-level IR based approach // implementation of __udivsi3.c. Here, we do a lower-level IR based approach
@@ -286,7 +286,7 @@ bool llvm::expandDivision(BinaryOperator *Div) {
// First prepare the sign if it's a signed division // First prepare the sign if it's a signed division
if (Div->getOpcode() == Instruction::SDiv) { if (Div->getOpcode() == Instruction::SDiv) {
// Lower the code to unsigned division, and reset Div to point to the udiv. // Lower the code to unsigned division, and reset Div to point to the udiv.
Value *Quotient = GenerateSignedDivisionCode(Div->getOperand(0), Value *Quotient = generateSignedDivisionCode(Div->getOperand(0),
Div->getOperand(1), Builder); Div->getOperand(1), Builder);
Div->replaceAllUsesWith(Quotient); Div->replaceAllUsesWith(Quotient);
Div->dropAllReferences(); Div->dropAllReferences();
@@ -301,7 +301,7 @@ bool llvm::expandDivision(BinaryOperator *Div) {
} }
// Insert the unsigned division code // Insert the unsigned division code
Value *Quotient = GenerateUnsignedDivisionCode(Div->getOperand(0), Value *Quotient = generateUnsignedDivisionCode(Div->getOperand(0),
Div->getOperand(1), Div->getOperand(1),
Builder); Builder);
Div->replaceAllUsesWith(Quotient); Div->replaceAllUsesWith(Quotient);