diff options
Diffstat (limited to 'src/backend/storage/lmgr/deadlock.c')
| -rw-r--r-- | src/backend/storage/lmgr/deadlock.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/src/backend/storage/lmgr/deadlock.c b/src/backend/storage/lmgr/deadlock.c index 5e49c78905..968e6c0e6d 100644 --- a/src/backend/storage/lmgr/deadlock.c +++ b/src/backend/storage/lmgr/deadlock.c @@ -307,7 +307,7 @@ GetBlockingAutoVacuumPgproc(void) * by an outer level of recursion. Add to this each possible solution * constraint for any cycle detected at this level. * - * Returns TRUE if no solution exists. Returns FALSE if a deadlock-free + * Returns true if no solution exists. Returns false if a deadlock-free * state is attainable, in which case waitOrders[] shows the required * rearrangements of lock wait queues (if any). */ @@ -432,8 +432,8 @@ TestConfiguration(PGPROC *startProc) * FindLockCycle -- basic check for deadlock cycles * * Scan outward from the given proc to see if there is a cycle in the - * waits-for graph that includes this proc. Return TRUE if a cycle - * is found, else FALSE. If a cycle is found, we return a list of + * waits-for graph that includes this proc. Return true if a cycle + * is found, else false. If a cycle is found, we return a list of * the "soft edges", if any, included in the cycle. These edges could * potentially be eliminated by rearranging wait queues. We also fill * deadlockDetails[] with information about the detected cycle; this info @@ -792,8 +792,8 @@ FindLockCycleRecurseMember(PGPROC *checkProc, * of nWaitOrders WAIT_ORDER structs in waitOrders[], with PGPROC array * workspace in waitOrderProcs[]. * - * Returns TRUE if able to build an ordering that satisfies all the - * constraints, FALSE if not (there are contradictory constraints). + * Returns true if able to build an ordering that satisfies all the + * constraints, false if not (there are contradictory constraints). */ static bool ExpandConstraints(EDGE *constraints, @@ -864,8 +864,8 @@ ExpandConstraints(EDGE *constraints, * the "blocker" in the output array. The EDGE array may well contain * edges associated with other locks; these should be ignored. * - * Returns TRUE if able to build an ordering that satisfies all the - * constraints, FALSE if not (there are contradictory constraints). + * Returns true if able to build an ordering that satisfies all the + * constraints, false if not (there are contradictory constraints). */ static bool TopoSort(LOCK *lock, |