JPH06203534A - File management system for electronic musical instrument - Google Patents

Abstract

PURPOSE:To insert and delete performance data of an arbitrary length without rewriting the entire data by storing the size of a performance data part and eliminating the need for one memory unit to be filled with the data. CONSTITUTION:A hard disk 21 is divided to the memory units consisting of the data regions of the prescribed length and the performance data for one file component of plural pieces of the memory units are properly divided and stored. The disk 21 stores the data indicating the size of the performance data part currently stored in the memory unit and the data indicating the sequence of connection. Then, the performance data for the prescribed one file component is reproduced by successively reading out the effective data from the memory unit in accordance with the data indicating the sequence of connection. A CPU 10 makes instruction as to whether the data be freshly inserted into the stored performance data or the data be deleted. A DMA device 18 rewrites the data indicating the size and sequence of connection of the performance data part according to the insertion, the deletion.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an electronic musical instrument for performing a desired performance by storing the performance data as a file in a storage medium in order to logically handle the performance data relating to the musical tone and reading the file. The present invention relates to a file management system for an electronic musical instrument in which the physical configuration of the file is improved by storing the file on an actual storage medium and reading the file.

[0002]

2. Description of the Related Art A sequencer-type automatic performance device that stores performance data input from a keyboard, a computer or the like in a storage medium such as a floppy disk or a hard disk, reads the performance data from the storage medium and automatically reproduces the performance sound. There is a built-in electronic musical instrument.

In such an electronic musical instrument, when storing performance data in a floppy disk, a hard disk, etc.,
Performance data is managed as a file by using a file management system of MS-DOS which is an operation system of a general-purpose personal computer. ("MS
-DOS "is a registered trademark of Microsoft Corporation, USA. ) In this MS-DOS, a disk is reserved area (boot sector), FAT (File Allocation).
performance data is stored by being divided into four blocks (n Table), a directory area, and a data area.
The reserved area stores the boot program, and the FAT determines which cluster on the disk the file or subdirectory uses, the connection status of the cluster, the position of the unused cluster, the position of the bad cluster, etc. It is a table that stores information on the usage status of the disk. The directory area corresponds to the root directory and stores a plurality of 32-byte directory entries. The data area is a collection of unused clusters or used clusters, and stores actual data such as performance data and subdirectories in order from the beginning as needed.

[0004]

However, the performance data handled by the electronic musical instrument is very large in comparison with the data handled by a normal personal computer, and the size of one file is inevitably very large. . Also,
In electronic musical instruments, insertion and deletion of performance data are often repeated according to the content of the performance. In order to manage such a huge amount of performance data with a file management system such as MS-DOS, it is necessary to rewrite all the data each time the performance data is inserted or deleted. Will spend time. This is M
This is because the S-DOS file management system relies on the system that data must be filled in except for the last cluster specified by the FAT that indicates the connected state of clusters. Therefore, MS
-If an enormous amount of performance data is managed by an existing file management system such as DOS, the storage positions of the performance data after the point where the performance data is inserted or deleted are all changed. Since it is necessary to rewrite the data, there is a problem that the performance data cannot be rewritten in real time according to the performance.

The present invention has been made in view of the above-mentioned points, and even if data is inserted or deleted from performance data stored in advance, it is possible to write data of arbitrary length without rewriting all data. An object of the present invention is to provide a file management system for electronic musical instruments in which performance data can be inserted or deleted at arbitrary positions.

[0006]

A file management system for an electronic musical instrument according to the present invention divides performance data of one file into a plurality of storage units each having a data area of a predetermined length and stores the performance data. Storage means for storing data indicating the size of the performance data portion stored in each storage unit and data indicating the connection order of the performance data portions stored in each storage unit, and this storage means Instructing means for instructing insertion or deletion of data with respect to the performance data stored in, and data for indicating the size of the performance data portion and the connection for inserting or deleting the data instructed by the instructing means. File management means for rewriting the data indicating the order, data indicating the size of the performance data portion stored in the storage means, and the connection order Reading means for reading the performance data stored in the storage means based on the data indicating

[0007]

The function data is data related to musical tones such as pitch-related data and sounding timing data. The storage means is divided into storage units each having a data area of a predetermined length, and the performance data for one file is appropriately divided and stored in a plurality of storage units. The storage means also stores data indicating the size of the performance data portion currently stored in that storage unit and data indicating the connection order of the performance data portions stored in each storage unit. Therefore, it is possible to reproduce the performance data for a predetermined one file by sequentially reading the valid data from the storage unit in accordance with the data indicating the connection order.
The instructing means is for instructing whether to insert new data or delete the performance data stored in the storage means. Therefore, data is inserted or deleted according to the operation of the instruction means. In such a case, the file management means rewrites the data indicating the size of the performance data portion and the data indicating the connection order when inserting or deleting the data designated by the designating means. Then, the reading means reads the performance data stored in the storage means on the basis of the data indicating the size of the performance data portion stored in the storage means and the data indicating the connection order. Therefore, when the size of the effective data of the storage unit becomes larger than the data area of the predetermined length due to the insertion of the data, the storage unit for storing the increased amount of data is newly added and added. All that is required is to add new data indicating the order of connection of storage units. Further, when the valid data stored in the storage unit disappears due to the deletion of the data, the storage unit only needs to be deleted from the data indicating the connection order. As a result, the number and amount of storage units that can be rewritten by inserting and deleting data is extremely small, and performance data of any length can be inserted at any position without rewriting all data one by one. It can be deleted.

[0008]

Embodiments of the present invention will now be described in detail with reference to the accompanying drawings. FIG. 2 is a hardware block diagram showing the overall configuration of an electronic musical instrument incorporating the file management system according to the present invention. Microprocessor unit (CPU)
Reference numeral 10 controls the operation of the entire electronic musical instrument. With respect to the CPU 10, a ROM 11, a RAM 12, a keyboard 13, a panel switch 14, a display device 15, a sound source circuit 16, an analog-digital converter (ADC) 17, a DMA (Direc) via a data and address bus 25.
A tMemory Access) device 18, an address conversion circuit 19 and an interface 20 are connected.

In this embodiment, an electronic musical instrument for performing key-depression detection processing and automatic performance processing by the CPU 10 will be described. A sequencer module for performing automatic performance processing and a module including the keyboard 13 and tone generator circuit 16 are separately provided. The present invention can be similarly applied to a device configured to transfer data between modules according to the well-known MIDI standard.

