Method and System for Testing USB Device

Abstract

A method for testing a USB (universal serial bus) device includes receiving a USB packet trace output from a USB host, at a USB packet trace converting apparatus, generating at least one token corresponding to the USB packet trace received from the USB host, determining a syntax tree corresponding to the at least one token, and generating a code for a USB host model corresponding to the determined syntax tree.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other features and advantages of the present invention will become more apparent by describing in detail preferred embodiments thereof with reference to the attached drawings in which;

FIG. 1 is a block diagram of a USB device test system having a USB packet trace converting apparatus according to an embodiment of the present invention,

FIG. 2 is an expression-token table according to an embodiment of the present invention;

FIGS. 3A through 3S are views showing a syntax tree forest according to an embodiment of the present invention;

FIG. 4 is a flow chart for explaining a USB device test method according to an embodiment of the present invention; and

FIG. 5 is a view showing the conversion process of a USB packet trace according to an embodiment of the present invention.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Hereinafter, the present invention will be described in detail by explaining preferred embodiments of the invention with reference to the attached drawings. Like reference numerals in the drawings denote like elements.

FIG. 1 is a block diagram of a USB device test system having a USB packet trace converting apparatus according to an embodiment of the present invention. Referring to FIG, 1, a USB device test system 10 according to an embodiment of the present invention includes a USB packet trace converting apparatus 100. The USB device test system 10 may further include a USB packet logger 230 and/or a host model 300. The USB packet trace converting apparatus 100 includes a storage device 140, a token generation module 110, a syntax tree determination module 120, and a host code generation module 130.

The storage device 140 stores an expression-token table, the expression-token table comprising an expression that can be included in a USB packet trace and a token corresponding to the expression and a syntax tree forest generated based on at least one token corresponding to the expression that can be included in the USB packet trace.

The expression-token table and the syntax tree forest may be stored in the storage device 140 in advance. The USB packet trace signifies a sequence of packets that a USB host 210, for example, a computer, outputs to a USB device 220.

FIG. 2 is an expression-token table according to an exemplary embodiment of the present invention. Referring to FIGS. 1 and 2, the storage device 140 stores the expression-token table. The expression-token table contains a regular expression that may include all expressions that can be included in the packet trace transmitted by the USB host 210 to the USB device 220 and the token corresponding to the regular expression. For example, when the USB packet trace is “ping addr=S endp=2 idle=1”, the expression-token table contains the regular expressions of “PING”, “addr”, “=”, “[0-9A-F]+”, “endp”, and “idle” that can include the respective expressions of “ping”, “addr”, “=”, “3”, “endp”, “=”, “2”, “idle”, “=” and “1”. Also, the expression-token table contains tokens of “PING”, “ADDR”, “EQ”, “NUM”, “ENP”, and “IDLE” corresponding to the regular expressions of “PING”, “addr”, “=”, “[0-9A-F]+”, “endp”, and “idle”.

FIGS. 3A through 3S are views showing a syntax tree forest according to an embodiment of the present invention. Referring to FIGS. 1 and 3A through 3S the storage device 140 stores the syntax tree forest that signifies a set of syntax trees corresponding to the syntax of the USB packet trace. The packets included in the USB packet trace can be expressed by each of the syntax trees shown in FIGS. 3A through 3S or a combination of the syntax trees. For example, the syntax tree shown in FIG, 31 signifies the syntax of a packet trace to output a command of “ping” from the USE host 210. The syntax tree of FIG. 3I shows that a token of “PING” a statement indicating an address (addr_state) a statement indicating an end-point (endp_state), and a statement indicating an idle state (idle_state) are needed to output the “ping” command.

When an overall syntax tree is generated by a combination of the syntax trees shown in FIGS. 3A through 3S, terminal nodes of the overall syntax tree, for example, (3) of FIG. 5, are configured with a token including a combination of the tokens corresponding to the received USB packet traces. The terminal node in a box among the terminal nodes of the syntax tree forest, for example, PID or EQ of FIG. 3C, signifies the token contained in the expression-token table.

Each of the syntax trees can be realized as an array, a linked-list, a doubly linked-list, 8+ tree, etc. The scope of the syntax trees is not limited thereto.

