From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id AA05F3852764; Thu, 9 Jun 2022 15:15:56 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org AA05F3852764 From: "dmalcolm at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug analyzer/105909] New: RFE: SARIF output could contain metadata about limitations of the analysis Date: Thu, 09 Jun 2022 15:15:56 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: new X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: analyzer X-Bugzilla-Version: 12.0 X-Bugzilla-Keywords: X-Bugzilla-Severity: normal X-Bugzilla-Who: dmalcolm at gcc dot gnu.org X-Bugzilla-Status: UNCONFIRMED X-Bugzilla-Resolution: X-Bugzilla-Priority: P3 X-Bugzilla-Assigned-To: dmalcolm at gcc dot gnu.org X-Bugzilla-Target-Milestone: --- X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: bug_id short_desc product version bug_status bug_severity priority component assigned_to reporter target_milestone Message-ID: Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/ Auto-Submitted: auto-generated MIME-Version: 1.0 X-BeenThere: gcc-bugs@gcc.gnu.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Gcc-bugs mailing list List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 09 Jun 2022 15:15:56 -0000 https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D105909 Bug ID: 105909 Summary: RFE: SARIF output could contain metadata about limitations of the analysis Product: gcc Version: 12.0 Status: UNCONFIRMED Severity: normal Priority: P3 Component: analyzer Assignee: dmalcolm at gcc dot gnu.org Reporter: dmalcolm at gcc dot gnu.org Target Milestone: --- The analysis has various limitations: - It can give up the analysis (currently with the off-by-default -Wanalyzer-too-complex): - too many exploded nodes at a program point - too many exploded nodes altogether - If it encounters a function with unknown behavior, it can approximate the behavior of the call; the code to do this makes various assumptions - the analyzer has hard-coded handlers for various standard functions - otherwise, it has a more general "unknown function" handler - The path-feasibility code can give up if it hits a complexity limit The SARIF output could contain metadata about these various situations. Perhaps a warning about "approximating the behavior of unknown function" ? That way a user of the SARIF data could supply enough stubs/handlers from t= he analysis to be "closed world".=