Field of the Invention
The field of the invention is data processing, or, more specifically, methods, systems, and products for code path tracking.
Description of Related Art
The development of the EDVAC computer system of 1948 is often cited as the beginning of the computer era. Since that time, computer systems have evolved into extremely complicated devices. Today's computers are much more sophisticated than early systems such as the EDVAC. Computer systems typically include a combination of hardware and software components, application programs, operating systems, processors, buses, memory, input/output devices, and so on. As advances in semiconductor processing and computer architecture push the performance of the computer higher and higher, more sophisticated computer software has evolved to take advantage of the higher performance of the hardware, resulting in computer systems today that are much more powerful than just a few years ago.
As computer software has become more complicated, analyzing problems in the software code and improving functions executed in the software code has also become more difficult. Tools currently exist which can sample instruction paths taken in specific software modules or collect data at trace points built into the software. These coverage tools are somewhat useful but they have several limitations:
There is therefore an ongoing need for improvement in code path tracking.
Methods, systems, and products are provided for code path tracking. Embodiments include identifying an instrumented trace point in software code to be path tracked; identifying a function executed at the instrumented trace point in the software code; identifying parameters for the function executed at the instrumented trace point; and recording a description of the function, the parameters, and the result of the execution of the function using the parameters.
The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular descriptions of exemplary embodiments of the invention as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts of exemplary embodiments of the invention.
Exemplary methods, systems, and products for code path tracking according to embodiments of the present invention are explained with reference to the accompanying drawings, beginning with
This exact architecture of the system of
The example of
Taking the following SQL query as an example:
This access plan represents database functions to scan through the stores table and, for each stores record, join all transactions records for the store. The transactions for a store are identified through the storeID field acting as a foreign key. The fact that a selection of transactions records is carried out for each store record in the stores table identifies the join function as iterative.
The system of
These three database statistics are presented for explanation only, not for limitation. The use of any database statistics as will occur to those of skill in the art is well within the scope of the present invention.
The optimizer (110) of
An instrumented trace point is one or more computer program instructions included at a location in the software code for identifying a function executed at that instrumented trace point; identifying parameters for the function executed at the instrumented trace point; and recording a description of the function, the parameters, and the result of the execution of the function using the parameters. The description of the function, the parameters, and the result of the execution of the function using the parameters may be implemented as an eXtensible markup language (‘XML’) description. ‘XML’ refers to the eXtensible Markup Language, a specification developed by the World Wide Web Consortium (‘W3C’). XML is a pared-down version of SGML (the Standard Generalized Markup Language). XML was originally intended primarily to encode Web documents, but its use today is much broader than just the Web. It allows designers to create their own customized tags, enabling the definition, transmission, validation, and interpretation of data between applications, between computers and database, and between organizations.
The description of the function, the parameters, and the result of the execution of the function using the parameters may be used to replay the function and the result of the execution of the function for analysis of the quality of the execution of the function. Replaying the function advantageously allows a user to make determinations as to whether to modify the functions or parameters of the functions as will occur to those of skill in the art.
For further explanation,
The exemplary recording computer of
As mentioned above, code path tracking in accordance with the present invention is generally implemented with computers, that is, with automated computing machinery. For further explanation,
The optimizer (110) of
The optimizer (110) of
Also stored in RAM (168) is an operating system (154). Operating systems useful in computers according to embodiments of the present invention include UNIX™, Linux™, Microsoft NT™, AIX™, IBM's i5os, and many others as will occur to those of skill in the art. Operating system (154), DBMS (106), and optimizer (112), code path tracking module (112), and code path replay module (117) in the example of
Computer (152) of
The example computer of
The exemplary computer (152) of
For further explanation,
An instrumented trace point may be implemented as a call into an application programming interface (‘API’) capable of recording a description of the function, the parameters, and the result of the execution of the function using the parameters. Such a call may be parameterized with an identification of a function executed at the instrumented trace point, as well as parameters of the function executed at the trace point.
The individual instrumented trace points may be user selected. That is, the method of
Consider for example the following exemplary instrumented trace point class:
The exemplary class contains simple helper methods such as ‘register(enum value)’ that provide for a user to add instrumented trace points into the software in question to path track a function at the instrumented trace point. The software is then changed to incorporate these instrumented trace points, compiled and executed.
As mentioned above, the instrumented trace point further may be implemented as a decision point in a database optimizer. Such a decision point may be a location of software code executing a particular sequence of database operations implementing an access plan. An access plan is a description of database functions for execution of an SQL query. Taking the following SQL query as an example:
This access plan represents database functions to scan through the stores table and, for each stores record, join all transactions records for the store. The transactions for a store are identified through the storeID field acting as a foreign key. The fact that a selection of transactions records is carried out for each store record in the stores table identifies the join function as iterative.
The method of
The method of
The method of
As mentioned above, the description of the function, the parameters, and the result of the execution of the function using the parameters may be used to replay the function and the result of the execution of the function for analysis of the quality of the execution of the function. Replaying the function advantageously allows a user to make determinations as to whether to modify the functions or parameters of the functions as will occur to those of skill in the art. For further explanation, therefore,
The method of
In some cases, replaying the execution of the function may demonstrate flaws in the function or parameters or other factors surrounding the execution of the function. To aid in improving the software code, the method of
The method of
Receiving from a user an alternative function, executing the alternative function, and displaying to the user the result of the execution of the alternative function may occur in real time, or alternatively, may include receiving from a user an alternative function either manually or programmatically and at some later date executing the alternative function and displaying the result of the execution of the alternative function.
Code path tracking has been described largely in the context of an optimizer for a SQL module in a DBMS. This is for explanation, and not for limitation. In fact, code path tracking according to embodiments of the present invention may be usefully implemented in many contexts as will occur to those of skill in the art and all such contexts are well within the scope of the present invention.
Exemplary embodiments of the present invention are described largely in the context of a fully functional computer system for code path tracking Readers of skill in the art will recognize, however, that the present invention also may be embodied in a computer program product disposed on signal bearing media for use with any suitable data processing system. Such signal bearing media may be transmission media or recordable media for machine-readable information, including magnetic media, optical media, or other suitable media. Examples of recordable media include magnetic disks in hard drives or diskettes, compact disks for optical drives, magnetic tape, and others as will occur to those of skill in the art. Examples of transmission media include telephone networks for voice communications and digital data communications networks such as, for example, Ethernets™ and networks that communicate with the Internet Protocol and the World Wide Web. Persons skilled in the art will immediately recognize that any computer system having suitable programming means will be capable of executing the steps of the method of the invention as embodied in a program product. Persons skilled in the art will recognize immediately that, although some of the exemplary embodiments described in this specification are oriented to software installed and executing on computer hardware, nevertheless, alternative embodiments implemented as firmware or as hardware are well within the scope of the present invention.
It will be understood from the foregoing description that modifications and changes may be made in various embodiments of the present invention without departing from its true spirit. The descriptions in this specification are for purposes of illustration only and are not to be construed in a limiting sense. The scope of the present invention is limited only by the language of the following claims.
This application is a continuation application of and claims priority from U.S. patent application Ser. No. 11/621,666, filed on Jan. 10, 2007.
Number | Name | Date | Kind |
---|---|---|---|
5734884 | Eberhard | Mar 1998 | A |
5870607 | Netzer | Feb 1999 | A |
6145121 | Levy et al. | Nov 2000 | A |
6339776 | Dayani-Fard et al. | Jan 2002 | B2 |
6546381 | Subramanian | Apr 2003 | B1 |
6557167 | Thelen | Apr 2003 | B1 |
6775826 | Zahavi et al. | Aug 2004 | B1 |
6795963 | Andersen et al. | Sep 2004 | B1 |
7092931 | Kaluskar et al. | Aug 2006 | B1 |
7430549 | Zane et al. | Sep 2008 | B2 |
7500225 | Khan et al. | Mar 2009 | B2 |
7506318 | Lindo et al. | Mar 2009 | B1 |
7877378 | Gray | Jan 2011 | B2 |
7958497 | Lindo et al. | Jun 2011 | B1 |
8307343 | Chaudhuri et al. | Nov 2012 | B2 |
20020120815 | Zahavi et al. | Aug 2002 | A1 |
20030033291 | Harris | Feb 2003 | A1 |
20030066053 | Al-Azzawe | Apr 2003 | A1 |
20030115212 | Hornibrook | Jun 2003 | A1 |
20030182276 | Bossman | Sep 2003 | A1 |
20030220941 | Arnold | Nov 2003 | A1 |
20030221187 | Barsness et al. | Nov 2003 | A1 |
20040088278 | Westmacott | May 2004 | A1 |
20040088699 | Suresh | May 2004 | A1 |
20050028134 | Zane et al. | Feb 2005 | A1 |
20050044063 | Barsness et al. | Feb 2005 | A1 |
20050049999 | Birn | Mar 2005 | A1 |
20050060285 | Barsness | Mar 2005 | A1 |
20050097091 | Ramacher et al. | May 2005 | A1 |
20050120001 | Yagoub et al. | Jun 2005 | A1 |
20050183068 | Cwalina et al. | Aug 2005 | A1 |
20050193264 | Khan et al. | Sep 2005 | A1 |
20050203940 | Farrar et al. | Sep 2005 | A1 |
20050223365 | Smith et al. | Oct 2005 | A1 |
20050223367 | Smith et al. | Oct 2005 | A1 |
20050251794 | Taylor et al. | Nov 2005 | A1 |
20050262060 | Rohwedder et al. | Nov 2005 | A1 |
20050283457 | Sonkin et al. | Dec 2005 | A1 |
20060075306 | Chandrasekaran | Apr 2006 | A1 |
20060085798 | Bendiksen et al. | Apr 2006 | A1 |
20060200507 | Holenstein et al. | Sep 2006 | A1 |
20060294158 | Tsyganskiy et al. | Dec 2006 | A1 |
20070078825 | Bornhoevd et al. | Apr 2007 | A1 |
20070143795 | Tran | Jun 2007 | A1 |
20070288902 | Lev et al. | Dec 2007 | A1 |
20080028370 | Lewallen et al. | Jan 2008 | A1 |
20080052271 | Lam | Feb 2008 | A1 |
20080097995 | Dias | Apr 2008 | A1 |
20080114718 | Anderson | May 2008 | A1 |
20080127108 | Ivanov et al. | May 2008 | A1 |
20080127109 | Simeon | May 2008 | A1 |
20080155350 | Ivanov et al. | Jun 2008 | A1 |
20080168427 | Bestgen et al. | Jul 2008 | A1 |
20100332473 | Brodsky et al. | Dec 2010 | A1 |
Entry |
---|
Stillger et al., “LEO—DB2's LEarning Optimizer”, 2001, VLDB. |
Cornelis, Frank et al., “A Taxonomy of Execution Replay Systems”, Department of Electronics and Information Systems, Ghent University, 2003. Available through Citeseer. |
Bhansali, Sanjay, et al. “Framework for instruction-level tracing and analysis of program executions.” 2006. Proceedings of the 2nd international conference on Virtual execution environments. ACM. |
Narayanasamy, Satish et al. “Bugnet: Recording application-level execution for deterministic replay debugging.” 2006. IEEE Micro 26.1, pp. 100-109. |
Dewald, Baya. “Monitoring and Tuning SQL Server with Profiler”. Mar. 3, 2006. Website Link: <http://www.informit.com/articles/article.aspx?p=454000&segNum=4>. |
Burke, “Using SQL Profiler”, Microsoft TechNet, Jun. 2001, pp. 1 -10, URL: http://www.microsoft.com/technet/prodtechnol/sq1/70/tips/sqlprof.mspx?pf=true>. |
PCT Search Report and Written Opinion, Jul. 18, 2008; PCT Application No. PCT/EP2007/063950. |
Office Action, U.S. Appl. No. 11/621,666, Oct. 28, 2011, pp. 1-19. |
Notice of Allowance, U.S. Appl. No. 11/621,666, Feb. 28, 2012, pp. 1-8. |
Number | Date | Country | |
---|---|---|---|
20120198423 A1 | Aug 2012 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11621666 | Jan 2007 | US |
Child | 13443140 | US |