comp.lang.ada
 help / color / mirror / Atom feed
* Converting application from BIG ENDIAN to LITTLE ENDIAN machine
@ 2004-04-23 15:50 Claude Riendeau
  2004-04-23 17:16 ` Jean-Pierre Rosen
                   ` (2 more replies)
  0 siblings, 3 replies; 5+ messages in thread
From: Claude Riendeau @ 2004-04-23 15:50 UTC (permalink / raw)


Hello

I'm new to ADA and this is probably a classical.

I have to have this large application that was programmed for a BIG
ENDIAN machine to run on a LITTLE ENDIAN machine.  I need to reorder
all the records BIT definitions (at 0 range 3 .. 12), and I have
10000+ lines of code to convert.  I'd like to automate this.

I planned to parse the source code and reorder the BIT fields myself,
but most of them contains constants, sizeof statements and
mathematical operations.  I wondered if it would be possible to stop
the ADA compiler in mid course where the compiler definitions would be
resolved, parse the intermediate file with my BIT reordering
application, than let the compiler continue its job.  This would be
like modifying a C preprocessor output.

I use RATIONAL ADA WINDOWS compiler.  Does someone knows how to have
this compiler generate intermediate files?

Does someone has a better approach to this problem?



^ permalink raw reply	[flat|nested] 5+ messages in thread

end of thread, other threads:[~2004-04-23 21:49 UTC | newest]

Thread overview: 5+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2004-04-23 15:50 Converting application from BIG ENDIAN to LITTLE ENDIAN machine Claude Riendeau
2004-04-23 17:16 ` Jean-Pierre Rosen
2004-04-23 18:59 ` Jacob Sparre Andersen
2004-04-23 21:42   ` Stephen Leake
2004-04-23 21:49 ` Stephen Leake

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox