Rename loop to cycle

Author: knizhnik

contrib/pg_dtm/dtmd/include/ddd.h

@@ -34,6 +34,6 @@ typedef struct Graph
 
 extern void initGraph(Graph* graph);
 extern void addSubgraph(Instance* instance, Graph* graph, xid_t* xids, int n_xids);
-extern bool findLoop(Graph* graph, xid_t root);
+extern bool findCycle(Graph* graph, xid_t root);
 
 #endif

contrib/pg_dtm/dtmd/src/ddd.c

@@ -119,7 +119,7 @@ static bool recursiveTraverseGraph(Vertex* root, Vertex* v, int marker)
     return false;        
 }
 
-bool findLoop(Graph* graph, xid_t root)
+bool findCycle(Graph* graph, xid_t root)
 {
     Vertex* v;
     for (v = graph->hashtable[root % MAX_TRANSACTIONS]; v != NULL; v = v->next) { 

contrib/pg_dtm/dtmd/src/main.c

@@ -547,7 +547,7 @@ static void ondeadlock(client_t client, int argc, xid_t *argv) {
     xid_t root = argv[1];
     Instance* instance = &CLIENT_USERDATA(client)->instance;
     addSubgraph(instance, &graph, argv+2, argc-2);
-    bool hasDeadLock = findLoop(&graph, root);
+    bool hasDeadLock = findCycle(&graph, root);
     client_message_shortcut(client, hasDeadLock ? RES_DEADLOCK : RES_OK);
 }
 

contrib/pg_dtm/pg_dtm.c

@@ -445,7 +445,7 @@ DtmGetNewTransactionId(bool isSubXact)
 
 		if (IsUnderPostmaster && TransactionIdFollowsOrEquals(xid, xidStopLimit))
 		{
-			char oldest_datname = get_database_name(oldest_datoid);
+			char *oldest_datname = get_database_name(oldest_datoid);
 
 			/* complain even if that DB has disappeared */
 			if (oldest_datname)
@@ -466,7 +466,7 @@ DtmGetNewTransactionId(bool isSubXact)
 		else
 		if (TransactionIdFollowsOrEquals(xid, xidWarnLimit))
 		{
-			char oldest_datname = get_database_name(oldest_datoid);
+			char *oldest_datname = get_database_name(oldest_datoid);
 
 			/* complain even if that DB has disappeared */
 			if (oldest_datname)