The ROM 11 stores various programs of the CPU 10 and various data, and is composed of a read only memory (ROM). The RAM 12 temporarily stores performance data and various data generated when the CPU 10 executes a program, and is assigned with a predetermined address area of a random access memory (RAM), and registers, flags, buffers, etc. Used as.

The keyboard 13 is provided with a plurality of keys for selecting the pitch of a musical tone to be pronounced, and data such as key-on event information, key-off event information, velocity information, key code, etc. according to the operation of each key. Is output to the CPU 10 via the data and address bus 25. Instead of the keyboard 13, a computer or the like may be connected to input desired performance data. The panel switch 14 includes various operators for selecting, setting, and controlling a tone color, a volume, an effect, and the like. The display 15 displays various information such as the control state of the CPU 10 and the contents of setting data on a liquid crystal panel (LCD) or the like.

The tone generator circuit 16 is capable of simultaneously generating musical tone signals on a plurality of channels, and inputs data and performance data (data conforming to the MIDI standard, waveform data, etc.) given via the address bus 25. However, a tone signal is generated based on this data, and is stored in the tone generator circuit 16 or in an external storage device such as a hard disk according to address data that changes corresponding to the pitch of the tone to be generated. A tone signal is generated by a memory reading method for sequentially reading tone waveform sample value data. It should be noted that the tone generator circuit 16 has a buffer memory having a two-block structure, and has a data and address bus 25.
The musical tone signal is generated after temporarily storing the performance data coming via the. The tone signal generated from the tone generator circuit 16 is sounded through a sound system 24 including an amplifier and a speaker (not shown).

The microphone 23 converts a voice signal, a musical instrument sound or the like into a voltage signal, and the analog-digital converter (ADC) 1
Output to 7. The analog-digital converter 17 converts the analog voltage signal from the microphone 23 into a digital signal and outputs it to the data and address bus 25. CPU1
Reference numeral 0 is a digital signal from the analog-digital converter 17, for example, a digital signal obtained by sampling a musical instrument sound is input, pitch data of the musical instrument sound is detected, and performance data is stored in an external storage device (hard disk 21 or the like).
To remember.

The hard disk 21 has a storage capacity of tens to hundreds of megabytes (MB) and is connected to the data and address bus 25 via the interface 20.
The cache RAM 22 has a storage capacity of several megabytes and greatly shortens the access time to the hard disk 21. The address conversion circuit 19 determines whether the read address exists in the cache RAM 22 and, if it exists, converts the read address into the address of the cache RAM 22. DMA device 18
Is to directly transfer data between the internal memory such as the RAM 12 and the external memory such as the hard disk 21 without passing through the CPU 10.

FIG. 1 is a diagram showing the contents of performance data stored on the hard disk 21. First, the hard disk 21 has a reserved area (boot sector) and a file allocation table (FAT: File Alloc).
data table, a data volume table (DVT), a directory area (DIR), and a data storage area. The reserved area stores the boot program as in the conventional case. The file allocation table FAT is used to determine which cluster on the disk the file or subdirectory uses, the disk connection status, unused cluster position, bad cluster position, etc. 3 is a table that stores information on the usage status of the.

The data volume table DVT is FAT.
3 is a table that stores data indicating the size of effective data stored in the cluster specified by. The directory area DIR corresponds to the root directory as in the conventional case, and stores a plurality of directory entries. The directory entry is composed of a file name, a file extension, a file attribute, a file creation date and time, a file start cluster number SC, a file size FS indicating the size of the file, and other data. The data storage area is a collection of unused clusters or used clusters, and stores actual data relating to performance data files and subdirectories.

In this embodiment, the size of one cluster is 512 bytes and the directory entry 1
Start cluster SC is 0002, file size F
A case where S is 2000 bytes will be described as an example. MS-DO
Similar to S, FAT cluster number CN = 0000, 00
No corresponding FAT is entered in 01, and the entry of FAT starts from the cluster number CN = 0002.

FAT0 = 0003 is entered in the cluster number CN = 0002 of the FAT, indicating that the next cluster number CN is 0003. Hereinafter, FAT1 = 0004 for the cluster number CN = 0003, FAT2 = 0005 for the cluster number CN = 0004, FAT3 = 0006 for the cluster number CN = 0005,
FAT4 = 0007 for cluster number CN = 0006
However, FAT5 = n + 1 for the cluster number CN = 0007
However, for the cluster number CN = n + 1, FATn-1 = FF
Each FF is entered. Therefore, the file specified by the directory entry 1 can be constructed by sequentially reading the data from the data storage area according to these cluster numbers CN. In the FAT entered here, FFFF is the MS
-Indicates that this is the last cluster among the clusters that configure files and subdirectories as with DOS.

DVT0 = 200 is entered in the cluster number CN = 0002 of the DVT, indicating that the size of valid data stored in this cluster is 200 bytes. Hereinafter, DVT1 = 300 for cluster number CN = 0003, DVT2 = 100 for cluster number CN = 0004, DVT3 = 512 for cluster number CN = 0005, DVT4 = 400 for cluster number CN = 0006, DVT5 = 300 is entered in the cluster number CN = 0007, and DVTn-1 = 188 is entered in the cluster number CN = n + 1.
If all the valid data indicated by this DVT is added, it becomes 2000 bytes which is the same as the file size FS.

By referring to the DVT, the size of data that can be stored in the cluster (margin area) can be recognized. That is, the cluster number CN = 000
2 has 312 bytes, cluster number CN = 0003 has 212 bytes, cluster number CN = 0004 has 412 bytes.
Bytes, 112 bytes for cluster number CN = 0006, 212 bytes for cluster number CN = 0007, 324 bytes for cluster number CN = n + 1, and a storable margin area for cluster number CN = 0005. Does not exist.

FIG. 6A is a conceptual diagram showing the size of valid data in the data storage area of the file of the directory 1 in FIG. 1 in a bar graph format for each cluster number. A case will be described in which about 300 bytes of data is inserted at the 100th byte (the position of the arrow DA in FIG. 6A) of the cluster number 0003 of the file of the directory 1 thus configured. In FIG. 6A, the shaded area on the left side of the arrow DA indicates data existing before the data insertion position, and the horizontal line shaded area on the right side of the arrow DA exists after the data insertion position. Data to be shown. Therefore, it is not necessary to change the storage area for the data existing before the shaded area, but it is necessary to change the storage area for the data after the horizontal shaded area. An example of changing the storage area will be described below with reference to the drawings.

