SCHEME FOR IMPROVING BANDWIDTH BY IDENTIFYING SPECIFIC FIXED PATTERN SEQUENCES AS HEADER ENCODING FOLLOWED BY THE PATTERN COUNT

Abstract

A system and method of counting event patterns in order to reduce the bandwidth of event data sent to a monitoring computer. The event patterns are output as one or more data packets indicating a value corresponding to the event pattern and a number of occurrences of the pattern.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

For a detailed description of exemplary embodiments of the invention, reference will now be made to the accompanying drawings in which:

FIG. 1 depicts an exemplary debugging and profiling system;

FIG. 2 depicts an embodiment of circuitry where code is being debugged and profiled using a trace;

FIG. 3 depicts an embodiment of circuitry where code is being debugged and profiled using a trace and a compression element;

FIG. 4 depicts an exemplary output data format; and

FIG. 5 depicts another exemplary output data format with a pattern bit and a count value being output in the same data packet.

DETAILED DESCRIPTION

FIG. 1 depicts an exemplary debugging and profiling system 100 including a host computer 105 coupled to a target device 110 through a connection 115. A user may debug and profile the operation of the target device 110 by operating the host computer 105. The target device 110 may be debugged and profiled in order for the operation of the target device 110 to perform as desired (for example, in an optimal manner) with circuitry 145. To this end, the host computer 105 may include an input device 120, such as a keyboard or mouse, as well as an output device 125, such as a monitor or printer. Both the input device 120 and the output device 125 couple to a central processing unit 130 (CPU) that is capable of receiving commands from a user and executing software 135 accordingly. Software 135 interacts with the target 110 and may allow the debugging and profiling of applications that are being executed on the target 110. In particular, software 135 may receive packets of data from the circuitry 145 and the target 110 corresponding to events occurring as a result of applications being executed on the target 110 by circuitry 145. Software 135 may be stored in a memory, such as a RAM, hard drive, etc., on computer 105.

Connection 115 couples the host computer 105 and the target device 110 and may be a wireless, hard-wired, or optical connection. Interfaces 140A and 140B may be used to interpret data from or communicate data to connection 115 respectively according to any suitable data communication method. Connection 150 provides outputs from the circuitry 145 to interface 140B. As such, software 135 on host computer 105 communicates instructions to be implemented by circuitry 145 through interfaces 140A and 140B across connection 115. The results of how circuitry 145 implements the instructions is output through connection 150 and communicated back to host computer 105. These results are analyzed on host computer 105 and the instructions are modified so as to debug and profile applications to be executed on target 110 by circuitry 145.

Connection 150 may be a wireless, hard-wired, or optical connection. In the case of a hard-wired connection, connection 150 is preferably implemented in accordance with any suitable protocol such as a Joint Testing Action Group (JTAG) type of connection. Additionally, hard-wired connections may include a real time data exchange (RTDX) type of connection developed by Texas instruments, Inc. Briefly put, RTDX gives system developers continuous real-time visibility into the applications that are being implemented on the circuitry 145 instead of having to force the application to stop, via a breakpoint, in order to see the details of the application implementation. Both the circuitry 145 and the interface 140B may include interfacing circuitry to facilitate the implementation of JTAG, RTDX, or other interfacing standards.

The target 110 preferably includes the circuitry 145 executing code that is actively being debugged and profiled. In some embodiments, the target 110 may be a test fixture that accommodates the circuitry 145 when code being executed by the circuitry 145 is being debugged and profiled. The debugging and profiling may be completed prior to widespread deployment of the circuitry 145. For example, if the circuitry 145 is eventually used in cell phones, then the executable code may be designed using the target 110.

The circuitry 145 may include a single integrated circuit or multiple integrated circuits that will be implemented as part of an electronic device. For example, the circuitry 145 may include multi-chip modules comprising multiple separate integrated circuits that are encapsulated within the same packaging. Regardless of whether the circuitry 145 is implemented as a single-chip or multiple-chip module, the circuitry 145 may eventually be incorporated into an electronic device such as a cellular telephone, a portable gaming console, network routing equipment, etc.

Debugging and profiling the executable firmware code on the target 110 using breakpoints to see the details of the code execution is an intrusive process and affects the operation and performance of the code being executed on circuitry 145. As such, a true understanding of the operation and performance of the code execution on circuitry 145 is not gained through the use of breakpoints.

FIG. 2 depicts an embodiment of circuitry 145 where code is being debugged and profiled using a trace on circuitry 145 to monitor events. Circuitry 145 includes a processor 200 which executes the code. Through the operation of the processor 200 many events 205 may occur that are significant for debugging and profiling the code being executed by the processor 200. The term “events” or “event data” herein is being used broadly to describe any type of stall, in which processor 200 is forced to wait before it can complete executing an instruction, such as a CPU stall or cache stall; any type of memory event, such as a read hit or read miss; and any other occurrences which may be useful for debugging and profiling the code being executed on circuitry 145. The trace 210 monitors the desired events 205 and outputs the event data through connection 150 to computer 105. This enables a user of the computer 105 to see how the execution of the code is being implemented on circuitry 145. As successive generations of processors are developed with faster speeds, the number of events occurring on a processor such as processor 200 similarly increases, however, the bandwidth between computer 105 and circuitry 145 through connection 150 is limited. The amount of event data 205 recorded using a trace may exceed the bandwidth of connection 150. As such, intelligent ways of reducing the amount of event data without loosing any or much information are desirable.

FIG. 3 discloses another embodiment of circuitry 145 where code is being debugged and profiled using a trace on circuitry 145 to monitor events. Circuitry 145 includes a processor core 300 which executes the code. Through the operation of the processor 300 many events 305 may occur that are significant for debugging and profiling the code being executed by the processor 200. Those events are monitored by a trace 310 which outputs various event streams such as a PC event stream 320, a timing event stream 325, and a data event stream 330. The event streams are input to a compression block 315 which compresses the event data and sends the event data to computer 105 through connection 150. Software 135 may then decompress the event data in order to interpret the events.

Table 1 is an exemplary table of the outputs on the various event streams 320-330, for a given trace interval:

TABLE 1
Timing Stream	PC stream	Data Stream
Timing Sync Point, id = 1	Pc Sync Point, id = 1	Data Sync Point,
		id = 1
Timing Data
	PC Data	Memory Data
Timing Data		Memory Data
Timing Data	PC Data	Memory Data
	PC Data
Timing Data		Memory Data
Timing Sync Point, id = 2	Pc Sync Point, id = 2	Data Sync Point,
		id = 2

As shown in Table 1 event data may occur simultaneously across the various event streams. For example, on the first line of the table a Sync Point with an id=1 may indicate that each of the streams is synchronized to each other and mark the start of a trace interval. On the other hand, on the last line of the table a Sync Point with an id=2 may indicate that each of the streams is synchronized to each other and mark the end of a trace interval. Note that the event data, such as the timing, PC, or memory data, may also occur simultaneously across the various event streams. In this case a priority may be given such that each event data is output in a given order.

Each event data shown in Table 1 may be represented by a data packet. FIG. 4 depicts an exemplary event data packet. In this example the event data packet is 10 bits with the first two bits being a header indicating the type of event data that is being represented, such as a PC data, timing data, or memory data. The following eight bits are data bits with each bit representing a clock cycle of the processor 300. A “0” may indicate that no event are occurred on that clock cycle, and a “1” may indicate that an event has occurred on that clock cycle. As such, an exemplary output from the processor 300 may appear as follows:

• • 01010101 01010101 01010101 01010101 01010101 01010101 01010101 01010101

Using the event data packet format shown in FIG. 4 the event data shown above may be output in eight event data packets as shown in Table 2.

TABLE 2
Packet Count	Header Bits	D7	D6	D5	D4	D3	D2	D1	D0
1	H1	H0	0	1	0	1	0	1	0	1
2	H1	H0	0	1	0	1	0	1	0	1
3	H1	H0	0	1	0	1	0	1	0	1
4	H1	H0	0	1	0	1	0	1	0	1
5	H1	H0	0	1	0	1	0	1	0	1
6	H1	H0	0	1	0	1	0	1	0	1
7	H1	H0	0	1	0	1	0	1	0	1
8	H1	H0	0	1	0	1	0	1	0	1

As discussed above, there is a limited bandwidth between the trace 310 and the computer 105. As shown in table 2 through the execution of code by processor 300, each command tends to have a characteristic execution pattern which in turn produces a characteristic event pattern. For example, the execution of the code may utilize system memory to produce a stall pattern associated with memory misses and conflicts. By counting the number of occurrences of one or more event patterns the event data may be output in a compressed format. By compressing the event data more events, or a greater frequency of events, may be monitored by the trace and still sent to a computer 105 to be interpreted.

FIG. 5 depicts an improved format for the event data packet. As shown in FIG. 5 the first two bits of the event data packet would comprise two header bits H1 and H0 that indicate type of event data. The third bit is a pattern bit C0 that is an encoded representation of the type of pattern that has been counted. For example, a “0” might indicate that a repeating pattern of “01” has been counted, whereas a “1” might indicate that a repeating pattern of “10” has been counted. The count value, indicating how many times the designated pattern has occurred, is stored in bits D6-D0. Note that a plurality of the count packets may be used to extend the count range beyond 2⁷. In particular, for each successive count packet identified by the two header bits C1 and C0 the count range would increase by eight more bits. In the example used above, the event data output from the processor 300 using the event data packet of FIG. 5 as shown below in Table 3:

TABLE 3
Packet Count	Header Bits	C0	D6	D5	D4	D3	D2	D1	D0
1	H1	H0	0	0	1	0	0	0	0	0