In a process of converting the USB packet trace according to an exemplary embodiment of the present invention, the USB device 220 is tested by assuming a logic error of the USB device 220 or an error of firmware that drives the USB device 220. Since it is assumed that there is no syntax error of the USB packet trace output from the USB host 210, the sentences included in the USB packet trace conform to the syntax expressed by the syntax tree forest. Thus, the USB packet trace is converted to a code that can be used in the RTL/NET simulation by using the expression-token table and the syntax tree forest.

FIG. 4 is a flow chart for explaining a USB device test method according to an embodiment of the present invention. Referring to FIGS. 1 and 4, the storage device 140 can be embodied by a hard disk drive, a magnetic disk drives, an optical disk drive, a Bernoulli cartridge, a random access memory (RAM), a read only memory (ROM), etc.

The token generation module 110 receives the USB packet trace output S from the USB host 210 (S10) and generates at least one token corresponding to the received USB packet trace based on the expression-token table stored in the storage device 140 (S20). The token generation module 110 searches the expression-token table stored in the storage device 140 for an expression included in the received USB packet trace (S21) and generates the searched -10 expression as at least one token from the token stored in the expression-token table corresponding to the expression (S23). The operations S21 and S23 for generating the expression as a token can be repeated until all the expressions included in the USB packet trace are generated as tokens corresponding thereto (325).

The syntax tree determination module 120 determines the syntax tree corresponding to at least one token that is generated based on the syntax tree forest stored in the storage device 140 (S30). The syntax tree determination module 120 searches the syntax tree forest stored in the storage device 140 for the token that is generated (S31) and determines whether the searched syntax tree corresponds to the token (333).

The host code generation module 130 generates a code for a USB host model corresponding to the determined syntax tree (S40). The host code generation module 130 converts a sub-tree of the determined syntax tree to a host model code (S41). When all sub-trees of the syntax tree are converted (S43), the host code generation module 130 converts a root of the syntax tree to the host model code (S45).

An operation of the USB packet trace converting apparatus 100 will be described in detail with reference to FIG. 5. FIG, 5 is a view showing the conversion process of a USB packet trace according to an exemplary embodiment of the present invention. Referring to FIGS. 1, 4, and 5, the token generation module 110 receives a packet trace of “pink addr=3 endp=2 idle=1” (S10). The token generation module 110 receives the packet trace from the USB packet logger 230.

The token generation module 110 searches the expression-token table for the first expression of “ping” of the packet trace (S21). The token generation module 110 generates the token of “PING” corresponding to the first expression of “ping” (S23). Also, the token generation module 110 determines whether all expressions are generated as tokens corresponding thereto (S25) and generates tokens until there is no expression that is not generated as a token. The generated token, the combination of the tokens corresponding to the received USB packet traces is shown in (2) of FIG. 5.

The syntax tree determination module 120 determines the syntax tree based on the generated token (S30). The syntax tree forest shown in FIGS. SA through 3S is searched for a syntax tree having the first token of “PING” as a node (S31). Since the syntax tree of FIG. 31 is the only syntax tree having the S first token of “PING” as a node, the syntax tree of FIG. 31 is selected (S33).

Since the second sub-tree of the syntax tree of FIG. 31 is “addr_states”, the syntax tree forest shown in FIGS. 3A through 3S are searched for a syntax tree corresponding to “addr_state” (S31). Since the syntax tree corresponding to “addr_state” is the syntax tree shown in FIG. 30 only, the syntax tree shown in FIG. 3O is selected (S33).

The next sub-tree is “endp_state” and the syntax tree forest shown in FIGS. 3A through 3S are searched for a syntax tree corresponding to “endp_state” (S31). Since the syntax tree corresponding to “endp_state” is the syntax tree shown in FIG. 3R only, the syntax tree shown in FIG. 3R is selected (S33).

