| Mips16ISelLowering.cpp (276479) | Mips16ISelLowering.cpp (277320) |
|---|---|
| 1//===-- Mips16ISelLowering.h - Mips16 DAG Lowering Interface ----*- C++ -*-===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// --- 227 unchanged lines hidden (view full) --- 236 return emitFEXT_CCRXI16_ins 237 (Mips::SltiuRxImm16, Mips::SltiuRxImmX16, MI, BB); 238 case Mips::SltuCCRxRy16: 239 return emitFEXT_CCRX16_ins 240 (Mips::SltuRxRy16, MI, BB); 241 } 242} 243 | 1//===-- Mips16ISelLowering.h - Mips16 DAG Lowering Interface ----*- C++ -*-===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// --- 227 unchanged lines hidden (view full) --- 236 return emitFEXT_CCRXI16_ins 237 (Mips::SltiuRxImm16, Mips::SltiuRxImmX16, MI, BB); 238 case Mips::SltuCCRxRy16: 239 return emitFEXT_CCRX16_ins 240 (Mips::SltuRxRy16, MI, BB); 241 } 242} 243 |
| 244bool Mips16TargetLowering:: 245isEligibleForTailCallOptimization(const MipsCC &MipsCCInfo, 246 unsigned NextStackOffset, 247 const MipsFunctionInfo& FI) const { | 244bool Mips16TargetLowering::isEligibleForTailCallOptimization( 245 const CCState &CCInfo, unsigned NextStackOffset, 246 const MipsFunctionInfo &FI) const { |
| 248 // No tail call optimization for mips16. 249 return false; 250} 251 252void Mips16TargetLowering::setMips16HardFloatLibCalls() { 253 for (unsigned I = 0; I != array_lengthof(HardFloatLibCalls); ++I) { 254 assert((I == 0 || HardFloatLibCalls[I - 1] < HardFloatLibCalls[I]) && 255 "Array not sorted!"); --- 537 unchanged lines hidden --- | 247 // No tail call optimization for mips16. 248 return false; 249} 250 251void Mips16TargetLowering::setMips16HardFloatLibCalls() { 252 for (unsigned I = 0; I != array_lengthof(HardFloatLibCalls); ++I) { 253 assert((I == 0 || HardFloatLibCalls[I - 1] < HardFloatLibCalls[I]) && 254 "Array not sorted!"); --- 537 unchanged lines hidden --- |