As shown in Table 3, the eight event data packets needed to represent the event data from processor 300 using the format of FIG. 4 can be reduced to just one data packet using the format of FIG. 5. As shown in Table 3, the event data packet indicates a repeating pattern of “01” by having the pattern bit C0 be “0”. Since there were 32 instances of the pattern then a binary representation of 32 has been indicated with the pattern count bits D6-D0. The effect of reducing the number of data packets that need to be sent can be further magnified by noting that using the format of FIG. 4, if the pattern were repeated up to 2⁷ times then 2⁷ packets would need to be used to represent the event data. However, using the format of FIG. 5 still only one event data packets would need to be used to represent the event data. It is noted that while the pattern bit was assigned such that a “0” indicated a repeating pattern of “01” and a “1” indicated a repeating pattern of “10”, any pattern may be assigned to the pattern bit. Further, if it is desirable to be able to select between more than two types of patterns, then the pattern bit may be extended to include two or more bits, albeit possibly at the expense of a corresponding number of bits for the count value. Still further, the allocation of bits D7-D0 between count bits and pattern bit(s) may be programmable. In this case, the computer 105 would need to communicate to the compression element 315 the current allocation for pattern and count bits as well as the current assignment of each combination of pattern bit(s) to a particular pattern. For example, bits D7 and D6 may be assigned to be pattern bits for representing four unique patterns. As such, the compression element 315 would need to know that the count value is to be stored in bits D5-D0 and bits D7 and D6 are to hold a value representing one of the four unique patterns. The compression element 315 would also need to each of the four unique patterns to count and the value that corresponds to each of the patterns.

As such the trace compression element 315 may be configured to detect and count patterns in order to compress the amount of event data that needs to be output to computer 105. The data output to computer 105 may be output in one or more data packets that indicate a pattern and a count value of the number of times that pattern has occurred. Software 135 may decode the data packets in order to determine the pattern and number of times it has occurred. It is noted that compression element 315 may also further compress the event data using know bit reduction methods such as Huffman coding.

While various system and method embodiments have been shown and described herein, it should be understood that the disclosed systems and methods may be embodied in many other specific forms without departing from the spirit or scope of the invention. The present examples are to be considered as illustrative and not restrictive. The intention is not to be limited to the details given herein, but may be modified within the scope of the appended claims along with their full scope of equivalents.

Claims

1. A method comprising: executing instructions on a processor;monitoring a stream of events corresponding to said executing step;determining a pattern of said events;counting a number of occurrences of said pattern;outputting one or more data packets indicating a value identifying said pattern and said number.

2. The method of claim 1, wherein: a first of said one or more data packets comprises bits for a header indicating a type of said events, one or more bits indicating said value, and bits for said number.

3. The method of claim 2, wherein: a second and following data packets comprises bits for a header indicating a count packet and bits for said number.

4. The method of claim 2, wherein: said one or more bits indicating said value are programmably allocated.

5. The method of claim 1, wherein: said outputting step outputs one data packet indicating both said value and said number.

6. The method of claim 4, wherein: said one data packet comprises bits for a header indicating a type of said events, one or more bits indicating said value, and bits for said number.

7. The method of claim 6, wherein: said one or more bits indicating said value are programmably allocated.

8. A system comprising: a processor configured to execute a plurality of instruction;a trace configured to monitor a stream of events from said processor corresponding to the execution of said instructions; anda compression element configured to determine a pattern of said events and count a number of occurrences of said pattern;wherein said compression element outputs one or more data packets with a value corresponding to said pattern and said number.

9. The system of claim 8, wherein: a first of said one or more data packets comprises bits for a header indicating a type of said events, one or more bits indicating said value, and bits for said number.

10. The system of claim 9, wherein: a second and following data packets comprises bits for a header indicating a count packet and bits for said number.

11. The system of claim 9, wherein: said one or more bits indicating said value are programmably allocated.

12. The system of claim 8, wherein: said outputting step outputs one data packet indicating both said value and said number.

13. The system of claim 12, wherein: said one data packet comprises bits for a header indicating a type of said events, one or more bits indicating said value, and bits for said number.

14. The system of claim 13, wherein: said one or more bits indicating said value are programmably allocated.

15. A storage medium containing software that, when executed by a processor, causes the processor to: receive one or more packets from a target circuit;decode said packets to determine a bit pattern from a value and to extract a count of occurrences of said bit pattern;wherein said packets encode information pertaining to events occurring on said target circuit.

16. The software of claim 15, wherein: a first of said one or more packets comprises bits for a header indicating a type of said events, one or more bits indicating said value, and bits for said count.

17. The software of claim 16, wherein: a second and following data packets comprises bits for a header indicating a count packet and bits for said count.

18. The software of claim 16, wherein: said one or more bits indicating said value are programmably allocated.

19. The software of claim 15, wherein: only one of said packets is received indicating both said value and said count.

20. The software of claim 19, wherein: said one data packet comprises bits for a header indicating a type of said events, one or more bits indicating said value, and bits for said count.

21. The software of claim 20, wherein: said one or more bits indicating said value are programmably allocated.