From patchwork Wed Mar 6 18:14:56 2019 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Patchwork-Submitter: Andrew Burgess X-Patchwork-Id: 31751 Received: (qmail 36833 invoked by alias); 6 Mar 2019 18:16:02 -0000 Mailing-List: contact gdb-patches-help@sourceware.org; run by ezmlm Precedence: bulk List-Id: List-Unsubscribe: List-Subscribe: List-Archive: List-Post: List-Help: , Sender: gdb-patches-owner@sourceware.org Delivered-To: mailing list gdb-patches@sourceware.org Received: (qmail 36496 invoked by uid 89); 6 Mar 2019 18:16:00 -0000 Authentication-Results: sourceware.org; auth=none X-Spam-SWARE-Status: No, score=-24.2 required=5.0 tests=BAYES_00, DNS_FROM_AHBL_RHSBL, GIT_PATCH_0, GIT_PATCH_1, GIT_PATCH_2, GIT_PATCH_3, RCVD_IN_DNSWL_NONE, SPF_PASS, TIME_LIMIT_EXCEEDED autolearn=unavailable version=3.3.1 spammy=lt, gt, ne, le X-HELO: mail-wr1-f49.google.com Received: from mail-wr1-f49.google.com (HELO mail-wr1-f49.google.com) (209.85.221.49) by sourceware.org (qpsmtpd/0.93/v0.84-503-g423c35a) with ESMTP; Wed, 06 Mar 2019 18:15:27 +0000 Received: by mail-wr1-f49.google.com with SMTP id o17so14520288wrw.3 for ; Wed, 06 Mar 2019 10:15:15 -0800 (PST) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=embecosm.com; s=google; h=from:to:cc:subject:date:message-id:in-reply-to:references :in-reply-to:references; bh=Ut6VIKcDaQTPESvr8qOiNDIl5ixGJiBGMfJ7wrS07qM=; b=fZ9iLLKvbJLNAJJvPvjN8EU2iQIlDQ3DqhiUBI2MWw4pO/cSGiU6hSJUxgJ2LsZEYV 5UGH892ZOLcZBytl6cUxXHF1bmLGN90xN3XX2PfZsuViloOcp8Z1cYWUY51P0MQueMn2 wEfOTl4lAZYmNlN9Q3JsWk117ok7aI1pOd5/2vmk7QisePDKELU17KMs6wGicWF5fvyo hnZXmqvFNO0ZUMsMuEX0AJZpMsPxbykhmthVK5YRGrBzSef7sqixnQM8vxSx8MWRknUZ SRSsPAQphrONQZnZNoqoqmZVcp1oGFLD484SoHsLc7m1tF704AA+vLxlHl9IPJkxD8qE xtow== Return-Path: Received: from localhost (host86-142-70-198.range86-142.btcentralplus.com. [86.142.70.198]) by smtp.gmail.com with ESMTPSA id z15sm3093656wmi.46.2019.03.06.10.15.11 (version=TLS1_2 cipher=ECDHE-RSA-CHACHA20-POLY1305 bits=256/256); Wed, 06 Mar 2019 10:15:12 -0800 (PST) From: Andrew Burgess To: gdb-patches@sourceware.org Cc: Andrew Burgess Subject: [PUSHED 03/11] gdb/fortran: Simplify handling of Fortran dot operations and keywords Date: Wed, 6 Mar 2019 18:14:56 +0000 Message-Id: <2978af721f1852cb232a2f70de3f94225601a704.1551895528.git.andrew.burgess@embecosm.com> In-Reply-To: References: In-Reply-To: References: X-IsSubscribed: yes Use strncasecmp to compare Fortran dot operations (like .AND.) and for the keywords list. This allows for some duplication to be removed from the token arrays. I've also performed whitespace cleanup around the code I've changed. I have added some tests to ensure that upper and lowercase dot operations are correctly tested. The keywords list remains always lowercase for now. There should be no user visible changes after this commit. gdb/ChangeLog: * f-exp.y (struct token): Add comments. (dot_ops): Remove uppercase versions and the end marker. (f77_keywords): Likewise. (yylex): Use ARRAY_SIZE to iterate over dot_ops, assert all entries in the dot_ops array are case insensitive, and use strncasecmp to compare strings. Also some whitespace cleanup in this area. Similar for the f77_keywords array, except entries in this list might be case sensitive. gdb/testsuite/ChangeLog: * gdb.fortran/dot-ops.exp: New file. --- gdb/ChangeLog | 11 +++ gdb/f-exp.y | 103 ++++++++++++++-------------- gdb/testsuite/ChangeLog | 4 ++ gdb/testsuite/gdb.fortran/dot-ops.exp | 123 ++++++++++++++++++++++++++++++++++ 4 files changed, 189 insertions(+), 52 deletions(-) create mode 100644 gdb/testsuite/gdb.fortran/dot-ops.exp diff --git a/gdb/f-exp.y b/gdb/f-exp.y index 704585e63ae..5e980944b19 100644 --- a/gdb/f-exp.y +++ b/gdb/f-exp.y @@ -775,36 +775,33 @@ parse_number (struct parser_state *par_state, struct token { + /* The string to match against. */ const char *oper; + + /* The lexer token to return. */ int token; + + /* The expression opcode to embed within the token. */ enum exp_opcode opcode; + + /* When this is true the string in OPER is matched exactly including + case, when this is false OPER is matched case insensitively. */ + bool case_sensitive; }; static const struct token dot_ops[] = { - { ".and.", BOOL_AND, BINOP_END }, - { ".AND.", BOOL_AND, BINOP_END }, - { ".or.", BOOL_OR, BINOP_END }, - { ".OR.", BOOL_OR, BINOP_END }, - { ".not.", BOOL_NOT, BINOP_END }, - { ".NOT.", BOOL_NOT, BINOP_END }, - { ".eq.", EQUAL, BINOP_END }, - { ".EQ.", EQUAL, BINOP_END }, - { ".eqv.", EQUAL, BINOP_END }, - { ".NEQV.", NOTEQUAL, BINOP_END }, - { ".neqv.", NOTEQUAL, BINOP_END }, - { ".EQV.", EQUAL, BINOP_END }, - { ".ne.", NOTEQUAL, BINOP_END }, - { ".NE.", NOTEQUAL, BINOP_END }, - { ".le.", LEQ, BINOP_END }, - { ".LE.", LEQ, BINOP_END }, - { ".ge.", GEQ, BINOP_END }, - { ".GE.", GEQ, BINOP_END }, - { ".gt.", GREATERTHAN, BINOP_END }, - { ".GT.", GREATERTHAN, BINOP_END }, - { ".lt.", LESSTHAN, BINOP_END }, - { ".LT.", LESSTHAN, BINOP_END }, - { NULL, 0, BINOP_END } + { ".and.", BOOL_AND, BINOP_END, false }, + { ".or.", BOOL_OR, BINOP_END, false }, + { ".not.", BOOL_NOT, BINOP_END, false }, + { ".eq.", EQUAL, BINOP_END, false }, + { ".eqv.", EQUAL, BINOP_END, false }, + { ".neqv.", NOTEQUAL, BINOP_END, false }, + { ".ne.", NOTEQUAL, BINOP_END, false }, + { ".le.", LEQ, BINOP_END, false }, + { ".ge.", GEQ, BINOP_END, false }, + { ".gt.", GREATERTHAN, BINOP_END, false }, + { ".lt.", LESSTHAN, BINOP_END, false }, }; /* Holds the Fortran representation of a boolean, and the integer value we @@ -825,25 +822,25 @@ static const struct f77_boolean_val boolean_values[] = { ".false.", 0 } }; -static const struct token f77_keywords[] = +static const struct token f77_keywords[] = { - { "complex_16", COMPLEX_S16_KEYWORD, BINOP_END }, - { "complex_32", COMPLEX_S32_KEYWORD, BINOP_END }, - { "character", CHARACTER, BINOP_END }, - { "integer_2", INT_S2_KEYWORD, BINOP_END }, - { "logical_1", LOGICAL_S1_KEYWORD, BINOP_END }, - { "logical_2", LOGICAL_S2_KEYWORD, BINOP_END }, - { "logical_8", LOGICAL_S8_KEYWORD, BINOP_END }, - { "complex_8", COMPLEX_S8_KEYWORD, BINOP_END }, - { "integer", INT_KEYWORD, BINOP_END }, - { "logical", LOGICAL_KEYWORD, BINOP_END }, - { "real_16", REAL_S16_KEYWORD, BINOP_END }, - { "complex", COMPLEX_S8_KEYWORD, BINOP_END }, - { "sizeof", SIZEOF, BINOP_END }, - { "real_8", REAL_S8_KEYWORD, BINOP_END }, - { "real", REAL_KEYWORD, BINOP_END }, - { NULL, 0, BINOP_END } -}; + /* Historically these have always been lowercase only in GDB. */ + { "complex_16", COMPLEX_S16_KEYWORD, BINOP_END, true }, + { "complex_32", COMPLEX_S32_KEYWORD, BINOP_END, true }, + { "character", CHARACTER, BINOP_END, true }, + { "integer_2", INT_S2_KEYWORD, BINOP_END, true }, + { "logical_1", LOGICAL_S1_KEYWORD, BINOP_END, true }, + { "logical_2", LOGICAL_S2_KEYWORD, BINOP_END, true }, + { "logical_8", LOGICAL_S8_KEYWORD, BINOP_END, true }, + { "complex_8", COMPLEX_S8_KEYWORD, BINOP_END, true }, + { "integer", INT_KEYWORD, BINOP_END, true }, + { "logical", LOGICAL_KEYWORD, BINOP_END, true }, + { "real_16", REAL_S16_KEYWORD, BINOP_END, true }, + { "complex", COMPLEX_S8_KEYWORD, BINOP_END, true }, + { "sizeof", SIZEOF, BINOP_END, true }, + { "real_8", REAL_S8_KEYWORD, BINOP_END, true }, + { "real", REAL_KEYWORD, BINOP_END, true }, +}; /* Implementation of a dynamically expandable buffer for processing input characters acquired through lexptr and building a value to return in @@ -951,18 +948,18 @@ yylex (void) } } } - + /* See if it is a special .foo. operator. */ - - for (int i = 0; dot_ops[i].oper != NULL; i++) - if (strncmp (tokstart, dot_ops[i].oper, - strlen (dot_ops[i].oper)) == 0) + for (int i = 0; i < ARRAY_SIZE (dot_ops); i++) + if (strncasecmp (tokstart, dot_ops[i].oper, + strlen (dot_ops[i].oper)) == 0) { + gdb_assert (!dot_ops[i].case_sensitive); lexptr += strlen (dot_ops[i].oper); yylval.opcode = dot_ops[i].opcode; return dot_ops[i].token; } - + /* See if it is an exponentiation operator. */ if (strncmp (tokstart, "**", 2) == 0) @@ -1122,16 +1119,18 @@ yylex (void) lexptr += namelen; /* Catch specific keywords. */ - - for (int i = 0; f77_keywords[i].oper != NULL; i++) + + for (int i = 0; i < ARRAY_SIZE (f77_keywords); i++) if (strlen (f77_keywords[i].oper) == namelen - && strncmp (tokstart, f77_keywords[i].oper, namelen) == 0) + && ((!f77_keywords[i].case_sensitive + && strncasecmp (tokstart, f77_keywords[i].oper, namelen) == 0) + || (f77_keywords[i].case_sensitive + && strncmp (tokstart, f77_keywords[i].oper, namelen) == 0))) { - /* lexptr += strlen(f77_keywords[i].operator); */ yylval.opcode = f77_keywords[i].opcode; return f77_keywords[i].token; } - + yylval.sval.ptr = tokstart; yylval.sval.length = namelen; diff --git a/gdb/testsuite/gdb.fortran/dot-ops.exp b/gdb/testsuite/gdb.fortran/dot-ops.exp new file mode 100644 index 00000000000..787471db918 --- /dev/null +++ b/gdb/testsuite/gdb.fortran/dot-ops.exp @@ -0,0 +1,123 @@ +# Copyright 2019 Free Software Foundation, Inc. + +# This program is free software; you can redistribute it and/or modify +# it under the terms of the GNU General Public License as published by +# the Free Software Foundation; either version 3 of the License, or +# (at your option) any later version. +# +# This program is distributed in the hope that it will be useful, +# but WITHOUT ANY WARRANTY; without even the implied warranty of +# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +# GNU General Public License for more details. +# +# You should have received a copy of the GNU General Public License +# along with this program. If not, see . + +# This file tests GDB's handling of some of the builtin logical and +# arithmetic dot operators in Fortran, for example `.AND.` and `.LE.`. + +load_lib "fortran.exp" + +if { [skip_fortran_tests] } { continue } + +proc test_dot_operations {} { + + foreach_with_prefix format { "uppercase" "lowercase" } { + if {$format == "uppercase"} { + set true ".TRUE." + set false ".FALSE." + set and ".AND." + set or ".OR." + set not ".NOT." + set eqv ".EQV." + set neqv ".NEQV." + set eq ".EQ." + set ne ".NE." + set le ".LE." + set ge ".GE." + set lt ".LT." + set gt ".GT." + } else { + set true ".true." + set false ".false." + set and ".and." + set or ".or." + set not ".not." + set eqv ".eqv." + set neqv ".neqv." + set eq ".eq." + set ne ".ne." + set le ".le." + set ge ".ge." + set lt ".lt." + set gt ".gt." + } + + # Logical AND + gdb_test "p $true $and $true" " = .TRUE." + gdb_test "p $true $and $false" " = .FALSE." + gdb_test "p $false $and $true" " = .FALSE." + gdb_test "p $false $and $false" " = .FALSE." + + # Logical OR + gdb_test "p $true $or $true" " = .TRUE." + gdb_test "p $true $or $false" " = .TRUE." + gdb_test "p $false $or $true" " = .TRUE." + gdb_test "p $false $or $false" " = .FALSE." + + # Logical NOT + gdb_test "p $not $true" " = .FALSE." + gdb_test "p $not $false" " = .TRUE." + + # Logical EQV + gdb_test "p $true $eqv $true" " = .TRUE." + gdb_test "p $true $eqv $false" " = .FALSE." + gdb_test "p $false $eqv $true" " = .FALSE." + gdb_test "p $false $eqv $false" " = .TRUE." + + # Logical NEQV + gdb_test "p $true $neqv $true" " = .FALSE." + gdb_test "p $true $neqv $false" " = .TRUE." + gdb_test "p $false $neqv $true" " = .TRUE." + gdb_test "p $false $neqv $false" " = .FALSE." + + # Arithmetic EQ + gdb_test "p 5 $eq 4" " = .FALSE." + gdb_test "p 4 $eq 4" " = .TRUE." + + # Arithmetic NE + gdb_test "p 5 $ne 4" " = .TRUE." + gdb_test "p 4 $ne 4" " = .FALSE." + + # Arithmetic LE + gdb_test "p 5 $le 4" " = .FALSE." + gdb_test "p 4 $le 4" " = .TRUE." + gdb_test "p 3 $le 4" " = .TRUE." + + # Arithmetic LT + gdb_test "p 5 $lt 4" " = .FALSE." + gdb_test "p 4 $lt 4" " = .FALSE." + gdb_test "p 3 $lt 4" " = .TRUE." + + # Arithmetic GE + gdb_test "p 5 $ge 4" " = .TRUE." + gdb_test "p 4 $ge 4" " = .TRUE." + gdb_test "p 3 $ge 4" " = .FALSE." + + # Arithmetic GT + gdb_test "p 5 $gt 4" " = .TRUE." + gdb_test "p 4 $gt 4" " = .FALSE." + gdb_test "p 3 $gt 4" " = .FALSE." + } +} + +# Start of test script. + +clean_restart + +if [set_lang_fortran] then { + test_dot_operations +} else { + warning "$test_name tests suppressed." 0 +} +