3 /* ddt_remote - Stuff needed to get datadescs about remote hosts */
5 /* Authors: Olivier Aumage, Martin Quinson */
6 /* Copyright (C) 2003, 2004 the GRAS posse. */
8 /* This program is free software; you can redistribute it and/or modify it
9 under the terms of the license (GNU LGPL) which comes with this package. */
11 /************************************************************************/
12 /* C combines the power of assembler with the portability of assembler. */
13 /************************************************************************/
15 #include "DataDesc/datadesc_private.h"
17 GRAS_LOG_NEW_DEFAULT_SUBCATEGORY(convert,datadesc);
20 *** Table of all known architectures:
22 *** l C<1/1> I<2/2:4/4:4/4:8/4> P<4/4:4/4> D<4/4:8/4>
23 *** l C<1/1> I<2/2:4/4:8/8:8/8> P<4/4:4/4> D<4/4:8/8>
24 *** B C<1/1> I<2/2:4/4:4/8:8/8> P<4/4:4/4> D<4/4:8/4>
25 *** B C<1/1> I<2/2:4/8:8/8:8/8> P<4/4:4/4> D<4/4:8/4>
29 const gras_arch_desc_t gras_arches[gras_arch_count] = {
30 {"little32", 0, {1,2,4,4,8, 4,4, 4,8}, 4},
31 // {1,2,4,4,4, 4,4, 4,4}},
33 {"little64", 0, {1,2,4,8,8, 8,8, 4,8}, 8},
34 // {1,2,4,8,8, 8,8, 4,8}},
36 {"big32", 1, {1,2,4,4,8, 4,4, 4,8}, 8},
37 // {1,2,4,4,8, 4,4, 4,8}},
39 {"big64", 1, {1,2,4,8,8, 8,8, 4,8}, 8}
40 // {1,2,4,8,8, 8,8, 4,8}}
43 const char *gras_datadesc_arch_name(int code) {
44 if (code < 0 || code >= gras_arch_count)
45 return "[unknown arch]";
46 return gras_arches[code].name;
50 * Local function doing the grunt work
53 gras_dd_reverse_bytes(void *to,
59 * gras_dd_convert_elm:
61 * Convert the element described by @type comming from architecture @r_arch.
62 * The data to be converted is stored in @src, and is to be stored in @dst.
63 * Both pointers may be the same location if no resizing is needed.
66 gras_dd_convert_elm(gras_datadesc_type_t *type, int count,
68 void *src, void *dst) {
69 gras_dd_cat_scalar_t scal = type->category.scalar_data;
73 size_t r_size, l_size;
74 /* Hexadecimal displayer
81 gras_assert(type->category_code == e_gras_datadesc_type_cat_scalar);
84 r_size = type->size[r_arch];
85 l_size = type->size[GRAS_THISARCH];
86 DEBUG4("r_size=%d l_size=%d, src=%p dst=%p",
87 r_size,l_size,src,dst);
89 if (r_arch == GRAS_THISARCH) {
90 DEBUG0("No conversion needed");
94 r_size = type->size[r_arch];
95 l_size = type->size[GRAS_THISARCH];
97 DEBUG2("remote=%c local=%c", gras_arches[r_arch].endian?'B':'l',
98 gras_arches[GRAS_THISARCH].endian?'B':'l');
100 if(r_size != l_size) {
101 for(cpt = 0, r_data = src, l_data = dst;
104 r_data = (char *)r_data + r_size,
105 l_data = (char *)l_data + l_size) {
108 fprintf(stderr,"r_data=");
109 for (cpt=0; cpt<r_size; cpt++) {
111 tester.c[0]= ((char*)r_data)[cpt];
112 fprintf(stderr,"\\%02x", tester.i);
114 fprintf(stderr,"\n");
117 /* Resize that damn integer, pal */
119 unsigned char *l_sign, *r_sign;
121 int sizeChange = l_size - r_size;
122 int lowOrderFirst = !gras_arches[r_arch].endian ||
123 gras_arches[r_arch].endian == gras_arches[GRAS_THISARCH].endian;
125 DEBUG5("Resize integer %d from %d @%p to %d @%p",
126 cpt, r_size,r_data, l_size,l_data);
127 gras_assert0(r_data != l_data, "Impossible to resize in place");
130 DEBUG3("Truncate %d bytes (%s,%s)", -sizeChange,
131 lowOrderFirst?"lowOrderFirst":"bigOrderFirst",
132 scal.encoding == e_gras_dd_scalar_encoding_sint?"signed":"unsigned");
133 /* Truncate high-order bytes. */
135 gras_arches[r_arch].endian ? ((char*)r_data-sizeChange)
139 if(scal.encoding == e_gras_dd_scalar_encoding_sint) {
140 DEBUG0("This is signed");
141 /* Make sure the high order bit of r_data and l_data are the same */
142 l_sign = gras_arches[GRAS_THISARCH].endian
143 ? ((unsigned char*)l_data + l_size - 1)
144 : (unsigned char*)l_data;
145 r_sign = gras_arches[r_arch].endian
146 ? ((unsigned char*)r_data + r_size - 1)
147 : (unsigned char*)r_data;
148 DEBUG2("This is signed (r_sign=%c l_sign=%c", *r_sign,*l_sign);
150 if ((*r_sign > 127) != (*l_sign > 127)) {
158 DEBUG1("Extend %d bytes", sizeChange);
159 if (scal.encoding != e_gras_dd_scalar_encoding_sint) {
160 DEBUG0("This is signed");
161 padding = 0; /* pad unsigned with 0 */
164 r_sign = gras_arches[r_arch].endian ? ((unsigned char*)r_data + r_size - 1)
165 : (unsigned char*)r_data;
166 padding = (*r_sign > 127) ? 0xff : 0;
169 memset(l_data, padding, l_size);
170 memcpy(!gras_arches[r_arch].endian ? l_data : ((char *)l_data + sizeChange),
174 fprintf(stderr,"r_data=");
175 for (cpt=0; cpt<r_size; cpt++) {
177 tester.c[0] = ((char*)r_data)[cpt];
178 fprintf(stderr,"\\%02x", tester.i);
180 fprintf(stderr,"\n");
182 fprintf(stderr,"l_data=");
183 for (cpt=0; cpt<l_size; cpt++) {
185 tester.c[0]= ((char*)l_data)[cpt];
186 fprintf(stderr,"\\%02x", tester.i);
187 } fprintf(stderr,"\n");
193 /* flip bytes if needed */
194 if(gras_arches[r_arch].endian != gras_arches[GRAS_THISARCH].endian &&
195 (l_size * count) > 1) {
197 for(cpt = 0, r_data=dst, l_data=dst;
200 r_data = (char *)r_data + l_size, /* resizing already done */
201 l_data = (char *)l_data + l_size) {
203 DEBUG1("Flip elm %d",cpt);
204 gras_dd_reverse_bytes(l_data, r_data, l_size);
212 gras_dd_reverse_bytes(void *to,
217 const char *fromBegin;
222 for(fromBegin = (const char *)from,
223 fromEnd = fromBegin + length - 1,
224 toBegin = (char *)to,
225 toEnd = toBegin + length - 1;
227 fromBegin <= fromEnd;
229 fromBegin++, fromEnd--,
230 toBegin++, toEnd--) {
232 charBegin = *fromBegin;
242 * returns the ID of the architecture the process is running on
245 gras_arch_selfid(void) {
246 return GRAS_THISARCH;