mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-03-04 02:18:46 +00:00
Fix differences in codegen between Linux and Windows toolchains
Summary: There are differences in codegen between Linux and Windows due to: 1. Using std::sort which uses quicksort which is a non-stable sort. 2. Iterating over Set data structure where the iteration order is non deterministic. Reviewers: arsenm, grosbach, junbuml, zinob, MatzeB Subscribers: MatzeB, wdng Differential Revision: https://reviews.llvm.org/D25695 llvm-svn: 284441
This commit is contained in:
parent
7471bcddec
commit
a59ccea20f
@ -39,6 +39,7 @@
|
||||
|
||||
#include "llvm/ADT/DepthFirstIterator.h"
|
||||
#include "llvm/ADT/PointerIntPair.h"
|
||||
#include "llvm/ADT/SetVector.h"
|
||||
#include "llvm/ADT/iterator_range.h"
|
||||
#include "llvm/IR/CFG.h"
|
||||
#include "llvm/IR/Dominators.h"
|
||||
@ -678,7 +679,7 @@ class RegionInfoBase {
|
||||
friend class MachineRegionInfo;
|
||||
typedef DenseMap<BlockT *, BlockT *> BBtoBBMap;
|
||||
typedef DenseMap<BlockT *, RegionT *> BBtoRegionMap;
|
||||
typedef SmallPtrSet<RegionT *, 4> RegionSet;
|
||||
typedef SmallSetVector<RegionT *, 4> RegionSet;
|
||||
|
||||
RegionInfoBase();
|
||||
virtual ~RegionInfoBase();
|
||||
|
@ -55,7 +55,8 @@ namespace {
|
||||
FrameRef(MachineBasicBlock::iterator I, int64_t Offset, int Idx) :
|
||||
MI(I), LocalOffset(Offset), FrameIdx(Idx) {}
|
||||
bool operator<(const FrameRef &RHS) const {
|
||||
return LocalOffset < RHS.LocalOffset;
|
||||
return std::tie(LocalOffset, FrameIdx) <
|
||||
std::tie(RHS.LocalOffset, RHS.FrameIdx);
|
||||
}
|
||||
MachineBasicBlock::iterator getMachineInstr() const { return MI; }
|
||||
int64_t getLocalOffset() const { return LocalOffset; }
|
||||
@ -318,8 +319,9 @@ bool LocalStackSlotPass::insertFrameReferenceRegisters(MachineFunction &Fn) {
|
||||
}
|
||||
}
|
||||
|
||||
// Sort the frame references by local offset
|
||||
array_pod_sort(FrameReferenceInsns.begin(), FrameReferenceInsns.end());
|
||||
// Sort the frame references by local offset.
|
||||
// Use frame index as a tie-breaker in case MI's have the same offset.
|
||||
std::sort(FrameReferenceInsns.begin(), FrameReferenceInsns.end());
|
||||
|
||||
MachineBasicBlock *Entry = &Fn.front();
|
||||
|
||||
|
@ -1359,7 +1359,8 @@ class BaseMemOpClusterMutation : public ScheduleDAGMutation {
|
||||
: SU(su), BaseReg(reg), Offset(ofs) {}
|
||||
|
||||
bool operator<(const MemOpInfo&RHS) const {
|
||||
return std::tie(BaseReg, Offset) < std::tie(RHS.BaseReg, RHS.Offset);
|
||||
return std::tie(BaseReg, Offset, SU->NodeNum) <
|
||||
std::tie(RHS.BaseReg, RHS.Offset, RHS.SU->NodeNum);
|
||||
}
|
||||
};
|
||||
|
||||
|
Loading…
x
Reference in New Issue
Block a user