First, as a first example, as shown in FIG. 6 (b), 100-byte data (hatched portion) of cluster number CN = 0003 is directly stored in the data storage area of cluster number CN = 0003. With respect to the remaining data of 200 bytes (horizontal line shaded portion), the cluster number CN = 0008 is set as a new data storage area.
Remember. Then, the cluster number CN = 0009 is stored as a new data storage area for the insertion data of about 300 bytes (lattice shaded portion).

Therefore, the contents of the FAT, DVT and the data storage area are respectively rewritten by the data insertion as shown in FIG. 6B, but the actual rewriting is the FAT corresponding to the cluster numbers CN = 0003, 0008 and 0009. , DVT and data storage areas. FIG. 3 is a diagram showing the contents of the rewritten FAT and DVT. That is, in the cluster number CN = 0003, 100-byte data (hatched portion) is left as it is in the data storage area of the cluster number CN = 0003, so the DVT1 is changed from 300 to 100.
As a result, there is no need to rewrite the contents of the data storage area with the cluster number CN = 0003. The data following the cluster number CN = 0003 is cluster number CN =
FAT1 is 0 because FAT1 is about 300 bytes of insertion data (lattice shaded portion) stored in the data storage area of 0009.
Changed from 004 to 0009.

In the cluster number CN = 0008,
Since 200 bytes of remaining data (horizontal line shaded portion) is stored in the data storage area of cluster number CN = 0008, 200 is stored in the DVT 6. The data following the cluster number CN = 0008 is the cluster number CN.
Since the data is = 0004, 0004 is stored in the FAT6. At cluster number CN = 0009, about 300 bytes of inserted data (latched portion) is stored in the data storage area at cluster number CN = 0009, so 300 is stored in DVT7. The data following the cluster number CN = 0009 is the cluster number CN.
Since the remaining data of 200 bytes (horizontal line shaded portion) stored in the data storage area of = 0008, 0008 is stored in FAT7. As described above, according to the first example, three cluster numbers CN = 0 with the insertion of data.
FAT, DV corresponding to 003, 0008 and 0009
It is only necessary to rewrite the data in T and the data storage area. Regarding the data storage area with the cluster number CN = 0003, it is sufficient to rewrite the DVT as described above, and it is not necessary to actually rewrite the data in the data storage area.

Next, as a second example, as shown in FIG. 6C, the 100-byte data (hatched portion) of the cluster number CN = 0003 is directly stored in the data storage area of the cluster number CN = 0003. , And then store about 300 bytes of insertion data (lattice shaded portion). Then, the cluster number CN = 0008 is stored as a new data storage area for the remaining data of 200 bytes (hatched portion in the horizontal line).

Therefore, the contents of the FAT, DVT and the data storage area are respectively rewritten by the data insertion shown in FIG. 6C, but the actual rewriting is the FA corresponding to the cluster numbers CN = 0003 and 0008.
T, DVT and data storage areas. FIG. 4 is a diagram showing the contents of the rewritten FAT and DVT. That is, in the cluster number CN = 0003, 10
The 0-byte data (hatched portion) is left as it is in the data storage area of cluster number CN = 0003, and about 300 bytes of inserted data (lattice-hatched portion) is stored thereafter, so that DVT1 is 300 to 400. And the data in the data storage area is rewritten. Further, since the data following the cluster number CN = 0003 is the remaining data of 200 bytes (horizontal line shaded portion) stored in the data storage area of the cluster number CN = 0008, FAT1 is changed from 0004 to 0008.

In the cluster number CN = 0008,
Since 200 bytes of remaining data (horizontal line shaded portion) is stored in the data storage area of cluster number CN = 0008, 200 is stored in the DVT 6. The data following the cluster number CN = 0008 is the cluster number CN.
Since the data is = 0004, 0004 is stored in the FAT6. As described above, according to the second example, two cluster numbers CN = 0003 and 00 due to the data insertion.
It is only necessary to rewrite the data in the FAT, DVT and data storage area corresponding to 08.

Next, as a third example, as shown in FIG. 6 (d), as for 100-byte data (hatched portion) of cluster number CN = 0003, the data storage area of cluster number CN = 0003 is unchanged. , And then store about 300 bytes of insertion data (lattice shaded portion). Then, since the remaining data of 200 bytes (horizontal line shaded portion) can be stored in the cluster number CN = 0004, it is stored as a new data storage area. FIG. 5 is a diagram showing the contents of the FAT that has not been rewritten and the DVT that has been rewritten. That is, since the FAT has not been rewritten, it is the same as the FAT in FIG.

By inserting data as shown in FIG. 6D, D
The contents of the VT and the data storage area are respectively rewritten, but the cluster number CN = 0 is actually rewritten.
DVT and data storage areas corresponding to 003 and 0004. That is, in the cluster number CN = 0003, 100-byte data (hatched portion) is left as it is in the data storage area of the cluster number CN = 0003, followed by about 300 bytes of inserted data (latched portion). ) Is stored, the DVT1 is 30
Changed from 0 to 400. Also, the cluster number CN =
Since the data following 0003 is the remaining data of 200 bytes (horizontal line shaded portion) stored in the data storage area of cluster number CN = 0004, FAT1 cannot be rewritten.

In the cluster number CN = 0004,
The remaining 200 bytes of data (horizontal line shaded portion) are stored in order from the beginning, followed by the cluster number CN =
Since 100 bytes of data (vertical line shaded portion) that has been previously stored in 0004 is stored, 300 is stored in DVT2. Also, the cluster number CN = 000
Since the data following 4 is data of cluster number CN = 0005, FAT2 cannot be rewritten. As described above, according to the third example, it is only necessary to rewrite the data in the DVT and the data storage area corresponding to the two cluster numbers CN = 0003 and 0004 when the data is inserted,
There is no need to rewrite the FAT.

The second and third examples depend on the storage capacity per cluster, the size of valid data already stored, and the size of inserted data. Optimal data arrangement may be performed by appropriately combining the first to third examples.

