DE102005011477A1 - Instruction set producing method for automatic updating of vehicle`s data memory, involves arranging negative block of instructions in source contents in reference direction, and positive block of instructions in opposition to direction - Google Patents

Abstract

The method involves characterizing identical block of instructions provided in an instruction block based on dislocations of source memory contents (10a) to target memory contents (10b) , where the block is negative or positive. The instructions within the negative block are arranged in sequence in the source contents in a reference direction, and the instructions within the positive block are arranged in opposition to the direction. An independent claim is also included for an application of an instruction set.

Description

The The invention relates to a method for generating an instruction list to automatically update the memory contents of a data store by a data processing system in which the contents of the data store is transferred from a source memory content to a destination memory content, wherein the destination memory content is made up of dc areas opposite to the Original memory contents are unchanged in content, and / or new areas, which are not contained in the original memory contents. The equal ranges are in the original memory contents and in the Destination memory content in a freely defined reference direction in arranged in the same order and include positive DC areas, their location in the destination memory content compared to the original memory content offset in the reference direction, as well as negative DC areas, their location in the destination memory content compared to the original memory content offset from the reference direction. The invention relates about that In addition, use of a statement list thus generated.

Of the Content of the DC areas changes consequently not by updating. It is possible, however, that these dz areas as a result of changes in the destination memory contents across from the original memory contents with respect to to change their location in the store are, for example, when new in the course of the update to insert between equal domains are or extinguishing areas are to be removed. The Gleichbereiche are divided into positive and negative DCs that differ by direction into the destination memory contents opposite to the original memory contents are offset. The invention relates specifically to updates, where the DCs are not in their order change. Areas in the original memory contents, the content unchanged in the Target memory content can be found, but there crosswise with respect to their Order opposite the original memory contents are swapped, are not considered equal parts understood in the context of the invention. This does not exclude that such crosswise arranged areas in the original memory content and in the Target memory contents are present.

A simple method to perform an update is it to completely override the datastore with the destination memory contents. These Method requires, however, that the data processing system the full, sometimes very big, Target memory content supplied becomes. This can be especially true for large data memories and low transmission speeds the transmission paths be problematic.

Around the amount of data for To reduce the update is the use of so-called delta files known. Such delta files contain only information about the Differences between source memory contents and destination memory contents and they are usually smaller than the target memory content itself, if components of the original memory contents are taken over into the destination memory content can be. One type of update procedure using a delta file is designed to perform the update in the data store, without that additional memory is required in the source memory contents and Delta file the target memory content is written. Problematic This so-called "in-place" update is to be avoided must overwrites memory areas whose contents will be later is still needed in the course of the update.

The US Pat. No. 6,018,747 proposes a method in which a reorganization of the instructions in the delta file takes place, which are responsible for the maintenance of DC areas, and then eliminating cyclical conflicts that can not be solved by a mere resorting, that areas of equal content between Source memory contents and destination memory contents are not moved, but are completely re-included in the delta file. As a result, cyclical conflicts are broken up at one point.

Depending on the type of data stored in the data store, cyclical conflicts can be completely ruled out. This is the case for such data consisting of elements whose order is determined by an ordering criterion. Cyclic conflicts can also be ruled out if the determination of dc ranges between the original memory content and the destination memory content only considers those areas as potential dz areas occurring in the same order. In this described data, the application of the complex method is the US Pat. No. 6,018,747 not appropriate, since no cyclical conflicts can occur.

task The invention is a comparatively simple and reliable method for generating an instruction list for automatic updating a data store, its source memory contents, and destination memory contents equal ranges have in both memory contents in the same order are arranged, and an advantageous use of a so generated Instruction list available to deliver.

The Invention solves this task by a generic method with the features of claim 1 or 8 and an advantageous use with the Features of claim 21.

Under Instructions within the meaning of the invention are digitally coded information understood that information to a data processing system in a associated memory to be performed Deliver operations. The instructions can have different parameters have the, to be performed Specify operation. Be under DC instructions understood such instructions to the data processing system, the enable this a DC area in the original memory contents with respect to beginning and end and to identify in the destination memory content for the DC area to move the intended position. A Gleichbereichsanweisung does not have to have all the necessary Information included. Instead, it is also possible that some of the required information to the data processing system already implicitly or explicitly supplied by preceding instructions. Thus, equal-range statements are also understood as meaning such instructions. which complete the information in the data processing system that one execution with respect to the shifting of the DC area by the data processing system becomes possible. For the DC areas, the subject of the DCS are, can be positive or negative DCs. DC areas that are in the original memory contents and in the Zielspeicherin can have the same position understood as either positive or negative DCs become.

All Gleichbereichsanweisungen become in the method according to claim 1 one of several statement blocks assigned. Each statement block always includes only such DCarray statements referring to the source memory contents refer to successive DC areas. Under each other following is to understand that in the midst of the Gleichbereiche, finally described by instructions of an instruction block are arranged, no further Gleichbereiche, their corresponding The same-range statements are not in the corresponding statement block are included. However, it is quite possible that the DCs, to which the equidistribution statements of a statement block refer, not flush with each other in the original memory contents, but for example, by extinguishing areas are separated from each other, these extinguishing areas are memory content areas, which are not taken over into the destination memory contents.

The statement blocks divide into positive and negative statement blocks. Based the order of the dz areas in the original memory content the corresponding statement blocks alternate in type on.

The negative statement blocks include only those equal-range statements that refer to negative Refer to DC areas. These DCS statements are within of the negative instruction block in order of each described Gleichbereiche arranged in the original memory contents in the reference direction. Each negative statement block refers to a series of consecutive The following negative DC areas, where he at least all the corresponding Includes equal-range statements that are in the source memory contents first DC range up to the penultimate in the original memory contents Describe DC area. A group of consecutive negative ones Gleichbereiche, wherein the first in the reference direction not immediately follows a negative DC range and that in the reference direction the last one does not immediately follow a negative DC, leads accordingly to a negative statement block, whose instructions at least the shift of all DC areas of the group except the describe last in reference direction.

All DCargets associated with non-negative statement blocks are summarized in positive statement blocks, where Again, the positive statement blocks also apply only include those DC instructions that relate to refer to successive DC areas. The arranged in positive instruction blocks DCarray statements include all positive DCA statements and, where appropriate, those same-range instructions that relate to refer negative DC areas, which are in the original memory content in the reference direction as the last in a series of positive dc ranges are located. Different from the negative statement blocks in the positive statement blocks the equal-range statements against the order of each arranged Gleichbereiche arranged in the reference direction.

The arrangement of the instruction blocks in the instruction list is carried out as follows: For two consecutive dc ranges, each of which is described by a Gleichbereichsanweisung, wherein the same Gleichbe statement of the first in the reference direction Gleichgleich portion of a negative instruction block and the Gleichbereichsanweisung a second in the reference direction Gleichbereich a is positive instruction block, the positive instruction block is to be placed in the instruction list after the negative instruction block, preferably immediately behind the negative statement block. The negative instruction blocks are preferably to be arranged in the reference direction in the order of the described DC regions. Overall, there is preferably an alternating arrangement of the statement blocks of both types in the statement list. However, it is also possible to have an arrangement in which the negative statement blocks are prefixed on the whole and the negative statement blocks are followed by the positive statement blocks.

instruction list of the type described, that no DC area overwritten will, before it could be read. In the execution of Negative statement block statements become the data store described in the reference direction. Because the shift of the DC areas, whose displacement is described in negative instruction blocks, always contrary to the reference direction, there is no overwriting of memory contents to be read later in the process to fear. In positive statement blocks the writing direction is reversed, which achieves that as well Memory contents of DC areas are only overwritten here if the corresponding DC sectors are already included in their new are shifted by the target memory contents predetermined position.

The Generation of the instruction lists described on the basis of the original memory contents, Target memory content and the identified DC areas very simple: to the DC areas can be DC instructions be generated, which subsequently according to the type of the described equal range - positive or negative - classified become. Then, the equal-range instructions become the ones described above statement blocks summarized and within the instruction block depending on the type of Instruction block sorted in or against the reference direction. Finally the instruction blocks become corresponding the above-described measure arranged in the instruction list, as far as the arrangement of the arrangement induced by the production differs.

One Data processing system, access to a to be updated Datastore can, according to the instructions in the instruction list the Update memory contents of this data store, whereby it is possible that the data processing system during the supply of Instructions the update performs. The storage equipment such a data processing system does not have to be essential to be taller as the source memory contents or destination memory contents. It must no memory is provided for filing the instruction list and it also does not need memory due to the "in-place" update Storing the destination memory content while maintaining the Be provided original storage content.

In In a further development of the method, the instruction blocks in the Instruction list arranged in a sequence according to the order the DC areas in the reference direction in the original memory contents corresponds to that of the DCS statements of the respective statement blocks to be discribed.

In In a further development of the method, the instruction list contains new area instructions, the ones to be inserted Describe data and location of new areas. Such a statement list serves accordingly also to inform the data processing system which equal parts of the original memory contents in which kind are to be transferred to the destination memory content and which new ranges are to be inserted into the target memory content. The new area instructions can be such that they also have equal-range instructions represent. For example, a statement that relates to the subject has to insert a new range at a certain address, implicitly also be a Gleichbereichsanweisung and state that a memory area, bounded by a in the process carried write pointer and the Address of the inserted New area, for a DC range is provided, which by the size of this Memory area and a read pointer in terms of location and size is identifiable.

In A development of the invention are the Neubereichsanweisungen, describe a new area, which in reference direction to a negative DC region follows and the one in the reference direction is a positive one Gleichbereich follows, in the statement block of that Gleichbereichsanweisung contain the change of position of positive DC. Because the instructions of this positive instruction block according to the instructions of the in the reference direction above negative equations related negative instruction block be executed is guaranteed that the negative DC is not overwritten unless its Content moved to the default location specified by the destination memory contents has been.

In one development of the invention, the instructions comprise copying instructions and insertion instructions, the copying instructions explicitly describing a DC area with regard to its location in the original memory content, its size and its location in the destination memory content, and the insertion instructions explicitly describing a new area with regard to its data and its location in the destination memory content. An instruction set from Ko The instructions and insertion instructions allow a particularly simple generation of the instructions. Each equal range is described by a copy instruction that uniquely identifies how array and extent of the DC are in the source memory contents and where the DC range is in the destination memory contents. Each new area that exists in the destination memory content in addition to the DC areas inherited from the source memory content is described by means of an insert instruction describing, on the one hand, the data to be inserted and, on the other hand, its location in the destination memory content.

In In a further development of the invention, the instructions comprise deletion instructions and insertion instructions, taking the deletion instructions each describe an area in the data store, whose in the original memory content data contained in the destination memory content are no longer included, and the insertion instructions each new area in terms of its data and its location in the destination memory contents and where the instructions are are marked, whether it is instructions of a positive or a negative statement block. In such an instruction set from deletion instructions and insertion instructions There are no explicit DCA instructions. Instead can both the deletion instructions as well as the insertion instructions implicitly act as a DCS.

So can a delete instruction, which identifies a specific memory area for deletion, at the same time implicitly make the statement that a memory area of one internal read pointer until the beginning of the deletion area as a DC area is to be considered and must be moved accordingly. The same applies to insert statements: An insertion instruction, which specifies as parameters a specific data block and the position to which the data block is to be placed in the destination memory content can be from Data processing system be interpreted as that an intermediate area between a last previously defined area the destination memory contents and the beginning of the new data block for a Gleichbereich is provided, thereby characterized in its destination and Size defined is. The labeling of the instructions as to whether it is Statements of positive or negative statement blocks, allows it the data processing system, pointer to the memory correctly to put.

Of the essential aspect of this development of the invention is that build the instructions on top of each other and not separate for each other are. In terms of the destination memory contents and / or the original memory contents becomes the current position when processing the instructions from the data processing system stored in the form of pointers, making the instructions constructive are clearly interpretable on these pointers. The advantage such a system is in particular that redundancies be avoided and the instruction list regarding their memory requirements is reduced. About that In addition, a statement list that allows to describe the new Memory contents only delete instructions and insert statements has no inconsistent information. The use of delete and insert statements instead of copying and inserting statements especially positive for the amount of data of the update information when a lot of small changes to the transfer of the Source memory content required in the destination memory contents is.

In a development of the invention can Modifizierungsanweisungen be provided, the content of an erase instruction and an insertion instruction combine with each other. Such modification instructions lead to a further data reduction in the update information. Their use is particularly useful if original memory content and destination memory contents consist of discrete data sets that are at the destination memory contents across from removed, modified or retained from the original memory contents can. Statements that exist in the source and destination memory contents records include content that differs from such memory contents be provided as Modifizierungsanweisungen.

The method according to claim 8 is based on the basic idea that at a given fixed and constant writing direction in the data memory then an overwriting of unread DC areas is to be feared if these DC areas are shifted in the destination memory contents with respect to their position relative to the location in the original memory content in the writing direction. Furthermore, this solution is based on the idea that the data memory can be understood and addressed as a ring buffer, it only being necessary for the data processing system accessing the data memory to know the position of a zero or reference point in the data memory. Based on these basic considerations, this method starts from an instruction list in which DC area instructions are arranged, which are arranged in the original memory contents in the order of their respective DC areas described. The Gleichbereichsanweisungen describe the Gleichbereiche with respect to their change in position by means of a Lageverandungsbetrages and a change in position direction. The change in direction is positive and positive in positive DC areas Negative negative ranges. Based on this instruction list, the position change information of each DCA instruction is changed, based on a common modification value. This modification value is selected such that all DC regions become negative DC regions, that is to say have a uniform negative position change direction. This position change direction opposes the reference and write directions.

The modified statement list with the modified equal-range statements leads the execution to move all DC areas in the same direction, so that it is ruled out that a DC area is overwritten, before he can be moved. The data store is at this Purpose organized as ring buffer. This means that the data processing system and / or the data memory are such that a memory address, which exceeds the limits of the memory area at one end, starting from the other end is brought back into the memory. The with the update according to the inventive method associated shift of memory contents at each update leads contrary to the writing direction So not inevitably, that at some point another shift not possible anymore is. The procedure is only applicable if guaranteed is that the shift of the first DC is not due to the ring structure of the memory irreversibly overwrites the last equal range. This can be achieved on the one hand by the fact that the memory designed so big that he will be the shift of the first DC without overwriting guaranteed the last Gleichbereichs. A different possibility is to cache the last or the last dc ranges and after execution all equal-range statements to re-insert into the data store.

The Modification of the instructions in the instruction list can be done both before the feeder the instruction list to the data processing system as well the data processing system itself. Furthermore it is also conceivable that the modification in two modification steps each with a different modification value, with a first modification of the instructions in the statement list, before transferring the instruction list to the data processing system becomes. After or during the transmission to the data processing system is then a second modification by the data processing system itself with a second modification value carried out. Is appropriate such a two-part modification of the instructions of the instruction list then, when the first modification is used to all DC areas to convert to negative DCs, and the second modification is used to data processing system specific or data storage specific Circumstances. This may be appropriate, for example, if the data processing system does not store the memory byte by byte, but only in blocks of a few bytes. In such a case can through an adapted modification prevents that one byte memory cell arranged in the back of a memory block before being read in the course one on a front in the memory block arranged memory cell directed write operation overwritten becomes.

In a development of the invention is the modification value in dependence of the change in position of the positive DC with the highest change in position established. Is appropriate while e.g. the choice of a modification value, the highest position change amount corresponds to or exceeds a positive DC. This ensures that the modification value is not greater as strictly necessary, which in turn directly affects the for the processing of the instruction list required free space or the memory required for caching the one or the last statements of the instruction list affected DCs Has.

In a development of the invention is the modification value in dependence of the change in position of the negative DC with the least amount of change in position established. This procedure is useful if all DCS statements in the instruction list from the beginning to negative DCs Respectively. In such a case, a modification is required only if the smallest change in position of the DCS is less than the minimum amount. In such a case, it is expedient, this least change in position decisively for the Determining the modification value to use after that Modification the location change amounts of all DC areas over the minimum amount.

In In a further development of the invention, the minimum amount is dependent from a smallest separately writable block size of the updating data store.

As a result, the characteristic behavior of the memory type of the data memory is taken into account. Some types of memory can not be written byte-accurate, but require larger units, such as 1, 2, 4, 8, or 16K, to be written at once. This entails the danger that even in negative DC areas in which a shift in the DC area ent takes place in the writing direction, the writing of data in a memory-front memory cell deletes the data of a rear memory cell in memory direction. In order to counteract this, the minimum amount can be chosen to be large, depending on the smallest block record size that can be separately written, in order to ensure that the writing operation of the first data of a DC area in a write-ahead block takes place in relation to the read area.

In a development of the method will be after the modification of A divide-by-order statement, a change in the order of the statements carried out, in the case of all the DCA statements that precede the DCA statement with the over all DC instructions least amount of change in position while keeping their order behind the last DCA statement be moved. The DCA statements are located after the conversion so in an order in which the first Gleichbereichsanweisung the least change in position having. As a result, when buffering the memory areas, the one of execution this first DCA are affected, only a small one Memory required. Since the memory is organized as a ring memory, is a sequence change with respect to the instructions, not synonymous with a sequence change regarding the Gleichbereiche.

In a development of the invention will be before the first instruction In the statement list, a backup instruction to back up the Memory area when running the first equal-range statement is overwritten into one temporary storage added and the equivalency statements of the statement list, which are refer to a DC range located in this memory area, modified to reflect the data from this temporary memory read. The temporary storage may be a particular memory area dedicated to this purpose be the data storage to be updated. However, it is also appropriate also the use of a detached memory, for example a volatile memory.

In a development of the invention will be in the instruction list Copy instructions that refer to dz areas in the source memory contents refer to the execution overwrite the first equal-range statement Insert instructions replaced by an insert the contents of the affected Gleichbereiche as new areas in the Data memory to the according to destination memory content envisage intended positions. This development of the method allows a complete exhaustion the memory by source memory content and destination memory content, without a temporary storage area is required. The Gleichbereiche, by the first Gleichbereichsanweisung or the first equal-range statements are overwritten according to this Continuing education in the meantime completely from the memory of the data processing system deleted and only towards the end of the process as new areas in the form of corresponding ones Insert instructions Data processing system fed again.

In a development of the method have the original memory content and the destination memory contents discrete records. Especially advantageous is it when the DC areas are based on comparisons between records the source memory contents and the destination memory contents. Memory contents made up of discrete data records allow a very simple identification of DC areas. It will be only records compared to each other, which is much less expensive than the Comparison of arbitrary memory contents between original memory contents and Target memory contents. The number of maximum required comparisons corresponds to the product of the number of records of the original memory area and the number of records of the destination storage area.

In a development of the method is the data sets respectively assigned a unique identification key and it will be to determine the DC areas only data records of the original memory contents and the destination memory contents having the identical identification key, compared to each other. This too facilitates identification of DCs quite considerably. It is enough to to examine the source memory content for whether it has records, the same identification key as records of the Destination storage content. If this is the case, it just needs still a comparison between these records of the same identification key to be performed for the guarantee for that too achieve that the records are identical are. Even with big ones Memory content with a high number of records is this method with low computational effort feasible.

In a development of the invention are the identification key elements a sortable set and the records of the source memory contents and the destination memory contents are sorted in the same way.

In one development of the method, the statement list contains index statements that describe the adaptation of entries of an index table related to the data store. Such an index table serves as a kind of table of contents and allows fast determination of memory addresses of specific content. The indexing instructions take into account the fact that updating the memory contents of the data store may be accompanied by the insertion of new memory contents that require new index entries.

In In a further development of the method, index instructions are in the instruction list for adapting the index table only for those entries of the index table contain, their change implied from the DCS. While, for example Index entries on extinguishing areas, which refer to memory areas that are in the modified destination memory content are no longer included, as well as index entries on DCs, the across from their location in the original memory contents are shifted accordingly automatically deleted or can be adjusted is such an automatic adaptation when inserting new ones Memory content, for example, when replacing old records by new records, not possible. The reduction of index statements in the statement list that are not implicit in the equation of equality leads to a reduction in the size of the instruction list.

The The invention relates in a further aspect to a use of a generated according to any one of the preceding claims instruction list, the instruction list being sent to a data processing system having a Transfer data memory and updates it using the instruction list in the data store.

In An advantageous development is an adaptation of Index entries an index table.

In A further development of the use is the adaptation of index entries, the have a DC-related destination address, in that that the destination address corresponding to the attitude change value of the corresponding Is adapted to the same-range instruction. Another advantageous Further development provides that index entries which have a destination address, referring to a non-targeted content Memory contents are automatically deleted during the update.

By This training is achieved that an index table up to date can be kept without this requiring a significant amount of memory in the instruction list. So can the data processing system recognize when data areas are deleted without replacement and on it referring index entries automatically delete in the index table. At DC areas or index entries, which refer to equal ranges, it is the data processing system possible, based on the location change value of the corresponding DC area, an automatic adjustment of the corresponding index entry. Index statements in the Instruction lists are only required if an implicit Derivation of the index table is not possible, for example, for index entries, the refer to new realms, or index entries that refer to the first memory cell of Refer to equal ranges, in front of those in the target memory contents new ranges added become.

These and further preferred embodiments of the invention except go out the claims as well from the description and the drawings, the individual Features for each alone or in the form of subcombinations corresponding embodiments shown and not shown The invention can be realized, the advantageous embodiments represent, for which claims protection here.

embodiments The invention are illustrated in the drawings and are in Following closer explained. Hereby show:

1a and 1b schematic block diagrams of different representations of a respective original memory content and a destination memory content of a data memory,

2 3 is a flow chart of a first section of a first variant of a first method;

3 an instruction list used in the execution of the in 2 generated method section is generated

4 a flowchart of a second method section of the first variant of the first method,

5a and 5b Instruction lists accordingly 3 in an intermediate state during or after a final state after the execution of the second method section according to FIG 4 .

6 a flowchart of a third method section of the first variant of the first method,

7a and 7b Block diagrams of various states of the in 1a shown data storage during the implementation of the third method section according to 6 .

8th 3 is a flowchart of a first method section of a second variant of the first method,

9a and 9b Instruction lists that are generated using the in 8th be constructed in a state before and a state after a resort,

10a and 10b Block diagrams of various states of the in 1a data storage during the execution of the instruction statements according to 9b .

11a and 11b Block diagrams of each original memory content and one by a modification value from the target memory content of the 1b offset destination memory contents of the data memory of 1a .

12 a flowchart of a second method for generating and modifying an instruction list for updating the original memory content of 11b in the destination memory content of 11b .

13a to 13f one each with the method 12 generated statement list in various states during and after the procedure and

14a and 14b Block diagrams of various states of the data memory of 11b during the transition from the original memory contents to the destination memory contents.

The 1a and 1b illustrate the task, which is a data store with a total of 64 byte memory cells from an original memory content 10a into a destination memory content 10b to convict. The 1a shows on the left side the original memory contents 10a and on the right, the destination memory contents 10b , The memory contents 10a . 10b are each from records 12 constructed, each of these records a unique identification key is assigned in the form of a letter and the records are arranged in respect of their identification key alphabetically sorted order in the data memory. The memory contents 10a . 10b differ in the presence and content of the records. Records A, C, E, H, J, M, P, R are both in the original memory contents 10a as well as in the target memory content 10b to find and in both memory contents 10a . 10b identical in content. A record F is also in the original memory contents 10a and in the destination memory content 10b to find, however, with the contents of the record F in the original memory content and in the destination memory content differ from each other. These records A, C, E, F, H, J, M, P, R are in both memory contents 10a . 10b in the same order. Records B, D, O, Q of the original memory contents 10a are in the destination memory content 10b not to be found. Data records I, K in the destination memory content 10b are new records that are in the original memory contents 10a not included.

For faster access to data of the data memory, an index table, not shown, is provided. This lists in the case of the original memory contents 10a Index table entries T1, T2, T3, T4, each associated with an index address A _T1 , A _T2 , A _T3 , A _T4 . The index table entries T1 to T4 allow a data processing system quick access to certain data of the records B, H, M and O.

In the destination memory content 10b the index table entry T1 with the index address A _{T1 is} no longer present together with the corresponding data record B. The index table entry T2 is still present with a matched index address A ' _T2 and still has the same data of the record H. The index table entry T3 is also present in the destination memory contents with a matched index address A' _T3 , but now points to the new record K in the destination memory content 10b is arranged before the data record M, to which the index table entry T3 with the index address A _T3 with respect to the original memory contents 10a has related. This may be due, for example, to the fact that the data of the data record K supplement the data contained in the data record M to the front, so that a change in the index address T3 or the relevant data record is required. The index table entry T4 with the index address A _T4 has been omitted together with the relevant data record O. An index table entry T5 with the index address A ' _T5 , which points to the new data set F, has been added.

The 1b illustrates the difference between the source memory contents 10a and the destination memory contents 10b , Those records that are in the target store content 10b and in the original memory contents 10a contents are unchanged and at most displaced, represent equal areas G1 to G8. Those records that are in the original memory contents 10a are present in the destination memory contents 10b however, missing or other content exists, the deletion areas L1 to L5 represent. Those records in the target memory content 10b are present in the original memory contents 10a are not found, however, or with other content, represent new areas N1 to N3.

For the equal areas G1 to G8 is by means of arrows 14 each indicated as their location in the data store from the original memory content 10a to the destination memory content 10b changed. While the DC region G1 remains unchanged in position, the DC regions G2, G3, G4, G5, G8 are shifted toward smaller memory addresses and the DC regions G6, G7 are shifted toward higher memory addresses. A reference direction is by means of an arrow 16 shown. Since the DC regions G1, G2, G3, G4, G5 and G8 are not displaced or counter to the reference direction, they are negative DC regions. The DC zones G6, G7, on the other hand, are positive DC zones.

It can be seen that sequentially moving the DC regions G1 to G8 and writing the new regions N1 to N3, respectively, in the order in which the regions in the target memory contents 10b would cause memory contents to be overwritten before they can be moved. This can be seen, for example, at the DC region G6, which lies in its target position (byte 43 to byte 47) where the DC region G7 is arranged in the original memory content. The problem can also be seen on the new area N3, which, if it is written after moving the DC area G5, overwrites the data of the DC area G6 in its position in the original memory content. A sequential writing of the DC regions as well as the new regions in their order in the target memory content is therefore just as impractical as a sequential writing of the DC regions and a subsequent sequential writing of the new regions.

in the Following are two methods for solving the above problem as exemplary embodiments explains wherein the first method in two variants, a variant A and a variant B, is shown.

The first method is characterized by a statement list, in the instructions for copying memory blocks, inserting memory blocks, and / or to delete of memory blocks are provided, this instruction list being sorted in such a way that that the issues outlined above overwrite a memory area will be avoided before it can be read.

The first variant A of this first method is based on the 2 to 7b explained. Variant A has three process sections, the first section of the method, shown in FIG 2 , which serves to generate an instruction list, the second method section, presented in the 4 , the reorganization of this instruction list clarifies and the third stage of the procedure, presented in 6 , which has the processing of the instruction list generated by the first two method sections by a data processing system and thus the actual updating of the data memory to the content.

In 2 the first part of the method according to variant A is shown. This first process section is performed by a data processing system which has information about the original memory content on the one hand and the destination memory content on the other hand. After the start 100 This process section will be in a first step 102 Dataset variables D _U and D _{Z are} respectively set to the first record of the original memory content and the destination memory contents. Subsequently, in decision-making steps 104 . 106 . 108 . 110 a comparison of the data set variables D _U and D _Z or the unique identification key ID (D _U ), ID (D _Z ) performed. In this case, the file end is performed as a pseudo-record by the file end is assigned a special identification key that is different from all other identification keys, so the decision steps 104 . 106 and 108 all are not fulfilled. An additional check is made after the decision step 108 even if the data set variable D _U, but not the record variable D _Z to the last record is set (then insert statements for the remaining elements in the destination memory) or if D _Z, but not D _U (is set to the last record then delete instructions for the remaining elements in the original memory), each with a subsequent end 126 ,

At the first decision step 104 is in the event that the identification key of the record in the data set variable D _{U is} smaller than the identification key of the record in the data set variable D _Z , in the process step 112 an erasure instruction relating to the record D _U inserted in the statement list. Subsequently, the data set variable D _{U is} in a process step 114 set to the next record in the source memory contents. The case that D _{U is} smaller than D _Z can only occur if there is a data record in the original memory contents that is not intended to be identical or modified in the target memory content.

Through the decision step 106 is in the event that the identification key of the record D _{U is} greater than the identification key of the record D _Z , causes in one step 116 a new insertion instruction is added to the data set D _Z in the statement list and in a procedural step 118 D _{Z is set} to the next record in the destination memory content. The execution of the process steps 116 . 118 only occurs if there is a data record in the target memory content that is neither identical nor changed in content in the original memory contents.

Through the decision steps 108 and 110 is effected in the event that the identification key of D _U and D _{Z are} identical and the content of the data set D _U from the content of the data set D _Z , in one step 120 a modification instruction regarding the modification of D _U to D _{Z is included} in the instruction list and in a method step 122 Both D _U and D _{Z are set} to the respective next record in the original memory content or destination memory content. In the event that the identification keys of D _U and D _{Z are} identical and the contents of the relevant data records are also identical, no new instruction is inserted in the statement list, but in the process step 122 D _Z and D _{U are set} to the respective next record in the destination memory contents or original memory contents. In a decision step 124 It is checked whether D _U and D _Z the last records of the original memory contents 10a or the destination memory contents 10b represent. If this is the case, the in 2 shown completed first process section. If this is not the case, re-processing the decision steps 104 . 106 . 108 . 110 began.

The by the in 2 The instruction list generated in the first section of the method shown in FIG 1a and 1b illustrated source memory content 10a and destination memory contents 10b in the 3 shown. The occurrence of this statement list is explained below.

After the start 100 of the process is in the process step 102 D _U to the record A of the original memory content 10a and D _Z to the record A of the destination memory contents 10b set. The condition of the decision steps 104 and 106 is not met, since the identification key of D _U and D _{Z are} each A and thus identical. The identity conditions of the decision steps 108 and 110 are fulfilled. As a consequence, in the process step 122 D _U and D _{Z are} each set to the next record, so that D _U the record B and D _{Z contains} the record C. Since this is not yet the last records of memory contents 10a . 10b are in the decision step 124 a return to the decision steps 104 . 106 . 108 . 110 causes. As the condition of the decision step 104 is fulfilled, is in the step 112 a new instruction 140 inserted in the instruction list. The instruction list provides five parameters for each instruction. These parameters include the number MB of memory cells to be erased, the number PB of the memory locations to be added, the memory position Pos describing the location of the change, and the data to be inserted in the case of an insert instruction or a modification instruction. The fifth parameter summation value will only be valid after completion of the procedure section 2 and will be explained later.

In the case of the first instruction 140 , which is inserted into the statement list, MByte is set to 5 because the record B, which is in the destination memory contents 10b is no longer contained, has a length of five bytes. PByte is set to 0, as it is at the first statement 140 is a deletion statement and, accordingly, no data in the course of the execution of this instruction 140 should be added. The memory position Pos is set to 6, which results from the first memory cell of the record C, at the time of insertion of the first instruction 140 Content of D _Z is. The first instruction 140 There is no data associated with it because, as already mentioned, it is an erasure instruction. In a similar way to the statement 140 will be on the next pass through the decision steps 104 . 106 . 108 . 110 with the data set variables D _U equal to D and D _Z equal to E a second instruction 142 inserted in the statement list, which with different values MByte and Pos otherwise with the first statement 140 matches.

If in the further course of the method D _{U is set} to F and D _{Z is set} to F, in the method step 120 a modification instruction 144 inserted into the instruction list because the record F of the original memory contents 10a and the record F of the destination memory contents 10b differ in content from each other despite identical identification key. The instruction 144 sets the number of bytes MByte to be deleted according to the size of the data set F in the original memory contents 10a stuck to 6. Since the size of the data set F, ie the new range N1, in the destination memory content is three bytes, the number of bytes to be inserted is set to 3 for the PByte. The storage position results in the case of a modification instruction such as the instruction 144 , from the first memory cell of the data set in the target memory content plus the size of the new data set, which in the present case results in a value of 20 for a first memory cell of the data set F of seventeen and a size of the data set F to be inserted. The instruction also receives the data to be inserted of the data set F, that is, the new range N1.

The next statement is added to the statement list if D _{U contains} the record J and D _{Z contains} the record I. Since thus the identification key of D _{U is} greater than the identification key of D _Z , is in the process step 116 an insertion instruction 146 inserted in the instruction list. As an insert statement, this statement points 146 as the number of bytes to be deleted MByte 0. The number of bytes to be inserted PByte results from the size of the record I or the new range N2, which is 3. As with the Mo difikationsanweisung 144 is at the insertion instruction 146 the value Pos is calculated from the start position of the data record J or the new range N2 plus the length of the data record J or the new range N2. The memory position Pos is therefore 23 plus 3 equals 26. The insertion instruction 146 In addition, the data to be inserted of the data set I are added, that is, the data N2. Upon further processing of the original memory contents 10a and the destination memory contents 10b in the course of the implementation of the first stage of the procedure 2 There are three more instructions left 148 . 150 . 152 added to the statement list, which is the statement 148 an insertion instruction regarding the new area N3 and the instructions 150 . 152 to delete instructions.

The 3 So shows a statement list with a total of seven statements 140 . 142 . 144 . 146 . 148 . 150 . 152 that made the necessary changes to the source memory content 10a to the destination memory content 10b to arrive clearly describes. Each instruction is assigned, in addition to the parameters already explained, a fifth parameter sum value, which is composed of the sum of the PByte values of the relevant instruction and of all the preceding instructions minus the sum of the Mbyte values of the instruction and of all the preceding instructions. In the present case, this summation value calculation is performed in a process step not shown in the figures, which corresponds to the in 2 followed by the first method section. In embodiments not shown, it may also be expedient to calculate the summation value of the instructions during the generation of the statement list directly. In terms of content, the Sum value parameter represents a shift value between the original memory content and the target memory content, which makes a statement as to whether this DC range is a positive or a negative DC range for a DC range to be shifted in the course of each successive instruction.

In an expanded, not shown embodiment according to the execution of the method section according to 2 a further section of the procedure is inserted in which the index addresses of the index tables are updated and supplemented or instructions relating thereto are added to the statement list. In this case, statements are generated only for those index table entries relating to the destination memory content that are not implicitly derived from the update instructions of the 3 result. These implicit update information related to the index table are given at the index table entries T1, T2, T4 with the index addresses A _T1 , A _T2 and A _T4, respectively. While the index table entries T1, T4 are omitted due to the omission of the associated data records B and O, the change of the index address A _T2 implicitly results from the change in position of the DC area G4.

Therefore, in the instruction list, specific instructions are only included for the index table entries T3 and T5 in this embodiment, which is not shown. The corresponding instructions include the corresponding new index addresses A ' _T3 and A' _T5 .

Starting from the statement list of the 3 is in a second process section, as a flowchart in the 4 is shown, a change in the instruction list is performed. After the start 160 This process section is in a first step 162 the first instruction of the statement list is assigned to a statement variable AktAnw1. In a subsequent decision step 164 it is checked whether a termination flag is set. If this is not the case, in one process step 166 the instruction variable AktAnw1 is set to the first instruction as of the instruction AktAnw1, which has a parameter total value greater than 0. If such an instruction does not exist, the procedure is terminated. Otherwise, with this newly set statement AktAnw1 with the procedural step 168 The first statement is searched for the statement AktAnw1, which has a negative parameter Sum value or a parameter Sum value of 0. This instruction is assigned to a second instruction variable, AktAnw2. If no such statement can be found, the termination flag is set.

In a subsequent decision step 170 it is checked whether the termination flag is set. If this is not the case, in a subsequent decision step 172 Checks whether the sum value parameter of the AktAnw2 instruction is less than 0. If this is not the case, then AktAnw2 is equal to 0, are in one step 174 reverse the instructions AktAnw1 to AktAnw2 in their order in the statement list and then in one procedural step 176 AktAnw1 is set to the statement following AktAnw2. If in the decision step 172 If it is determined that AktAnw2 is less than 0, the instruction AktAnw2 becomes a procedural step 178 separated in two instructions AktAnw2a and AktAnw2b, with respect to the first of this new instruction AktAnw2a the parameter Mbyte is set to the parameter sum value of the instruction AktAnw2 plus the PByte value of AktAnw2 minus the Mbyte value of AktAnw2. The PByte value of AktAnw2a is set to 0 and the Pos value of AktAnw2a is set to the Pos value of AktAnw2. Regarding the second new instruction AktAnw2b set the Mbyte value of AktAnw2b to the MByte value of AktAnw2 minus the MByte value of AktAnw2a, set the PByte value of AktAnw2b to the PByte value of AktAnw2, the Pos value of AktAnw2b to the Pos value set by AktAnw2 and the possibly inserted data from AktAnw2 to the new instruction AktAnw2b adopted. Subsequently, in a process step 179 reversed the order of the instructions AktAnw1 to AktAnw2a in the statement list, whereupon the procedural step 176 follows in which AktAnw1 is set to the next on AktAnw2 or after the division of AktAnw2 the next following AktAnw2b statement.

In both cases of the decision step 172 is then jumped back and with the decision step 164 continued. If it is determined that the termination flag in the process step 176 has been set, this process section is completed (step 184 ). If after the assignment of AktAnw1 and AktAnw2 in the process steps 166 . 168 in the decision step 170 it is determined that the termination flag is set, then in step 180 a new last instruction is inserted into the instruction list, where the PByte value of this new instruction is 0, the MByte value for this new instruction is set to the sum value of AktAnw2, and the Pos value is set to the last memory cell of the destination memory contents plus one byte becomes. In a subsequent process step 182 the order of the instructions AktAnw1 to AktAnw2 is reversed, after which this section of the procedure is again completed (step 184 ).

The described method steps are explained below in terms of content. The procedure section is used to identify negative statement blocks, starting with the statement AktAnw1 and ending with the statement AktAnw2 or AktAnw2a, in which the parameter Sum value is positive. Such a positive sum value indicates that writes are to be made to areas of the data store whose data has not yet been read. The instructions of the statement blocks bounded by the instructions AktAnw1 and AktAnw2 could thus lead to the loss of data that would still be needed in the further course of the processing of the statement list. This is avoided by reversing the instructions in these instruction blocks in order. The identification of these instruction blocks is in the process steps 166 . 168 carried out. In the decision step 170 it is evaluated whether the block bounded by AktAnw1 and AktAnw2 moves to the end of the statement list. If this is the case, in the process step 180 a new deletion statement is placed at the end of the statement list, with which the later execution of the statement list results in a DC area located behind the last memory area affected by AktAnw2 being moved, since the shifting of DC areas in this first variant A is postponed During the execution of insertion, deletion and modification instructions is performed, as described below and in 6 shown. In the process step 182 For the identified statement block between AktAnw1 and AktAnw2, the already mentioned order reversal takes place. If in the process step 170 however, it is determined that the positive sum block does not extend to the end of the instruction list, in the decision step 172 distinguish whether the last statement of the statement block AktAnw2 extends into an area with a negative total value (AktAnw2 less than 0) or ends flush (AktAnw2 = 0). For the first case, AktAnw2 is split into two statements, the first of which has a total value of 0, meaning that it ends flush. Subsequently, in the process steps 174 respectively. 179 an order reversal of the identified instruction block is performed, this order reversal comprising the instructions AktAnw1 to AktAnw2 or AktAnw1 to AktAnw2a.

In the following, the application of the described method section of 4 on through the first procedural section of the 2 created statement list of the 3 explained. For this purpose, the instructions are each supplemented by a sixth parameter direction, which at the beginning of the in 4 for each of the instructions is set to forward. Starting from the in 3 The second section of the procedure begins with the method step shown in the instruction list 162 , in which AktAnw1 refers to the first instruction of the statement list, that is, the statement 140 , is set. Since the completion flag is not set, then the process step 166 is performed, in which AktAnw1 is set to the first instruction starting from AktAnw1, which has a positive sum value. If AktAnw1 already contains a statement with a positive total, AktAnw1 will not be changed. In the case of the underlying statement list, this next statement with positive parameter sum value is the statement 148 whose sum value is 6. Subsequently, in the process step 168 the first statement after statement 148 searched in which the parameter Sum value is less than or equal to 0. In the present case this is the instruction 152 , Since such an instruction exists, the completion flag is in the process step 168 not set. In the decision step 172 It checks whether the sum value of the AktAnw2, in this case the statement 152 , less than 0. This is given in the present case. Therefore, next, the process step 178 performed in which the instruction 152 in two directions 152a and 152b is decomposed. The Mbyte value of the statement 152a is equal to the sum value of the instruction 152 plus the PByte value of the statement 152 minus the Mbyte value of the instruction 152 ie it is -4 + 7 = 3. The PByte value of the statement 152a is set to 0 and the pos value corresponds to the pos value of the instruction 152 and is 51. The Mbyte value of the instruction 152b is equal to the Mbyte value of the statement 152 minus the Mbyte value of the instruction 152a ie it is 7-3 = 4. The PByte value of the statement 152b corresponds to the PByte value of the instruction 152 and is 0. The pos value of the instruction 152b corresponds to the pos value of the instruction 152 and is 51. The data to be inserted in the instruction 152a correspond to the insertion of the data of the instruction 152 , However, as this does not have its own data as the deletion statement, the instruction also points 152b no data on.

The instruction list, as it will after the step 178 is present in the 5a shown. It can be seen that the statement 152 now broken down into two separate instructions. Until this time, the order of the instructions is unchanged. After completion of the process step 178 becomes the process step 179 executed in which a sequence reversal of the determined statement block 156 , bounded by the instructions AktAnw1 (statement 148 ) and AktAnw2a (instruction 152a ), is provided. The this positive statement block 156 unassigned instructions form two negative instruction blocks 154 . 158 , The instructions 148 . 150 . 152a of the positive statement block 156 are changed in order so that the order subsequently 152a . 150 . 148 reads. The direction parameter is changed backwards for the orders in question as part of this order reversal. The table of 5b shows the instruction list after executed order reversal of the process step 179 , Subsequently, in the process step 176 AktAnw1 is set to the next statement following AktAnw2a, in this case the statement 152b is. Subsequently, in the decision step 164 again checked whether the termination flag is set, which again is not the case. In the process step 166 the next statement is taken from the statement AktAnw1 (statement 152b ), which has a positive sum value. Since such does not exist, the resorting is in step with it 166 completed.

5b shows the instruction list after completion of the second procedure section according to 4 , The sum value parameter is no longer assigned to the instructions in this statement list because it is no longer needed in the following. 5b thus represents the final instruction list, which in this state is suitable to be used by data processing equipment to update an associated memory. For example, it may be transmitted to a data processing system via a data carrier or a wired or wireless communication link. The instruction list is structured so that the instructions can be executed before the executing data processing system is aware of all statements. The data processing system accordingly requires only a small storage capacity for storing the instructions.

The processing of an instruction list, which according to the method of 2 to 5b is described below and is in 6 shown as a flowchart. The method in question is based on a successive processing of the instructions of the instruction list in the order of their occurrence in the instruction list. Depending on the parameter direction of the instructions, different method steps are carried out, the method steps for backward instructions in the diagram of 6 in one area 200 and the procedural steps to be used for forward instructions in one area 202 , A third area 204 includes procedural steps that are performed after all instructions have been processed. Specifically, the method is as follows.

After the start 208 be in one step 210 set some underlying values. A direction variable actuator direction, which represents the processing direction of the last instruction, is set to forward. The statement variable AktAnw, which contains the statement currently being executed, is set to the first statement statement statement. In addition, a forward position PosV and a backward position PosR are set to 0, respectively. The forward position PosV indicates, during execution, the memory cell at which the next write operation begins in the course of a forward instruction. The backward position PosR respectively indicates the memory cell up to which - excluding the memory cell itself - is written into the memory at the next backward instruction. In addition, a forward difference DiffV and a backward difference DiffR are set to 0, respectively. For forward or backward instructions, you specify the shift value when copying the next equal range.

With these set starting conditions is in a decision step 212 Checks whether the current statement - in the beginning, the first statement in the statement list - has moved forward. If this is the case, then in a subsequent decision step 214 Checks whether it is the first forward instruction for the above reverse instructions by checking whether the current direction of the actuator is set to forward. If this is the case, then by means of the decision step 216 and the process step 218 in the event that the Pos value of the current instruction minus the forward position PosV minus the PByte value of the current instruction is greater than or equal to 1, a copying operation is initiated by which an area extending from the forward PosV plus position Forward difference DiffV to the position of the current instruction plus the forward difference DiffV minus the PByte value of the current instruction minus one, is copied to a memory area beginning at the forward position PosV. Returns the decision step 214 However, that the current direction Aktrichtung is not forward, that is, that it is a first forward instruction after a previous backward instruction, so in the step 220 the current direction Act direction is set to forward. After copying the process step 218 or the setting of the current direction Act direction in the process step 220 be in one step 222 the values for the forward position PosV and the forward difference DiffV are reset. DiffV is increased by the PByte value of the current instruction and reduced by the MByte value of the current instruction. The forward position PosV is set to the pos value of the current instruction. In a subsequent process step 224 The data to be inserted in the current instruction is inserted into a memory location according to the Pos value of the current instruction minus the PByte value of the current instruction. If the current statement is a pure deletion statement, ie contains no data to be inserted and has a PByte value of 0, this method step is 224 without effect. In a decision step 226 it then checks whether there are any further instructions in the statement list. If this is the case, the instruction variable act instruction becomes the method step 228 set to the next statement in the statement list. Subsequently, the processing begins with the decision step 212 again.

If the decision step 212 As a result, the direction of the current instruction AktAnw is backwards, so in a subsequent decision step 230 checks if the backward instruction follows a preceding forward instruction. This is considered to be true even if the instruction is the first instruction, since the examined value of the current direction of the Akt direction is at the beginning of the method in the method step 210 is set to forward. If it is a first backward instruction after a previous forward instruction or the first instruction of the instruction list, is in a process step 232 the current direction AktRichtung is set to reverse. In the event that in the decision step 230 is determined that AktRichtung is already set to backward, ie that the current instruction is already preceded by a backward instruction is in one step 234 copied a memory area from the Pos value of the current instruction minus the backward difference DiffR to the backward position PosR minus the backward difference DiffR minus one into a memory area beginning with the address of the Pos value of the current instruction. In one, both the process step 234 as well as the process step 232 subsequent process step 236 the backward difference DiffR is decreased by the PByte value of the current instruction and increased by the MByte value of the current instruction.

In a subsequent decision step 238 it is checked if the backward difference DiffR is less than 0. If this is the case, it means that the subsequent instruction step will again be a forward-directed instruction step. In this case, the process step 240 through which a storage area between the forward position PosR plus the forward difference DiffR and the Pos value of the current instruction minus the PByte value of the current instruction plus the forward difference DiffV minus one in one at the forward position PosR beginning storage area is copied. Subsequently, the forward difference DiffV and the backward difference DiffR in a process step 242 set to 0 again. Regardless of the result of the decision step 238 is in each case subsequent to the method steps described in the case of a rear instruction direction, a method step 244 in which the data of the current instruction is copied to a memory area which starts at the position value of the current instruction minus the PByte value of the current instruction. If the current statement is a pure deletion statement with no data, this step will have no effect. Subsequently, in a process step 246 the backward position PosR is set to the Pos value of the current instruction minus the MByte value of the current instruction. This is followed by the decision step again 226 in which the presence of further instructions is checked.

When all instructions have been processed and accordingly in the process step 226 is determined that there are no further instructions, with a decision step 248 fortge in which it is determined whether the current direction of the direction of action, ie the direction of the last statement in the instruction list, is forward. If this is the case, in one process step 250 copying a memory block between the forward position PosV plus the forward difference DiffV and the data end in the source memory contents to the forward position PosV. As in the case that in the decision step 248 is determined that the current direction AktRichtung is backwards, the method is then terminated (step 252 ).

The described method is thus based on executing the instructions one after the other and, as part of this, shifting regions of the original memory contents to their new target positions (method step 234 . 240 . 218 ) or new data are inserted (method step 224 . 244 ). After all instructions have been processed, in the case where the last method step was a forward-oriented method step, in the method step 250 executed another copy instruction.

The insertion instructions (procedural step 224 for advanced instructions and procedural step 244 for backward-facing statements) are executed with each statement, whereby there are no data to insert in the case of deletion statements and the respective statements thus remain ineffective.

The copy instructions of the method steps 234 . 218 are executed only if the instruction facing the backward instruction has not been preceded by a forward instruction or the forward instruction has not been preceded by a backward instruction. This is because the copy instructions serve the purpose of shifting a DC range whose exact position and size in memory are known at the earliest after the second rectified instruction.

The copy instruction of the process step 240 is only executed if the backward difference DiffR is less than 0. As already mentioned, this is the case if the following instruction is again a forward instruction, that is, the current backward instruction is the last instruction of its positive instruction block. The copy instruction is used to move a negative Gleichbe rich whose displacement is only clearly described at this time, since its size and position by the last statement of the previous negative statement block and the last statement of the positive statement block are clearly defined.

The fourth method step with a copy instruction, the method step 250 , is intended for a DC area containing the original memory content 10a limited to the rear.

This in 6 The method illustrated with reference to the flowchart will be described below with reference to FIG 1a and 1b illustrated source memory content 10a and the in 5b explained instruction list explained. The 7a and 7b show the contents of the data store in various stages of the process starting from the original memory content 10a and opening into the target memory content 10b , The state 270 of the datastore content represents the original memory content 10a Referring to the in 6 illustrated flow diagram of the method are in the process step 210 the basic values PosV are equal to 0, DiffV is equal to 0, PosR is equal to 0, DiffR is equal to 0, Act direction is equal to forward and AktAnw to the instruction 140 set. At the decision step 212 it is determined that the direction of the current instruction 147 Is forward, and in the decision step 214 it is determined that the current direction of the actuator direction is also forward. In the subsequent process step 216 it is calculated that the Pos value of the current instruction minus PosV minus the PByte value of the current instruction 6 is greater than or equal to one. As a result, in the process step 218 the first copy instruction performed. A memory range from PosV plus DiffV equal to 0 to the Pos value of the current instruction AktAnw plus DiffV minus one minus the PByte value of the current instruction is copied equal 5 to PosV equal to 0. Since the original position and the destination position of this memory area are identical, the result of this copy instruction is in 7a not visible.

Subsequently, in the process step 222 DiffV and PosV reset, where DiffV is 5 and PosV is 6. Because the statement 140 as a pure deletion statement contains no own data, the insert operation remains in the process step 224 without effect. After checking whether further instructions exist, the procedure step 228 the next statement, the statement 142 , to the current instruction. Since the direction of this instruction is again forward (decision step 212 ) and the current direction Akt direction is also forward (decision step 214 ), is in the decision step 216 Check if the copy instruction 218 to be carried out. This is the case and leads to a copying operation in the course of the method step 218 in which a memory area from memory cell 11 to memory cell 17 is copied into a region beginning with memory cell 6. This leads to the in 7a with the reference number 272 designated state. In the process step 222 DiffV will go to 8 and PosV to 13 set. As is the instruction 142 As erase instruction has no data, the process step affects 224 again with the insert instruction provided therein. After changing the current statement on instruction 144 (Step 228 ) is in the process step 218 a copy operation is triggered, wherein a memory block is copied from the memory cells 21 to 24 in an area beginning with the memory cell 13 (see state 274 in 7a ). In the subsequent process step 222 DiffV is set to 11 and PosV to 20. Since this is the statement 144 has a modification instruction to be inserted with data N1 to be inserted, has the insertion instruction of the method step 224 for the first time an impact. The data of the statement 144 (N1) are written in an area starting with the memory cell 17 (see state 276 in 7a ).

In the process step 228 becomes the next statement, statement 146 , made to the current instruction and with this instruction in the process step 218 a memory area from memory cell 31 to memory cell 33 is copied into an area beginning with memory cell 26 (state 278 ). In the process step 222 Then DiffV are set to 8 and PosV to 26. The insertion instruction of the method step 224 subsequently results in the insertion of the data N2 associated with the instruction into an area starting with the memory cell 23 (state 280 ). The current instruction is then in the process step 228 on the instruction 152a which is the first backward instruction of the statement list. Accordingly, in the decision step 212 recognized that the direction of the current instruction is not forward, and then in the decision step 230 recognized that the current direction is not backward. The current direction is therefore in the process step 232 set to reverse and then in the process step 236 DiffR around the PByte value of the statement 152a reduced from 0 and increased by the Mbyte value from 3 to 3. Since DiffR is greater than 0, the method becomes the process step 244 in which an insert operation is performed in the absence of the instruction 152a associated data has no effect. The reverse position PosR is then changed for the first time to a value of 51.

In the process step 228 the current statement then becomes the statement 150 which is also a backward-facing instruction, so that the next step in the process step 234 is performed. In this case, a memory area from memory cell 45 to memory cell 47 is copied into a memory area beginning with memory cell 48 (state 282 in 7b ). DiffR is then in the process step 23 6 set to 6. Because the statement 150 as the deletion instruction has no associated data, the subsequent insertion instruction of the method step remains 144 without effect. In the process step 246 PosR is then set to the Pos value of the current 48 instruction. In the process step 228 becomes the next statement, statement 148 , made to the current instruction. Because the statement 148 is also a backward instruction, it comes in the process step 234 to a copying operation in which a memory area starting with memory cell 37 and ending with memory cell 41 is copied into a memory area starting with memory cell 43. (Status 284 in 7b ). In the process step 236 DiffR is decremented by the PByte value of the current statement of 14, which is -8. The decision step 238 in which it is checked whether DiffR is less than 0, therefore, leads to a subsequent execution of the copying instruction of the method step 240 , In this case, a memory area is copied from the memory cell 34 to the memory cell 36 in an area starting with the memory cell 26 (see state 286 in 7b ). In the process step 242 Then DiffV and DiffR are set to 0 again. The insertion instruction of the method step 244 has an insertion of the statement 148 associated data N3 to the memory location 29 (state 288 in 7b ).

PosR is then in the process step 246 set to 29 and in the process step 228 becomes the instruction 152b made to the current instruction. The decision step 212 recognizes that the parameter direction is the current instruction forward, and the decision step 214 recognizes that the current direction Aktrichtung is not forward, so that in the process step 220 then the current direction is set to forward. Subsequently, in the process step 222 DiffV set to 4 and PosV to 51. Because the statement 152b does not contain any data associated with it, the insertion instruction of the method step remains 224 without effect. In the decision step 226 it is recognized that there are no further instructions. It is therefore in the decision step 248 Checks if the current direction is direction, ie the direction of the last statement 152b , Forward reads. Since this is the case, in the process step 250 a memory area, beginning with the memory cell 55 and ending with the end of the memory, the memory cell 63, copied into an area beginning with the memory cell 51 (see state 290 in 7b ). The in 7b illustrated state 290 the contents of the memory correspond to the destination memory content 10b how he got that 1a and 1b can be seen. The data update in the data store is therefore complete.

In the not-shown extended embodiment of variant A is in the course of Verfah rensschritte 234 . 240 . 218 . 250 , which cause a copy of a memory area in the data memory, checked whether the index table of the data processing device for the affected memory areas index table entries provides. If an index table entry exists whose index address lies in the destination area of the copy instruction but not in the origin area of the copy instruction, this index table entry is deleted. If the index address of an index table entry is in the source area of the copy instruction, the index address of this index table entry is changed parallel to the shift distance of the copy instruction, ie either reduced by the backward difference DiffR or increased by the forward difference DiffV. By such supplemented process steps 234 . 240 . 218 . 250 a correct update of the index table of the data processing system with respect to the index table entries T1, T2 and T4 is achieved. The index table entries T1 and T4 are cleared and the index table entry T2 is provided with a new index address A _T2 (32) minus DiffV (11) equal to A ' _T2 (21). The update regarding the index table entries T3 and T5 will be made after completion of the procedure according to 6 achieved by the explicit index statements of the instruction list provided in this extended embodiment.

The 8th to 10b show a second variant B of the described method. Variant B differs from the variant A described above in that insertion instructions and copy instructions are added to the instruction list instead of insertion, deletion and modification instructions, which describe the respectively described operation completely and conclusively.

8th shows analogously to 2 a flowchart, which includes a first method section, with which an instruction list is generated. In addition, referring to the 1a and 1b the implementation of this section of the procedure is explained below. After the start 300 be in the process step 302 the data set variables D _U and D _Z on the first record of the original memory content 10a or the destination memory contents 10b set. Subsequently, in the decision steps 304 . 306 . 308 . 310 the identification key or the contents of the records contained in the data set variables D _U and D _Z compared. It is by the decision step 304 causes, if the identification key of the current record in the original memory content is smaller than that of the current record in the target memory content, in the method step 312 the record variable D _{U is set} to the next record in the source memory contents. This situation occurs when in the source memory contents 10a a record is contained in the destination memory contents 10b can not find anymore.

If in the decision step 306 it is determined that the identification key of the data record in the data set variable D _{U is} greater than the identification key of the data record in the data set variable D _Z , is in the process step 314 an insertion instruction is inserted into the statement list containing the target position of the data set referenced in D _Z and its data. Subsequently, in the process step 316 D _{Z set} to the next record in the destination memory contents. If in the decision step 308 is determined that the identification key of the records referenced by D _U and D _Z , are identical, so in the decision step 310 checks if the contents of the two records are also identical. If this is the case, then in the process step 318 a copy statement is inserted into the statement list whose parameters describe the beginning and the end of the record in the source memory contents as well as its target position in the target memory contents. If, in contrast, in the decision step 310 it is determined that the contents of the records referred to in D _U and D _Z is not identical, is in the process step 320 an insertion instruction is inserted in the instruction list, which corresponds to the insertion instruction of the method step 314 as parameter includes the target position in the destination memory content and the data to be inserted there.

Regardless of whether the data of the data records referenced by D _U and D _Z are identical, in one process step 322 the two data set variables D _Z and D _{U are} respectively set to the next data record in the target memory content or in the original memory content. If in a decision step 324 If it is determined that D _U and D _Z respectively refer to the last data records of the original memory contents or of the destination memory contents, the in 8th shown process section ended (step 326 ). However, if this is not the case, with one more pass through the decision steps 304 . 306 . 308 . 310 continued.

The 9a shows the result of the application of in 8th The method section shown in the 1a and 1b illustrated source memory content or destination memory content. The instructions shown 330 . 332 . 334 . 336 . 338 . 340 . 342 . 344 . 346 . 348 . 350 each refer to a DC or new area in the destination memory contents of the data memory. The copy instructions 330 . 332 . 334 . 338 . 342 . 346 . 348 . 350 are each assigned to a DC area, which they unambiguously describe by assigned parameters with respect to beginning and end in the original memory content and destination position in the destination memory content. The insertion instructions 336 . 340 . 344 each refer to a new area and include as parameters its target position and its data content.

After the in 9a has been generated is analogous to the in 4 for the first variant A method section also carried out in the variant B, a resorting of the instruction list. For this purpose, the equal-range statements are started, starting with statement 330 and ending with instruction 350 , one by one, to see whether they are DC or DC positive or negative. The positive DC areas are those in the reference direction 16 are shifted to larger memory addresses, while negative DC regions are those which are opposite to the reference direction 16 be moved to smaller memory addresses out. A DC area that does not change its position, as in the present case, that of the DC area instruction 330 , is considered a negative DC. The review of the DCS statements reveals that the DCS statements 330 . 332 . 334 . 338 . 342 . 350 refer to negative DCs while the DCS statements 346 . 348 refer to positive DCs.

In the knowledge of this, the instructions are subsequently combined into instruction blocks. This is done according to the proviso that in each case such DC areas are combined into a block, the identical type (positive or negative) and are not interrupted by a statement that is of a different type (negative or positive). The insert instructions, when framed by the same-type equal-range instructions, are assigned to the instruction block of the copying instruction relating to these same-domains. Insert instructions followed by a positive-match copy instruction, such as the insert instruction in the present case 344 , are assigned to the instruction block of this copy instruction. In this way, the statements that are in the statement list of the 9a are shown in three instruction blocks 352 . 354 and 356 divided up. Within the statement blocks with positive DCA statements, in this case the statement block 354 with the instructions 344 . 346 . 348 , the instructions are reversed in their order.

The result of this change of order is in the 9b to recognize. The modified statement list depicted therein has the same instructions as those in FIG 9a but also the instructions 344 and 348 are interchanged. The order of the statements within the statement blocks 352 . 356 with negative dc ranges remains unchanged. The order of the statement blocks themselves remains unchanged, the order of which corresponds to the arrangement of the equal ranges in the reference direction which they each describe.

The instructions of the instruction list of the 9b correspond exactly to the instructions to which the instructions of the in 5 presented in the course of the in 6 converted process section are converted. The instructions of in 9b However, in contrast to the instructions of variant A, the instruction list shown for variant B can be executed directly by a data processing system, without having to use a data processing system 6 would be required method section comparable process section. However, the advantage of reducing the overhead of translating the Instruction List into directly executable operations is a significantly higher number of instructions. It is easy to see that the instruction list of the 5 with only eight statements is significantly shorter than the statement list of 9b with eleven instructions.

Like the ones in the 5 The instruction list shown is also that in the 9b The instruction set shown is the final instruction list that is transmitted to the data processing system whose memory is to be updated. As already too 5 explained, the transmission can be carried out by means of a data carrier or by remote data transmission.

The initial state, the destination state, and some intermediate states of execution of the instructions in the instruction list 9b by means of a data processing system are the 10a and 10b refer to. The illustrated states 370 to 390 correspond largely to those in the 7a and 7b illustrated intermediate states 270 to 290 , The only difference is that the shift of G5 in the case of the 7a and 7b the underlying method is only effected by an instruction at the end of the positive statement block (see transition from state 284 to state 286 ), while this shift in the 10a and 10b underlying method already at the end of the first negative statement block (see transition from state 380 to state 382 ).

Due to its small number of instructions, variant A is particularly suitable for updates in which a large number of small changes in the data memory are to be carried out. The smaller the data blocks to be inserted in each case, the more the amount of data generated by the instructions themselves becomes significant. The variant B is due to its simplicity, especially in lower-performance data processing systems appropriate, especially if the necessary updates concern a small number of individual areas.

The 11a to 14b serve to explain a further embodiment of the method according to the invention. This is based on the basic idea that a data memory with a memory start and a memory end can also be regarded as a ring memory whose memory start and memory end are quasi connected to each other. Such a consideration makes it possible to reorganize the data memory in the course of the update so that the first memory block after the update does not start at an absolute memory cell 0, but at any other memory cell of the data memory, a logical memory zero, where only that is required Accessing data processing device knows where the logical memory zero point is compared to the absolute physical memory zero.

11a shows how 1b the data store 10a before performing the update. The key issue in updating the datastore towards the destination memory content 10b of the 1b This is because some DC areas within memory are shifted in one direction and other DC areas in the opposite direction. As a result, the method variants described above are required to establish a suitable order of the write operations, avoiding overwriting memory areas whose contents are subsequently used.

Like the first modification 10c of the destination memory contents in 11a shows, is to be avoided by a memory organized as a circular memory this problem. If all copy statements and all insert statements with respect to their miss memory address are changed by a uniform value, the modification value, it is achieved that all DC areas are negative DC areas. As in 11a can be seen is achieved by the fact that the relative change in position of each Gleichbereich in its target position relative to its original position takes place in the same direction. In the case of the modified destination memory content 10c arises opposite to in 1b shown destination memory content 10b a modification value of -6. Each DC range will be six bytes larger than the one in the destination memory 10b from 1b shown positions of the DC areas opposite to the reference direction 16 offset inserted into the data store. The same applies to the new areas whose target position is also six bytes compared to the destination memory content 10b from 1b shown position are shifted forward.

11b shows a modified target storage area 10d , the opposite to the destination memory content 10b from 1b is offset by a modification value of -19. The realization of this modification value and the generation and adaptation of the instruction list for the transfer of the original memory contents into the illustrated modified destination memory content 10d will be described below with reference to the flow chart of 12 and various intermediate stages of the instruction list, presented in 13a to 13e , explained.

12 FIG. 10 is a flowchart of a method by which an instruction list is generated and adjusted to the original memory content 10a in the modified destination memory content 10d to convict.

After the start 400 of the method is in a first step 402 It generates an instruction list with instructions whose statements in the statement list are in the order of the equal and new ranges in the target memory content. The generation of this statement list is performed according to the in 8th illustrated method section. Subsequently, in a decision step 404 determines if there is a positive equal band in the original target content 10b is available.

If at least one positive DC range is present, then in one process step 406 Determines which positive DC range has the largest change in position. In a subsequent process step 408 For example, a modification value is set to the attitude change amount of this detected DC region.

If in the decision step 404 it is determined that there is no positive equal band in the target memory content 10b is present, is in a process step 410 determines the negative DC range with the least change in position amount and the modification value in one step 412 set to 0.

To the process steps 408 such as 412 closes a joint process step 414 in which the modification value is increased by an amount which corresponds to the distance in the original memory content between the first memory cell of the determined positive or negative DC region and the first memory cell of the discretely writable memory block before this DC region. A discretely writable memory block is understood to mean the smallest memory unit of the data memory which can be written without this writing gang adjacent storage areas are affected. The memory block on which this method step is based is to be selected such that it does not include any data of the determined DC range. For example, if the size of a discretely-writable memory block is fixed at 16 bytes by the type of memory and the detected equal range begins at the fifth byte of a memory block, the modification value is increased by 20, which is the size of a memory block plus the size of the memory area in the memory block of the memory block DC range that lies before the DC range corresponds to. In a subsequent process step 416 the target parameter of all statements in the statement list is changed by the thus defined modification value.

In a subsequent process step 418 In the instruction list, all statements that precede the statement that relates to the shift of the determined DC range are moved, keeping their order, after the last statement in the statement list. The instruction list then begins with that instruction that the move in the step 406 respectively. 410 The objective of the identified equality Subsequently, in a process step 420 an instruction at the beginning of the statement list, which has a copy of a backup area before the determined DC area in a temporary memory to the content. This fuse area has a size that corresponds to the modification of the modification value in the method step 414 equivalent. The backup area of the original memory content, which is located immediately before the detected DC area, is stored in a temporary memory, which may be a special memory area of the general data memory or else a separate data memory. In a final process step 422 For example, those instructions of the instruction list that involve copying dc ranges that are wholly or partially located in the save area are modified to copy from the temporary store instead of this save area. Instructions relating to DC areas that are only partially located in the save area are split into two separate statements, one of which is the non-hedged portion of the DC and the other is the fully hedged portion of the DC refers. After completion of this procedural step 422 is the end 424 achieved the method.

The following is the flowchart in the 14 illustrated method based on in the 11b illustrated source memory content 10a and destination memory contents 10d clarified.

After the start of the process is in the process step 402 generates a statement list. This statement list is in the 13a displayed. It corresponds to that in the 9a instruction list, since they are identical to the one in 8th has been produced. It consists on the one hand of copy instructions for moving DC areas, which as parameters are the extension of the DC area in the original memory contents 10a and the target position of the DC region in the target memory contents, and insertion instructions having as parameters the data to be inserted and the intended target position in the data memory.

After generating the instruction list according to 13a will be in the decision step 404 Determines if at least one positive DC range exists. Since both the DC region G6 and the DC region G7 are shifted counter to the reference direction toward larger memory addresses (see FIG 1b ), these are positive equal parts. As a result, in the process step 406 determines which is the DC area with the largest change in location. In the present case, this is the DC area G6 whose stock change amount is according to the target storage content 10b has the value 6. In the process step 408 the modification value is set to this position change amount of the determined DC range and thus also amounts to 6. In the subsequent method step 414 the modification value is increased by a value corresponding to the distance between the beginning of the detected DC region G6 and the beginning of the discretely writable memory block, which does not contain contents of the DC region G6, located before the detected DC region G6.

The 64-byte data memory is divided in the present case in discretely writable memory blocks of 8-byte size. The for this process step 414 The memory block used in the present case is the memory block starting with memory cell 24 and ending with memory cell 31. Since the DC region G6 starts at the sixth byte of the following memory block, the modification value is increased by a total of 13, resulting from the 8 bytes of the size of a memory block and 5 bytes which are arranged in the memory block of the DC region G6 before the DC region G6. Overall, the modification value is set to 19 accordingly. Subsequently, in the process step 416 made a change in the destination memory positions of the instructions in the instruction list. In this case, the target memory positions are each reduced by the modification value, so that subsequently the target memory positions of all DC bands are smaller than the respective original memory positions. Because the data store As ring memory is constructed, the negative memory values resulting from this modification correspond to those of the total size of the data memory of 63 bytes less the target position. 13b shows the instruction list after decreasing the destination memory position of all instructions. The instructions 430 . 432 . 434 . 436 The addresses specified in brackets are the converted memory addresses of negative indications. They are not part of the instructions.

In the subsequent process step 418 If the instructions of the instruction list, which are arranged before an instruction relating to the ascertained DC range, are moved behind the last instruction of the statement list while keeping their order. This ensures that the change of the memory contents of the data memory from the original memory contents 10a to the destination memory content 10b or to the destination memory content 10d in an order starting with the shift of a DC range representing the least required shift. In 13b is the instruction related to the detected DC range 446 bold. The statement list after carrying out this method step 418 is the 13c refer to. As already described, the instruction list changed in this way now starts with the instruction 446 that is, the instruction related to the detected DC region having the least amount of posture change.

In the subsequent process step 420 At the beginning of the statement list, a new statement is added 452 which is intended to copy a save area to a temporary store. This security area extends from the first memory cell of the determined DC area in the original memory content 10a including same up to the first memory cell of Gleichbereich in Zielspeicherin halt 10d without it. Its size corresponds to the modification value. The purpose of storing this save area in a temporary store is to allow all instructions relating to non-secure DC areas to be executed without irretrievably overwriting the contents of the backup storage area. By having the DC area with respect to the destination memory contents 10d The least amount of change in position is the subject of the first instruction in the instruction list, ensuring that as little data as possible has to be transferred to the temporary memory. The temporary memory can be kept small accordingly. The 13d shows the instruction list supplemented by the save instruction, where "T: 0" stands for the memory cell 0 of the temporary memory.

In the last procedural step 422 For example, those instructions that refer to DCs that are in the source memory content in the backup region are modified to read the data from the temporary memory rather than the backup region. Since, at the time of executing the respective instructions, the save area is overwritten by the above instructions, the data to which the ones in the step are 420 refer to statements to be modified, already deleted. The data is instead read from the temporary memory. When statements refer to DC areas that are partially within and partially out of the save area in the source memory contents, these instructions are divided into two statements, one referring to the DC section outside and the other referring to the DC section within the backup section. In 13e are the effects of the procedural step 420 recognizable on the instruction list.

The instructions 438 and 442 are now modified to copy data from the temporary memory to the data memory to the destination memory content 10d cause predetermined space. The copy instruction 434 referring to the DC area G3 is in two copy instructions 434a and 434b divided. The copy instruction 434b is adapted to copy the formerly in the fuse area arranged portion Gab of the Gleichbereichs G3 from the temporary memory into the by the target memory content 10d predetermined position in the data memory causes. The copy instruction 434a refers to the portion G3a of the DC region G3 which is arranged outside the securing region and has been adapted only with respect to the extent.

The in the 13e The instruction list shown represents the final instruction list which is transmitted to the data processing system which can use this instruction list to update the data memory.

The 14a and 14b show the data store in various states based on the source memory contents 10a to the destination memory content 10d in the course of execution of the instruction list according to 13e , The state 470 corresponds to the original memory content 10a , Starting from this state becomes in the course of the execution of the instruction 452 the hedging area 468 , which extends from the memory cell 24 to the memory cell 36, copied in a temporary memory, not shown. The resulting state is in 14a With 472 marked. The subsequent instructions 446 . 448 . 450 cause a shifting of the DC regions G6, G7, G8 toward their through the target memory contents 10d given Po sitions. When executing the instruction related to the DC area G1 430 the executing data processing system sets the target position -19 with knowledge of the size of the ring buffer of 64 bytes in the target position 45 converted. The target positions of the instructions also become analogous 432 and 434 , which refer to the DC areas G2 and G3a, converted. The state of the data store after execution of these instructions 430 . 432 . 434 is the illustrated states 480 . 482 . 484 refer to. The memory areas G1, G2, G3 shown in dashed lines show their positions according to the corresponding instructions 430 . 432 . 434 , The dotted areas shown by solid lines G1, G2, G3 show the positions in the data memory after the conversion of the negative target positions. The instruction 436 then inserts the new range N1 into the data memory. In the course of the execution of the copy instruction 434b becomes the second portion Gab of the Gleichbereichs G3 to its destination position according to target memory content 10d copied. The data of this second section Gab are read from the temporary memory. The same applies to the data of the DC areas G4 and G5, which are used in the copy instructions 438 and 442 be copied to the data store. The new areas N2 and N3 are after the copy instruction 438 respectively. 442 in the course of the insertion instructions 440 and 444 at their according to modified destination memory contents 10d inserted in given positions.

Claims (23)

A method for generating a statement list for automatic updating of the memory contents of a data memory by a data processing system, in which the content of the data memory is based on an original memory content ( 10a ) into a destination memory content ( 10b ), wherein - the destination memory content ( 10b ) from equal areas (G1 to G8), which are unchanged in content with respect to the original memory content, and / or new areas (N1, N2, N3) which are not contained in the original memory content, - the DC areas in the original memory content and in the destination memory content in a freely defined Reference direction ( 16 ) are arranged in the same sequence, and - the dc areas comprise positive dc areas (G6, G7) whose position in the destination memory content is offset from the original memory content in the reference direction and negative dc areas (G1, G2, G3, G4, G5, G8), whose position in the destination memory content is offset from the original memory content in the direction opposite to the reference direction, characterized in that - the instruction list instruction blocks ( 352 . 354 . 356 ), in which equal-range statements ( 330 . 332 . 334 . 338 . 342 . 346 . 348 . 350 ), each having at least one DC region (G1 to G8) with respect to its position change from the original memory content ( 10a ) to the destination memory content ( 10b ), each of these instruction blocks being either a negative ( 352 . 356 ) or a positive ( 354 ) Statement block is, - the negative statement blocks ( 352 . 356 ) those DC instructions ( 330 . 332 . 334 . 338 . 342 . 350 ) containing the change in position of the original memory ( 10a ) successive negative DC areas (G1, G2, G3, G4, G5, G8), the negative statement blocks ( 352 . 356 ) the equal-range statements ( 330 . 332 . 334 . 338 . 342 . 350 ) at least one in the reference direction ( 16 ) comprise first (G1, G8) to a reference negative (G4) negative DC range of these successive DC domains (G1, G2, G3, G4, G5, G8), the DC domain instructions (G1) 330 . 332 . 334 . 338 . 342 . 350 ) within their respective negative instruction block are arranged in the reference direction in the order of the respectively described negative dc ranges in the original memory content, - the positive instruction blocks ( 354 ) the DCS statements not contained in the negative statement blocks ( 346 . 348 ) which describe the change in position of successive equal domains (G5, G6) in the original memory content, the information contained within positive instruction blocks ( 354 ) containing equality instructions ( 346 . 348 ) within their respective positive statement block ( 354 ) are arranged in the order of the respective DC areas described in the original memory contents opposite to the reference direction. Method according to claim 1, characterized in that the instruction blocks ( 352 . 354 . 356 ) are arranged in the order list in an order that corresponds to the order of the equal ranges (G1 to G8) in the reference direction ( 16 ) in the original memory content ( 10a ) from the DCS statements ( 330 . 332 . 334 . 338 . 342 ; 346 . 348 ; 350 ) of the respective instruction blocks ( 352 354 . 356 ) to be discribed. Method according to Claim 1 or 2, characterized in that the statement list contains new range statements ( 336 . 340 . 344 ) describing the data to be inserted (N1, N2, N3) and the location of the new areas (N1, N2, N3). Method according to claim 3, characterized in that new area statements ( 344 ) describing a new region (N3) that is in the reference direction ( 16 ) to a negative DC range (G5) follows and in the reference direction ( 16 ) is followed by a positive DC region (G6), in the statement block ( 354 ) of that Gleichbereichsanweisung ( 346 ), which describes the change in position of the positive DC region (G6). Method according to claim 3 or 4, characterized in that the instructions copy instructions ( 330 . 332 . 334 . 338 . 342 . 346 . 348 . 350 ) and insertion instructions ( 336 . 340 . 344 ), wherein - the copy instructions each have a DC area (G1, G2, G3, G4, G5, G8) with respect to its location in the original memory content ( 10a ), its size and its location in the destination memory ( 10b ) and the insertion instructions each describe a new area (N1, N2, N3) with regard to its data and its location in the destination memory content ( 10b ). A method according to claim 3 or 4, characterized in that the instructions delete instructions ( 140 . 142 . 144 . 150 . 152 ) and insertion instructions ( 144 . 146 . 148 ), wherein - the deletion instructions each describe a region (L1, L2, L3, L4, L5) in the data memory whose original memory contents ( 10a ) contained in the target memory content ( 10b ) are no longer contained, and the insertion instructions each have a new area (N1, N2, N3) with regard to its data and its location in the destination memory content ( 10b ) and the instructions are marked as to whether they are statements of a positive statement block ( 354 ) or a negative statement block ( 352 . 356 ). Method according to claim 6, characterized in that the instructions include modification instructions ( 144 ) comprising the contents of an erase instruction and an insertion instruction. Method for generating a statement list according to the preamble of claim 1, characterized in that an initial statement list is generated, wherein - the initial statement list contains equal area instructions ( 430 . 432 . 434 . 438 . 442 . 446 . 448 . 450 ), each describing the change in position of a DC region (G1 to G8) in the form of a position change amount and a position change direction of a DC region, and - the DC range statements in the initial instruction list in the order of DC regions in the original memory content ( 10a ) in the reference direction ( 16 ), and then a modification of the instructions of the instruction list is carried out, in which the in the Gleichbereichsanweisungen ( 430 . 432 . 434 . 438 . 442 . 446 . 448 . 450 ) described by a uniform modification value for all Gleichbereichsanweisungen over that by the target memory content ( 10b ) conditional change such that all DC areas become negative DC areas, wherein the modification value is set so large that the minimum posture change amount of the DC postings after the modification does not fall short of a minimum amount for each DC area instruction. Method according to claim 8, characterized in that that the modification value in dependence of the Lageveränderungsbetrages of the negative DC with the least amount of change in position is determined. Method according to claim 8 or 9, characterized that the minimum amount depending on from a smallest separately writable block size of the updating data store. Method according to one of claims 8 to 10, characterized in that after the modification of the Gleichbereichsanweisungen a change of the order is performed, in which all Gleichbereichsanweisungen ( 430 . 432 . 434 . 438 . 442 ) that preceded the DCS instruction ( 446 ) with the least amount of posture change over all DCS statements, keeping their order after the last DCA statement ( 446 ) are moved. Method according to one of claims 8 to 11, characterized in that - before the first instruction ( 430 ) in the instruction list a safety instruction ( 452 ) to save the memory area ( 468 ), which is executed when the first DCS instruction ( 446 ), is inserted in a temporary memory and - the equal-range instructions ( 430 . 432 . 434 ) of the instruction list relating to one in this memory area ( 468 ), are modified to read their data from this temporary memory. Method according to one of the preceding claims 8 to 11, characterized in that in the instruction list copy statements that refer to DC areas in the original memory content, which are overwritten when executing the first Gleichbereichsanweisung by Ein replace instructions that provide for inserting the contents of the affected dicates as new ranges into the data memory at the locations provided according to destination memory contents. Method according to one of the preceding claims, characterized in that the original memory content ( 10a ) and the destination memory content ( 10b ) discrete data records ( 12 ) exhibit. A method according to claim 14, characterized in that the DC ranges based on comparisons between data sets ( 12 ) of the original memory contents ( 10a ) and destination memory content ( 10b ) be determined. Method according to claim 15, characterized in that the data sets ( 12 ) in each case a unique identification key (A, B, C, D, E, F, H, J, K, M, O, P, Q, R) is assigned and to determine the DC areas exclusively records ( 12 ) of the original memory contents ( 10a ) and destination memory content ( 10b ) having the identical unique identification key (A, C, E, F, H, J, M, P, R) are compared with each other. A method according to claim 16, characterized in that the identification keys (A, B, C, D, E, F, H, J, K, M, O, P, Q, R) are elements of a sortable amount and the data sets ( 12 ) of the original memory contents ( 10a ) and destination memory content ( 10b ) are sorted in the same way. Method according to one of the preceding claims, characterized in that the statement list contains index statements that the adaptation of an index table related to the data store describe. Method according to claim 18, characterized that in the statement list index statements for adjusting the Index table only for those Posts the index table, their change is not implicit the Gleichbereichsanweisungen. Use of a product produced according to one of the preceding claims Statement list, the instruction list being sent to a data processing system transmitted with a data memory and it updates the data store using the statement list. Use according to claim 20, characterized that when updating the data in the data store using the Instruction List an adjustment of index entries of an index table is performed. Use according to claim 21, characterized that the adjustment of index entries, the one on a DC have related destination address, to the effect that the destination address according to the attitude change value adapted to the corresponding equal-range instruction. Use according to claim 21 or 22, characterized in that Index entries which have a destination address that refers to a non-destination content Memory contents are automatically deleted during the update.