Textile machines

Claim 2

The combination comprising a textile material producing machine having at least one electromechanically operated actuating element and means for producing information representative of the status of the machine, and a stored program digital computer, the computer including random access storage means in which is stored information representative of at least one repeated area of the material to be produced, the information relating to a respective repeated area being stored only once in said storage means, said computer also including logic unit means disposed between said storage means and the machine and a control program means, said logic unit means receiving said status information from the machine and acting to produce control information according to said repeated area information and to supply said control information to each said actuating element of the machine as instructed by the control program means in the time available during the operation of the machine, the information representative of each repeated area being stored in said storage means in an order other than that in which the control information is produced for supply to each said actuating element.

Claim 3

The combination according to claim 1 in which said repeated area information stored in said storage means includes a block representative of the control information to be produced by said logic unit means and supplied to at least one actuating element for the production of a repetitive portion of the repeats on the textile material.

Claim 4

The combination according to claim 1 in which a repeated area of the textile material includes a repetitive portion, said stored information representative of said repeated area including a plurality of bit patterns each comprising one or more bits and being stored in a certain order to define the pattern of said repeated area, each kind of bit pattern being uniquely related to one kind of repetitive portion.

Claim 5

The combination according to claim 2 in which a plurality of bit patterns each comprising one or more bits are stored in said storage means in a certain order to define the pattern of a repeated area, each kind of bit pattern being uniquely related to one kind of repetitive portion.

Claim 6

The combination according to claim 3 in which, when a repeated area contains an axis of symmetry, bit patterns are stored for only one of those parts of the repeated area which are in symmetry to each other.

Claim 7

The combination according to claim 4 in which, when a repeated area contains an axis of symmetry, bit patterns are stored for only one of those parts of the repeated area which are in symmetry to each other.

Claim 8

The combination according to claim 3 in which said storage means includes bistable storage elements for storing said bit patterns, each of said bit patterns comprising N bits (where N is an integer), the number of kinds of bit patterns being more than 2N 1 but at the most 2N.

Claim 9

The combination according to claim 4 in which said storage means includes bistable storage elements for storing said bit patterns, each of said bit patterns comprising N bits (where N is an integer), the number of kinds of bit patterns being more than 2N 1 but at the most 2N.

Claim 10

The combination according to claim 5 in which said storage means includes bistable storage elements for storing said bit patterns, each of said bit patterns comprising N bits (where N is an integer), the number of kinds of bit patterns being more than 2N 1 but at the most 2N.

Claim 11

The combination according to claim 6 in which said storage means includes bistable storage elements for storing said bit patterns, each of said bit patterns comprising N bits (where N is an integer), the number of kinds of bit patterns being more than 2N 1 but at the most 2N.

Claim 12

The combination according to claim 3 in which said storage meanS includes individually addressable words each of which comprises a certain number of storage elements, the storage elements of all of said words being in fixed relation to each other, a plurality of first words storing a first predetermined number of bit patterns and a plurality of second words associated with an edge of a repeated area storing a second predetermined number of bit patterns, the total number of the stored bit patterns of said first and second words comprising the pattern data, a number of said first words each containing in at least one corresponding predetermined storage element position one of a set of bit patterns to which access is required consecutively to make the control information available to the machine, said second words each containing at corresponding predetermined storage element positions one of a set of bit patterns to which access is required consecutively to make the control information available to the machine.

Claim 13

The combination according to claim 4 in which said storage means includes individually addressable words each of which comprises a certain number of storage elements, the storage elements of all of said words being in fixed relation to each other, a plurality of first words storing a first predetermined number of bit patterns and a plurality of second words associated with an edge of a repeated area storing a second predetermined number of bit patterns, the total number of the stored bit patterns of said first and second words comprising the pattern data, a number of said first words each containing in at least one corresponding predetermined storage element position one of a set of bit patterns to which access is required consecutively to make the control information available to the machine, said second words each containing at corresponding predetermined storage element positions one of a set of bit patterns to which access is required consecutively to make the control information available to the machine.

Claim 14

