Hi,
We’ve been working with Smoothieboards for over 4 years now. We were able to solve quite some issues, but one thing remains elusive. It appears M-codes are processed in their own timeline, quite independent of G-code processing. When printing a G-code file that contains M-codes, the M-codes are sometimes processed earlier and sometime processed later with respect to the G-codes in the file. Ideally what we would like to see, is that the M-code is processed after the previous G-code has been executed end before the next G-code is processed, i.e. in the original order in the file. Our current work-around is to add at least 40 bogus print moves before and after each M-code to make absolutely sure the M-code is processed at the right moment. The number 40 has been chosen because we feel that it has something to do with the length of the print queue. This of course is quite a silly solution. There must be better way to ensure the M-codes are executed at the right time as indicated above. Does someone have the a solution?
Thanks!
Marc
Imported from wikidot