Compare bits of dint to another dint value

Hello all,

I have been trying to come up with a solution for the following application and I am drawing a blank.

Compactlogix v20
I am using a MOV-EQU sequencer.

I have six different main steps of which each main step consists of 10 sub-steps. These six main steps with their sub-steps are located in a recipe array. Which is called by the operator.

I am monitoring which main step is in process and at what step the sub-step is at. I also monitor when each main step is complete.

I have an output for each step that tells me it is complete.
i.e, "Sub-Step = 10 --> Main Step Complete"

I need to use the "Step Complete" from each step to reset the machine back its beginning cycle. The problem is that not all of the steps are used for each recipe. Some recipes require all six others may only require two or three. It will vary based on which recipe is running.

This can be done in some lengthy ladder...but was hoping for a more classy approach.
Step1 Complete--] [--Step2 Complete--] [--Recipe Steps=2--Current Recipe Done(OTE)

I have the number of steps required stored in an active recipe array as a DINT.
I have the current step stored in an DINT.
I have the Step Complete outputs addressed to bits of a DINT.
Step_Complete.0,Step_Complete.1,Step_Complete.2, etc.

So, when trying to compare the "number of steps required DINT" to the "steps completed DINT", I get a value of 6 in the required DINT and 63 in the Completed DINT (if all six steps are complete). This is natural, but I would like to be able to say that 6 equals 63 by some means.

2 shl 6 - 1 = 63
2 shl 5 - 1 = 31

Here is a rung which, for space, only has three steps but you should get the idea.

Actually increase the 'Source B' in each LES by 1

Thank you Bernie & Peter, I really appreciate it.

Not really sure what you meant by "2 shl 6-1=63" though?

Although, I did do a face palm when I saw what you came up with Bernie. Sometimes there are no pre-fabbed solutions in the form of a drag and drop instruction.

Peter was showing how to get '63' from '6' by shifting the value '2' to the left by the number ('6') then subtracting '1'. That could have been used to generate the number that you would compare to the bit word.

Actually, Peter's note started a new way of thinking about this. If the 'Step_Complete' word is zeroed before the steps begin and the 'complete' bits are turned on starting with the lowest and working up then the attached code works just as well.

Thanks Bernie, I like that way much better. And thank you for clarifying what Peter meant. I see what he was trying to tell me now.

seth350 said:

Thank you Bernie & Peter, I really appreciate it.

Not really sure what you meant by "2 shl 6-1=63" though?

Although, I did do a face palm when I saw what you came up with Bernie. Sometimes there are no pre-fabbed solutions in the form of a drag and drop instruction.

Click to expand...

Actually it should be 1 shift left 6.
SHL or << is commonly used for shift left.
SHR or >> is commonly used for shift right.

seth350 said:

I have the number of steps required stored in an active recipe array as a DINT.
I have the current step stored in an DINT.
I have the Step Complete outputs addressed to bits of a DINT.
Step_Complete.0,Step_Complete.1,Step_Complete.2, etc.

So, when trying to compare the "number of steps required DINT" to the "steps completed DINT", I get a value of 6 in the required DINT and 63 in the Completed DINT (if all six steps are complete). This is natural, but I would like to be able to say that 6 equals 63 by some means.

Click to expand...

In S7 I would do it like this:
L diStepsCompleted
L diStepsRequired
AD // and-ing 32-bits double
L diStepsRequired
=D // Comparing double if equal
=xFinito //Finished, fertig, conec, coffeetime!!!

Kalle