JP2008077392A - Data structure, file data-processing program, and information storage medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a data structure, which makes the management of a memory easy and enables a computer to process a program at a high speed, a final data-processing program, and an information storage medium therefor. <P>SOLUTION: File data areas are secured on a memory, and file data are read in the file data areas to analyze the file data, and event data which are reference data are referred to. Then, areas, which dummy data occupy among the file data areas, are dynamically allocated, as the work areas, to the memory, and an event program is executed by use of the work areas. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a data structure, a file data processing program, and an information storage medium.

  Conventionally, there are many file data processing programs in which a computer secures an area on a memory, reads file data, refers to the read data, and executes a given program. In such file data processing, a work area is further secured on the memory, and a given program is often executed using the work area.

  However, there are various problems in securing the work area on the memory. For example, when the work area is secured to the operating system processing, there is a problem that the processing speed becomes low. This is because the memory securing process has increased versatility and is often slow. Therefore, if the process of securing or releasing the memory is frequently performed, it takes time to execute the program.

In addition, when the processing content is complicated or when there are many processes for securing a work area on the memory, the secured work area may not be released. If the work area is not released, memory resources are wasted. Further, when the memory area that is not released increases, a memory leak problem occurs. Furthermore, if the memory release order is not correctly performed, free areas in the memory are fragmented, and a large-capacity memory cannot be secured.
JP 2001-137545 A

  The present invention has been made in view of the problems as described above. The object of the present invention is to make it easy to manage a memory and to make a computer process a program at high speed, a file data processing program It is to provide an information storage medium.

(1) The present invention
A data structure of file data including reference data to be referred to when a computer executes a given program,
The file data is
In addition to the reference data, including dummy data for securing a work area used in executing the given program on the memory,
The computer is
After securing the file data area on the memory, the file data is read into the file data area,
An area occupied by the dummy data in the file data area is allocated as a work area on the memory, and the given data is referred to the reference data read into the file data area using the allocated work area. The present invention relates to a data structure characterized by executing the above program.

  The present invention also relates to an information storage medium that can be read by a computer and stores a program that causes the computer to function as each of the above-described units.

  According to the present invention, since the file data has a data structure including dummy data in addition to the reference data, the computer uses the area occupied by the dummy data in the file data area as the work area when executing the program. can do. Therefore, it is sufficient to allocate a part of the file data area as a work area, so that the memory can be easily managed. Furthermore, since the work area is allocated from the already secured file data area, the processing can be performed at high speed.

  Further, according to the present invention, the amount of memory used in a given program corresponds to the amount of file data area used, so if the capacity of file data is confirmed, the upper limit of the amount of memory used is assumed. Error due to memory shortage can be avoided, and memory management can be performed appropriately.

(2) In the data structure and information storage medium of the present invention,
The file data is
Including offset data specifying the dummy data;
The computer is
The work area may be allocated on a memory based on the offset data.

  According to the present invention, since the file data has a data structure that further includes offset data, the work area that is the area occupied by the dummy data can be specified based on the offset data read into the file data area. Therefore, work area allocation processing can be performed at high speed.

(3) In the data structure and information storage medium of the present invention,
The file data is
Including a plurality of types of reference data according to the processing contents for executing the given program,
The computer is
Based on the offset data, a work area associated with each reference data may be allocated on a memory.

  According to the present invention, the file data includes a plurality of types of reference data, and the computer uses the area occupied by the dummy data as a work area in the already-allocated file data area instead of the empty memory area for each reference data. Can be assigned on top. Also, based on the offset data, a work area associated with each reference data can be allocated on the memory. Therefore, the computer can refer to each reference data and secure a work area associated with each reference data at high speed.

  Furthermore, according to the present invention, since the work area associated with each reference data is allocated as a part of the file data area, memory management can be easily performed, and the problem of memory shortage and memory leak is solved. can do.

(4) In the data structure and information storage medium of the present invention,
The dummy data is
The data structure may be sequential data that is embedded in a predetermined area with a predetermined value.

  According to the present invention, since the dummy data is sequential data embedded in a predetermined area with a predetermined value, when the file data is compressed, the data capacity is suppressed as compared with the case where the normal data is compressed. Can do.

(5) The present invention
A file data processing program for performing processing using file data including reference data to be referred to when a computer executes a given program,
A memory management unit that performs processing to secure a file data area on the memory;
A reading unit that performs processing of reading file data including the reference data and dummy data for securing a work area used in executing the given program on a memory into the file data area; ,
A program execution unit that executes the given program with reference to the reference data of the file data read into the file data area;
Including
The memory management unit
The area occupied by the dummy data in the file data area is allocated as a work area on the memory,
The program execution unit is
The present invention relates to a file data processing program that executes the given program using the assigned work area.

  The present invention also relates to an information storage medium that can be read by a computer and stores a program that causes the computer to function as each of the above-described units.

  According to the present invention, the computer can use the area occupied by the dummy data in the file data area as the work area when executing the program. Therefore, it is sufficient to allocate a part of the file data area as a work area, so that the memory can be easily managed. Furthermore, since the work area is allocated from the already secured file data area, the processing can be performed at high speed.

  Further, according to the present invention, the amount of memory used in a given program corresponds to the amount of file data area used, so if the capacity of file data is confirmed, the upper limit of the amount of memory used is assumed. Error due to memory shortage can be avoided, and memory management can be performed appropriately.

  Furthermore, once the computer secures the file data area, the work area required for executing a given program may be allocated as a part of the file data area. It is not necessary to perform processing for securing a part and assigning it as a work area, so that memory management can be performed centrally.