The combination according to claim 3 in which said storage means includes individually addressable words each of which comprises a certain number of storage elements, the storage elements of all of said words being in fixed relation to each other, a plurality of first words storing a first predetermined number of bit patterns and a plurality of second words associated with an edge of a repeated area storing a second predetermined number of bit patterns, the total number of the stored bit patterns of said first and second words comprising the pattern data, each of a number of said first words having monotonically increasing addresses containing in at least one corresponding predetermined storage element position one of a set of bit patterns, which must be accessed consecutively to control said machine, the bit patterns in said set being stored in an order such that the word with the lowest order address contains the first bit pattern to which access is required, the words with increasing order addresses respectively containing the subsequent bit patterns to which access is required, and the word with the highest order address containing the last bit pattern to which access is required, each of said second words having monotonically increasing addresses containing in at least one corresponding predetermined storage element position one of a further set of bit patterns, which must be accessed consecutively to control said machine, the bit patterns in said further set being stored in an order such that the word with the lowest order address contains the first bit pattern to which access is required, the words with increasing order addresses respectively containing the subsequent bit patterns to which access is required, and the word with the highest order address containing the last bit pattern to which access is required.

Claim 15

The combination according to claim 4 in which said storage means includes individually addressable words each of which comprises a certain number of storage elements, the storage elements of all Of said words being in fixed relation to each other, a plurality of first words storing a first predetermined number of bit patterns and a plurality of second words associated with an edge of a repeated area storing a second predetermined number of bit patterns, the total number of the stored bit patterns of said first and second words comprising the pattern data, each of a number of said first words having monotonically increasing addresses containing in at least one corresponding predetermined storage element position one of a set of bit patterns, which must be accessed consecutively to control said machine, the bit patterns in said set being stored in an order such that the word with the lowest order address contains the first bit pattern to which access is required, the words with increasing order addresses respectively containing the subsequent bit patterns to which access is required, and the word with the highest order address containing the last bit pattern to which access is required, each of said second words having monotonically increasing addresses containing in at least one corresponding predetermined storage element position one of a further set of bit patterns, which must be accessed consecutively to control said machine, the bit patterns in said further set being stored in an order such that the word with the lowest order address contains the first bit pattern to which access is required, the words with increasing order addresses respectively containing the subsequent bit patterns to which access is required, and the word with the highest order address containing the last bit pattern to which access is required.

Claim 16

The combination according to claim 3 in which said storage means includes individually addressable words each of which comprises a certain number of storage elements, the storage elements of all of said words being in fixed relation to each other, a plurality of first words storing a first predetermined number of bit patterns and a plurality of second words associated with an edge of a repeated area storing a second predetermined number of bit patterns, the total number of the stored bit patterns of said first and second words comprising the pattern data, each of a number of said first words having monotonically increasing addresses containing in at least one corresponding predetermined storage element position one of a set of bit patterns, which must be accessed consecutively to control said machine, the bit patterns in said set being stored in an order such that the word with the highest order address contains the first bit pattern to which access is required, the words with decreasing order addresses respectively contain the subsequent bit patterns to which access is required, and the word with the lowest order address contains the last bit pattern to which access is required, each of said second words having monotonically increasing addresses containing in at least one corresponding predetermined storage element position one of a further set of bit patterns, which must be accessed consecutively to control said machine, the bit patterns in said further set being in an order such that the word with the highest order address contains the first bit pattern to which access is required, the words with decreasing order addresses respectively contain the subsequent bit patterns to which access is required, and the word with the lowest order address contains the last bit pattern to which access is required.

Claim 17

The combination according to claim 4 in which said storage means includes individually addressable words each of which comprises a certain number of storage elements, the storage elements of all of said words being in fixed relation to each other, a plurality of first words storing a first predetermined number of bit patterns and a plurality of second words associated with an edge of a repeated area storing a second predetermined number of bit patterns, the total number of the stored bit patterns of said first and second words comprisinG the pattern data, each of a number of said first words having monotonically increasing addresses containing in at least one corresponding predetermined storage element position one of a set of bit patterns, which must be accessed consecutively to control said machine, the bit patterns in said set being stored in an order such that the word with the highest order address contains the first bit pattern to which access is required, the words with decreasing order addresses respectively contain the subsequent bit patterns to which access is required, and the word with the lowest order address contains the last bit pattern to which access is required, each of said second words having monotonically increasing addresses containing in at least one corresponding predetermined storage element position one of a further set of bit patterns, which must be accessed consecutively to control said machine, the bit patterns in said further set being stored in an order such that the word with the highest order address contains the first bit pattern to which access is required, the words with decreasing order addresses respectively contain the subsequent bit patterns to which access is required, and the word with the lowest order address contains the last bit pattern to which access is required.

Claim 18

The combination according to claim 11 in which a word stored in said storage means includes a mask in the said corresponding predetermined storage element position.

Claim 19

The combination according to claim 12 in which a word stored in said storage means includes a mask in the said corresponding predetermined storage element position.

Claim 20

The combination according to claim 12 in which said control program means is stored in the storage means and includes at least one actuator routine each of which concerns at least one actuating element of said textile machine.

Claim 21

The combination according to claim 14 in which said control program means is stored in the storage means and includes at least one actuator routine each of which concerns at least one actuating element of said textile machine.

Claim 22

The combination according to claim 16 in which said control program means is stored in the storage means and includes at least one actuator routine each of which concerns at least one actuating element of said textile machine.

Claim 23

The combination according to claim 19 in which said control program means includes a first set of words, each holding a different mask, and each actuator routine of said control program includes a number of control program instructions, a said instruction including the address of one word of said first set of words, said logic unit means operating in response to said program instructions to change the address part of said instruction to designate a particular mask at a particular point in time.

Claim 24

The combination according to claim 20 in which said control program means includes a first set of words, each holding a different mask, and each actuator routine of said control program includes a number of control program instructions, a said instruction including the address of one word of said first set of words, said logic unit means operating in response to said program instructions to change the address part of said instruction to designate a particular mask at a particular point in time.

Claim 25

The combination according to claim 21 in which said control program means includes a first set of words, each holding a different mask, and each actuator routine of said control program includes a number of control program instructions, a said instruction including the address of one word of said first set of words, said logic unit means operating in response to said program instructions to change the address part of said instruction to designate a particular mask at a particular point in time.

Claim 26

The combination according to claim 22 in which each actuator routine of said control program means includes at least two of said control program instructions designating particular Masks in said words of said first set.

Claim 27

The combination according to claim 23 in which each actuator routine of said control program means includes at least two of said control program instructions designating particular masks in said words of said first set.

Claim 28

The combination according to claim 24 in which each actuator routine of said control program means includes at least two of said control program instructions designating particular masks in said words of said first set.

Claim 29

The combination according to claim 19 in which said control program means includes a set of subroutines, each actuator routine of said control program means including a control program instruction which contains the address of one said subroutine, and said logic unit means operates in response to said control program means to change the address part of said instruction to refer to a different subroutine when a particular kind of bit pattern is to refer to a different block.

Claim 30

The combination according to claim 20 in which said control program means includes a set of subroutines, each actuator routine of said control program means including a control program instruction which contains the address of one said subroutine, and said logic unit means operates in response to said control program means to change the address part of said instruction to refer to a different subroutine when a particular kind of bit pattern is to refer to a different block.

Claim 31

The combination according to claim 21 in which said control program means includes a set of subroutines, each actuator routine of said control program means including a control program instruction which contains the address of one said subroutine, and said logic unit means operates in response to said control program means to change the address part of said instruction to refer to a different subroutine when a particular kind of bit pattern is to refer to a different block.

Claim 32

The combination according to claim 5 in which said storage means contains individually addressable words each of which comprises a certain number of storage elements, certain of these words storing at least one bit pattern, said control program means being stored in said storage means and including at least one actuator routine each of which concerns at least one actuating element of said textile machine.

Claim 33

The combination according to claim 6 in which said storage means contains individually addressable words each of which comprises a certain number of storage elements, certain of these words storing at least one bit pattern, said control program means being stored in said storage means and including at least one actuator routine each of which concerns at least one actuating element of said textile machine.

Claim 34

The combination according to claim 31 in which each actuator routine includes two words for accessing a word holding bit patterns, and said logic unit means operates in response to said control program means to change the first word of said two words to hold a control program instruction of a certain type according to the sign of the address value in the second word to produce respective parts of the repeated area in both senses of symmetry.

Claim 35

The combination according to claim 32 in which each actuator routine includes two words for accessing a word holding bit patterns, and said logic unit means operates in response to said control program means to change the first word of said two words to hold a control program instruction of a certain type according to the sign of the address value in the second word to produce respective parts of the repeated area in both senses of symmetry.

Claim 36

The combination according to claim 33 in which said control program means also includes a subroutine for accessing the word holding the bit patterns and an instruction related to a negative address value for transferring the control of the logic unit means to said subroutine.

Claim 37

The combination according to claim 34 in which said control program means Also includes a subroutine for accessing the word holding the bit patterns and an instruction related to a negative address value for transferring the control of the logic unit means to said subroutine.

Claim 38

The combination according to claim 31 in which each actuator routine of said control program means includes two words for accessing a word holding bit patterns from said storage means, and the logic unit means operates in response to said control program means to change the first of said two words to hold a control program instruction which decrements the address value contained in the second of said two words to produce a part of a repeated area in one sense of symmetry, and to change said first word to hold a control program instruction which increments said address value to produce a part of said repeated area in the opposite sense of symmetry.

Claim 39

The combination according to claim 32 in which each actuator routine of said control program means includes two words for accessing a word holding bit patterns from said storage means, and the logic unit means operates in response to said control program means to change the first of said two words to hold a control program instruction which decrements the address value contained in the second of said two words to produce a part of a repeated area in one sense of symmetry, and to change said first word to hold a control program instruction which increments said address value to produce a part of said repeated area in the opposite sense of symmetry.

Claim 40

The combination according to claim 11 in which the control program means also includes a set comprised of at least one actuator routine concerning at least one actuating element, and each word of a group of at least two words of the pattern data with addresses n, n + m, n + 2m, etc., contains at least two bit patterns, all said bit patterns in all said words being accessed by at least one actuator routine of said set of actuator routines, the bit patterns being stored in such a manner that each actuator routine in said set first accesses all the bit patterns in one word of said group of words before accessing any bit pattern in any of the remaining words of said group.

Claim 41

The combination according to claim 12 in which the control program means also includes a set comprised of at least one actuator routine concerning at least one actuating element, and each word of a group of at least two words of the pattern data with addresses n, n + m, n + 2m, etc., contains at least two bit patterns, all said bit patterns in all said words being accessed by at least one actuator routine of said set of actuator routines, the bit patterns being stored in such a manner that each actuator routine in said set first accesses all the bit patterns in one word of said group of words before accessing any bit pattern in any of the remaining words of said group.

Claim 42

The combination according to claim 13 in which the control program means also includes a set comprised of at least one actuator routine concerning at least one actuating element, and each word of a group of at least two words of the pattern data with addresses n, n + m, n + 2m, etc., contains at least two bit patterns, all said bit patterns in all said words being accessed by at least one actuator routine of said set of actuator routines, the bit patterns being stored in such a manner that each actuator routine in said set first accesses all the bit patterns in one word of said group of words before accessing any bit pattern in any of the remaining words of said group.

Claim 43

The combination according to claim 14 in which the control program means also includes a set comprised of at least one actuator routine concerning at least one actuating element, and each word of a group of at least two words of the pattern data with addresses n, n + m, n + 2m, etc., contains at least two bit patterns, all said bit patterns in all said words being Accessed by at least one actuator routine of said set of actuator routines, the bit patterns being stored in such a manner that each actuator routine in said set first accesses all the bit patterns in one word of said group of words before accessing any bit pattern in any of the remaining words of said group.

Claim 44

The combination according to claim 15 in which the control program means also includes a set comprised of at least one actuator routine concerning at least one actuating element, and each word of a group of at least two words of the pattern data with addresses n, n + m, n + 2m, etc., contains at least two bit patterns, all said bit patterns in all said words being accessed by at least one actuator routine of said set of actuator routines, the bit patterns being stored in such a manner that each actuator routine in said set first accesses all the bit patterns in one word of said group of words before accessing any bit pattern in any of the remaining words of said group.

Claim 45

The combination according to claim 16 in which the control program means also includes a set comprised of at least one actuator routine concerning at least one actuating element, and each word of a group of at least two words of the pattern data with addresses n, n + m, n + 2m, etc., contains at least two bit patterns, all said bit patterns in all said words being accessed by at least one actuator routine of said set of actuator routines, the bit patterns being stored in such a manner that each actuator routine in said set first accesses all the bit patterns in one word of said group of words before accessing any bit pattern in any of the remaining words of said group.

Claim 46

The combination comprising a textile material producing machine for producing textile material having on a background spaced repeats of a repeated area, said textile machine having at least one electromechanically operated actuating element which moves relative to the material being produced and means for producing information representative of the status of the machine, and a stored program digital computer, the computer including random access storage means in which is stored information representative of a repeated area of the material to be produced, the information relating to the repeated area being stored only once in said storage means and said storage means also having information of the position of the repeats of said repeated area of said textile material, said computer also including logic unit means disposed between said storage means and the machine and a control program means, said logic unit means receiving said status information from the machine and acting to produce control information according to said repeated area information and said position information and to supply said control information to each said actuating element of the machine as instructed by the control program means in the time available during the operation of the machine, the information representative of each repeated area being stored in said storage means in an order other than that in which the control information is produced for supply to each said actuating element, said control program means also including actuator routines each of which is related to a respective number of actuating elements of the textile machine, said logic unit means as instructed by a said actuator routine calculating the data to be output to said respective number of actuating elements for each successive relative position of said respective actuating elements with respect to the material, said logic unit means so acting at a particular point in time for a future relative position of said respective number of actuating elements with respect to the material, said future relative position being at least one position in the sequence of relative positions ahead of the actual relative position of said respective number of actuating elements with respect to the material at said particular point in time, each of said actUator routines of said control program means including data which defines both a further relative position for said respective actuating elements with respect to one of the repeated areas and corresponding to said future relative position, and whether said further relative position lies within one of the said repeats.

Claim 47

The combination comprising a textile material producing machine for producing textile material having on a background spaced repeats of a repeated area, said textile machine having at least one electromechanically operated actuating element which moves relative to the material being produced and means for producing information representative of the status of the machine, and a stored program digital computer, the computer including random access storage means in which is stored information representative of a repeated area of the material to be produced, the information relating to the repeated area being stored only once in said storage means and said storage means also having information of the position of the repeats of said repeated area of said textile material, said computer also including logic unit means disposed between said storage means and the machine and a control program means, said logic unit means receiving said status information from the machine and acting to produce control information according to said repeated area information and said position information and to supply said control information to each said actuating element of the machine as instructed by the control program means in the time available during the operation of the machine, the information representative of each repeated area being stored in said storage means in an order other than that in which the control information is produced for supply to each said actuating element, said control program means also including actuator routines each of which is related to a respective number of actuating elements of the textile machine, said logic unit means as instructed by a said actuator routine calculating the data to be output to said respective number of actuating elements for each successive relative position of said respective actuating elements with respect to the material, said logic unit means so acting at a particular point in time for a future relative position of said respective number of actuating elements with respect to the material, said future relative position being at least one position in the sequence of relative positions ahead of the actual relative position of said respective number of actuating elements with respect to the material at said particular point in time, each of said actUator routines of said control program means including data which defines both a further relative position for said respective actuating elements with respect to one of the repeated areas and corresponding to said future relative position, and whether said further relative position lies within one of the said repeats.

Claim 48

The combination according to claim 45 wherein said control program means also includes a reset routine and setup routine said reset routine providing a said actuator routine with means to operate said logic unit means to produce a pattern on the background of the material whenever its respective further relative position becomes external to all of the said repeats, and said setup routine removing said means from an actuator routine whenever its respective further relative position becomes internal to one of the said repeats.

Claim 49

The combination according to claim 45 wherein each said further relative position has two co-ordinates one of which changes more frequently than the other, said control program means determining whether one of said further relative positions has become internal to one of the said repeats only when its most frequently changing co-ordinate becomes equal to the respective co-ordinate of a boundary between a repeat and the background, information being stored for each actuator routine for the purpose of said determination.

Claim 50

The combination according to claim 46 wherein each said further relative position has two co-ordinates one of which changes more frequently than the other, said control program means determining whether one of said further relative positions has become internal to one of the said repeats only when its most frequently changing co-ordinate becomes equal to the respective co-ordinate of a boundary between a repeat and the background, information being stored for each actuator routine for the purpose of said determination.

Claim 51

The combination according to claim 47 in which said storage means includes individually addressable words, each of which comprises a predetermined number of storage elements, said storage means including a counter for each actuator routine constituted by a said addressable word for counting according to the most frequently changing co-ordinate of the respective further relative position until it reaches a predetermined number which corresponds to the respective co-ordinate of a boundary between a repeat and the background, it being determined by said logic unit means in response to said control program means whether said further relative position is inside the repeat by reference to the other co-ordinates of the further relative position only when said counter has reached said predetermined number.

Claim 52

The combination according to claim 48 in which said storage means includes individually addressable words, each of which comprises a predetermined number of storage elements, said storage means including a counter for each actuator routine constituted by a said addressable word for counting according to the most frequently changing co-ordinate of the respective further relative position until it reaches a predetermined number which corresponds to the respective co-ordinate of a boundary between a repeat and the background, it being determined by said logic unit means in response to said control program means whether said further relative position is inside the repeat by reference to the other co-ordinates of the further relative position only when said counter has reached said predetermined number.

Claim 53

The combination according to claim 49 in which said storage means stores a table of information containing successive values which correspond to the distances between the successive boundaries.

Claim 54

The combination according to claim 50 in which said storage means stores a table of information containing successive values which correspond to the distances between the successive boundaries.

Claim 55

The combination according to claim 51 in which said table contains the co-ordinates to be tested for each boundary, there being one such co-ordinate, corresponding to the least frequently changing co-ordinates of the further relative positions, for each of the repeats which have a common co-ordinate corresponding to the most frequently changing co-ordinates of the further relative positions, relating to that boundary.

Claim 56

The combination according to claim 52 in which said table contains the co-ordinates to be tested for each boundary, there being one such co-ordinate, corresponding to the least frequently changing co-ordinates of the further relative positions, for each of the repeats which have a common co-ordinate corresponding to the most frequently changing co-ordinates of the further relative positions, relating to that boundary.

Claim 57

The combination according to claim 53 wherein said logic unit means operates in response to said control program means to test when the last item in the said table has been reached and resume operation at the first item, for repeated use of the said table during the continuous operation of the machine to produce a two-dimensional textile material in which the arrangement of repeats is itself repeated.

Claim 58

The combination according to claim 54 wherein said logic unit means operates in response to said control program means to test when the last item in the said table has been reached and resume operation at the first item, for repeated use of the said table during the continuous operation of the machine to produce a two-dimensional textile material in which the arrangement of repeats is itself repeated.

Claim 59

The combination according to claim 55 in which the values of the co-ordinates in the said table are referred to an axis which extends in the direction of the most frequently changing co-ordinates of said further relative positions, which axis coincides with a further boundary line between one of the repeats and the background.

Claim 60

The combination according to claim 56 in which the values of the co-ordinates in the said table are referred to an axis which extends in the direction of the most frequently changing co-ordinates of said further relative positions, which axis coincides with a further boundary line between one of the repeats and the background.

Claim 61

The combination according to claim 57 in which said table includes an additional co-ordinate for each repeat which extends across said axis.

Claim 62

The combination according to claim 58 in which said table includes an additional co-ordinate for each repeat which extends across said axis.

Claim 63

The combination according to claim 51 in which a word including an index is stored in said storage means for each actuator routine in order to facilitate access to the data stored in the said table.

Claim 64

The combination according to claim 52 in which a word including an index is stored in said storage means for each actuator routine in order to facilitate access to the data stored in the said table.

Claim 65

The combination according to claim 45 wherein said control program means is stored in the storage means and includes a set of subroutines, each actuator routine including a control program instruction which includes the address of the word at which one subroutine out of said set of subroutines starts, the logic unit means operating in response to the control program to change the address part of said instruction to designate different subroutines at different points in time according to the nature of that part of the pattern which corresponds to the respective further relative position at a certain point in time.

Claim 66

The combination according to claim 19 wherein said control program means includes a set of words, each of which holds a different mask, and each actuator routine includes a control program instruction which includes the address of one said word, the logic unit means operating in response to said control program means to change the address part of said instruction to refer to a different subroutine when a particular kind of bit pattern is to refer to a different block.

Claim 67

The combination according to claim 20 wherein said control program means includes a set of words, each of which holds a different mask, and each actuator routine includes a control program instruction which includes the address of one said word, the logic unit means operating in response to said control program means to change the address part of said instruction to refer to a different subroutine when a particular kind of bit pattern is to refer to a different block.

Claim 68

The combination according to claim 21 wherein said control program means includes a set of words, each of which holds a different mask, and each actuator routine includes a control program instruction which includes the address of one said word, the logic unit means operating in response to said control program means to change the address part of said instruction to refer to a different subroutine when a particular kind of bit pattern is to refer to a different block.