Next, from the 100th byte (the position of arrow DA1 in FIG. 9A) of cluster number CN = 0002 of the file in directory 1 to the 50th byte of cluster number CN = 0004 (arrow in FIG. 9A). A case of deleting about 450 bytes of data up to the position of DA2) will be described. In FIG. 9A, the cluster number CN = 000
The shaded area on the left side of the arrow DA1 of 2 indicates data that is not deleted, and the shaded area on the right side of the arrow DA1 indicates data that is deleted. Similarly, the hatched portion of the cluster number CN = 0003 indicates the data to be deleted, and the hatched portion of the cluster number CN = 0004 on the left side of the arrow DA2 indicates the data to be deleted.
The shaded area on the right side of A2 indicates data that is not deleted. Therefore, regarding the data in which the horizontal line is shaded, the storage area is changed by deleting the data.
Hereinafter, the case of changing the storage area will be described with reference to the drawings.

First, as shown in FIG. 9A, 100-byte data of cluster number CN = 0002 (horizontal line shaded portion), 300-byte data of cluster number CN = 0003 (horizontal line shaded portion) and cluster Number CN = 0
The 50-byte data 004 (horizontal hatched portion) is deleted as it is, and the data remaining in each cluster (hatched portion) is stored in the data storage area as the data for that cluster.

Therefore, the contents of the FAT, DVT and the data storage area are respectively rewritten by the data deletion as shown in FIG. 9B. The actual rewriting is the FAT and DVT corresponding to the cluster numbers CN = 0002 and 0003. And D corresponding to the cluster number CN = 0004
A VT and data storage area. FIG. 7 is a diagram showing the contents of the rewritten FAT and DVT. That is, in the cluster number CN = 0002, 100-byte data (hatched portion) is left as it is in the data storage area of the cluster number CN = 0002.
VT1 is only changed from 200 to 100, and the data storage area is not rewritten. Further, the data following the cluster number CN = 0002 is cluster number CN =
FAT0 is rewritten from 0003 to 0004 because it is the data of 50 bytes (hatched portion) stored in the data storage area of 0004.

In the cluster number CN = 0003,
Since all 300 bytes of valid data (horizontal line shaded portion) are all deleted, DVT1 is rewritten to 000, indicating that there is no valid data. Further, since the data following the cluster number CN = 0003 does not exist, FAT6 is also rewritten to 0000. When the cluster number CN = 0004, the 50-byte data (hatched portion) is the cluster number CN = 00 as it is.
Since it is left in the data storage area of 04, DVT2 is 10
It is rewritten from 0 to 50, and at the same time, the corresponding data storage area is also rewritten to 50 bytes of data (hatched portion). Further, since the data following the cluster number CN = 0004 is 512-byte data stored in the data storage area of the cluster number CN = 0005, FAT2 is 0.
It cannot be rewritten as 005. As described above, even if data is deleted, FAs with three cluster numbers CN = 0002, 0003 and 0004 corresponding to the deletion
All that is required is to change the data in the T, DVT and data storage areas. For the cluster number CN = 0003, only FAT may be rewritten to 0000 and the size of DVT may be left unchanged. This is because the size of DVT has no meaning because the FAT is rewritten.

In the case of deletion, since the data of the deleted cluster becomes small, the small data is not stored as it is as shown in FIG. 9B, but the small data are combined into one cluster. May be stored in. For example, in FIG.
When deleting in the same manner as in (a), the data remaining in each cluster (hatched portion) is cluster number CN = 000.
4 in the data storage area. In this case, FAT and DVT are rewritten as shown in FIG. That is, when the cluster number CN = 0002, 100-byte data (hatched portion) has a cluster number CN = 0004.
00 is stored in the data storage area of DVT1.
0 is stored, and 0000 is stored in FAT0.

In the cluster number CN = 0003,
Since all 300 bytes of effective data (horizontal line shaded part) are deleted, 000 is stored in DVT1 and FAT is stored.
0000 is stored in 6 as well. Cluster number CN = 00
In 04, the cluster number CN = 0002 is 100
Byte data (hatched area) is stored, and then 50 bytes of data (hatched area) is stored as is in the data storage area of cluster number CN = 0004, so DVT2 is rewritten from 100 to 150. The data following the cluster number CN = 0004 is stored in the data storage area of the cluster number CN = 0005.
Since it is 12-byte data, FAT2 cannot be rewritten as 0005. By combining small data generated when the data is deleted in this way and storing them in one cluster, it is possible to effectively use the storage capacity.

Next, FIG. 2 executed by the CPU 10
An example of the processing of the electronic musical instrument will be described based on the flowcharts of FIGS. FIG. 10 is a flowchart showing an example of a main routine processed by the CPU 10. The processing of the main routine will be described below in order of steps. Step 31: First, when the power is turned on, the CPU 10
Starts processing according to the control program stored in the ROM 11 and initializes various registers and flags in the RAM 12. Step 32: Perform key processing according to the operating state of each key on the keyboard 13. Step 33: Perform panel processing according to the operating state of each switch on the panel switch 14. Here, for example,
The operation mode is set.

Step 34: What is the currently set operation mode, the stored value in the operation mode register is read out, and the processing corresponding thereto is selected and processed. If the value stored in the operation mode register is "0", the process proceeds to step 35, and the sampling process is performed. If the stored value is "1", the process proceeds to step 3
In step 6, the waveform edit & processing process is carried out. In the case of "2", the process goes to step 37, and in the case of "3", the process goes to step 38 to execute other processes. Step 35: The digital signal input from the microphone 23 is sampled at predetermined intervals to create performance data such as waveform data. Step 36: Various editing and processing are performed on the waveform data obtained by the sampling process, the waveform data read from the hard disk 21, and the like. Step 37: Create timbre data of a new timbre based on the waveform data obtained by the sampling process or the waveform data read from the hard disk 21, or modify the timbre data that has already been created. Step 38: Processing based on operations of other operators,
Various other processes are performed.

FIG. 11 is a flow chart showing details of the sampling processing of FIG. 10 processed by the CPU 10. In this sampling process, the digital signal input from the microphone 23 is sampled at predetermined intervals to create performance data such as waveform data, and the hard disk 21
Memorize sequentially. Hereinafter, this sampling process will be described in order of steps.

Step 41: It is judged whether or not the recording state flag REC is "1". If "1" (YES), the process proceeds to step 48, and if "0" (NO), the step 4 is performed.
Go to 2. The recording status flag REC is the panel switch 14
When the upper recording start switch is turned on, it is set to "1" to indicate that the recording mode is currently set, and when the recording stop switch is turned on, it is reset to "0".

