zoukankan      html  css  js  c++  java
  • ABAP代码静态分析工具SQF

    如果系统里没有SQF这个tcode,可以参考note 1814328: SQF: Plug-In for Source Code Scans进行安装。

    ABAP static analysis tool SQF is a static code analysis tool developed in package SUPPORT_QUERY_FRAMEWORK in software component SAP_BASIS.

    It contains lots of handy tool or short cut to other system utility tools. The most attractive function which is worthy to put it into my toolset is the static code analysis.

    1. use tcode SQF, double click on “Source code Analysis”

    1. Maintain the ABAP object which you would like to do static analysis.

    In this example it is function module CRM_PRODUCT_GETLIST2. Specify the object type as well, which could be found in table TADIR.
    The Analysis Depth 6 means: for example in the implementation of the FM, it calls another FM or subroutine, these delegated calls will also be analyzed by the tool. Say FM calls A and A calls B, B calls C, C calls D, D calls E, E calls F and F calls G, depth = 6 means any further calls starting from F calls G will be ignored.

    1. Click save button and it is automatically navigated back to SQF main view. Click F8 to execute.

    The progress will be displayed in the bottom, the bigger size of depth specified, the more time the analysis will take.

    After execution, the color of icon changes from white to blue, which means the analysis result is available.

    1. The analysis results are categorized into four groups:

    a. Call hierarchy, something like the one in SAT.

    b. the table read access in static call. Those table read access done via dynamic coding will be listed in group d.

    Compare with DB access list analyzed by runtime trace SAT, there are far more entries than the static one. This is not surprising, as in CRM product, the set type access is implemented in a highly dynamic way.

    c. interface call:

    d. Dynamic coding

    要获取更多Jerry的原创文章,请关注公众号"汪子熙":

  • 相关阅读:
    网络流24题
    Songwriter CF1252-E(贪心)
    Card Collector AtCoder
    Game on a Tree Gym
    图书管理系统五
    bfs+状态压缩dp
    最短路径(邻接矩阵)
    求小于等于k长度的最大区间和
    链表实现队列C语言写法
    图书管理系统四
  • 原文地址:https://www.cnblogs.com/sap-jerry/p/12825934.html
Copyright © 2011-2022 走看看