The next sub-tree is “idel_state” and the syntax tree forest shown in FIGS. 3A through 3S are searched for a syntax tree corresponding to “idle_state” (S31). The syntax tree corresponding to “idle_state” exists in FIGS. 3P and 3Q only. When the terminal nodes “IDLE, EQ, and NUM” of FIG. 3P and “IDLE, EQ, and TO_EOF” of FIG. 3Q are searched, since the terminal nodes “IDLE, EQ, and TO_EOF” of FIG. 3Q do not match (2) of FIG. 5, the syntax tree shown in FIG. 3Q is not selected. The syntax tree determined in the above processes is shown in (3) of FIG. 5.

The host code generation module 130 generates a host model code based on the syntax tree shown in (3) of FIG. 5 (S40). The host code generation module 130 searches the sub-tree of the determined syntax tree and generates the host model code corresponding to the syntax tree.

The first sub-tree of the syntax tree shown in (3) of FIG, 5, that is, a sub-tree having “PING” as a root, is converted to a host model code (S41). Since the first sub-tree is a sub-tree having a token “PING” as a root, no code is generated.

Since all sub-trees are not converted to the host model code (S43), the host code generation module 130 converts the next sub-tree, that is, a sub-tree having “addr_state“ as a root, to the host model code (541). The conversion begins from a sub-tree of the sub-tree, that is, the sub-tree having “addr_state” as a root, to convert the sub-tree having “addr_state” as a root to the host model code (S41). Since all sub-trees include tokens of “ADDR”, “EO”, and “NUM”, no code is generated as a result of the conversion of all sub-trees to codes. When the root of the sub-tree, that is, the sub-tree having “addr_state” as a root, is converted to the host model code (S45), “USB_pkt.addr=atoi($3);” is generated.

The host code generation module 130 converts the next sub-tree, that is, a sub-tree having “endp_state” as a root, to the host model code (S41). The conversion begins from a sub-tree of the sub-tree, that is, the sub-tree having “endp_state” as a root, to convert the sub-tree having “endp_state” as a root to the host model code (S41). Since all sub-trees include tokens of “ENDP”, “EQ”, and “NUM”, no code is generated as a result of the conversion of all sub-trees to codes, When the root of the sub-tree, that is, the sub-tree having “endp_state” as a root, is converted to the host model code (S45), “USB_pkt.endp=atoi($3),” is generated.

The host code generation module 130 converts the next sub-tree, that is, a sub-tree having “idle state” as a root, to the host model code (S41). The process of converting the sub-tree, that is, sub-tree having “idle_state” as a root, to the host model code is similar to that of converting the above sub-trees, that is, the sub-tree having “addr_state” or “endp_state” as a root, to the host model code. No code is generated for the sub-tree having “idle_state” as a root (S45).

Since the code conversion of all sub-trees of the syntax tree, that is, the syntax tree having “out_ping_state” as a root, is complete (S43), when the root is converted to the host model code (S45), “USB_opkt.do(ping);” is generated. The host model code corresponding to the syntax tree shown in (3) of FIG. 5 is shown in (4) of FIG. 5.

The representation of the method for converting the above determined syntax tree to the host model code with yacc_notation (yet another compiler compiler_notation) is shown below. However, the following code is merely an exemplary embodiment of a case in which the host model code is a USB eVC (e Verification Components) code. However, the code can be embodied in other different methods according to the type and embodiment method of the host model code; the scope of the present invention is not limited thereto.

