private List <int> PathableNeighborIndices(int index)
{
RegionCostCalculator.tmpPathableNeighborIndices.Clear();
PathGrid pathGrid = this.map.pathGrid;
IntVec3 size = this.map.Size;
int x = size.x;
bool flag = index % x > 0;
bool flag2 = index % x < x - 1;
bool flag3 = index >= x;
int num = index / x;
IntVec3 size2 = this.map.Size;
bool flag4 = num < size2.z - 1;
if (flag3 && pathGrid.WalkableFast(index - x))
{
RegionCostCalculator.tmpPathableNeighborIndices.Add(index - x);
}
if (flag2 && pathGrid.WalkableFast(index + 1))
{
RegionCostCalculator.tmpPathableNeighborIndices.Add(index + 1);
}
if (flag && pathGrid.WalkableFast(index - 1))
{
RegionCostCalculator.tmpPathableNeighborIndices.Add(index - 1);
}
if (flag4 && pathGrid.WalkableFast(index + x))
{
RegionCostCalculator.tmpPathableNeighborIndices.Add(index + x);
}
bool flag5 = !flag || PathFinder.BlocksDiagonalMovement(index - 1, this.map);
bool flag6 = !flag2 || PathFinder.BlocksDiagonalMovement(index + 1, this.map);
if (flag3 && !PathFinder.BlocksDiagonalMovement(index - x, this.map))
{
if (!flag6 && pathGrid.WalkableFast(index - x + 1))
{
RegionCostCalculator.tmpPathableNeighborIndices.Add(index - x + 1);
}
if (!flag5 && pathGrid.WalkableFast(index - x - 1))
{
RegionCostCalculator.tmpPathableNeighborIndices.Add(index - x - 1);
}
}
if (flag4 && !PathFinder.BlocksDiagonalMovement(index + x, this.map))
{
if (!flag6 && pathGrid.WalkableFast(index + x + 1))
{
RegionCostCalculator.tmpPathableNeighborIndices.Add(index + x + 1);
}
if (!flag5 && pathGrid.WalkableFast(index + x - 1))
{
RegionCostCalculator.tmpPathableNeighborIndices.Add(index + x - 1);
}
}
return(RegionCostCalculator.tmpPathableNeighborIndices);
}
private List <int> PathableNeighborIndices(int index)
{
tmpPathableNeighborIndices.Clear();
PathGrid pathGrid = map.pathGrid;
int x = map.Size.x;
bool num = index % x > 0;
bool flag = index % x < x - 1;
bool flag2 = index >= x;
bool flag3 = index / x < map.Size.z - 1;
if (flag2 && pathGrid.WalkableFast(index - x))
{
tmpPathableNeighborIndices.Add(index - x);
}
if (flag && pathGrid.WalkableFast(index + 1))
{
tmpPathableNeighborIndices.Add(index + 1);
}
if (num && pathGrid.WalkableFast(index - 1))
{
tmpPathableNeighborIndices.Add(index - 1);
}
if (flag3 && pathGrid.WalkableFast(index + x))
{
tmpPathableNeighborIndices.Add(index + x);
}
bool flag4 = !num || PathFinder.BlocksDiagonalMovement(index - 1, map);
bool flag5 = !flag || PathFinder.BlocksDiagonalMovement(index + 1, map);
if (flag2 && !PathFinder.BlocksDiagonalMovement(index - x, map))
{
if (!flag5 && pathGrid.WalkableFast(index - x + 1))
{
tmpPathableNeighborIndices.Add(index - x + 1);
}
if (!flag4 && pathGrid.WalkableFast(index - x - 1))
{
tmpPathableNeighborIndices.Add(index - x - 1);
}
}
if (flag3 && !PathFinder.BlocksDiagonalMovement(index + x, map))
{
if (!flag5 && pathGrid.WalkableFast(index + x + 1))
{
tmpPathableNeighborIndices.Add(index + x + 1);
}
if (!flag4 && pathGrid.WalkableFast(index + x - 1))
{
tmpPathableNeighborIndices.Add(index + x - 1);
}
}
return(tmpPathableNeighborIndices);
}
private bool ContainsPathCostIgnoreRepeater(IntVec3 c)
{
List <Thing> list = this.map.thingGrid.ThingsListAt(c);
for (int i = 0; i < list.Count; i++)
{
if (PathGrid.IsPathCostIgnoreRepeater(list[i].def))
{
return(true);
}
}
return(false);
}
public static void ThingPathCostsIgnoreRepeaters()
{
StringBuilder stringBuilder = new StringBuilder();
stringBuilder.AppendLine("===============PATH COST IGNORE REPEATERS==============");
foreach (ThingDef current in DefDatabase <ThingDef> .AllDefs)
{
if (PathGrid.IsPathCostIgnoreRepeater(current) && current.passability != Traversability.Impassable)
{
stringBuilder.AppendLine(current.defName + " " + current.pathCost);
}
}
stringBuilder.AppendLine("===============NON-PATH COST IGNORE REPEATERS that are buildings with >0 pathCost ==============");
foreach (ThingDef current2 in DefDatabase <ThingDef> .AllDefs)
{
if (!PathGrid.IsPathCostIgnoreRepeater(current2) && current2.passability != Traversability.Impassable && current2.category == ThingCategory.Building && current2.pathCost > 0)
{
stringBuilder.AppendLine(current2.defName + " " + current2.pathCost);
}
}
Log.Message(stringBuilder.ToString(), false);
}
public int CalculatedCostAt(IntVec3 c, bool perceivedStatic, IntVec3 prevCell)
{
bool flag = false;
TerrainDef terrainDef = this.map.terrainGrid.TerrainAt(c);
if (terrainDef == null || terrainDef.passability == Traversability.Impassable)
{
return(10000);
}
int num = terrainDef.pathCost;
List <Thing> list = this.map.thingGrid.ThingsListAt(c);
for (int i = 0; i < list.Count; i++)
{
Thing thing = list[i];
if (thing.def.passability == Traversability.Impassable)
{
return(10000);
}
if (!PathGrid.IsPathCostIgnoreRepeater(thing.def) || !prevCell.IsValid || !this.ContainsPathCostIgnoreRepeater(prevCell))
{
int pathCost = thing.def.pathCost;
if (pathCost > num)
{
num = pathCost;
}
}
if (thing is Building_Door && prevCell.IsValid)
{
Building edifice = prevCell.GetEdifice(this.map);
if (edifice != null && edifice is Building_Door)
{
flag = true;
}
}
}
int num2 = SnowUtility.MovementTicksAddOn(this.map.snowGrid.GetCategory(c));
if (num2 > num)
{
num = num2;
}
if (flag)
{
num += 45;
}
if (perceivedStatic)
{
for (int j = 0; j < 9; j++)
{
IntVec3 b = GenAdj.AdjacentCellsAndInside[j];
IntVec3 c2 = c + b;
if (c2.InBounds(this.map))
{
Fire fire = null;
list = this.map.thingGrid.ThingsListAtFast(c2);
for (int k = 0; k < list.Count; k++)
{
fire = (list[k] as Fire);
if (fire != null)
{
break;
}
}
if (fire != null && fire.parent == null)
{
if (b.x == 0 && b.z == 0)
{
num += 1000;
}
else
{
num += 150;
}
}
}
}
}
return(num);
}
public PawnPath FindPath(IntVec3 start, LocalTargetInfo dest, TraverseParms traverseParms, PathEndMode peMode = PathEndMode.OnCell)
{
if (DebugSettings.pathThroughWalls)
{
traverseParms.mode = TraverseMode.PassAllDestroyableThings;
}
Pawn pawn = traverseParms.pawn;
if (pawn != null && pawn.Map != this.map)
{
Log.Error("Tried to FindPath for pawn which is spawned in another map. His map PathFinder should have been used, not this one. pawn=" + pawn + " pawn.Map=" + pawn.Map + " map=" + this.map);
return(PawnPath.NotFound);
}
if (!start.IsValid)
{
Log.Error("Tried to FindPath with invalid start " + start + ", pawn= " + pawn);
return(PawnPath.NotFound);
}
if (!dest.IsValid)
{
Log.Error("Tried to FindPath with invalid dest " + dest + ", pawn= " + pawn);
return(PawnPath.NotFound);
}
if (traverseParms.mode == TraverseMode.ByPawn)
{
if (!pawn.CanReach(dest, peMode, Danger.Deadly, traverseParms.canBash, traverseParms.mode))
{
return(PawnPath.NotFound);
}
}
else if (!this.map.reachability.CanReach(start, dest, peMode, traverseParms))
{
return(PawnPath.NotFound);
}
this.PfProfilerBeginSample("FindPath for " + pawn + " from " + start + " to " + dest + ((!dest.HasThing) ? string.Empty : (" at " + dest.Cell)));
this.cellIndices = this.map.cellIndices;
this.pathGrid = this.map.pathGrid;
this.edificeGrid = this.map.edificeGrid.InnerArray;
IntVec3 cell = dest.Cell;
int x = cell.x;
IntVec3 cell2 = dest.Cell;
int z = cell2.z;
int num = this.cellIndices.CellToIndex(start);
int num2 = this.cellIndices.CellToIndex(dest.Cell);
ByteGrid byteGrid = (pawn == null) ? null : pawn.GetAvoidGrid();
bool flag = traverseParms.mode == TraverseMode.PassAllDestroyableThings;
bool flag2 = traverseParms.mode != TraverseMode.NoPassClosedDoorsOrWater && traverseParms.mode != TraverseMode.PassAllDestroyableThingsNotWater;
bool flag3 = !flag;
CellRect cellRect = this.CalculateDestinationRect(dest, peMode);
bool flag4 = cellRect.Width == 1 && cellRect.Height == 1;
int[] array = this.map.pathGrid.pathGrid;
EdificeGrid edificeGrid = this.map.edificeGrid;
int num3 = 0;
int num4 = 0;
Area allowedArea = this.GetAllowedArea(pawn);
bool flag5 = pawn != null && PawnUtility.ShouldCollideWithPawns(pawn);
bool flag6 = true && DebugViewSettings.drawPaths;
bool flag7 = !flag && start.GetRegion(this.map, RegionType.Set_Passable) != null;
bool flag8 = !flag || !flag3;
bool flag9 = false;
int num5 = 0;
int num6 = 0;
float num7 = this.DetermineHeuristicStrength(pawn, start, dest);
int num8;
int num9;
if (pawn != null)
{
num8 = pawn.TicksPerMoveCardinal;
num9 = pawn.TicksPerMoveDiagonal;
}
else
{
num8 = 13;
num9 = 18;
}
this.CalculateAndAddDisallowedCorners(traverseParms, peMode, cellRect);
this.InitStatusesAndPushStartNode(ref num, start);
while (true)
{
this.PfProfilerBeginSample("Open cell");
if (this.openList.Count <= 0)
{
string text = (pawn == null || pawn.CurJob == null) ? "null" : pawn.CurJob.ToString();
string text2 = (pawn == null || pawn.Faction == null) ? "null" : pawn.Faction.ToString();
Log.Warning(pawn + " pathing from " + start + " to " + dest + " ran out of cells to process.\nJob:" + text + "\nFaction: " + text2);
this.DebugDrawRichData();
this.PfProfilerEndSample();
return(PawnPath.NotFound);
}
num5 += this.openList.Count;
num6++;
CostNode costNode = this.openList.Pop();
num = costNode.index;
if (costNode.cost != this.calcGrid[num].costNodeCost)
{
this.PfProfilerEndSample();
continue;
}
if (this.calcGrid[num].status == this.statusClosedValue)
{
this.PfProfilerEndSample();
continue;
}
IntVec3 c = this.cellIndices.IndexToCell(num);
int x2 = c.x;
int z2 = c.z;
if (flag6)
{
this.DebugFlash(c, (float)((float)this.calcGrid[num].knownCost / 1500.0), this.calcGrid[num].knownCost.ToString());
}
if (flag4)
{
if (num == num2)
{
this.PfProfilerEndSample();
PawnPath result = this.FinalizedPath(num);
this.PfProfilerEndSample();
return(result);
}
}
else if (cellRect.Contains(c) && !this.disallowedCornerIndices.Contains(num))
{
this.PfProfilerEndSample();
PawnPath result2 = this.FinalizedPath(num);
this.PfProfilerEndSample();
return(result2);
}
if (num3 <= 160000)
{
this.PfProfilerEndSample();
this.PfProfilerBeginSample("Neighbor consideration");
for (int i = 0; i < 8; i++)
{
uint num10 = (uint)(x2 + PathFinder.Directions[i]);
uint num11 = (uint)(z2 + PathFinder.Directions[i + 8]);
int num12;
int num13;
int num14;
bool flag10;
int num15;
if (num10 < this.mapSizeX && num11 < this.mapSizeZ)
{
num12 = (int)num10;
num13 = (int)num11;
num14 = this.cellIndices.CellToIndex(num12, num13);
if (this.calcGrid[num14].status == this.statusClosedValue && !flag9)
{
continue;
}
num15 = 0;
flag10 = false;
if (!flag2 && new IntVec3(num12, 0, num13).GetTerrain(this.map).HasTag("Water"))
{
continue;
}
if (!this.pathGrid.WalkableFast(num14))
{
if (!flag)
{
if (flag6)
{
this.DebugFlash(new IntVec3(num12, 0, num13), 0.22f, "walk");
}
}
else
{
flag10 = true;
num15 += 70;
Building building = edificeGrid[num14];
if (building != null && PathFinder.IsDestroyable(building))
{
num15 += (int)((float)building.HitPoints * 0.10999999940395355);
goto IL_0749;
}
}
continue;
}
goto IL_0749;
}
continue;
IL_092b:
if (this.BlocksDiagonalMovement(num - this.mapSizeX))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2, 0, z2 - 1), 0.9f, "corn");
}
continue;
}
num15 += 70;
}
if (this.BlocksDiagonalMovement(num - 1))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2 - 1, 0, z2), 0.9f, "corn");
}
continue;
}
num15 += 70;
}
goto IL_09bf;
IL_0b0e:
ushort status;
if (status != this.statusClosedValue && status != this.statusOpenValue)
{
if (flag9)
{
this.calcGrid[num14].heuristicCost = Mathf.RoundToInt((float)this.regionCostCalculator.GetPathCostFromDestToRegion(num14) * PathFinder.RegionHeuristicWeightByNodesOpened.Evaluate((float)num4));
}
else
{
int dx = Math.Abs(num12 - x);
int dz = Math.Abs(num13 - z);
int num16 = GenMath.OctileDistance(dx, dz, num8, num9);
this.calcGrid[num14].heuristicCost = Mathf.RoundToInt((float)num16 * num7);
}
}
int num17;
int num18 = num17 + this.calcGrid[num14].heuristicCost;
this.calcGrid[num14].parentIndex = num;
this.calcGrid[num14].knownCost = num17;
this.calcGrid[num14].status = this.statusOpenValue;
this.calcGrid[num14].costNodeCost = num18;
num4++;
this.openList.Push(new CostNode(num14, num18));
continue;
IL_0803:
if (this.BlocksDiagonalMovement(num + this.mapSizeX))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2, 0, z2 + 1), 0.9f, "corn");
}
continue;
}
num15 += 70;
}
if (this.BlocksDiagonalMovement(num + 1))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2 + 1, 0, z2), 0.9f, "corn");
}
continue;
}
num15 += 70;
}
goto IL_09bf;
IL_09bf:
int num19 = (i <= 3) ? num8 : num9;
num19 += num15;
if (!flag10)
{
num19 += array[num14];
}
if (byteGrid != null)
{
num19 += byteGrid[num14] * 8;
}
if (allowedArea != null && !allowedArea[num14])
{
num19 += 600;
}
if (flag5 && PawnUtility.AnyPawnBlockingPathAt(new IntVec3(num12, 0, num13), pawn, false, false))
{
num19 += 175;
}
Building building2 = this.edificeGrid[num14];
if (building2 != null)
{
this.PfProfilerBeginSample("Edifices");
int buildingCost = PathFinder.GetBuildingCost(building2, traverseParms, pawn);
if (buildingCost == 2147483647)
{
this.PfProfilerEndSample();
continue;
}
num19 += buildingCost;
this.PfProfilerEndSample();
}
num17 = num19 + this.calcGrid[num].knownCost;
status = this.calcGrid[num14].status;
if (status != this.statusClosedValue && status != this.statusOpenValue)
{
goto IL_0b0e;
}
int num20 = 0;
if (status == this.statusClosedValue)
{
num20 = num8;
}
if (this.calcGrid[num14].knownCost > num17 + num20)
{
goto IL_0b0e;
}
continue;
IL_0897:
if (this.BlocksDiagonalMovement(num + this.mapSizeX))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2, 0, z2 + 1), 0.9f, "corn");
}
continue;
}
num15 += 70;
}
if (this.BlocksDiagonalMovement(num - 1))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2 - 1, 0, z2), 0.9f, "corn");
}
continue;
}
num15 += 70;
}
goto IL_09bf;
IL_0749:
switch (i)
{
case 4:
break;
case 5:
goto IL_0803;
case 6:
goto IL_0897;
case 7:
goto IL_092b;
default:
goto IL_09bf;
}
if (this.BlocksDiagonalMovement(num - this.mapSizeX))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2, 0, z2 - 1), 0.9f, "corn");
}
continue;
}
num15 += 70;
}
if (this.BlocksDiagonalMovement(num + 1))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2 + 1, 0, z2), 0.9f, "corn");
}
continue;
}
num15 += 70;
}
goto IL_09bf;
}
this.PfProfilerEndSample();
num3++;
this.calcGrid[num].status = this.statusClosedValue;
if (num4 >= 2000 && flag7 && !flag9)
{
flag9 = true;
this.regionCostCalculator.Init(cellRect, traverseParms, num8, num9, byteGrid, allowedArea, this.disallowedCornerIndices);
this.InitStatusesAndPushStartNode(ref num, start);
num4 = 0;
num3 = 0;
}
continue;
}
break;
}
Log.Warning(pawn + " pathing from " + start + " to " + dest + " hit search limit of " + 160000 + " cells.");
this.DebugDrawRichData();
this.PfProfilerEndSample();
return(PawnPath.NotFound);
}
public PawnPath FindPath(IntVec3 start, LocalTargetInfo dest, TraverseParms traverseParms, PathEndMode peMode = PathEndMode.OnCell)
{
if (DebugSettings.pathThroughWalls)
{
traverseParms.mode = TraverseMode.PassAllDestroyableThings;
}
Pawn pawn = traverseParms.pawn;
if (pawn != null && pawn.Map != this.map)
{
Log.Error(string.Concat(new object[]
{
"Tried to FindPath for pawn which is spawned in another map. His map PathFinder should have been used, not this one. pawn=",
pawn,
" pawn.Map=",
pawn.Map,
" map=",
this.map
}), false);
return(PawnPath.NotFound);
}
if (!start.IsValid)
{
Log.Error(string.Concat(new object[]
{
"Tried to FindPath with invalid start ",
start,
", pawn= ",
pawn
}), false);
return(PawnPath.NotFound);
}
if (!dest.IsValid)
{
Log.Error(string.Concat(new object[]
{
"Tried to FindPath with invalid dest ",
dest,
", pawn= ",
pawn
}), false);
return(PawnPath.NotFound);
}
if (traverseParms.mode == TraverseMode.ByPawn)
{
if (!pawn.CanReach(dest, peMode, Danger.Deadly, traverseParms.canBash, traverseParms.mode))
{
return(PawnPath.NotFound);
}
}
else if (!this.map.reachability.CanReach(start, dest, peMode, traverseParms))
{
return(PawnPath.NotFound);
}
this.PfProfilerBeginSample(string.Concat(new object[]
{
"FindPath for ",
pawn,
" from ",
start,
" to ",
dest,
(!dest.HasThing) ? string.Empty : (" at " + dest.Cell)
}));
this.cellIndices = this.map.cellIndices;
this.pathGrid = this.map.pathGrid;
this.edificeGrid = this.map.edificeGrid.InnerArray;
this.blueprintGrid = this.map.blueprintGrid.InnerArray;
int x = dest.Cell.x;
int z = dest.Cell.z;
int num = this.cellIndices.CellToIndex(start);
int num2 = this.cellIndices.CellToIndex(dest.Cell);
ByteGrid byteGrid = (pawn == null) ? null : pawn.GetAvoidGrid(true);
bool flag = traverseParms.mode == TraverseMode.PassAllDestroyableThings || traverseParms.mode == TraverseMode.PassAllDestroyableThingsNotWater;
bool flag2 = traverseParms.mode != TraverseMode.NoPassClosedDoorsOrWater && traverseParms.mode != TraverseMode.PassAllDestroyableThingsNotWater;
bool flag3 = !flag;
CellRect cellRect = this.CalculateDestinationRect(dest, peMode);
bool flag4 = cellRect.Width == 1 && cellRect.Height == 1;
int[] array = this.map.pathGrid.pathGrid;
TerrainDef[] topGrid = this.map.terrainGrid.topGrid;
EdificeGrid edificeGrid = this.map.edificeGrid;
int num3 = 0;
int num4 = 0;
Area allowedArea = this.GetAllowedArea(pawn);
bool flag5 = pawn != null && PawnUtility.ShouldCollideWithPawns(pawn);
bool flag6 = true && DebugViewSettings.drawPaths;
bool flag7 = !flag && start.GetRegion(this.map, RegionType.Set_Passable) != null && flag2;
bool flag8 = !flag || !flag3;
bool flag9 = false;
bool flag10 = pawn != null && pawn.Drafted;
bool flag11 = pawn != null && pawn.IsColonist;
int num5 = (!flag11) ? 2000 : 100000;
int num6 = 0;
int num7 = 0;
float num8 = this.DetermineHeuristicStrength(pawn, start, dest);
int num9;
int num10;
if (pawn != null)
{
num9 = pawn.TicksPerMoveCardinal;
num10 = pawn.TicksPerMoveDiagonal;
}
else
{
num9 = 13;
num10 = 18;
}
this.CalculateAndAddDisallowedCorners(traverseParms, peMode, cellRect);
this.InitStatusesAndPushStartNode(ref num, start);
while (true)
{
this.PfProfilerBeginSample("Open cell");
if (this.openList.Count <= 0)
{
break;
}
num6 += this.openList.Count;
num7++;
PathFinder.CostNode costNode = this.openList.Pop();
num = costNode.index;
if (costNode.cost != this.calcGrid[num].costNodeCost)
{
this.PfProfilerEndSample();
}
else if (this.calcGrid[num].status == this.statusClosedValue)
{
this.PfProfilerEndSample();
}
else
{
IntVec3 c = this.cellIndices.IndexToCell(num);
int x2 = c.x;
int z2 = c.z;
if (flag6)
{
this.DebugFlash(c, (float)this.calcGrid[num].knownCost / 1500f, this.calcGrid[num].knownCost.ToString());
}
if (flag4)
{
if (num == num2)
{
goto Block_32;
}
}
else if (cellRect.Contains(c) && !this.disallowedCornerIndices.Contains(num))
{
goto Block_34;
}
if (num3 > 160000)
{
goto Block_35;
}
this.PfProfilerEndSample();
this.PfProfilerBeginSample("Neighbor consideration");
for (int i = 0; i < 8; i++)
{
uint num11 = (uint)(x2 + PathFinder.Directions[i]);
uint num12 = (uint)(z2 + PathFinder.Directions[i + 8]);
if ((ulong)num11 < (ulong)((long)this.mapSizeX) && (ulong)num12 < (ulong)((long)this.mapSizeZ))
{
int num13 = (int)num11;
int num14 = (int)num12;
int num15 = this.cellIndices.CellToIndex(num13, num14);
if (this.calcGrid[num15].status != this.statusClosedValue || flag9)
{
int num16 = 0;
bool flag12 = false;
if (flag2 || !new IntVec3(num13, 0, num14).GetTerrain(this.map).HasTag("Water"))
{
if (!this.pathGrid.WalkableFast(num15))
{
if (!flag)
{
if (flag6)
{
this.DebugFlash(new IntVec3(num13, 0, num14), 0.22f, "walk");
}
goto IL_E3A;
}
flag12 = true;
num16 += 70;
Building building = edificeGrid[num15];
if (building == null)
{
goto IL_E3A;
}
if (!PathFinder.IsDestroyable(building))
{
goto IL_E3A;
}
num16 += (int)((float)building.HitPoints * 0.2f);
}
if (i > 3)
{
switch (i)
{
case 4:
if (this.BlocksDiagonalMovement(num - this.mapSizeX))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2, 0, z2 - 1), 0.9f, "corn");
}
goto IL_E3A;
}
num16 += 70;
}
if (this.BlocksDiagonalMovement(num + 1))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2 + 1, 0, z2), 0.9f, "corn");
}
goto IL_E3A;
}
num16 += 70;
}
break;
case 5:
if (this.BlocksDiagonalMovement(num + this.mapSizeX))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2, 0, z2 + 1), 0.9f, "corn");
}
goto IL_E3A;
}
num16 += 70;
}
if (this.BlocksDiagonalMovement(num + 1))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2 + 1, 0, z2), 0.9f, "corn");
}
goto IL_E3A;
}
num16 += 70;
}
break;
case 6:
if (this.BlocksDiagonalMovement(num + this.mapSizeX))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2, 0, z2 + 1), 0.9f, "corn");
}
goto IL_E3A;
}
num16 += 70;
}
if (this.BlocksDiagonalMovement(num - 1))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2 - 1, 0, z2), 0.9f, "corn");
}
goto IL_E3A;
}
num16 += 70;
}
break;
case 7:
if (this.BlocksDiagonalMovement(num - this.mapSizeX))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2, 0, z2 - 1), 0.9f, "corn");
}
goto IL_E3A;
}
num16 += 70;
}
if (this.BlocksDiagonalMovement(num - 1))
{
if (flag8)
{
if (flag6)
{
this.DebugFlash(new IntVec3(x2 - 1, 0, z2), 0.9f, "corn");
}
goto IL_E3A;
}
num16 += 70;
}
break;
}
}
int num17 = (i <= 3) ? num9 : num10;
num17 += num16;
if (!flag12)
{
num17 += array[num15];
if (flag10)
{
num17 += topGrid[num15].extraDraftedPerceivedPathCost;
}
else
{
num17 += topGrid[num15].extraNonDraftedPerceivedPathCost;
}
}
if (byteGrid != null)
{
num17 += (int)(byteGrid[num15] * 8);
}
if (allowedArea != null && !allowedArea[num15])
{
num17 += 600;
}
if (flag5 && PawnUtility.AnyPawnBlockingPathAt(new IntVec3(num13, 0, num14), pawn, false, false, true))
{
num17 += 175;
}
Building building2 = this.edificeGrid[num15];
if (building2 != null)
{
this.PfProfilerBeginSample("Edifices");
int buildingCost = PathFinder.GetBuildingCost(building2, traverseParms, pawn);
if (buildingCost == 2147483647)
{
this.PfProfilerEndSample();
goto IL_E3A;
}
num17 += buildingCost;
this.PfProfilerEndSample();
}
List <Blueprint> list = this.blueprintGrid[num15];
if (list != null)
{
this.PfProfilerBeginSample("Blueprints");
int num18 = 0;
for (int j = 0; j < list.Count; j++)
{
num18 = Mathf.Max(num18, PathFinder.GetBlueprintCost(list[j], pawn));
}
if (num18 == 2147483647)
{
this.PfProfilerEndSample();
goto IL_E3A;
}
num17 += num18;
this.PfProfilerEndSample();
}
int num19 = num17 + this.calcGrid[num].knownCost;
ushort status = this.calcGrid[num15].status;
if (status == this.statusClosedValue || status == this.statusOpenValue)
{
int num20 = 0;
if (status == this.statusClosedValue)
{
num20 = num9;
}
if (this.calcGrid[num15].knownCost <= num19 + num20)
{
goto IL_E3A;
}
}
if (flag9)
{
this.calcGrid[num15].heuristicCost = Mathf.RoundToInt((float)this.regionCostCalculator.GetPathCostFromDestToRegion(num15) * PathFinder.RegionHeuristicWeightByNodesOpened.Evaluate((float)num4));
if (this.calcGrid[num15].heuristicCost < 0)
{
Log.ErrorOnce(string.Concat(new object[]
{
"Heuristic cost overflow for ",
pawn.ToStringSafe <Pawn>(),
" pathing from ",
start,
" to ",
dest,
"."
}), pawn.GetHashCode() ^ 193840009, false);
this.calcGrid[num15].heuristicCost = 0;
}
}
else if (status != this.statusClosedValue && status != this.statusOpenValue)
{
int dx = Math.Abs(num13 - x);
int dz = Math.Abs(num14 - z);
int num21 = GenMath.OctileDistance(dx, dz, num9, num10);
this.calcGrid[num15].heuristicCost = Mathf.RoundToInt((float)num21 * num8);
}
int num22 = num19 + this.calcGrid[num15].heuristicCost;
if (num22 < 0)
{
Log.ErrorOnce(string.Concat(new object[]
{
"Node cost overflow for ",
pawn.ToStringSafe <Pawn>(),
" pathing from ",
start,
" to ",
dest,
"."
}), pawn.GetHashCode() ^ 87865822, false);
num22 = 0;
}
this.calcGrid[num15].parentIndex = num;
this.calcGrid[num15].knownCost = num19;
this.calcGrid[num15].status = this.statusOpenValue;
this.calcGrid[num15].costNodeCost = num22;
num4++;
this.openList.Push(new PathFinder.CostNode(num15, num22));
}
}
}
IL_E3A :;
}
this.PfProfilerEndSample();
num3++;
this.calcGrid[num].status = this.statusClosedValue;
if (num4 >= num5 && flag7 && !flag9)
{
flag9 = true;
this.regionCostCalculator.Init(cellRect, traverseParms, num9, num10, byteGrid, allowedArea, flag10, this.disallowedCornerIndices);
this.InitStatusesAndPushStartNode(ref num, start);
num4 = 0;
num3 = 0;
}
}
}
string text = (pawn == null || pawn.CurJob == null) ? "null" : pawn.CurJob.ToString();
string text2 = (pawn == null || pawn.Faction == null) ? "null" : pawn.Faction.ToString();
Log.Warning(string.Concat(new object[]
{
pawn,
" pathing from ",
start,
" to ",
dest,
" ran out of cells to process.\nJob:",
text,
"\nFaction: ",
text2
}), false);
this.DebugDrawRichData();
this.PfProfilerEndSample();
return(PawnPath.NotFound);
Block_32:
this.PfProfilerEndSample();
PawnPath result = this.FinalizedPath(num, flag9);
this.PfProfilerEndSample();
return(result);
Block_34:
this.PfProfilerEndSample();
PawnPath result2 = this.FinalizedPath(num, flag9);
this.PfProfilerEndSample();
return(result2);
Block_35:
Log.Warning(string.Concat(new object[]
{
pawn,
" pathing from ",
start,
" to ",
dest,
" hit search limit of ",
160000,
" cells."
}), false);
this.DebugDrawRichData();
this.PfProfilerEndSample();
return(PawnPath.NotFound);
}
public int CalculatedCostAt(IntVec3 c, bool perceivedStatic, IntVec3 prevCell)
{
int num = 0;
TerrainDef terrainDef = this.map.terrainGrid.TerrainAt(c);
num = ((terrainDef != null && terrainDef.passability != Traversability.Impassable) ? (num + terrainDef.pathCost) : 10000);
int num2 = SnowUtility.MovementTicksAddOn(this.map.snowGrid.GetCategory(c));
num += num2;
List <Thing> list = this.map.thingGrid.ThingsListAt(c);
for (int i = 0; i < list.Count; i++)
{
Thing thing = list[i];
if (thing.def.passability == Traversability.Impassable)
{
return(10000);
}
if (!PathGrid.IsPathCostIgnoreRepeater(thing.def) || !prevCell.IsValid || !this.ContainsPathCostIgnoreRepeater(prevCell))
{
num += thing.def.pathCost;
}
if (prevCell.IsValid && thing is Building_Door)
{
Building edifice = prevCell.GetEdifice(this.map);
if (edifice != null && edifice is Building_Door)
{
num += 45;
}
}
}
if (perceivedStatic)
{
for (int j = 0; j < 9; j++)
{
IntVec3 b = GenAdj.AdjacentCellsAndInside[j];
IntVec3 c2 = c + b;
if (c2.InBounds(this.map))
{
Fire fire = null;
list = this.map.thingGrid.ThingsListAtFast(c2);
int num3 = 0;
while (num3 < list.Count)
{
fire = (list[num3] as Fire);
if (fire == null)
{
num3++;
continue;
}
break;
}
if (fire != null && fire.parent == null)
{
num = ((b.x != 0 || b.z != 0) ? (num + 150) : (num + 1000));
}
}
}
}
return(num);
}
public PawnPath FindPath(IntVec3 start, LocalTargetInfo dest, TraverseParms traverseParms, PathEndMode peMode = PathEndMode.OnCell)
{
if (DebugSettings.pathThroughWalls)
{
traverseParms.mode = TraverseMode.PassAllDestroyableThings;
}
Pawn pawn = traverseParms.pawn;
if (pawn != null && pawn.Map != map)
{
Log.Error("Tried to FindPath for pawn which is spawned in another map. His map PathFinder should have been used, not this one. pawn=" + pawn + " pawn.Map=" + pawn.Map + " map=" + map);
return(PawnPath.NotFound);
}
if (!start.IsValid)
{
Log.Error("Tried to FindPath with invalid start " + start + ", pawn= " + pawn);
return(PawnPath.NotFound);
}
if (!dest.IsValid)
{
Log.Error("Tried to FindPath with invalid dest " + dest + ", pawn= " + pawn);
return(PawnPath.NotFound);
}
if (traverseParms.mode == TraverseMode.ByPawn)
{
if (!pawn.CanReach(dest, peMode, Danger.Deadly, traverseParms.canBash, traverseParms.mode))
{
return(PawnPath.NotFound);
}
}
else if (!map.reachability.CanReach(start, dest, peMode, traverseParms))
{
return(PawnPath.NotFound);
}
PfProfilerBeginSample("FindPath for " + pawn + " from " + start + " to " + dest + (dest.HasThing ? (" at " + dest.Cell) : ""));
cellIndices = map.cellIndices;
pathGrid = map.pathGrid;
this.edificeGrid = map.edificeGrid.InnerArray;
blueprintGrid = map.blueprintGrid.InnerArray;
int x = dest.Cell.x;
int z = dest.Cell.z;
int curIndex = cellIndices.CellToIndex(start);
int num = cellIndices.CellToIndex(dest.Cell);
ByteGrid byteGrid = pawn?.GetAvoidGrid();
bool flag = traverseParms.mode == TraverseMode.PassAllDestroyableThings || traverseParms.mode == TraverseMode.PassAllDestroyableThingsNotWater;
bool flag2 = traverseParms.mode != TraverseMode.NoPassClosedDoorsOrWater && traverseParms.mode != TraverseMode.PassAllDestroyableThingsNotWater;
bool flag3 = !flag;
CellRect cellRect = CalculateDestinationRect(dest, peMode);
bool flag4 = cellRect.Width == 1 && cellRect.Height == 1;
int[] array = map.pathGrid.pathGrid;
TerrainDef[] topGrid = map.terrainGrid.topGrid;
EdificeGrid edificeGrid = map.edificeGrid;
int num2 = 0;
int num3 = 0;
Area allowedArea = GetAllowedArea(pawn);
bool flag5 = pawn != null && PawnUtility.ShouldCollideWithPawns(pawn);
bool flag6 = (!flag && start.GetRegion(map) != null) & flag2;
bool flag7 = !flag || !flag3;
bool flag8 = false;
bool flag9 = pawn?.Drafted ?? false;
int num4 = (pawn?.IsColonist ?? false) ? 100000 : 2000;
int num5 = 0;
int num6 = 0;
float num7 = DetermineHeuristicStrength(pawn, start, dest);
int num8;
int num9;
if (pawn != null)
{
num8 = pawn.TicksPerMoveCardinal;
num9 = pawn.TicksPerMoveDiagonal;
}
else
{
num8 = 13;
num9 = 18;
}
CalculateAndAddDisallowedCorners(traverseParms, peMode, cellRect);
InitStatusesAndPushStartNode(ref curIndex, start);
while (true)
{
PfProfilerBeginSample("Open cell");
if (openList.Count <= 0)
{
string text = (pawn != null && pawn.CurJob != null) ? pawn.CurJob.ToString() : "null";
string text2 = (pawn != null && pawn.Faction != null) ? pawn.Faction.ToString() : "null";
Log.Warning(pawn + " pathing from " + start + " to " + dest + " ran out of cells to process.\nJob:" + text + "\nFaction: " + text2);
DebugDrawRichData();
PfProfilerEndSample();
PfProfilerEndSample();
return(PawnPath.NotFound);
}
num5 += openList.Count;
num6++;
CostNode costNode = openList.Pop();
curIndex = costNode.index;
if (costNode.cost != calcGrid[curIndex].costNodeCost)
{
PfProfilerEndSample();
continue;
}
if (calcGrid[curIndex].status == statusClosedValue)
{
PfProfilerEndSample();
continue;
}
IntVec3 c = cellIndices.IndexToCell(curIndex);
int x2 = c.x;
int z2 = c.z;
if (flag4)
{
if (curIndex == num)
{
PfProfilerEndSample();
PawnPath result = FinalizedPath(curIndex, flag8);
PfProfilerEndSample();
return(result);
}
}
else if (cellRect.Contains(c) && !disallowedCornerIndices.Contains(curIndex))
{
PfProfilerEndSample();
PawnPath result2 = FinalizedPath(curIndex, flag8);
PfProfilerEndSample();
return(result2);
}
if (num2 > 160000)
{
break;
}
PfProfilerEndSample();
PfProfilerBeginSample("Neighbor consideration");
for (int i = 0; i < 8; i++)
{
uint num10 = (uint)(x2 + Directions[i]);
uint num11 = (uint)(z2 + Directions[i + 8]);
if (num10 >= mapSizeX || num11 >= mapSizeZ)
{
continue;
}
int num12 = (int)num10;
int num13 = (int)num11;
int num14 = cellIndices.CellToIndex(num12, num13);
if (calcGrid[num14].status == statusClosedValue && !flag8)
{
continue;
}
int num15 = 0;
bool flag10 = false;
if (!flag2 && new IntVec3(num12, 0, num13).GetTerrain(map).HasTag("Water"))
{
continue;
}
if (!pathGrid.WalkableFast(num14))
{
if (!flag)
{
continue;
}
flag10 = true;
num15 += 70;
Building building = edificeGrid[num14];
if (building == null || !IsDestroyable(building))
{
continue;
}
num15 += (int)((float)building.HitPoints * 0.2f);
}
switch (i)
{
case 4:
if (BlocksDiagonalMovement(curIndex - mapSizeX))
{
if (flag7)
{
continue;
}
num15 += 70;
}
if (BlocksDiagonalMovement(curIndex + 1))
{
if (flag7)
{
continue;
}
num15 += 70;
}
break;
case 5:
if (BlocksDiagonalMovement(curIndex + mapSizeX))
{
if (flag7)
{
continue;
}
num15 += 70;
}
if (BlocksDiagonalMovement(curIndex + 1))
{
if (flag7)
{
continue;
}
num15 += 70;
}
break;
case 6:
if (BlocksDiagonalMovement(curIndex + mapSizeX))
{
if (flag7)
{
continue;
}
num15 += 70;
}
if (BlocksDiagonalMovement(curIndex - 1))
{
if (flag7)
{
continue;
}
num15 += 70;
}
break;
case 7:
if (BlocksDiagonalMovement(curIndex - mapSizeX))
{
if (flag7)
{
continue;
}
num15 += 70;
}
if (BlocksDiagonalMovement(curIndex - 1))
{
if (flag7)
{
continue;
}
num15 += 70;
}
break;
}
int num16 = (i > 3) ? num9 : num8;
num16 += num15;
if (!flag10)
{
num16 += array[num14];
num16 = ((!flag9) ? (num16 + topGrid[num14].extraNonDraftedPerceivedPathCost) : (num16 + topGrid[num14].extraDraftedPerceivedPathCost));
}
if (byteGrid != null)
{
num16 += byteGrid[num14] * 8;
}
if (allowedArea != null && !allowedArea[num14])
{
num16 += 600;
}
if (flag5 && PawnUtility.AnyPawnBlockingPathAt(new IntVec3(num12, 0, num13), pawn, actAsIfHadCollideWithPawnsJob: false, collideOnlyWithStandingPawns: false, forPathFinder: true))
{
num16 += 175;
}
Building building2 = this.edificeGrid[num14];
if (building2 != null)
{
PfProfilerBeginSample("Edifices");
int buildingCost = GetBuildingCost(building2, traverseParms, pawn);
if (buildingCost == int.MaxValue)
{
PfProfilerEndSample();
continue;
}
num16 += buildingCost;
PfProfilerEndSample();
}
List <Blueprint> list = blueprintGrid[num14];
if (list != null)
{
PfProfilerBeginSample("Blueprints");
int num17 = 0;
for (int j = 0; j < list.Count; j++)
{
num17 = Mathf.Max(num17, GetBlueprintCost(list[j], pawn));
}
if (num17 == int.MaxValue)
{
PfProfilerEndSample();
continue;
}
num16 += num17;
PfProfilerEndSample();
}
int num18 = num16 + calcGrid[curIndex].knownCost;
ushort status = calcGrid[num14].status;
if (status == statusClosedValue || status == statusOpenValue)
{
int num19 = 0;
if (status == statusClosedValue)
{
num19 = num8;
}
if (calcGrid[num14].knownCost <= num18 + num19)
{
continue;
}
}
if (flag8)
{
calcGrid[num14].heuristicCost = Mathf.RoundToInt((float)regionCostCalculator.GetPathCostFromDestToRegion(num14) * RegionHeuristicWeightByNodesOpened.Evaluate(num3));
if (calcGrid[num14].heuristicCost < 0)
{
Log.ErrorOnce("Heuristic cost overflow for " + pawn.ToStringSafe() + " pathing from " + start + " to " + dest + ".", pawn.GetHashCode() ^ 0xB8DC389);
calcGrid[num14].heuristicCost = 0;
}
}
else if (status != statusClosedValue && status != statusOpenValue)
{
int dx = Math.Abs(num12 - x);
int dz = Math.Abs(num13 - z);
int num20 = GenMath.OctileDistance(dx, dz, num8, num9);
calcGrid[num14].heuristicCost = Mathf.RoundToInt((float)num20 * num7);
}
int num21 = num18 + calcGrid[num14].heuristicCost;
if (num21 < 0)
{
Log.ErrorOnce("Node cost overflow for " + pawn.ToStringSafe() + " pathing from " + start + " to " + dest + ".", pawn.GetHashCode() ^ 0x53CB9DE);
num21 = 0;
}
calcGrid[num14].parentIndex = curIndex;
calcGrid[num14].knownCost = num18;
calcGrid[num14].status = statusOpenValue;
calcGrid[num14].costNodeCost = num21;
num3++;
openList.Push(new CostNode(num14, num21));
}
PfProfilerEndSample();
num2++;
calcGrid[curIndex].status = statusClosedValue;
if (num3 >= num4 && flag6 && !flag8)
{
flag8 = true;
regionCostCalculator.Init(cellRect, traverseParms, num8, num9, byteGrid, allowedArea, flag9, disallowedCornerIndices);
InitStatusesAndPushStartNode(ref curIndex, start);
num3 = 0;
num2 = 0;
}
}
Log.Warning(pawn + " pathing from " + start + " to " + dest + " hit search limit of " + 160000 + " cells.");
DebugDrawRichData();
PfProfilerEndSample();
PfProfilerEndSample();
return(PawnPath.NotFound);
}
