mirror of
git://git.sv.gnu.org/emacs.git
synced 2026-04-27 16:51:06 -07:00
In gcc 7.3, -wextra sets -wimplicit-fallthough=3, which is rather strict about the format of the "fall through" comment.
Copied from Perforce Change: 194064
This commit is contained in:
parent
2e63bc2b64
commit
bd5a075fd2
2 changed files with 8 additions and 8 deletions
|
|
@ -1,7 +1,7 @@
|
|||
/* qs.c: QUICKSORT
|
||||
*
|
||||
* $Id$
|
||||
* Copyright (c) 2001-2016 Ravenbrook Limited. See end of file for license.
|
||||
* Copyright (c) 2001-2018 Ravenbrook Limited. See end of file for license.
|
||||
*
|
||||
* The purpose of this program is to act as a "real" client of the MM.
|
||||
* It is a test, but (hopefully) less contrived than some of the other
|
||||
|
|
@ -415,7 +415,7 @@ static mps_res_t scan1(mps_ss_t ss, mps_addr_t *objectIO)
|
|||
if(res != MPS_RES_OK)
|
||||
return res;
|
||||
cell->value = addr;
|
||||
/* fall */
|
||||
/* fall through */
|
||||
|
||||
case QSInt:
|
||||
fixTail:
|
||||
|
|
@ -538,7 +538,7 @@ int main(int argc, char *argv[])
|
|||
|
||||
/* C. COPYRIGHT AND LICENSE
|
||||
*
|
||||
* Copyright (c) 2001-2016 Ravenbrook Limited <http://www.ravenbrook.com/>.
|
||||
* Copyright (c) 2001-2018 Ravenbrook Limited <http://www.ravenbrook.com/>.
|
||||
* All rights reserved. This is an open source license. Contact
|
||||
* Ravenbrook for commercial licensing options.
|
||||
*
|
||||
|
|
|
|||
|
|
@ -1,7 +1,7 @@
|
|||
/* splay.c: SPLAY TREE IMPLEMENTATION
|
||||
*
|
||||
* $Id$
|
||||
* Copyright (c) 2001-2016 Ravenbrook Limited. See end of file for license.
|
||||
* Copyright (c) 2001-2018 Ravenbrook Limited. See end of file for license.
|
||||
*
|
||||
* .purpose: Splay trees are used to manage potentially unbounded
|
||||
* collections of ordered things. In the MPS these are usually
|
||||
|
|
@ -753,7 +753,7 @@ Bool SplayTreeInsert(SplayTree splay, Tree node) {
|
|||
switch (SplaySplay(splay, splay->nodeKey(node), splay->compare)) {
|
||||
default:
|
||||
NOTREACHED;
|
||||
/* defensive fall-through */
|
||||
/* fall through */
|
||||
case CompareEQUAL: /* duplicate node */
|
||||
return FALSE;
|
||||
|
||||
|
|
@ -930,7 +930,7 @@ Bool SplayTreeNeighbours(Tree *leftReturn, Tree *rightReturn,
|
|||
switch (cmp) {
|
||||
default:
|
||||
NOTREACHED;
|
||||
/* defensive fall-through */
|
||||
/* fall through */
|
||||
case CompareEQUAL:
|
||||
found = FALSE;
|
||||
break;
|
||||
|
|
@ -1005,7 +1005,7 @@ Tree SplayTreeNext(SplayTree splay, TreeKey oldKey) {
|
|||
switch (SplaySplay(splay, oldKey, splay->compare)) {
|
||||
default:
|
||||
NOTREACHED;
|
||||
/* defensive fall-through */
|
||||
/* fall through */
|
||||
case CompareLESS:
|
||||
return SplayTreeRoot(splay);
|
||||
|
||||
|
|
@ -1394,7 +1394,7 @@ Res SplayTreeDescribe(SplayTree splay, mps_lib_FILE *stream, Count depth,
|
|||
|
||||
/* C. COPYRIGHT AND LICENSE
|
||||
*
|
||||
* Copyright (C) 2001-2016 Ravenbrook Limited <http://www.ravenbrook.com/>.
|
||||
* Copyright (C) 2001-2018 Ravenbrook Limited <http://www.ravenbrook.com/>.
|
||||
* All rights reserved. This is an open source license. Contact
|
||||
* Ravenbrook for commercial licensing options.
|
||||
*
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue