Dint bits to an array

[Dariusincj]

Studio 5000 Ladder logic, i have a dint. We will call it Station. I want to see if there is a cleaner way of saying if bit .1 is true, then a dint array we will call SQOArray, SQOArray[1] = 1. If bit .2 is true the SQOArray[2] = 2. But then if bit .3 is true SQOArray[3] = 4, bit .4 is true SQOArray[4] = 8.... if you see what i'm trying to do is use my dint array in an SQO so i can sequence valves for each bit that is true. But if bit 2 is not true, then i leave it a 0. It's mostly used for a pump system. Not sure if this makes any sense. I have instructions now that if bit .1 is true then move a 1 into SQOArray[1], and so on and so forth. So that my SQOArray[0] thru [30] is equal to 0, 1, 2, 4, 8, 16...
Tell me if i'm crazy in trying to do this or if i just need to write out all the move statements.

 

[L33er]

It does!
Use FBC

 

[Sergei Troizky]

You did not say what should be each SQOArray value, if the corresponding bit in Station is Off.
Zero? If yes:
XIC Station.1 OTE SQOArray[1].1
XIC Station.2 OTE SQOArray[2].2
...
XIC Station.30 OTE SQOArray[30].30

But be sure other bits in the destinations are always Off.
This may be achieved by executing FLL before the above code.

 

[Dariusincj]

So i'm wanting the array to be 0 if that station is not enabled. So my SQO could skip over that and go to the next.

 

[Sergei Troizky]

Edited my post before seeing yours. See the edited post above.

 

[drbitboy]

Update II: if we are only going to SQOArray[30] then use the upper construct and use 31 in the LES

Bitwise AND:

MOV 1 j MOV 0 i
LBL x MVM Station j SQOArray ADD i 1 i LES i 32 ADD j j j JMP x

That has an overflow, but the basic idea should work.

Update:

That would work with UDINTs, btw, no overflow, if the ADD j j j were moved to after the LES.

Or this

MOV 1 j MOV 0 i
LBL x MVM Station j SQOArray ADD i 1 i LES i 31 ADD j j j JMP x
MVM Station -2147483648 SQOArray[31]

 

[Sergei Troizky]

drbitboy, it would be little more readable as:
MOV 1 j
MOV 0 i
LBL x
MVM -1 j SQOArray
ADD j j j
ADD i 1 i
LES i 32 JMP x

So where is the Station in this code?.

 

[drbitboy]

drbitboy,

So where is the Station in this code?.

Yeah, I had a brain freeze in the middle there, I had Station where the -1 was, then changed it to -1 for some hallucinogenic episode, then fixed it eventually ...

�� Re

 

[Sergei Troizky]

I intentionally did not suggest a loop, but if using it I would do:

MOV 1 i
LBL x
MOV 0 SQOArray
XIC Station. OTE SQOArray.
ADD i 1 i
LES i 31 JMP x

 

[drbitboy]

P.S. in the time it took to execute this thread you could have done the FLL/XIC brute force ten times over, and it it easier to grow the months hence. Leave the code golf to dilettantes like me.

 

[drbitboy]

I intentionally did not suggest a loop, but if using it I would do:

MOV 1 i
LBL x
MOV 0 SQOArray
XIC Station. OTE SQOArray.
ADD i 1 i
LES i 31 JMP x

Yeah the MVM eliminates the need for the MOV but add the need for the ADD j j j, so I like your loop better

 

[drbitboy]

What about FAL?
- built in loop
- ctl.POS replaces i
- maybe the "&" operator does the bitwise AND in the FAL expression?