(6) In the program and information storage medium of the present invention,
The file data is
Including offset data specifying the dummy data;
The reading unit is
Read the file data including the offset data into the file data area on the memory,
The memory management unit
The work area may be allocated on a memory based on the offset data.

  According to the present invention, since the file data has a data structure that further includes offset data, the work area that is the area occupied by the dummy data can be specified based on the offset data read into the file data area. Therefore, work area allocation processing can be performed at high speed.

(7) In the program and information storage medium of the present invention,
The file data is
Including a plurality of types of reference data according to the processing contents for executing the given program,
The memory management unit
Based on the offset data, a process of allocating a work area associated with each reference data on a memory may be performed.

  According to the present invention, the file data includes a plurality of types of reference data, and the computer uses the area occupied by the dummy data as a work area in the already-allocated file data area instead of the empty memory area for each reference data. Can be assigned on top. In addition, based on the offset data, a work area associated with each reference data is allocated on the memory. Therefore, the computer can refer to each reference data and secure a work area associated with each reference data at high speed.

  Furthermore, according to the present invention, since the work area associated with each reference data is allocated as a part of the file data area, memory management can be easily performed, and the problem of memory shortage and memory leak is solved. can do.

(8) In the program and information storage medium of the present invention,
The memory management unit
The processing unit may perform a process of releasing the file data area secured on the memory when a given end condition is satisfied.

  According to the present invention, when a given end condition is satisfied, the file data area is released at a time. As described above, since the memory is secured at one time and released at a time, the problem of memory fragmentation can be solved.

  Here, the case where the given termination condition is satisfied includes the case where the given program ends abnormally due to exceptional processing in addition to the case where the given program ends normally.

  Hereinafter, this embodiment will be described. In addition, this embodiment demonstrated below does not unduly limit the content of this invention described in the claim. In addition, all the configurations described in the present embodiment are not necessarily essential configuration requirements of the present invention.

