Please find the attached example. Pay attention to the rules. I entered the numbers in hex when writing the translator but after saving the file MT Pro converts it to decimal so I put the original hex values in comments.
The first translator takes gc and masks the upper 16 bits and puts the result into pp
Then since we are going to be replacing them into the lower bits of gk, we also need to mask out the lower bits.
Finally we perform a bitwise OR operation to combine them into gk
The second translator is similar except we mask the upper bits of gk and we bit shift the masked results of pp.
Then we combine them into gk with a bitwise OR operation.
I also included log statements so that you can see what is happening in the Log window.
Thanks for putting that together. I don’t understand it yet, but it works
One of the things I learned: I’ve been identifying the bits as 1-32, when it is actually 0-31 (?)
But curiosly, I haven’t had any issues, because rr is equal in both the below examples:
Another lesson I learnt in this proces: Due to the sign bit, moving bits around in chunks can’t always be done without changing bits that aren’t moved.
Specifically, moving/mirroring bits 17-32 of one variable to bits 1-16 of another variable changes bits 17-32 of the latter, which wasn’t my intention.
It those cases, I had to mirror the bits individually in order to preserve the settings of the bits that wasn’t meant to change.
It took a while to figure out what was going on, but I found a solution
Yes, I was clearing the bits before putting the new bits in. You need to either use XOR to update the ones ore to perform a ones compliment and AND to Updates the zeros.
Setting a bit
pp=1<<xx - xx is bit number to set
ga=ga|pp
Clearing a bit
pp=1<<xx - xx is bit number to clear
pp=pp^-1
ga=ga&pp
Steve Caldwell
Bome Customer Care
Also available for paid consulting services: bome@sniz.biz
