diff options
| author | rubidium <rubidium@openttd.org> | 2009-11-09 10:40:33 +0000 |
|---|---|---|
| committer | rubidium <rubidium@openttd.org> | 2009-11-09 10:40:33 +0000 |
| commit | 860b9b1cead825da2dfc109858f8f134f973f62d (patch) | |
| tree | 217816b8cd30cd32331090a36222f2e968c830e2 /src/aystar.cpp | |
| parent | c2221885f488b9a7ca52b11e621582d4c60ab80d (diff) | |
| download | openttd-860b9b1cead825da2dfc109858f8f134f973f62d.tar.xz | |
(svn r18028) -Codechange: unglobalise some functions
Diffstat (limited to 'src/aystar.cpp')
| -rw-r--r-- | src/aystar.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/aystar.cpp b/src/aystar.cpp index ef8b7657e..5630c01bb 100644 --- a/src/aystar.cpp +++ b/src/aystar.cpp @@ -90,7 +90,7 @@ static void AyStarMain_OpenList_Add(AyStar *aystar, PathNode *parent, const AySt * return values: * AYSTAR_DONE : indicates we are done */ -int AyStarMain_CheckTile(AyStar *aystar, AyStarNode *current, OpenListNode *parent) +static int AyStarMain_CheckTile(AyStar *aystar, AyStarNode *current, OpenListNode *parent) { int new_f, new_g, new_h; PathNode *closedlist_parent; @@ -156,7 +156,7 @@ int AyStarMain_CheckTile(AyStar *aystar, AyStarNode *current, OpenListNode *pare * AYSTAR_FOUND_END_NODE : indicates we found the end. Path_found now is true, and in path is the path found. * AYSTAR_STILL_BUSY : indicates we have done this tile, did not found the path yet, and have items left to try. */ -int AyStarMain_Loop(AyStar *aystar) +static int AyStarMain_Loop(AyStar *aystar) { int i, r; @@ -200,7 +200,7 @@ int AyStarMain_Loop(AyStar *aystar) /* * This function frees the memory it allocated */ -void AyStarMain_Free(AyStar *aystar) +static void AyStarMain_Free(AyStar *aystar) { aystar->OpenListQueue.free(&aystar->OpenListQueue, false); /* 2nd argument above is false, below is true, to free the values only @@ -276,7 +276,7 @@ int AyStarMain_Main(AyStar *aystar) * clear() automatically when the algorithm finishes * g is the cost for starting with this node. */ -void AyStarMain_AddStartNode(AyStar *aystar, AyStarNode *start_node, uint g) +static void AyStarMain_AddStartNode(AyStar *aystar, AyStarNode *start_node, uint g) { #ifdef AYSTAR_DEBUG printf("[AyStar] Starting A* Algorithm from node (%d, %d, %d)\n", |