1. Configuration FIG. 1 shows an example of a functional block diagram of an image generation system (game system) of the present embodiment. Note that the image generation system of the present embodiment may have a configuration in which some of the components (each unit) in FIG. 1 are omitted.

  The operation unit 160 is for a player to input operation data of a player object (an example of a moving object, a player vehicle operated by the player), and functions thereof are a lever, a button, a steering, a microphone, and a touch panel display. Alternatively, it can be realized by a housing or the like. The storage unit 170 serves as a work area for the processing unit 100, the communication unit 196, and the like, and its function can be realized by a RAM (VRAM) or the like.

  The information storage medium 180 (computer-readable medium) stores programs, data, and the like, and functions as an optical disk (CD, DVD), magneto-optical disk (MO), magnetic disk, hard disk, and magnetic tape. Alternatively, it can be realized by a memory (ROM). The processing unit 100 performs various processes of the present embodiment based on a program (data) stored in the information storage medium 180. That is, the information storage medium 180 stores a program for causing a computer to function as each unit of the present embodiment (a program for causing a computer to execute processing of each unit). In particular, in the information storage medium 180 of this embodiment, file data 182 is stored. The information storage medium 180 may store a compressed version of the file data 182.

  The display unit 190 outputs an image generated according to the present embodiment, and its function can be realized by a CRT, LCD, touch panel display, HMD (head mounted display), or the like. The sound output unit 192 outputs the sound generated by the present embodiment, and its function can be realized by a speaker, headphones, or the like.

  The portable information storage device 194 stores player personal data, game save data, and the like. Examples of the portable information storage device 194 include a memory card and a portable game device. The communication unit 196 performs various controls for communicating with the outside (for example, a host device or other image generation system), and functions thereof are hardware such as various processors or communication ASICs, programs, and the like. It can be realized by.

  Note that a program (data) for causing a computer to function as each unit of this embodiment is distributed from the information storage medium of the host device (server) to the information storage medium 180 (storage unit 170) via the network and communication unit 196. May be. Use of the information storage medium of such a host device (server) can also be included in the scope of the present invention.

  The processing unit 100 (processor) performs processing such as game processing, image generation processing, or sound generation processing based on operation data and programs from the operation unit 160. Here, as the game process, a process for starting a game when a game start condition is satisfied, a process for advancing the game, a process for placing an object such as a character or a map, a process for displaying an object, and a game result are calculated. There is a process or a process of ending a game when a game end condition is satisfied. The processing unit 100 performs various processes using the main storage unit 172 in the storage unit 170 as a work area. The functions of the processing unit 100 can be realized by hardware such as various processors (CPU, DSP, etc.), ASIC (gate array, etc.), and programs.

  The processing unit 100 includes a game processing unit 110, a drawing unit 120, and a sound generation unit 130. Note that some of these may be omitted.

  The game processing unit 110 performs processing for setting an object space, object movement / calculation processing, and processing for controlling a virtual camera.

  The object space setting unit displays various objects (objects composed of primitives such as polygons, free-form surfaces, or subdivision surfaces) that represent display objects such as characters, buildings, stadiums, cars, trees, columns, walls, and maps (terrain). The process of setting the placement in the object space is performed. In other words, the position and rotation angle of the object in the world coordinate system (synonymous with direction and direction) are determined, and the rotation angle (rotation angle around the X, Y, and Z axes) is determined at that position (X, Y, Z). Arrange objects.

  The movement / motion processing unit performs movement / motion calculation (movement / motion simulation) of an object (such as a character, a car, a train, or an airplane). That is, based on operation data input by the player through the operation unit 160, a program (movement / motion algorithm), various data (motion data), or the like, the object is moved in the object space, or the object is moved (motion, animation). ) Process. Specifically, object movement information (position, rotation angle, speed, or acceleration) and motion information (position or rotation angle of each part that constitutes the object) are sequentially transmitted every frame (1/60 seconds). Perform the required simulation process. A frame is a unit of time for performing object movement / motion processing (simulation processing) and image generation processing.

  The virtual camera control unit performs control processing of the virtual camera (viewpoint) for generating an image that can be seen from a given (arbitrary) viewpoint in the object space. Specifically, processing for controlling the position (X, Y, Z) or rotation angle (rotation angle about the X, Y, Z axis) of the virtual camera (processing for controlling the viewpoint position, the line-of-sight direction or the angle of view) I do.

  For example, when an object (eg, character, ball, car) is photographed from behind using a virtual camera, the position or rotation angle of the virtual camera (the direction of the virtual camera is set so that the virtual camera follows changes in the position or rotation of the object. ) To control. In this case, the virtual camera can be controlled based on information such as the position, rotation angle, or speed of the object obtained by the movement / motion processing unit. Alternatively, the virtual camera may be controlled to rotate at a predetermined rotation angle or to move along a predetermined movement path. In this case, the virtual camera is controlled based on the virtual camera data for specifying the position (movement path) or rotation angle of the virtual camera. When there are a plurality of virtual cameras (viewpoints), the above control process is performed for each virtual camera.

  Furthermore, the game processing unit 110 includes a memory management unit 112, a reading unit 114, an analysis unit 116, and a program execution unit 118.

  The memory management unit 112 performs processing for securing an area necessary for processing the program on the memory. Further, during the execution of the program, a process of dynamically allocating memory in an area on the already reserved memory is performed. Further, a process for releasing the secured area is performed. In particular, the memory management unit 112 of this embodiment secures a file data area for reading the file data 182 in the main storage unit 172 of the storage unit 170.

  Then, the memory management unit 112 according to the present embodiment performs a process of dynamically allocating an area occupied by dummy data in the file data area as a work area used when executing a given program. When there are a plurality of given programs, processing for dynamically allocating work areas may be performed for each program.

  The memory management unit 112 according to the present embodiment can perform processing for releasing the file data area when a given end condition is satisfied. The case where a given end condition is satisfied is, for example, a case where a given program ends normally. When there are a plurality of given programs, it may be a case where all the programs have ended normally. Further, even when exceptional processing occurs and the processing ends abnormally, processing for releasing the file data area can be performed. As described above, the memory can be effectively used by releasing the memory in the file data area secured when a given end condition is satisfied.

  The reading unit 114 performs processing for reading data into the memory. In particular, the reading unit 114 of this embodiment reads the file data 182 into a file data area secured on the memory.

  The analysis unit 116 performs processing for analyzing data. In particular, the analysis unit 116 of the present embodiment analyzes file data read into the file data area. Specifically, reference data and offset data included in file data are analyzed. If the file data includes a plurality of types of reference data, analysis is performed for each reference data. For example, when the file data includes a plurality of types of event data referenced by the event program, the analysis is performed for each event data. Further, when the reference data is data composed of a plurality of items, analysis may be performed for each item.

  Here, the reference data is data referred to by a given program. That is, the reference data is values and data used in arithmetic processing of a given program. For example, the reference data includes event data that is referred to in the event program.

  The program execution unit 118 performs processing for executing a given program. In particular, the program execution unit 118 of the present embodiment executes a given program using the work area allocated by the memory management unit 112. A given program refers to a program that is executed based on a given instruction. For example, based on a given command accompanying the occurrence of an event, the event data analyzed by the analysis unit 116 is referred to and a process for executing the event program is performed using the work area.

  The drawing unit 120 performs drawing processing based on the results of various processing (game processing) performed by the processing unit 100, thereby generating an image and outputting the image to the display unit 190. When generating a so-called three-dimensional game image, first, object data (model data) including vertex data (vertex position coordinates, texture coordinates, color data, normal vector, α value, etc.) of each vertex of the object (model) ) Is input, and vertex processing (shading by a vertex shader) is performed based on the vertex data included in the input object data. When performing the vertex processing, vertex generation processing (tessellation, curved surface division, polygon division) for re-dividing the polygon may be performed as necessary. In the vertex processing, according to the vertex processing program (vertex shader program, first shader program), vertex movement processing, coordinate conversion (world coordinate conversion, camera coordinate conversion), clipping processing, perspective processing, and other geometric processing are performed. On the basis of the processing result, the vertex data given to the vertex group constituting the object is changed (updated or adjusted). Then, rasterization (scan conversion) is performed based on the vertex data after the vertex processing, and the surface of the polygon (primitive) is associated with the pixel. Subsequent to rasterization, pixel processing (shading or fragment processing by a pixel shader) for drawing pixels (fragments forming a display screen) constituting an image is performed. In pixel processing, according to a pixel processing program (pixel shader program, second shader program), various processes such as texture reading (texture mapping), color data setting / change, translucent composition, anti-aliasing, etc. are performed, and an image is processed. The final drawing color of the constituent pixels is determined, and the drawing color of the perspective-transformed object is output (drawn) to the drawing buffer 174 (a buffer capable of storing image information in units of pixels; VRAM, rendering target). That is, in pixel processing, per-pixel processing for setting or changing image information (color, normal, luminance, α value, etc.) in units of pixels is performed. Thereby, an image that can be seen from the virtual camera (given viewpoint) in the object space is generated. Note that when there are a plurality of virtual cameras (viewpoints), an image can be generated so that an image seen from each virtual camera can be displayed as a divided image on one screen.

  The vertex processing and pixel processing are realized by hardware that enables polygon (primitive) drawing processing to be programmed by a shader program written in a shading language, so-called programmable shaders (vertex shaders and pixel shaders). Programmable shaders can be programmed with vertex-level processing and pixel-level processing, so that the degree of freedom of drawing processing is high, and expressive power is greatly improved compared to conventional hardware-based fixed drawing processing. Can do.

  The drawing unit 120 performs geometry processing, texture mapping, hidden surface removal processing, α blending, and the like when drawing an object.

  In the geometry processing, processing such as coordinate conversion, clipping processing, perspective projection conversion, or light source calculation is performed on the object. Then, object data (positional coordinates of object vertices, texture coordinates, color data (luminance data), normal vector, α value, etc.) after geometry processing (after perspective projection conversion) is stored in the object data storage unit 176. Is done.

  Texture mapping is a process for mapping a texture (texel value) stored in the texture storage unit of the storage unit 170 to an object. Specifically, the texture (surface properties such as color (RGB) and α value) is read from the texture storage unit of the storage unit 170 using the texture coordinates set (given) to the vertex of the object. Then, a texture that is a two-dimensional image is mapped to an object. In this case, processing for associating pixels with texels, bilinear interpolation or the like is performed as texel interpolation.

  As the hidden surface removal processing, hidden surface removal processing can be performed by a Z buffer method (depth comparison method, Z test) using a Z buffer (depth buffer) in which Z values (depth information) of drawing pixels are stored. . That is, when drawing pixels corresponding to the primitive of the object are drawn, the Z value stored in the Z buffer is referred to. Then, the Z value of the referenced Z buffer is compared with the Z value at the drawing pixel of the primitive, and the Z value at the drawing pixel is a Z value (for example, a small Z value) on the near side when viewed from the virtual camera. In some cases, the drawing process of the drawing pixel is performed and the Z value of the Z buffer is updated to a new Z value.

  α blending (α synthesis) is a translucent synthesis process (usually α blending, addition α blending, subtraction α blending, or the like) based on an α value (A value).

  The α value is information that can be stored in association with each pixel (texel, dot), for example, plus alpha information other than color information. The α value can be used as mask information, translucency (equivalent to transparency and opacity), bump information, and the like.

  The sound generation unit 130 performs sound processing based on the results of various processes performed by the processing unit 100, generates game sounds such as BGM, sound effects, or sounds, and outputs the game sounds to the sound output unit 192.

  Note that the image generation system of the present embodiment may be a system dedicated to the single player mode in which only one player can play, or may be a system having a multiplayer mode in which a plurality of players can play. Further, when a plurality of players play, game images and game sounds to be provided to the plurality of players may be generated using one terminal, or connected via a network (transmission line, communication line) or the like. Alternatively, it may be generated by distributed processing using a plurality of terminals (game machine, mobile phone).

