//
GenTree* BasicBlock::firstNode()
{
- return IsLIR() ? bbTreeList : Compiler::fgGetFirstNode(firstStmt()->gtStmtExpr);
+ return IsLIR() ? GetBBTreeList() : Compiler::fgGetFirstNode(firstStmt()->gtStmtExpr);
}
//------------------------------------------------------------------------
else
{
// Should not have tree list before LIR.
- return (bbTreeList == nullptr);
+ return (GetBBTreeList() == nullptr);
}
}
return bbRefs;
}
- __declspec(property(get = getBBTreeList, put = setBBTreeList)) GenTree* bbTreeList; // the body of the block.
-
Statement* bbStmtList;
- GenTree* getBBTreeList() const
+ GenTree* GetBBTreeList() const
{
return m_firstNode;
}
- void setBBTreeList(GenTree* tree)
+ void SetBBTreeList(GenTree* tree)
{
m_firstNode = tree;
}
hasTailCalls = true;
noway_assert(block->bbJumpKind == BBJ_RETURN);
- noway_assert(block->bbTreeList != nullptr);
+ noway_assert(block->GetBBTreeList() != nullptr);
/* figure out what jump we have */
GenTree* jmpNode = lastNode;
if (jmpEpilog)
{
noway_assert(block->bbJumpKind == BBJ_RETURN);
- noway_assert(block->bbTreeList);
+ noway_assert(block->GetBBTreeList());
// figure out what jump we have
GenTree* jmpNode = block->lastNode();
}
else
{
- for (GenTree* node = block->bbTreeList; node != nullptr; node = node->gtNext)
+ for (GenTree* node = block->GetBBTreeList(); node != nullptr; node = node->gtNext)
{
cNodeIR(comp, node);
}
if (curr->IsLIR())
{
- newBlock->bbTreeList = curr->bbTreeList;
- curr->bbTreeList = nullptr;
+ newBlock->SetBBTreeList(curr->GetBBTreeList());
+ curr->SetBBTreeList(nullptr);
}
else
{
// Make sure the one return BB is not changed.
if (genReturnBB != nullptr)
{
- assert(genReturnBB->bbTreeList != nullptr || genReturnBB->bbStmtList != nullptr);
+ assert(genReturnBB->GetBBTreeList() != nullptr || genReturnBB->bbStmtList != nullptr);
}
// The general encoder/decoder (currently) only reports "this" as a generics context as a stack location,
//-----------------------------------------------------------------------------
// Statement operator nodes:
//-----------------------------------------------------------------------------
-GTNODE(STMT , Statement ,0,(GTK_SPECIAL|GTK_NOVALUE))// top-level list nodes in bbTreeList
+GTNODE(STMT , Statement ,0,(GTK_SPECIAL|GTK_NOVALUE))// top-level list nodes in GetBBTreeList()
GTNODE(RETURN , GenTreeOp ,0,(GTK_UNOP|GTK_NOVALUE)) // return from current function
GTNODE(SWITCH , GenTreeOp ,0,(GTK_UNOP|GTK_NOVALUE)) // switch
//
BasicBlock* getNonEmptyBlock(BasicBlock* block)
{
- while (block != nullptr && block->bbTreeList == nullptr)
+ while (block != nullptr && block->GetBBTreeList() == nullptr)
{
BasicBlock* nextBlock = block->bbNext;
// Note that here we use the version of NumSucc that does not take a compiler.
// assert( block->GetSucc(0) == nextBlock);
block = nextBlock;
}
- assert(block != nullptr && block->bbTreeList != nullptr);
+ assert(block != nullptr && block->GetBBTreeList() != nullptr);
return block;
}