%{
#include <stdio.h>
int transfer_cnt = 1;
struct USB_packet {
int addr;
int endp;
unsigned long data[1024];
int len;
};
struct USB_packet USB_pkt;
%}
%token OUT ADDR ENDP PID EQ IN DATA SETUP PING IDLE
TO_EOF sdata LBRACE
%token RBRACE FRAME AUTO
%token EMPTY_FRAME EXPECTED_PID ACK NAK PRETRY BOOL
PNYET NYET
%union
{
char string[10];
}
%token <string> NUM
%%
top_state:
statement
| top_state statement
;
statement:
PD EQ out_state
|PID EQ in_state
|PID EQ ack_state
|PID EQ setup_state
|PID EQ out_ping_state
|frame_state
|empty_frame_state
|expected_pid_state
;
setup_state:
SETUP addr_state endp_state ping_state idle_state PID
EQ data_state
;
ping_state:
PRETRY EQ BOOL PNYET EQ BOOL
;
ack_state:
ACK idle_state
;
frame_state:
FRAME EQ AUTO idle_state
;
empty_frame_state:
EMPTY_FRAME EQ NUM
;
expected_pid_state:
EXPECTED_PID EQ ACK idle_state
|EXPECTED_PID EQ NAK idle_state
|EXPECTED_PID EQ DATA idle_state
|EXPECTED_PID EQ NYET idle_state
;
out_state:
OUT addr_state endp_state idle_state PID EQ data_state
{
int i;
fprintf(stdout,“\t\twrite(p_host.get_pipe(%d,    %d,
OUT)”, USB_pkt.addr, USB_pkt.endp);
if(USB_pkt.len != 0)
{
fprintf(stdout,“,{”);
for(i = 0: i < USB_pkt.len; i++)
{
fprintf(stdout, “%d”, USB_pkt.data[i]);
if( i != USB_pkt.len −1) fprintf(stdout,“;”);
}
fprintf(stdout,“);W n ”);
} else {
fprintf(stdout, “,{});”);
}
USB_pkt.len = 0;
transfer_cnt++;
}
;
idle_state:
IDLE EQ NUM
| IDLE EQ TO_EOF
;
in_state:
IN addr_state endp_state idle_state
{
fprintf(stdout,“\t\td             =
read(p_host.get_pipe(%d, %d,IN));W n ”, USB_pkt.addr, USB_pkt.endp);
transfer_cnt++;
}
| IN addr_state endp_state
{
fprintf(stdout,“\t\td             =
read(p_host.get_pipe(%d, %d,IN));W n ”, USB_pkt.addr, USB_pkt.endp);
transfer_cnt++;
}
;
out_ping_state:
PING addr_state endp_state idle_state
;
data_state:
DATA ctx_state idle_state
{
}
;
ctx_state:
sdata EQ LBRACE num_series RBRACE
| sdata EQ LBRACE RBRACE
;
num_series:
NUM {
USB_pkt.data[USB_pkt.len++] = (unsigned long)strtol($1,
NULL, 16);
}
| num_series NUM
{
USB_pkt.data[USB_pkt.len++] = (unsigned long)strtol($2,
NULL, 16);
}
;
addr_state:
ADDR EQ NUM {USB_pkt.addr = atoi($3);}
;
endp_state:
ENDP EQ NUM {USB_pkt.endp = atoi($3);}
;

Referring back to FIG. 1, the USB device test system 10 may further include the USB packet logger 230. The USB packet logger 230 connected between the USB host 210 and the USE device 220, receives the USB packet tracer output from the USB host 210 and outputs the received USB packet trace to the token generation module 10. The token generation module 110 receives through the USB packet logger 230>the USB packet trace output from the USB host 210 to the USB device 220. The USB packet logger 230, for example, a USB packet analyzer of Computer Access Technology Corporation (CATC), is connected between the USB host 210 and the USB device 220 and generates a file recording the packet trace that the USB host 210 outputs to the USE device 220. The file may be, for example, a utg file.

The host model 300 receives the host model code output from the host code generation module 130 and outputs a host signal corresponding to the received host model code. The host model 300 outputs the host signal to a USB device model (not shown). The USB device model receiving the host signal outputs a signal in response to the host signal. A user may check the signal output from the USB device model through a simulator to test the USB device.

The USB packet trace converting apparatus 100 converts the USB packet trace that the USB host 210 outputs to the USB device 220, to the host model code that can be used by the host model 300. The host model 300 outputs a host signal corresponding to the host model code to the USE device model, The USB device model outputs a signal In response to the host signal. Thus, the operation and generated signal of the USB device is tested using the same error situation as an actual situations

The host model 300 may be a USB eVC (e Verification Components) and the USB device model can model an RTL level through Verilog, Synopses' VCS, or Mentor's Modelism.

The present invention can be embodied as computer readable codes on a computer readable recording medium. The computer readable recording medium may be any data storage device that can store data that can be read by a computer system Examples of the computer readable recording medium include read-only memory (ROM), random-access memory (RAM), CO-ROMs, magnetic tapes, floppy disks optical data storage devices, and carrier waves (such as data transmission through the Internet). The computer readable recording medium can also be distributed over network coupled computer systems so that the computer readable code is stored and executed in a distributed fashion. Functional programs, codes, and code segments for implementing embodiments of the present invention can be understood by those of ordinary skill in the art to which the present invention pertains.