2. The method of the present embodiment The file data processing program of the present embodiment secures a file data area on the memory, reads the file data into the file data area, analyzes the file data, and refers to event data as reference data . Then, an area occupied by dummy data in the file data area is dynamically allocated on the memory as a work area, and the event program is executed using the work area. This is because the memory can be easily managed and processed at high speed.

  Here, the event program of the present embodiment is a program that performs processing in response to the occurrence of an event. More specifically, the event program is a program that performs processing based on an operation input by the player through the operation unit 160, a signal generated when a specific phenomenon occurs based on various programs or data, data, and the like. is there. Furthermore, the work area is an area on a memory used for executing an event program. For example, it is an area used for temporarily storing data and temporarily storing calculation results and the like. The work area may be used to process data. In the file data processing program of this embodiment, the work area is allocated at a predetermined timing such as before or during execution of the event program.

2.1 Data Structure Next, the data structure of the file data according to the present embodiment will be described in comparison with a conventional method.

  FIG. 2A shows an example of the data structure of the file data according to the conventional technique, and FIG. 2B shows an example of the data structure of the file data of the present embodiment. As shown in FIG. 2A, the data structure of the conventional method is a data structure that includes event data 200 and does not include offset data and dummy data. On the other hand, as shown in FIG. 2B, the data structure of the file data of this embodiment is a data structure including offset data 210, event data 220, and dummy data 230.

  Event data is reference data that is referred to when an event program is executed, and is information necessary to execute the event program. In short, event data refers to values and data required for arithmetic processing of event program execution processing. The event data may be referred to before the execution of the event program, or may be referred to during the execution of the event program. In addition, the event data may be a plurality of types of event data corresponding to the processing content for executing the event program. Specifically, a plurality of types of event data can be prepared in advance, and the event program can be executed with reference to each event data.

  Further, the event data may be data that provides an identification number or an identification name and associates each item of the object to be displayed, the size of the work area, and the coordinate value of the world coordinate system of the object to be displayed. When there are a plurality of event data, the contents of each item can be changed by changing the identification number or the identification name and the contents of each item. In this way, when analyzing the file data in this embodiment, each event data can be analyzed based on the identification number or the identification name.

  For example, event data referred to by an event program that displays an object in the object space may be data in which an object to be displayed, a coordinate value in the world coordinate system, and a work area size are recorded in association with an identification number.

  The dummy data is sequential data in which a predetermined value is embedded in a predetermined area of the file data in order to secure a work area used when executing the event program on the memory. Here, the sequential data means data that is continuously filled.

  Specifically, the size of the work area that must be secured in advance in the memory or the size that is sufficiently required as the work area is determined. In the file data, a predetermined value is filled in a predetermined area of the determined size. In this way, when the file data is read into the file data area on the memory, the area occupied by the dummy data can be used as the work area.

  More specifically, for example, when it is desired to secure a work area of 10 kilobytes, 0x00 (NULL value) is filled in a predetermined area of 10 kilobytes of file data. In this way, when the file data is read into the file data area on the memory, the area occupied by the dummy data on the file data area is 10 kilobytes, so a work area of 10 kilobytes is secured. The predetermined value is not necessarily 0x00, and may be a code (value, character) determined by a character code (for example, ASCII code, shift JIS code). For example, if a predetermined value is filled in a predetermined area such as 0x00, the compression rate can be increased when the file data is compressed. Therefore, considering the case where compressed file data is stored in the information storage medium, it may be desirable to fill 0x00 in a predetermined area.

  Note that the dummy data of this embodiment is only data for securing a work area, and the dummy data itself is not effectively used, but all or part of the dummy data is used for the event program. It may be data. Further, the dummy data of the present embodiment may be data embedded with a plurality of types of arbitrary codes (values and characters).

  The offset data is an offset address indicating the start address of the work area used by the event program. Therefore, since the work area is specified based on the offset address, the work area can be easily specified. In addition, when an event program is executed with reference to a plurality of types of event data, an offset address indicating the start address of a work area used in each event program is prepared.

  The file data of the present embodiment is read and analyzed in a file data area secured on the memory. As an analysis method, for example, event data and an offset address are associated and analyzed so that a work area can be specified for each event data. Further, when a plurality of types of event data exist, analysis may be performed for each event data. For example, the identification number or identification name for each event data may be analyzed by associating the displayed object, the size of the work area, the coordinate value of the displayed object in the world coordinate system, and each item of the displayed object.

  Note that the file data having the data structure of this embodiment shown in FIG. 2B is stored in an information storage medium. The compressed file data obtained by compressing the file data may be stored in the information storage medium. In this way, the capacity stored in the information storage medium can be suppressed.

