}
unsigned listElemNum = 0;
- char* childMsg = nullptr;
+ const char* childMsg = nullptr;
if (tree->IsCall())
{
if (child == tree->gtCall.gtCallObjp)
EHblkDsc* ehOuter = ehGetDsc(ehOuterIndex);
// Debugging: say what type of block we're updating.
- INDEBUG(char* outerType = ""; char* innerType = "";)
+ INDEBUG(const char* outerType = ""; const char* innerType = "";)
// 'insertAfterBlk' is the place we will insert new "normalization" blocks. We don't know yet if we will
// insert them after the innermost 'try' or handler's "last" block, so we set it to nullptr. Once we determine
#ifdef DEBUG
if (VERBOSE)
{
- char * insertionPointString = "top";
+ const char * insertionPointString = "top";
if (insertionPoint == nullptr)
{
insertionPointString = "bottom";
regNumber fromReg)
{
#ifdef DEBUG
- char * insertionPointString = "top";
+ const char * insertionPointString = "top";
#endif // DEBUG
if (insertionPoint == nullptr)
{
void
LinearScan::lsraGetOperandString(GenTreePtr tree, LsraTupleDumpMode mode, char *operandString, unsigned operandStringLength)
{
- char* lastUseChar = "";
+ const char* lastUseChar = "";
if ((tree->gtFlags & GTF_VAR_DEATH) != 0) lastUseChar = "*";
switch (mode)
{
Compiler* compiler = GetTlsCompiler();
const unsigned operandStringLength = 16;
char operandString[operandStringLength];
- char* emptyDestOperand = " ";
+ const char* emptyDestOperand = " ";
char spillChar = ' ';
if (mode == LinearScan::LSRA_DUMP_POST)
else if (tree->OperIsAssignment())
{
assert(!tree->gtHasReg());
- char * isRev = "";
+ const char * isRev = "";
if ((tree->gtFlags & GTF_REVERSE_OPS) != 0) isRev = "(Rev)";
printf(" asg%s%s ", GenTree::NodeName(tree->OperGet()), isRev);
}
int regColumnWidth;
int regTableIndent;
- char* columnSeparator;
- char* line;
- char* leftBox;
- char* middleBox;
- char* rightBox;
+ const char* columnSeparator;
+ const char* line;
+ const char* leftBox;
+ const char* middleBox;
+ const char* rightBox;
static const int MAX_FORMAT_CHARS = 12;
char intervalNameFormat[MAX_FORMAT_CHARS];
{
public:
Phase(Compiler *_comp,
- char *_name,
+ const char *_name,
Phases _phase=PHASE_NUMBER_OF)
: comp(_comp), name(_name), phase(_phase) {}
virtual void Run();
protected:
Compiler *comp;
- char *name;
+ const char *name;
Phases phase;
};
return false;
}
#ifdef DEBUG
- char* ToString(IAllocator* alloc)
+ const char* ToString(IAllocator* alloc)
{
unsigned size = 64;
char* buf = (char*) alloc->Alloc(size);
//
#ifdef _DEBUG
void DumpClauses(IJitManager* pJitMan, const METHODTOKEN& MethToken, UINT_PTR uMethodStartPC, UINT_PTR dwControlPc);
-static void DoEHLog(DWORD lvl, __in_z char *fmt, ...);
+static void DoEHLog(DWORD lvl, __in_z const char *fmt, ...);
#define EH_LOG(expr) { DoEHLog expr ; }
#else
#define EH_LOG(expr)
}
// static
-void ExceptionTracker::DebugLogTrackerRanges(__in_z char *pszTag)
+void ExceptionTracker::DebugLogTrackerRanges(__in_z const char *pszTag)
{
#ifdef _DEBUG
CONTRACTL
static void DoEHLog(
DWORD lvl,
- __in_z char *fmt,
+ __in_z const char *fmt,
...
)
{
void EnumMemoryRegions(CLRDataEnumMemoryFlags flags);
#endif // DACCESS_COMPILE
- static void DebugLogTrackerRanges(__in_z char *pszTag);
+ static void DebugLogTrackerRanges(__in_z const char *pszTag);
bool IsStackOverflowException();
-//
+
// Copyright (c) Microsoft. All rights reserved.
// Licensed under the MIT license. See LICENSE file in the project root for full license information.
//
const char* const str_timeUnit[] = { "usec", "msec", "sec" };
const int timeUnitFactor[] = { 1, 1000, 1000000 };
-void MinMaxTot::DisplayAndUpdate(FILE* logFile, __in_z char *pName, MinMaxTot *pLastOne, int fullCount, int priorCount, timeUnit unit /* = usec */)
+void MinMaxTot::DisplayAndUpdate(FILE* logFile, __in_z const char *pName, MinMaxTot *pLastOne, int fullCount, int priorCount, timeUnit unit /* = usec */)
{
LIMITED_METHOD_CONTRACT;
minVal = maxVal = 0;
}
- void DisplayAndUpdate(FILE* logFile, __in_z char *pName, MinMaxTot *pLastOne, int fullCount, int priorCount, timeUnit=usec);
+ void DisplayAndUpdate(FILE* logFile, __in_z const char *pName, MinMaxTot *pLastOne, int fullCount, int priorCount, timeUnit=usec);
};
// A note about timings. We use QueryPerformanceCounter to measure all timings in units. During