As described above, the method and system for testing a USB device according to an embodiment of the present invention reproduce an error of an actual situation and simulate the same internal signal and device status as those in an RTL/NET (netlist: gate level) simulation,

While this invention has been particularly shown and described with reference to preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the disclosure.

Claims

1. A method for testing a USB (universal serial bus) device comprising: receiving a USB packet trace output from a USB host, at a USB packet trace converting apparatus;generating at least one token corresponding to the USB packet trace received from the USB host;determining a syntax tree corresponding to the at least one token; andgenerating a host code for a USB host model corresponding to the syntax tree.

2. The method of claim 1, wherein the receiving of the USB packet trace comprises; receiving the USB packet trace output from the USB host through a USB packet logger; andreceiving the USB packet trace output from the USB packet logger at the USB packet trace converting apparatus.

3. The method of claim 2, wherein the USB packet logger generates a utg (USB traffic generation) file from the USB packet trace and outputs the utg file to the USB packet trace converting apparatus.

4. The method of claim 1 further comprising storing, in a predetermined storage device, an expression-token table, the expression-token table comprising a stored expression and a stored token corresponding to the expression, and a syntax tree forest generated based on the stored token.

5. The method of claim 4, wherein the generating of the at least one token comprises: searching the stored expression of the expression-token table stored in the storage device for an expression included in the received USB packet trace; andgenerating the at least one token from the stored token in the expression-token table corresponding to the stored expression based on the expression included in the received USB packet trace.

6. The method of claim 4, wherein the determining of the syntax tree comprises: searching the syntax tree forest stored in the storage device for a syntax tree comprising the at least one token generated corresponding to the USB packet trace; anddetermining whether the searched syntax tree is the syntax tree corresponding to the at least one token generated corresponding to the USB packet trace.

7. The method of claim 1, wherein the generating of the host code comprises generating the host code corresponding to the syntax tree while conducting a search from a sub-tree of the syntax tree.

8. The method of claim 1 wherein the host code for the USB host model is a USB eVC (e Verification Components) host code.

9. A computer readable medium embodying instructions executable by a processor to perform a method for testing a USB (universal serial bus) device, the method steps comprising: receiving a USB packet trace output from a USB host at a USB packet trace converting apparatus;generating at least one token corresponding to the USB packet trace received from the USB host;determining a syntax tree corresponding to the at least one token; andgenerating a host code for a USB host model corresponding to the syntax tree,

10. A system for testing a USB (universal serial bus) device, the system comprising: a storage device storing an expression-token table, the expression-token table comprising an expression and a token corresponding to the expression, and a syntax tree forest generated based on the token of the expression-token table;a token generation module receiving a USB packet trace output from a USB host and generating at least one generated token corresponding to the received USB packet trace based on the expression-token table,a syntax tree determination module determining a syntax tree corresponding to the at least one generated token based on the syntax tree forest; anda host code generation module generating a host code for a USB host model corresponding to the syntax tree,

11. The system of claim 10 wherein the token generation module receives the USB packet trace output from the USB host, through a USB packet logger.

12. The system of claim 10, wherein the token generation module searches the expression-token table stored in the storage device for a received expression included in the received USB packet trace and generates the at least one generated token with the token stored in the expression-token table corresponding to the expression based on the received expression.

13. The system of claim 10, wherein the syntax tree determination module searches the syntax tree forest stored in the storage device for a syntax tree comprising the at least one generated token and determines whether the searched syntax tree is the syntax tree corresponding to the at least one generated token.

14. The system of claim 10, wherein the host code generation module generates the host code corresponding to the syntax tree while conducting a search from a sub-tree of the syntax tree.

15. The system of claim 10, further comprising a host model which receives the host model code output from the host code generation module and outputs a host signal corresponding to the received host model code.

16. The system of claim 11, further comprising a USB packet logger which is connected between the USB host and the USB device receives the USB packet trace output from the USB host, and outputs the received USB packet trace to the token generation module.