2.2 Memory Management Next, in the file data processing program of this embodiment, a memory management method using the above-described file data will be described in comparison with a conventional method.

  FIG. 3 shows an example of a memory map in an initial state before the event program is executed. The in-use area 300 is an area used by the operating system and other programs. On the other hand, the free area 310 is an area where a file data area can be secured.

  Next, in order to execute the event program, a file data area for reading file data from a free area of the memory is secured. Specifically, a file data area corresponding to the capacity (size) of the file data is secured. In this way, it is possible to secure a necessary amount of memory without unnecessarily securing a large capacity memory. If the memory capacity is sufficient, a file data area having a capacity larger than the file data size may be secured. When compressed file data obtained by compressing file data is stored in the information storage medium, the compressed file data is decompressed, and a file data area is secured based on the capacity of the decompressed file data. . In short, processing for securing a file data area on the memory is performed based on the capacity of the file data.

  When the file data area is secured, the file data stored in the information storage medium is read into the file data area. If the compressed file data is stored in the information storage medium, the decompression process is performed, and the decompressed file data is read into the file data area.

  FIG. 4 shows an example of a memory map when a file data area is secured on the memory and the file data is read in the conventional method. The file data area 410 stores event data 412.

  FIG. 5 shows an example of a memory map when a file data area is secured on the memory and the file data is read in this embodiment. The file data area 510 stores offset data 512, event data 514, and dummy data 516. Since the file data of the present embodiment includes offset data and dummy data, the size of the file data area secured on the memory is larger than that of the conventional method. However, since the offset data is offset address data indicating the head of the work area, the capacity of the offset data in the entire file data is very small. In the present embodiment, a file data area including a work area is secured by using an area occupied by dummy data as a work area. On the other hand, in the conventional method, after a file data area is secured, a work area is secured. Therefore, the size of the area used on the memory in this embodiment is almost the same as the size of the area used on the memory in the conventional method.

  Next, a method in which the file data processing program according to the present embodiment allocates a work area used in the event program will be described by comparing the conventional methods.

  In the conventional technique, event data stored in a memory is referred to, a work area necessary for event data is secured from a free area, and an event program is executed. When there are a plurality of event data, the work area of the event program is secured from the free area for each event data.

  FIG. 6 shows an example of a memory map when the work area of the conventional method is secured. For example, as shown in FIG. 6, event data 1 (612), event data 2 (614), and event data 3 (616) are stored in the file data area 610. In the conventional method, an event program executed with reference to event data 1 secures a work area 1 (620) from a free area, and executes the program using the work area 1 (620). The event program executed with reference to the event data 2 secures the work area 2 (630) and executes the event program. The event program executed by referring to the event data 3 secures the work area 3 (640) and executes the event program.

  In the conventional method, a work area used for an event program is secured in a free area on a memory. Therefore, every time an event program is executed, it is necessary to consider securing and releasing the free space of the memory and the work area, so that the memory management is complicated. Further, the work area securing process is left to the operating system process, and the process is slow.

  On the other hand, in the file data processing program of this embodiment, the event data stored in the file data area on the memory is referred to, and the area occupied by the dummy data in the file data area is assigned as the work area. Then, the event program is executed using the work area.

  FIG. 7 shows an example of a memory map when the work area of this embodiment is allocated. As shown in FIG. 7, the event program executed by referring to the event data 1 (712) stored in the file data area 710 dynamically uses the work area 1 (715) occupied by dummy data in the file data area. Assigned to. The dummy data can be specified based on the offset address. Similarly, an event program executed with reference to event data 2 (713) is dynamically assigned work area 2 (716). An event program executed with reference to event data 3 (714) is dynamically assigned work area 3 (717).

  In the conventional method, the work area is secured from the free area of the memory. In the present embodiment, the area occupied by the dummy data in the already secured file data area is allocated as the work area. In this embodiment, the processing for securing the work area on the memory is performed not by the operating system but by dynamically allocating a part of the file data area, so that the processing speed can be increased compared to the conventional method. . Further, since it is sufficient to manage the memory in the file data area, it is not necessary to consider the free space of the memory or the release of the work area every time the event program is executed. Therefore, the memory can be easily managed.

  A method of assigning work areas according to the present embodiment will be described. In the file data processing program of this embodiment, a conventional method for securing a memory is overloaded, and a part of the file data area is dynamically allocated as a work area. A work area is dynamically allocated by so-called overloading. Specifically, a method for allocating memory from the area secured in the file data area by changing the return value and the number of arguments by the method having the same name as the method for allocating memory by the operating system is defined. For example, the start address of the work area is designated based on the offset address associated with the event data, and the work area is defined to be assigned based on the capacity to be secured as the work area. When a work area is secured, a method for allocating memory is called from an area secured in the file data area, not a method for securing memory by the operating system. In this way, since the file data area on the already secured memory is allocated, the processing speed of the computer is much faster than the conventional method.

  Furthermore, according to the present embodiment, not only the work area allocation processing speed is improved, but also the problem of memory fragmentation can be solved.

  FIG. 8 shows an example of a memory map when the work area of the conventional method is released. FIG. 9 shows an example of a memory map when the work area of this embodiment is released.

  With conventional methods, even when the work area is no longer used, free memory is fragmented by leaving the memory area free without releasing it, or by reordering the release order when multiple work areas are secured. Has occurred. This is because the management of the memory is left to the processing of the operating system. For example, as shown in FIG. 8, the released area is only the free area 830, and the work area 1 (820) and the work area 3 (840) remain secured without being released.

  As shown in FIG. 8, if free areas are generated in pieces, it becomes impossible to secure a large capacity of memory. In addition, since the area on the memory that is not actually used remains reserved, the memory resources are wasted, the memory that is originally required cannot be secured, and a system failure occurs. There is a fear.

  On the other hand, as shown in FIG. 9, in this embodiment, when the file data area is released, the area 910 in which the file data area is secured becomes a free area. Since the file data area including the area 916 which is the work area is released at once, the problem of memory fragmentation can be solved.

  Thus, in the file data processing program of this embodiment, as shown in FIG. 9, the file data area already secured on the memory is released when a given end condition is satisfied. Therefore, since the area secured at one time is released at a time, memory fragmentation, which has been a problem in the past, can be prevented. In addition, since it is not necessary to consider the release of each work area, memory management can be easily performed.