Step 42: Since the recording status flag REC was determined to be "0" in the previous step 41, it is determined whether or not a recording start switch on event has occurred.
The start switch on event has occurred (YE
If S), proceed to the next step 43, otherwise (N
If O), return.

Step 43: The recording status flag REC is set to "1" and the buffer variable i is reset to "0". If the recording status flag REC is set to "1" in this step, it will be determined to be YES in step 41 from the next time. Here, the buffer variable i is RA
This is a variable for selecting one of the buffer areas for two blocks secured on M12, and has a value of either "0" or "1". Hereafter, 2 on RAM12
The buffer area for blocks is represented as an iB area (0B area and 1B area).

Step 44: Prepare a file on the hard disk 21 for the portion where recording is to be started. For example, a directory area on the hard disk 21 is secured, and a file name, start cluster number, etc. are set therein. Step 45: The cluster to be recorded at the beginning of the file prepared in the previous step 44 is secured and its cluster number is stored in the current cluster register CC.

Step 46: Channel C of DMA 18
Start recording transfer of H0. That is, DMA1
Reference numeral 8 denotes a first channel CH0 for transferring data from the ADC 17 to the RAM 12 and a second channel for performing mutual data transfer between the iB area on the RAM 12 and the hard disk 21.
Since it is composed of two channels, the channel CH1 and the first channel CH0, the recording transfer of data is started. As a result, the DAM 18 outputs the data output from the ADC 17 to the RA as shown in FIG.
The data is sequentially transferred to the buffer area of M12. Step 47: "Recording" is displayed on the display unit 15 to indicate that the recording is in progress, and the process returns to the main routine of FIG.

Step 48: The fact that the recording status flag REC is judged to be "1" in the previous step 41 is currently recording, so it is judged whether or not the recording stop switch is operated to generate the ON event. If the on event has occurred (YES), the next step 4
9. If not (NO), return to 9. Step 49: Reset the recording status flag REC to "0". In this step, the recording status flag REC is "0".
Is reset to NO in step 41 from the next time.
Will be determined.

Step 4A: The recording transfer process (the CH0 process in FIG. 12) of the first channel CH0 of the DMA 18, which started the recording transfer process in step 46, is stopped.
As a result, the first channel CH0 of the DAM 18 becomes A
Even during data transfer from the DC 17 to the iB area of the RAM 12, the data transfer process is interrupted. In addition,
At this point, the recording transfer processing of the second channel CH1 in FIG. 13 is still continued.

Step 4B: Data (sampling data) temporarily stored in the iB area of the RAM 12
Is transferred to the hard disk 21 by the second channel CH1 of the DMA 18. Step 4C: Second channel CH1 of the previous step 4B
It is determined whether or not the data transfer by is completed. If it is completed (YES), the process proceeds to the next step 4D, and if not (NO), this step is repeatedly executed until the data transfer is completed, and the data transfer is completed. Wait until is completed.

Step 4D: Write data for final cluster. That is, the end data (END = FFFF) is stored in the FAT of the final cluster, and the data capacity of the final cluster is stored in the DVT. Step 4E: Write the related data such as the total amount of recorded data and the recording date. Step 4F: "Recording completed" is displayed on the display unit 15 to indicate that the recording is currently stopped, and the process returns to the main routine of FIG.

12 and 13 are flow charts showing an example of the data transfer processing performed by the DMA 18.
2 is a data transfer process performed by the first channel CH0 of the DMA 18, and FIG. 13 is a second channel C of the DMA 18.
This is a data transfer process performed by H1. Hereafter, this DMA1
The data transfer process performed by 8 will be described step by step.

Step 51: It is judged whether or not a sampling clock is generated. If it is generated (YES), the process proceeds to the next step 52, and if it is not generated (NO), the process returns. Step 52: Transfer one data from the ADC 17 to the iB area of the RAM 12. Step 53: It is determined whether or not the iB area of the RAM 12 is full, and if it is full (YES), the process proceeds to the next step 54, and if not (NO), the process returns and the processes of steps 51 to 53 are repeated. It is executed and data is transferred from the ADC 17 to the RAM 12 for each sampling clock.

Step 54: Invert the buffer variable i. That is, when the buffer variable i is "0", it is set to "1", and when it is "1", it is set to "0". As a result, the iB area is written with data alternately. Step 55: A transfer start instruction is output to the second channel CH1 of the DMA 18 to transfer the data stored in the iB area of the RAM 12 to the hard disk 21. Note that here, the processing of this step is DM
Although the case where the processing is automatically performed internally by A18 is shown, the processing of this step may be relayed to the CPU 10.

Steps 56 to 5D of FIG.
The second channel CH1 is performed at the time when the transfer start instruction in step 55 of FIG. 12 is input. Step 56: When the writing of the data is completed, a transfer request is output from the hard disk 21 to the DMA 18 at that time. Therefore, it is judged whether or not there is a transfer request from the hard disk 21, and if there is a transfer request (YES). Proceeds to the next step 57, otherwise returns (NO).

Step 57: The following one data is transferred from the iB area of the RAM 12 to the hard disk 21. Step 58: It is judged whether or not the storage area of the cluster which is transferring data, that is, the current cluster corresponding to the current cluster register CC is full. If YES, the process proceeds to the next step 59, and if NO, the process returns.

Step 59: Since it was determined in the previous step 58 that the storage area of the current cluster was full, here, when the next cluster (the one with a free storage area) is searched and secured, its cluster number Is stored in the cluster number register CN. Instead of searching the next cluster in this step, a chain of empty clusters may be prepared in advance and the cluster number based on the chain may be stored in the cluster number register CN. Step 5A: The new cluster number (value of the cluster number register CN) secured in the previous step 59 is stored in the FAT (CC) of the current cluster, and FULL indicating that the cluster storage area is full is stored in the current cluster. Store in DVT (CC).

Step 5B: The new cluster number secured in the previous step 59, that is, the value stored in the cluster number register CN is stored in the current cluster register CC. Step 5C: It is judged whether or not the transfer of all data in the iB area is completed. If the transfer is completed (YES), proceed to the next step 5D. If not (NO), return to return all the data in the iB area. The processes of steps 56 to 5B are repeatedly executed until the transfer is completed. Step 5D: Since it has been determined in the previous step 5C that the transfer of all data in the iB area has been completed, the transfer stop is instructed to the second channel CH1 of the DMA 18. Therefore, the second channel CH1 suspends the data transfer process until the transfer start instruction in step 55 is output. Note that the processing of this step is also performed here by the DMA 18
Although the case where the processing is automatically performed internally is shown, the processing of this step may be intervened by the CPU 10.

