From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-0.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD, FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: 103376,40c39923d4ce99fe,start X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Received: by 10.68.235.4 with SMTP id ui4mr5115307pbc.3.1331662065237; Tue, 13 Mar 2012 11:07:45 -0700 (PDT) Path: h9ni22180pbe.0!nntp.google.com!news2.google.com!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail From: Anh Vo Newsgroups: comp.lang.ada Subject: Endian problems - what best way to solve it with least effort Date: Tue, 13 Mar 2012 11:00:51 -0700 (PDT) Organization: http://groups.google.com Message-ID: <10483391.72.1331661651734.JavaMail.geo-discussion-forums@vbdj6> NNTP-Posting-Host: 149.32.224.35 Mime-Version: 1.0 X-Trace: posting.google.com 1331662064 32616 127.0.0.1 (13 Mar 2012 18:07:44 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Tue, 13 Mar 2012 18:07:44 +0000 (UTC) Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=149.32.224.35; posting-account=Qh2kiQoAAADpCLlhT_KTYoGO8dU3n4I6 User-Agent: G2/1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Date: 2012-03-13T11:00:51-07:00 List-Id: I have an application previously running on Big Endian machine communicatin= g with a client simulator through socket. This client is coded in Java runn= ing on a separate machine. The data exchanged between them have different s= tructures down to bits and bytes. Currently, this application is being ported to GNAT running on RH 5.4 (Litt= le Endian PC machine). As the result, both application and client do not co= mmunicate correctly any longer due to endian mismatched. The reason is that= Java VM uses Big Endian format even though the client runs on a PC. So far, I have come up with a couple ways. However, each of them involves l= ots of efforts. What is the best way to solve it with least effort? Thank you in advance fo= r your suggestion. Anh Vo