3. Processing of this embodiment Next, a detailed processing example of the file data processing program of this embodiment will be described with reference to the flowchart of FIG.

  First, a file data area for reading file data is secured on the memory (step S10). A file data area may be secured based on the size of the file data. For example, when the size of the file data is 128 megabytes, the file data area is secured with 128 megabytes.

  Next, the file data is read into the file data area. (Step S20). An area on the memory occupied by dummy data of the file data read into the file data area is used as a work area.

  Next, the file data read into the memory is analyzed (step S30). When multiple types of event data exist, analysis may be performed for each event data. Further, analysis may be performed so that an offset address can be specified in association with each event data.

  Subsequently, event data is referred to based on the analysis result (step S40).

  Then, an offset address corresponding to the event data is acquired (step S50), and a work area used for the event program is allocated based on the offset address (step S60). For example, processing is performed so that a work area of 10 kilobytes is assigned to address 100 based on the offset address. It may be initialized with 0x00 before using the work area. Then, the event program executes the event program using the work area (step S70).

  After the event program is executed, it is determined whether there is next event data (step S80). If there is next event data (Yes in step S80), steps S40 to S80 are repeated. If there is no event data (No in step S80), the file data area is released (step S90).

4). Hardware Configuration FIG. 11 shows an example of a hardware configuration capable of realizing this embodiment. The main processor 900 operates based on a program stored in a DVD 982 (information storage medium, which may be a CD), a program downloaded via the communication interface 990, a program stored in the ROM 950, or the like. Perform processing, sound processing, etc. The coprocessor 902 assists the processing of the main processor 900, and executes matrix operation (vector operation) at high speed. For example, when a matrix calculation process is required for a physical simulation for moving or moving an object, a program operating on the main processor 900 instructs (requests) the process to the coprocessor 902.

  The geometry processor 904 performs geometry processing such as coordinate conversion, perspective conversion, light source calculation, and curved surface generation based on an instruction from a program operating on the main processor 900, and executes matrix calculation at high speed. The data decompression processor 906 performs decoding processing of compressed image data and sound data, and accelerates the decoding processing of the main processor 900. Thereby, a moving image compressed by the MPEG method or the like can be displayed on the opening screen or the game screen.

  The drawing processor 910 executes drawing (rendering) processing of an object composed of primitive surfaces such as polygons and curved surfaces. When drawing an object, the main processor 900 uses the DMA controller 970 to pass the drawing data to the drawing processor 910 and, if necessary, transfers the texture to the texture storage unit 924. Then, the drawing processor 910 draws the object in the frame buffer 922 while performing hidden surface removal using a Z buffer or the like based on the drawing data and texture. The drawing processor 910 also performs α blending (translucent processing), depth cueing, mip mapping, fog processing, bilinear filtering, trilinear filtering, anti-aliasing, shading processing, and the like. When a programmable shader such as a vertex shader or a pixel shader is installed, the vertex data is created / changed (updated) and the drawing color of a pixel (or fragment) is determined according to the shader program. When an image for one frame is written in the frame buffer 922, the image is displayed on the display 912.

  The sound processor 930 includes a multi-channel ADPCM sound source and the like, generates game sounds such as BGM, sound effects, and sounds, and outputs them through the speaker 932. Data from the game controller 942 and the memory card 944 is input via the serial interface 940.

  The ROM 950 stores system programs and the like. In the case of an arcade game system, the ROM 950 functions as an information storage medium, and various programs are stored in the ROM 950. A hard disk may be used instead of the ROM 950. The RAM 960 is a work area for various processors. The DMA controller 970 controls DMA transfer between the processor and the memory. The DVD drive 980 (may be a CD drive) accesses a DVD 982 (may be a CD) in which programs, image data, sound data, and the like are stored. The communication interface 990 performs data transfer with the outside via a network (communication line, high-speed serial bus).

  The processing of each unit (each unit) in this embodiment may be realized entirely by hardware, or may be realized by a program stored in an information storage medium or a program distributed via a communication interface. Also good. Alternatively, it may be realized by both hardware and a program.

  When the processing of each part of this embodiment is realized by both hardware and a program, a program for causing the hardware (computer) to function as each part of this embodiment is stored in the information storage medium. More specifically, the program instructs the processors 902, 904, 906, 910, and 930, which are hardware, and passes data if necessary. Each processor 902, 904, 906, 910, 930 realizes the processing of each unit of the present invention based on the instruction and the passed data.

  The present invention is not limited to the one described in the above embodiment, and various modifications can be made. For example, terms cited as broad or synonymous terms in the description in the specification or drawings can be replaced by broad or synonymous terms in other descriptions in the specification or drawings. Further, the method of expressing the contact trace is not limited to that described in the present embodiment, and a method equivalent to these is also included in the scope of the present invention.

  Not only the event program but also various programs using the work area, file data including dummy data may be read into the memory, and the area occupied by the dummy data may be dynamically allocated as the work area.

  The file data may include various data in addition to the offset data, reference data, and dummy data.

  The file management area 112 of the memory management unit 112 according to this embodiment may be secured by operating system processing, or may be dynamically secured. Further, the memory management unit 112 according to the present embodiment may perform various types of memory management such as garbage collection, heap area expansion / reduction processing, and memory shortage exception processing.