FIG. 14 is a flow chart showing an example of a reproduction process which is one of the other processes of FIG. 10 processed by the CPU 10. Below, this CPU
The reproduction process performed by 10 will be described in order of steps. Step 61: It is judged whether or not the reproduction state flag PLAY is "1", and if "1" (YES), step 6A
If it is "0" (NO), the process proceeds to step 62. The reproduction state flag PLAY is set to "1" when the reproduction start switch on the panel switch 14 is turned on, and is reset to "0" when the reproduction stop switch is turned on.

Step 62: Since the reproduction state flag PLAY was judged to be "0" in the previous step 61, it is judged whether or not the on-event has occurred by operating the reproduction start switch, and there is an on-event (YES). If No, the process proceeds to the next step 63, and if not (NO), the process returns to the main routine of FIG. Step 63: The reproduction state flag PLAY is set to "1" and the buffer variable j is reset to "0". Here, the buffer variable j is a variable for selecting one of the buffer areas for two blocks secured on the tone generator circuit 16, and has a value of either "0" or "1". Hereinafter, the buffer area for two blocks on the tone generator circuit 16 is represented as a jB area (0B area and 1B area). When the reproduction state flag PLAY is set to "1" in this step, YES is determined in step 61 from the next time, and steps 6A to 6D are processed.

Step 64: File reproduction preparation processing is performed. For example, the sampling frequency at the time of recording is set in the tone generator circuit 16, or the tone color name is displayed based on the fail name to be reproduced. Step 65: The first two blocks of data reproduced from the file prepared in the previous step 64 are stored in advance in the jB area (0B area and 1B area) of the sound source memory. That is, 0 of the sound source memory of the sound source circuit 16
Data is transferred from the hard disk 21 to the B area, and then data is transferred to the 1B area. Step 66: Store the first cluster number of the next block in the current cluster register CC. That is, since the data for two blocks has already been transferred to the iB area on the RAM 12 in the previous step 65, the cluster number initially stored in the 0B area is stored in the subsequent transfer processing.

Step 67: DVT of current cluster
The data capacity stored in (CC) is calculated by the capacity register D.
Store in V. Step 68: The sound source circuit 16 is instructed to start reproduction so as to read data from the beginning of the 0B area of the sound source memory and start the reproduction process. The sound source circuit 16 starts the sound generation processing by inputting this reproduction start instruction. Step 69: "Reproducing" is displayed on the display unit 15 to indicate that the reproduction is currently in progress.

Step 6A: The fact that the reproduction status flag PLAY was determined to be "1" in the previous step 61 is currently reproducing, so in this step it is judged whether or not an on event of the reproduction stop switch has occurred, and it is turned on. If an event has occurred (YES), the process proceeds to the next step 6B, and if not (NO), the process returns. Step 6B: The reproduction state flag PLAY is reset to "0". When the reproduction state flag PLAY is reset to "0" in this step, it will be judged NO in step 61 from the next time.

Step 6C: A reproduction stop command is output to the sound source circuit 16 to stop the reproduction process for the sound source circuit 16 which has started reproduction in step 68. Sound source circuit 1
6 inputs the reproduction stop command to end the reproduction processing. Step 6D: The display unit 15 displays "Playback stopped".
This allows the operator to recognize that the reproduction is currently stopped.

FIG. 15 is a diagram showing an example of a sound source transfer request interrupt process performed by the CPU 10 in response to the sound source transfer request interrupt output by the sound source circuit 16 that has input the reproduction start instruction in step 68. FIG. 16 is a diagram showing an example of the during-reproduction CH1 process performed by the second channel CH1 of the DMA 18 at that time. The sound source transfer request interrupt process and the reproducing CH1 process are executed in parallel. The sound source transfer request interrupt process and the playing CH1 process will be described below in the order of steps.

Step 71: The tone generator circuit 16 which has input the reproduction start instruction in step 68 reads out data from the 0B area of the tone generator memory and reproduces a musical sound, and when all the data in this 0B area is read out, the tone generator transfer request assignment is made. Output to the CPU 10. Then, at this point, the sound source circuit 1
Since 6 reads data from the 1B area of the sound source memory, the buffer variable j is "1". Therefore, in this step, the buffer variable j is inverted when the sound source transfer request interrupt occurs.

Step 72: Instruct the second channel CH1 of the DMA 18 to start data transfer from the hard disk 21 to the iB area of the sound source memory. Thus, while data is being read from the 1B area of the tone generator memory, new data is written to the 0B area by the second channel CH1.

Step 73: It is judged whether the hard disk 21 is in the data ready state, and the data ready state (Y
If ES), the process proceeds to the next step 74, and if not (NO), the process returns.

Step 74: Transfer one data from the hard disk 21 to the jB area of the sound source memory. Step 75: It is judged whether or not the data corresponding to the capacity register DV has been read out from the cluster which is transferring the data, that is, the cluster corresponding to the current cluster register CC. If the reading is completed (YES), the next step 76 is performed. Proceed to step 78 if not complete
Jump to.

Step 76: Since reading of all the data of the current cluster is completed, the cluster number stored in the FAT (CC) of the current cluster is stored in the current cluster register CC in order to secure the next cluster. Step 77: The data capacity value stored in the DVT (CC) of the new current cluster secured in the previous step 76 is stored in the capacity register DV. Step 78: It is determined whether or not the data transfer to the jB area is completed. If the transfer is completed (YES), the process proceeds to the next step 79, and if not (NO), the process returns.

Step 79: Since it is judged in the previous step 78 that the data transfer to the jB area is completed, DM
The transfer stop is instructed to the second channel CH1 of A18. Therefore, the second channel CH1 suspends the data transfer process until the transfer start instruction in step 72 is output. Note that the processing of this step is also D here.
I showed the case where MA18 does it automatically internally.
You may make CPU10 mediate the process of this step.

