| ??? 06/06/07 13:01 Read: times |
#140313 - you need to read it all, THEN process Responding to: ???'s previous message |
you are in a typical J1708 situation and the way I handle it is with a 'circular array'. I have no idea how your 'adapter' works, I do the J1708 in my own code, but I guess the situation is similar.
the maximum record sixe of the j1708 makes a circular array feasible so what I use is typedef struct
{
U8 flags;
U8 length;
U8 priority; // only used for output array
U8 data[21];
} J1708record;
J1708output J1708record[8];
J1708input J1708record[8];Erik
|
| Topic | Author | Date |
| Software design problem | 01/01/70 00:00 | |
| Something like this, maybe? | 01/01/70 00:00 | |
| Well, yes, actually... | 01/01/70 00:00 | |
| Duhr and a question | 01/01/70 00:00 | |
| Which ones did you look at ? | 01/01/70 00:00 | |
| Duhr and an answer | 01/01/70 00:00 | |
| Is it not possible to | 01/01/70 00:00 | |
| Horses for courses | 01/01/70 00:00 | |
| have fun | 01/01/70 00:00 | |
| A Queue? | 01/01/70 00:00 | |
| I used what I called a \'cache\' | 01/01/70 00:00 | |
| Gah, code repost | 01/01/70 00:00 | |
| you need to read it all, THEN process | 01/01/70 00:00 | |
| Your approach is much more general... | 01/01/70 00:00 | |
| Prioritizing? | 01/01/70 00:00 | |
| Some suggestions Bob | 01/01/70 00:00 | |
| Thank you, sir! | 01/01/70 00:00 | |
| Division / modulus not always slow | 01/01/70 00:00 | |
| Are we making this too difficult? | 01/01/70 00:00 | |
I don't think so, it seems to work pretty well... | 01/01/70 00:00 |