The example of a functional block diagram of the image generation system of this embodiment. 2A and 2B are explanatory diagrams of the data structure. Explanatory drawing of the initial state of memory. Explanatory drawing of the conventional file data area. Explanatory drawing of the file data area | region of this embodiment. Explanatory drawing of the conventional work area | region. Explanatory drawing of the work area | region of this embodiment. Explanatory drawing of the open | release of the conventional work area | region. Explanatory drawing of opening of the file data area | region of this embodiment. The flowchart of the process of this embodiment. Hardware configuration example.

Explanation of symbols

100 processing unit, 110 game processing unit, 112 memory management unit, 114 reading unit,
116 analysis unit, 118 program execution unit, 120 drawing unit, 130 sound generation unit,
160 operation unit, 170 storage unit, 172 main storage unit, 174 drawing buffer,
180 information storage medium, 190 display unit, 192 sound output unit,
194 Portable information storage device, 196 communication unit

Claims (10)

A data structure of file data including reference data to be referred to when a computer executes a given program,
The file data is
In addition to the reference data, including dummy data for securing a work area used in executing the given program on the memory,
The computer is
After securing the file data area on the memory, the file data is read into the file data area,
An area occupied by the dummy data in the file data area is allocated as a work area on the memory, and the given data is referred to the reference data read into the file data area using the allocated work area. A data structure characterized by executing the program. In claim 1,
The file data is
Including offset data specifying the dummy data;
The computer is
A data structure, wherein the work area is allocated on a memory based on the offset data. In claim 2,
The file data is
Including a plurality of types of reference data according to the processing contents for executing the given program,
The computer is
A data structure, wherein a work area associated with each reference data is allocated on a memory based on the offset data. In any one of Claims 1-3,
The dummy data is
A data structure, which is sequential data embedded in a predetermined area with a predetermined value.   A computer-readable information storage medium, wherein the file data having the data structure according to any one of claims 1 to 4 is stored. A file data processing program for performing processing using file data including reference data to be referred to when a computer executes a given program,
A memory management unit that performs processing to secure a file data area on the memory;
A reading unit that performs processing of reading file data including the reference data and dummy data for securing a work area used in executing the given program on a memory into the file data area; ,
A program execution unit that executes the given program with reference to the reference data of the file data read into the file data area;
Including
The memory management unit
The area occupied by the dummy data in the file data area is allocated as a work area on the memory,
The program execution unit is
A file data processing program, wherein the given program is executed using the assigned work area. In claim 6,
The file data is
Including offset data specifying the dummy data;
The reading unit is
Read the file data including the offset data into the file data area on the memory,
The memory management unit
A file data processing program for performing a process of allocating the work area on a memory based on the offset data. In claim 7,
The file data is
Including a plurality of types of reference data according to the processing contents for executing the given program,
The memory management unit
A file data processing program for performing a process of allocating a work area associated with each reference data on a memory based on the offset data. In any one of Claims 6-8,
The memory management unit
A file data processing program for performing a process of releasing a file data area secured on a memory when a given end condition is satisfied in the processing unit.   A computer-readable information storage medium, wherein the file data processing program according to any one of claims 6 to 9 is stored.

Images