FIG. 17 is a flow chart showing an example of the data deleting process in the waveform editing process & modification process of FIG. 10 processed by the CPU 10. In this data deletion process, when data is deleted, all the data of the cluster to be deleted is temporarily transferred to the RAM 12, the data is deleted from the RAM 12, and then the data is transferred to the hard disk 21. I try to remember it. Then, at the same time that this data is deleted, the data corresponding to the data volume table DVT and the file allocation table FAT is written. Hereinafter, this data deletion process will be described step by step.

Step 81: Of the plurality of files stored in the hard disk 21, the range of which file is desired to be deleted is designated. Step 82: The clusters at the beginning and end of the range to be deleted are detected, and their cluster numbers are stored in the beginning cluster register SC and the ending cluster register EC, respectively. Step 83: RAM of cluster data corresponding to the head cluster register SC and the tail cluster register EC
Read on 12. Step 84: Of the data read in step 83, data other than the range to be deleted, that is, a portion effective as data is connected on the memory.

Step 85: It is judged whether or not the size (data size) of the data connected in Step 84 is equal to or larger than the data capacity of one cluster (here, the amount of data that can be stored in one cluster is judged as "1"). If the data capacity of one cluster is more than (YES), next step 86
If not (NO), the process proceeds to step 89. Step 86: Since it is determined in the previous step 85 that the data size is equal to or larger than the data capacity of one cluster, one cluster of data is written in the cluster corresponding to the head cluster register SC.

Step 87: Since one cluster of data has been written in the cluster corresponding to the first cluster register SC in the previous step 86, it is indicated here that the storage area is full in DVT (SC) of that cluster. FU
LL is stored, and the cluster number of FAT (SC) of the cluster is stored in the head cluster register SC. Step 88: Write the remaining data to the cluster corresponding to the head cluster register SC rewritten in the previous step 87.

Step 89: Since it is determined in the previous step 85 that the data size is smaller than the data capacity of one cluster, the data after connection is written in the cluster corresponding to the head cluster register SC as it is. Step 8A: The cluster number stored in the FAT (EC) of the cluster corresponding to the end cluster register EC is set to the F of the cluster corresponding to the top cluster register SC.
Store in AT (SC).

Step 8B: First cluster register SC
The data capacity of the cluster corresponding to the DV of that cluster
Write to T (SC). Step 8C: In order to release the FAT of the cluster existing between the first cluster register SC and the last cluster register EC, "00" is added to the DVT of each cluster.
0 ”is stored and the process returns to the main routine of FIG. As a result, the deleted cluster is released from FAT and is deleted as data.

FIG. 18 is a flow chart showing an example of the data insertion process in the waveform edit process & modification process of FIG. 10 processed by the CPU 10. In this data insertion process, when data is inserted, all the data of the cluster to be inserted is temporarily transferred to the RAM 12, the data is inserted on the RAM 12, and then the data is transferred to the hard disk 21. I try to remember it. Then, at the same time when this data is inserted, the data corresponding to the data volume table DVT and the file allocation table FAT is written. Hereinafter, this data insertion process will be described in order of steps.

Step 91: Specify which file and where the data is to be inserted among a plurality of files stored in the hard disk 21. Step 92: The cluster number to which the insertion position belongs is stored in the insertion cluster register IC. Step 93: Designate which range of data in which file is to be inserted. Step 94: The clusters at the beginning and end of the range to be inserted are detected, and their cluster numbers are stored in the beginning cluster register SC and the ending cluster register EC, respectively.

Step 95: Insert cluster register IC
The data of the cluster corresponding to is read out onto the RAM 12. Step 96: Read all data from the cluster corresponding to the head cluster register SC to the cluster corresponding to the end cluster register EC onto the RAM 12. Step 97: Insert and combine the data read in the previous steps 95 and 96 on the RAM 12. When the inserted data is long, only the data of the Kratus corresponding to the inserted cluster register IC, the head cluster register SC and the tail Clatas register EC is read out on the RAM 12, and the head and tail 1-2 clusters of the inserted portion are read. May be combined and written. Then, it is not necessary to move the entire long insertion portion on the hard disk 21.

Step 98: While sequentially searching a required amount of empty clusters with the inserted cluster register IC as the head, the inserted combined data on the RAM 12 are sequentially written into the empty clusters. In addition, D of the cluster in the middle
FULL that indicates that the storage area is full is stored in VT. Step 99: Last cluster or previous step 9
In step 8, the FAT (IC) of the cluster having the cluster number stored in the inserted cluster register IC is written in the FAT of the cluster in which the data was last written. Step 9A: Write the data capacity of the last cluster to the DVT of that cluster, and return to the main routine of FIG.

In the reproducing process of FIG. 14, the case where the musical sound is reproduced while sequentially reading the data from the hard disk 21 has been described.
The waveform data corresponding to the key code generated in response to the operation of 3 may be read from the hard disk 21 to reproduce the musical sound. If the waveform data is read from the hard disk 21 in response to the operation of the keyboard 13, the reading of the waveform data cannot be performed in time for the reproduction process. Therefore, in this embodiment, the start corresponding to the tone color and the key code is made on the tone generator memory. A plurality of waveform data are stored in advance, and in response to the operation of the keyboard 13, the start waveform data is first read to reproduce a musical sound, and the corresponding waveform data is read from the hard disk 21 in the sound source memory while the start waveform data is being read. The waveform data is read in real time by alternately using the jB area.

An example of the musical sound reproduction processing will be described below with reference to FIG. First, the key code data corresponding to the operation of the keyboard 13 is stored in the key code register KCD.
The start waveform data corresponding to the tone color and the key code register KCD is set in the sound source. That is, the start waveform data corresponding to the tone color and the key code is read from the tone generator memory. Then, the jB area is set as the loop section. Then, the note-on is instructed to the sound source. The DMA 18 is instructed to transfer the waveform data from the hard disk 21 to the jB area. This allows the DMA 18
Is the hard disk 2 using the jB area of the sound source memory.
The waveform data is read one after another and the musical sound reproduction processing is performed.

In the above embodiment, the case where the size of one cluster is 512 bytes has been described, but this is an example, and it goes without saying that one cluster may be formed with a size other than this. Nor. For example, DV
Since 16 bits are allocated as T, one cluster can be represented by 16 bits, that is, 64
It may be configured in kilobytes (KB). Further, in the above-described embodiment, the size of one cluster is 512 bytes, whereas the DVT has a 16-bit configuration. However, the bit size of this DVT should correspond to the size of one cluster. That is, if the size of one cluster is 512 bytes, the DVT has a 9-bit configuration.
When the size of the cluster is 64 KB, the DVT may have a 16-bit configuration, and the DVT bit configuration may be appropriately adopted according to the size of one cluster.

