diff options
author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2002-09-22 02:03:17 +0000 |
---|---|---|
committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2002-09-22 02:03:17 +0000 |
commit | d10cfa8dc0e0c46fb4ebdcbb957029727bc8fe21 (patch) | |
tree | 46c3473e2a4ca056cf463861491452bb0f47b6a9 /gcc/cfganal.c | |
parent | d7a9a1c8a54a4eb32dcc524bea8753342994aa67 (diff) | |
download | gcc-d10cfa8dc0e0c46fb4ebdcbb957029727bc8fe21.tar.gz |
* ChangeLog: Follow spelling conventions.
* ChangeLog.0: Likewise.
* ChangeLog.1: Likewise.
* ChangeLog.2: Likewise.
* ChangeLog.3: Likewise.
* ChangeLog.4: Likewise.
* ChangeLog.5: Likewise.
* ChangeLog.6: Likewise.
* FSFChangeLog.10: Likewise.
* FSFChangeLog.11: Likewise.
* alias.c: Likewise.
* basic-block.h: Likewise.
* c-aux-info.c: Likewise.
* c-common.c: Likewise.
* c-common.h: Likewise.
* c-decl.c: Likewise.
* c-format.c: Likewise.
* c-semantics.c: Likewise.
* c-typeck.c: Likewise.
* calls.c: Likewise.
* cfganal.c: Likewise.
* cfgloop.c: Likewise.
* collect2.c: Likewise.
* combine.c: Likewise.
* conflict.c: Likewise.
* cppexp.c: Likewise.
* cppfiles.c: Likewise.
* cpphash.h: Likewise.
* cppinit.c: Likewise.
* cpplex.c: Likewise.
* cpplib.c: Likewise.
* cpplib.h: Likewise.
* cppmacro.c: Likewise.
* cse.c: Likewise.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@57398 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/cfganal.c')
-rw-r--r-- | gcc/cfganal.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/cfganal.c b/gcc/cfganal.c index 35ce07d53fc..bc8fff2510b 100644 --- a/gcc/cfganal.c +++ b/gcc/cfganal.c @@ -97,7 +97,7 @@ can_fallthru (src, target) } /* Mark the back edges in DFS traversal. - Return non-zero if a loop (natural or otherwise) is present. + Return nonzero if a loop (natural or otherwise) is present. Inspired by Depth_First_Search_PP described in: Advanced Compiler Design and Implementation @@ -370,7 +370,7 @@ flow_call_edges_add (blocks) } /* Find unreachable blocks. An unreachable block will have 0 in - the reachable bit in block->flags. A non-zero value indicates the + the reachable bit in block->flags. A nonzero value indicates the block is reachable. */ void @@ -781,8 +781,8 @@ flow_reverse_top_sort_order_compute (rts_order) } /* Compute the depth first search order and store in the array - DFS_ORDER if non-zero, marking the nodes visited in VISITED. If - RC_ORDER is non-zero, return the reverse completion number for each + DFS_ORDER if nonzero, marking the nodes visited in VISITED. If + RC_ORDER is nonzero, return the reverse completion number for each node. Returns the number of nodes visited. A depth first search tries to get as far away from the starting point as quickly as possible. */ @@ -1027,7 +1027,7 @@ flow_preorder_transversal_compute (pot_order) /* Initialize the data structures used for depth-first search on the reverse graph. If INITIALIZE_STACK is nonzero, the exit block is added to the basic block stack. DATA is the current depth-first - search context. If INITIALIZE_STACK is non-zero, there is an + search context. If INITIALIZE_STACK is nonzero, there is an element on the stack. */ static void |