private InstructionBlock FindMostDistantSuccessor(InstructionBlock currentBlock)
{
V_0 = null;
V_1 = currentBlock.get_Successors();
V_2 = 0;
while (V_2 < (int)V_1.Length)
{
V_3 = V_1[V_2];
if (!InstructionBlock.op_Equality(V_0, null))
{
if (V_3.get_Index() > V_0.get_Index())
{
V_0 = V_3;
}
}
else
{
if (V_3.get_Index() > currentBlock.get_Index())
{
V_0 = V_3;
}
}
V_2 = V_2 + 1;
}
return(V_0);
}
public override bool Equals(object obj)
{
if (obj == null || InstructionBlock.op_Equality(obj as InstructionBlock, null))
{
return(false);
}
return(this.Equals(this, (InstructionBlock)obj));
}
public bool Equals(BlockRange other)
{
if (!InstructionBlock.op_Equality(this.Start, other.Start))
{
return(false);
}
return(InstructionBlock.op_Equality(this.End, other.End));
}
private void MarkPartitioningVertices(int startInstructionBlockIndex)
{
V_0 = this.cfg.get_Blocks()[startInstructionBlockIndex];
V_1 = this.FindMostDistantSuccessor(V_0);
if (InstructionBlock.op_Equality(V_1, null))
{
return;
}
if (V_1.get_Index() == this.cfg.get_Blocks().Count <InstructionBlock>() - 1)
{
return;
}
V_2 = null;
V_3 = V_0.get_Index() + 1;
while (V_3 <= V_1.get_Index())
{
if (!InstructionBlock.op_Equality(V_2, null))
{
V_4 = this.FindMostDistantSuccessor(this.cfg.get_Blocks()[V_3]);
if (V_4.get_Index() > V_2.get_Index())
{
V_2 = V_4;
}
}
else
{
V_2 = this.FindMostDistantSuccessor(this.cfg.get_Blocks()[V_3]);
}
V_3 = V_3 + 1;
}
if ((long)V_1.get_Index() < (ulong)this.mostDistantInstructionBlockIndexReached)
{
if (InstructionBlock.op_Inequality(V_2, null) && (long)V_2.get_Index() > (ulong)this.mostDistantInstructionBlockIndexReached)
{
this.mostDistantInstructionBlockIndexReached = V_2.get_Index();
}
}
else
{
if (!InstructionBlock.op_Inequality(V_2, null))
{
this.verticesThatPartitionGraph.Add(V_1);
}
else
{
if (V_2.get_Index() <= V_1.get_Index())
{
this.verticesThatPartitionGraph.Add(V_1);
}
}
}
this.MarkPartitioningVertices(V_1.get_Index());
return;
}