In the above embodiment, the case where the data is directly read from and written to the hard disk 21 has been described, but the present invention is not limited to this, and the cache RA
The M22 may be used as an intermediate buffer, and the rewriting process may be performed when the size of valid data in one cluster reaches the size of one cluster. For example, in FIG.
In the case of (d), 100-byte data of cluster number = 0003 (hatched portion) is directly stored in the cache RAM 22 as cluster number = 0003.
Of the inserted data of about 300 bytes (lattice shaded part) and the remaining data of 200 bytes (horizontal shaded part), 112 bytes of which is 300 bytes of inserted data of cluster number = 0003 It is stored continuously after (lattice shaded part). As a result, the size of valid data at cluster number = 0003 is 512
Since it becomes a byte, the cluster of the corresponding hard disk 21 is rewritten at this point. Then, of the remaining data of 200 bytes (the portion shaded by the horizontal line), 88 bytes are stored in the cluster number = 0004. This makes it possible to effectively utilize the storage area. In the above-described embodiment, the case where the size of the data (margin area) that can be stored in the cluster is left as it is has been described. However, in order to appropriately remove the margin area after the insertion processing and / or the deletion processing is completed, May be rewritten. Furthermore, the present invention is not limited to the edit processing of waveform data, but is also effective when applied to the case where, for example, a silent period in a sample is detected and replaced with a silent code for data compression.

It should be noted that a lower limit is set for the capacity (corresponding to the value of DVT) of the data stored in the used cluster,
You may restrict so that the reading speed of the data from a disk may not become too slow. A plurality of clusters of each file in this embodiment can be sequentially connected in an arbitrary order by FAT management. Therefore, clusters at distant positions on the hard disk may be sequentially connected, and it is necessary to consider a certain time lag for the transition of reading from the previous cluster to the next cluster. Here, the lower limit of the data capacity of each cluster is set to reduce the number of times of read transfer between clusters per unit time and improve the average read speed from the disk.
Specifically, the capacity limit processing of each cluster may be performed by the routine of steps 85 to 8B of the deletion processing of FIG. 17 or the routine of steps 98 to 99 of the insertion processing of FIG. 18 of this embodiment. Ah

[0085]

As described above, according to the present invention, the size of the performance data portion is stored so that one storage unit does not have to be filled with data. Therefore, all data can be rewritten. It is possible to insert or delete performance data of an arbitrary length at an arbitrary position without performing.

[Brief description of drawings]

FIG. 1 is a diagram showing a configuration of performance data stored on a hard disk by a file management system for an electronic musical instrument according to the present invention.

FIG. 2 is a hardware block diagram showing the overall configuration of an electronic musical instrument incorporating the file management system according to the present invention.

3 is a diagram showing the FAT and DVT of FIG. 1 rewritten by the file management system according to the present invention in response to the insertion of data.
It is a figure which shows the 1st example of the content of.

4 is a diagram showing the FAT and DVT of FIG. 1 rewritten by the file management system according to the present invention in response to the insertion of data.
It is a figure which shows the 2nd example of the content of.

5 is a diagram showing the FAT and DVT of FIG. 1 rewritten by the file management system according to the present invention in response to data insertion.
It is a figure which shows the 3rd example of the content of.

FIG. 6 is a conceptual diagram showing the size of valid data in the data storage areas of FIGS. 1, 3, 4, and 5 in a bar graph format for each cluster number.

FIG. 7: FAT and DVT of FIG. 1 rewritten by the file management system according to the present invention in response to deletion of data
It is a figure which shows the 1st example of the content of.

FIG. 8 is a diagram showing the FAT and DVT of FIG. 1 rewritten by the file management system according to the present invention in response to data deletion.
It is a figure which shows the 2nd example of the content of.

9 is a conceptual diagram showing the size of valid data in the data storage areas of FIGS. 1 and 7 in a bar graph format for each cluster number.

FIG. 10 is a flowchart showing an example of a main routine processed by the CPU of FIG.

11 is a flowchart showing details of the sampling process of FIG. 10 processed by the CPU of FIG.

12 is a flowchart showing an example of a data transfer process performed by the first channel of the DMA of FIG.

13 is a flowchart showing an example of a data transfer process performed by the second channel of the DMA shown in FIG.

FIG. 14 is a flowchart showing an example of a reproduction process which is one of the other processes of FIG. 10 processed by the CPU of FIG.

15 is a flowchart showing an example of a sound source transfer request interrupt process performed by the CPU of FIG.

16 is a flowchart showing an example of the CH1 process during reproduction performed by the second channel of the DMA of FIG.

17 is a flowchart showing an example of data deletion processing in the waveform edit processing & modification processing of FIG. 10 processed by the CPU of FIG.

18 is a flowchart showing an example of data insertion processing in the waveform edit processing & modification processing of FIG. 10 processed by the CPU of FIG.

FIG. 19 is a flowchart showing an example of a musical tone generation process for reading waveform data from the hard disk and generating a musical tone in response to an operation of the keyboard of FIG.

[Explanation of Codes] 10 ... CPU, 11 ... ROM, 12 ... RAM, 13 ... Keyboard, 14 ... Panel switch, 15 ... Display, 16 ... Sound source circuit, 17 ... Analog-digital converter, 18 ... DMA
Device, 19 ... Address conversion circuit, 20 ... Interface, 21 ... Hard disk, 22 ... Cache RAM,
23 ... Microphone, 24 ... Sound system, 25 ... Data and address bus

Claims (1)

[Claims] 1. The performance data for one file is divided and stored in a plurality of storage units each having a data area of a predetermined length, and the size of the performance data portion stored in each storage unit is determined. Storage means for storing the data shown and the data indicating the connection order of the performance data portions stored in the respective storage units; and insertion or deletion of data with respect to the performance data stored in the storage means. And a file management means for inserting or deleting the data instructed by the instructing means and rewriting the data indicating the size of the performance data portion and the data indicating the connection order, and storing in the storage means. The performance data stored in the storage means is read out based on the data indicating the size of the performance data portion and the data indicating the connection order. A file management system for an electronic musical instrument, comprising a reading means.