1 /* disasm.c where all the _work_ gets done in the Netwide Disassembler
3 * The Netwide Assembler is copyright (C) 1996 Simon Tatham and
4 * Julian Hall. All rights reserved. The software is
5 * redistributable under the license given in the file "LICENSE"
6 * distributed in the NASM archive.
8 * initial version 27/iii/95 by Simon Tatham
26 * Flags that go into the `segment' field of `insn' structures
29 #define SEG_RELATIVE 1
36 #define SEG_SIGNED 128
45 uint8_t osize; /* Operand size */
46 uint8_t asize; /* Address size */
47 uint8_t osp; /* Operand size prefix present */
48 uint8_t asp; /* Address size prefix present */
49 uint8_t rep; /* Rep prefix present */
50 uint8_t seg; /* Segment override prefix present */
51 uint8_t lock; /* Lock prefix present */
52 uint8_t rex; /* Rex prefix present */
55 #define getu8(x) (*(uint8_t *)(x))
57 /* Littleendian CPU which can handle unaligned references */
58 #define getu16(x) (*(uint16_t *)(x))
59 #define getu32(x) (*(uint32_t *)(x))
60 #define getu64(x) (*(uint64_t *)(x))
62 static uint16_t getu16(uint8_t *data)
64 return (uint16_t)data[0] + ((uint16_t)data[1] << 8);
66 static uint32_t getu32(uint8_t *data)
68 return (uint32_t)getu16(data) + ((uint32_t)getu16(data+2) << 16);
70 static uint64_t getu64(uint8_t *data)
72 return (uint64_t)getu32(data) + ((uint64_t)getu32(data+4) << 32);
76 #define gets8(x) ((int8_t)getu8(x))
77 #define gets16(x) ((int16_t)getu16(x))
78 #define gets32(x) ((int32_t)getu32(x))
79 #define gets64(x) ((int64_t)getu64(x))
81 /* Important: regval must already have been adjusted for rex extensions */
82 static enum reg_enum whichreg(int32_t regflags, int regval, int rex)
84 if (!(regflags & (REGISTER|REGMEM)))
85 return 0; /* Registers not permissible?! */
89 if (!(REG_AL & ~regflags))
91 if (!(REG_AX & ~regflags))
93 if (!(REG_EAX & ~regflags))
95 if (!(REG_RAX & ~regflags))
97 if (!(REG_DL & ~regflags))
99 if (!(REG_DX & ~regflags))
101 if (!(REG_EDX & ~regflags))
103 if (!(REG_RDX & ~regflags))
105 if (!(REG_CL & ~regflags))
107 if (!(REG_CX & ~regflags))
109 if (!(REG_ECX & ~regflags))
111 if (!(REG_RCX & ~regflags))
113 if (!(FPU0 & ~regflags))
115 if (!(REG_CS & ~regflags))
116 return (regval == 1) ? R_CS : 0;
117 if (!(REG_DESS & ~regflags))
118 return (regval == 0 || regval == 2
119 || regval == 3 ? rd_sreg[regval] : 0);
120 if (!(REG_FSGS & ~regflags))
121 return (regval == 4 || regval == 5 ? rd_sreg[regval] : 0);
122 if (!(REG_SEG67 & ~regflags))
123 return (regval == 6 || regval == 7 ? rd_sreg[regval] : 0);
125 /* All the entries below look up regval in an 16-entry array */
126 if (regval < 0 || regval > 15)
129 if (!(REG8 & ~regflags)) {
131 return rd_reg8_rex[regval];
133 return rd_reg8[regval];
135 if (!(REG16 & ~regflags))
136 return rd_reg16[regval];
137 if (!(REG32 & ~regflags))
138 return rd_reg32[regval];
139 if (!(REG64 & ~regflags))
140 return rd_reg64[regval];
141 if (!(REG_SREG & ~regflags))
142 return rd_sreg[regval & 7]; /* Ignore REX */
143 if (!(REG_CREG & ~regflags))
144 return rd_creg[regval];
145 if (!(REG_DREG & ~regflags))
146 return rd_dreg[regval];
147 if (!(REG_TREG & ~regflags)) {
149 return 0; /* TR registers are ill-defined with rex */
150 return rd_treg[regval];
152 if (!(FPUREG & ~regflags))
153 return rd_fpureg[regval & 7]; /* Ignore REX */
154 if (!(MMXREG & ~regflags))
155 return rd_mmxreg[regval & 7]; /* Ignore REX */
156 if (!(XMMREG & ~regflags))
157 return rd_xmmreg[regval];
162 static const char *whichcond(int condval)
164 static int conds[] = {
165 C_O, C_NO, C_C, C_NC, C_Z, C_NZ, C_NA, C_A,
166 C_S, C_NS, C_PE, C_PO, C_L, C_NL, C_NG, C_G
168 return conditions[conds[condval]];
172 * Process a DREX suffix
174 static uint8_t *do_drex(uint8_t *data, insn *ins)
176 uint8_t drex = *data++;
177 operand *dst = &ins->oprs[ins->drexdst];
179 if ((drex & 8) != ((ins->rex & REX_OC) ? 8 : 0))
180 return NULL; /* OC0 mismatch */
181 ins->rex = (ins->rex & ~7) | (drex & 7);
183 dst->segment = SEG_RMREG;
184 dst->basereg = drex >> 4;
190 * Process an effective address (ModRM) specification.
192 static uint8_t *do_ea(uint8_t *data, int modrm, int asize,
193 int segsize, operand * op, insn *ins)
195 int mod, rm, scale, index, base;
199 mod = (modrm >> 6) & 03;
202 if (mod != 3 && rm == 4 && asize != 16)
205 if (ins->rex & REX_D) {
206 data = do_drex(data, ins);
212 if (mod == 3) { /* pure register version */
213 op->basereg = rm+(rex & REX_B ? 8 : 0);
214 op->segment |= SEG_RMREG;
223 * <mod> specifies the displacement size (none, byte or
224 * word), and <rm> specifies the register combination.
225 * Exception: mod=0,rm=6 does not specify [BP] as one might
226 * expect, but instead specifies [disp16].
228 op->indexreg = op->basereg = -1;
229 op->scale = 1; /* always, in 16 bits */
260 if (rm == 6 && mod == 0) { /* special case */
264 mod = 2; /* fake disp16 */
268 op->segment |= SEG_NODISP;
271 op->segment |= SEG_DISP8;
272 op->offset = (int8_t)*data++;
275 op->segment |= SEG_DISP16;
276 op->offset = *data++;
277 op->offset |= ((unsigned)*data++) << 8;
283 * Once again, <mod> specifies displacement size (this time
284 * none, byte or *dword*), while <rm> specifies the base
285 * register. Again, [EBP] is missing, replaced by a pure
286 * disp32 (this time that's mod=0,rm=*5*) in 32-bit mode,
287 * and RIP-relative addressing in 64-bit mode.
290 * indicates not a single base register, but instead the
291 * presence of a SIB byte...
293 int a64 = asize == 64;
298 op->basereg = rd_reg64[rm | ((rex & REX_B) ? 8 : 0)];
300 op->basereg = rd_reg32[rm | ((rex & REX_B) ? 8 : 0)];
302 if (rm == 5 && mod == 0) {
304 op->eaflags |= EAF_REL;
305 op->segment |= SEG_RELATIVE;
306 mod = 2; /* fake disp32 */
310 op->disp_size = asize;
313 mod = 2; /* fake disp32 */
316 if (rm == 4) { /* process SIB */
317 scale = (sib >> 6) & 03;
318 index = (sib >> 3) & 07;
321 op->scale = 1 << scale;
324 op->indexreg = -1; /* ESP/RSP/R12 cannot be an index */
326 op->indexreg = rd_reg64[index | ((rex & REX_X) ? 8 : 0)];
328 op->indexreg = rd_reg32[index | ((rex & REX_X) ? 8 : 0)];
330 if (base == 5 && mod == 0) {
332 mod = 2; /* Fake disp32 */
334 op->basereg = rd_reg64[base | ((rex & REX_B) ? 8 : 0)];
336 op->basereg = rd_reg32[base | ((rex & REX_B) ? 8 : 0)];
344 op->segment |= SEG_NODISP;
347 op->segment |= SEG_DISP8;
348 op->offset = gets8(data);
352 op->segment |= SEG_DISP32;
353 op->offset = gets32(data);
362 * Determine whether the instruction template in t corresponds to the data
363 * stream in data. Return the number of bytes matched if so.
365 #define case4(x) case (x): case (x)+1: case (x)+2: case (x)+3
367 static int matches(const struct itemplate *t, uint8_t *data,
368 const struct prefix_info *prefix, int segsize, insn *ins)
370 uint8_t *r = (uint8_t *)(t->code);
371 uint8_t *origdata = data;
372 bool a_used = false, o_used = false;
373 enum prefixes drep = 0;
374 uint8_t lock = prefix->lock;
375 int osize = prefix->osize;
376 int asize = prefix->asize;
379 int s_field_for = -1; /* No 144/154 series code encountered */
381 for (i = 0; i < MAX_OPERANDS; i++) {
382 ins->oprs[i].segment = ins->oprs[i].disp_size =
383 (segsize == 64 ? SEG_64BIT : segsize == 32 ? SEG_32BIT : 0);
386 ins->rex = prefix->rex;
387 memset(ins->prefixes, 0, sizeof ins->prefixes);
389 if (t->flags & (segsize == 64 ? IF_NOLONG : IF_LONG))
392 if (prefix->rep == 0xF2)
394 else if (prefix->rep == 0xF3)
397 while ((c = *r++) != 0) {
398 opx = &ins->oprs[c & 3];
412 ins->oprs[0].basereg = 0;
415 ins->oprs[0].basereg = 2;
418 ins->oprs[0].basereg = 3;
428 ins->oprs[0].basereg = 4;
431 ins->oprs[0].basereg = 5;
441 ins->oprs[0].basereg = 0;
444 ins->oprs[0].basereg = 1;
447 ins->oprs[0].basereg = 2;
450 ins->oprs[0].basereg = 3;
460 ins->oprs[0].basereg = 4;
463 ins->oprs[0].basereg = 5;
472 int t = *r++, d = *data++;
473 if (d < t || d > t + 7)
476 opx->basereg = (d-t)+
477 (ins->rex & REX_B ? 8 : 0);
478 opx->segment |= SEG_RMREG;
484 opx->offset = (int8_t)*data++;
485 opx->segment |= SEG_SIGNED;
489 opx->offset = *data++;
493 opx->offset = *data++;
497 opx->offset = getu16(data);
503 opx->offset = getu32(data);
506 opx->offset = getu16(data);
509 if (segsize != asize)
510 opx->disp_size = asize;
514 opx->offset = getu32(data);
521 opx->offset = getu16(data);
527 opx->offset = getu32(data);
533 opx->offset = getu64(data);
541 opx->offset = gets8(data++);
542 opx->segment |= SEG_RELATIVE;
546 opx->offset = getu64(data);
551 opx->offset = gets16(data);
553 opx->segment |= SEG_RELATIVE;
554 opx->segment &= ~SEG_32BIT;
558 opx->segment |= SEG_RELATIVE;
560 opx->offset = gets16(data);
562 opx->segment &= ~(SEG_32BIT|SEG_64BIT);
563 } else if (osize == 32) {
564 opx->offset = gets32(data);
566 opx->segment &= ~SEG_64BIT;
567 opx->segment |= SEG_32BIT;
569 if (segsize != osize) {
571 (opx->type & ~SIZE_MASK)
572 | ((osize == 16) ? BITS16 : BITS32);
577 opx->offset = gets32(data);
579 opx->segment |= SEG_32BIT | SEG_RELATIVE;
588 opx->segment |= SEG_RMREG;
589 data = do_ea(data, modrm, asize, segsize,
590 &ins->oprs[(c >> 3) & 3], ins);
593 opx->basereg = ((modrm >> 3)&7)+
594 (ins->rex & REX_R ? 8 : 0);
599 if (s_field_for == (c & 3)) {
600 opx->offset = gets8(data);
603 opx->offset = getu16(data);
610 s_field_for = (*data & 0x02) ? c & 3 : -1;
611 if ((*data++ & ~0x02) != *r++)
616 if (s_field_for == (c & 3)) {
617 opx->offset = gets8(data);
620 opx->offset = getu32(data);
627 ins->drexdst = c & 3;
631 ins->rex |= REX_D|REX_OC;
632 ins->drexdst = c & 3;
641 data = do_drex(data, ins);
648 uint8_t ximm = *data++;
650 ins->oprs[c >> 3].basereg = ximm >> 4;
651 ins->oprs[c >> 3].segment |= SEG_RMREG;
652 ins->oprs[c & 7].offset = ximm & 15;
666 if (((modrm >> 3) & 07) != (c & 07))
667 return false; /* spare field doesn't match up */
668 data = do_ea(data, modrm, asize, segsize,
669 &ins->oprs[(c >> 3) & 07], ins);
690 if (asize != segsize)
704 if (prefix->rex & REX_B)
709 if (prefix->rex & REX_X)
714 if (prefix->rex & REX_R)
719 if (prefix->rex & REX_W)
738 if (osize != (segsize == 16) ? 16 : 32)
745 ins->rex |= REX_W; /* 64-bit only instruction */
751 if (!(ins->rex & (REX_P|REX_W)) || osize != 64)
758 int t = *r++, d = *data++;
759 if (d < t || d > t + 15)
762 ins->condition = d - t;
772 if (prefix->rep != 0xF2)
778 if (prefix->rep != 0xF3)
821 return false; /* Unknown code */
825 /* REX cannot be combined with DREX */
826 if ((ins->rex & REX_D) && (prefix->rex))
830 * Check for unused rep or a/o prefixes.
832 for (i = 0; i < t->operands; i++) {
833 if (ins->oprs[i].segment != SEG_RMREG)
838 if (ins->prefixes[PPS_LREP])
840 ins->prefixes[PPS_LREP] = P_LOCK;
843 if (ins->prefixes[PPS_LREP])
845 ins->prefixes[PPS_LREP] = drep;
848 if (osize != ((segsize == 16) ? 16 : 32)) {
849 enum prefixes pfx = 0;
863 if (ins->prefixes[PPS_OSIZE])
865 ins->prefixes[PPS_OSIZE] = pfx;
868 if (!a_used && asize != segsize) {
869 if (ins->prefixes[PPS_ASIZE])
871 ins->prefixes[PPS_ASIZE] = asize == 16 ? P_A16 : P_A32;
874 /* Fix: check for redundant REX prefixes */
876 return data - origdata;
879 int32_t disasm(uint8_t *data, char *output, int outbufsize, int segsize,
880 int32_t offset, int autosync, uint32_t prefer)
882 const struct itemplate * const *p, * const *best_p;
883 const struct disasm_index *ix;
885 int length, best_length = 0;
887 int i, slen, colon, n;
891 uint32_t goodness, best;
893 struct prefix_info prefix;
896 memset(&ins, 0, sizeof ins);
901 memset(&prefix, 0, sizeof prefix);
902 prefix.asize = segsize;
903 prefix.osize = (segsize == 64) ? 32 : segsize;
907 for (end_prefix = false; !end_prefix; ) {
911 prefix.rep = *data++;
914 prefix.lock = *data++;
917 segover = "cs", prefix.seg = *data++;
920 segover = "ss", prefix.seg = *data++;
923 segover = "ds", prefix.seg = *data++;
926 segover = "es", prefix.seg = *data++;
929 segover = "fs", prefix.seg = *data++;
932 segover = "gs", prefix.seg = *data++;
935 prefix.osize = (segsize == 16) ? 32 : 16;
936 prefix.osp = *data++;
939 prefix.asize = (segsize == 32) ? 16 : 32;
940 prefix.asp = *data++;
943 if (segsize == 64 && (*data & 0xf0) == REX_P) {
944 prefix.rex = *data++;
945 if (prefix.rex & REX_W)
954 best = -1; /* Worst possible */
960 while (ix->n == -1) {
961 ix = (const struct disasm_index *)ix->p + *dp++;
964 p = (const struct itemplate * const *)ix->p;
965 for (n = ix->n; n; n--, p++) {
966 if ((length = matches(*p, data, &prefix, segsize, &tmp_ins))) {
969 * Final check to make sure the types of r/m match up.
970 * XXX: Need to make sure this is actually correct.
972 for (i = 0; i < (*p)->operands; i++) {
973 if (!((*p)->opd[i] & SAME_AS) &&
975 /* If it's a mem-only EA but we have a
977 ((tmp_ins.oprs[i].segment & SEG_RMREG) &&
978 !(MEMORY & ~(*p)->opd[i])) ||
979 /* If it's a reg-only EA but we have a memory
981 (!(tmp_ins.oprs[i].segment & SEG_RMREG) &&
982 !(REG_EA & ~(*p)->opd[i]) &&
983 !((*p)->opd[i] & REG_SMASK)) ||
984 /* Register type mismatch (eg FS vs REG_DESS):
986 ((((*p)->opd[i] & (REGISTER | FPUREG)) ||
987 (tmp_ins.oprs[i].segment & SEG_RMREG)) &&
988 !whichreg((*p)->opd[i],
989 tmp_ins.oprs[i].basereg, tmp_ins.rex))
997 * Note: we always prefer instructions which incorporate
998 * prefixes in the instructions themselves. This is to allow
999 * e.g. PAUSE to be preferred to REP NOP, and deal with
1000 * MMX/SSE instructions where prefixes are used to select
1001 * between MMX and SSE register sets or outright opcode
1006 goodness = ((*p)->flags & IF_PFMASK) ^ prefer;
1008 for (i = 0; i < MAXPREFIX; i++)
1009 if (tmp_ins.prefixes[i])
1011 if (nprefix < best_pref ||
1012 (nprefix == best_pref && goodness < best)) {
1013 /* This is the best one found so far */
1016 best_pref = nprefix;
1017 best_length = length;
1025 return 0; /* no instruction was matched */
1027 /* Pick the best match */
1029 length = best_length;
1033 /* TODO: snprintf returns the value that the string would have if
1034 * the buffer were long enough, and not the actual length of
1035 * the returned string, so each instance of using the return
1036 * value of snprintf should actually be checked to assure that
1037 * the return value is "sane." Maybe a macro wrapper could
1038 * be used for that purpose.
1040 for (i = 0; i < MAXPREFIX; i++)
1041 switch (ins.prefixes[i]) {
1043 slen += snprintf(output + slen, outbufsize - slen, "lock ");
1046 slen += snprintf(output + slen, outbufsize - slen, "rep ");
1049 slen += snprintf(output + slen, outbufsize - slen, "repe ");
1052 slen += snprintf(output + slen, outbufsize - slen, "repne ");
1055 slen += snprintf(output + slen, outbufsize - slen, "a16 ");
1058 slen += snprintf(output + slen, outbufsize - slen, "a32 ");
1061 slen += snprintf(output + slen, outbufsize - slen, "a64 ");
1064 slen += snprintf(output + slen, outbufsize - slen, "o16 ");
1067 slen += snprintf(output + slen, outbufsize - slen, "o32 ");
1070 slen += snprintf(output + slen, outbufsize - slen, "o64 ");
1076 for (i = 0; i < (int)elements(ico); i++)
1077 if ((*p)->opcode == ico[i]) {
1079 snprintf(output + slen, outbufsize - slen, "%s%s", icn[i],
1080 whichcond(ins.condition));
1083 if (i >= (int)elements(ico))
1085 snprintf(output + slen, outbufsize - slen, "%s",
1086 insn_names[(*p)->opcode]);
1088 length += data - origdata; /* fix up for prefixes */
1089 for (i = 0; i < (*p)->operands; i++) {
1090 opflags_t t = (*p)->opd[i];
1091 const operand *o = &ins.oprs[i];
1095 o = &ins.oprs[t & ~SAME_AS];
1096 t = (*p)->opd[t & ~SAME_AS];
1099 output[slen++] = (colon ? ':' : i == 0 ? ' ' : ',');
1102 if (o->segment & SEG_RELATIVE) {
1103 offs += offset + length;
1105 * sort out wraparound
1107 if (!(o->segment & (SEG_32BIT|SEG_64BIT)))
1109 else if (segsize != 64)
1113 * add sync marker, if autosync is on
1124 if ((t & (REGISTER | FPUREG)) ||
1125 (o->segment & SEG_RMREG)) {
1127 reg = whichreg(t, o->basereg, ins.rex);
1129 slen += snprintf(output + slen, outbufsize - slen, "to ");
1130 slen += snprintf(output + slen, outbufsize - slen, "%s",
1131 reg_names[reg - EXPR_REG_START]);
1132 } else if (!(UNITY & ~t)) {
1133 output[slen++] = '1';
1134 } else if (t & IMMEDIATE) {
1137 snprintf(output + slen, outbufsize - slen, "byte ");
1138 if (o->segment & SEG_SIGNED) {
1141 output[slen++] = '-';
1143 output[slen++] = '+';
1145 } else if (t & BITS16) {
1147 snprintf(output + slen, outbufsize - slen, "word ");
1148 } else if (t & BITS32) {
1150 snprintf(output + slen, outbufsize - slen, "dword ");
1151 } else if (t & BITS64) {
1153 snprintf(output + slen, outbufsize - slen, "qword ");
1154 } else if (t & NEAR) {
1156 snprintf(output + slen, outbufsize - slen, "near ");
1157 } else if (t & SHORT) {
1159 snprintf(output + slen, outbufsize - slen, "short ");
1162 snprintf(output + slen, outbufsize - slen, "0x%"PRIx64"",
1164 } else if (!(MEM_OFFS & ~t)) {
1166 snprintf(output + slen, outbufsize - slen,
1167 "[%s%s%s0x%"PRIx64"]",
1168 (segover ? segover : ""),
1169 (segover ? ":" : ""),
1170 (o->disp_size == 64 ? "qword " :
1171 o->disp_size == 32 ? "dword " :
1172 o->disp_size == 16 ? "word " : ""), offs);
1174 } else if (!(REGMEM & ~t)) {
1175 int started = false;
1178 snprintf(output + slen, outbufsize - slen, "byte ");
1181 snprintf(output + slen, outbufsize - slen, "word ");
1184 snprintf(output + slen, outbufsize - slen, "dword ");
1187 snprintf(output + slen, outbufsize - slen, "qword ");
1190 snprintf(output + slen, outbufsize - slen, "tword ");
1193 snprintf(output + slen, outbufsize - slen, "oword ");
1195 slen += snprintf(output + slen, outbufsize - slen, "far ");
1198 snprintf(output + slen, outbufsize - slen, "near ");
1199 output[slen++] = '[';
1201 slen += snprintf(output + slen, outbufsize - slen, "%s",
1202 (o->disp_size == 64 ? "qword " :
1203 o->disp_size == 32 ? "dword " :
1204 o->disp_size == 16 ? "word " :
1206 if (o->eaflags & EAF_REL)
1207 slen += snprintf(output + slen, outbufsize - slen, "rel ");
1210 snprintf(output + slen, outbufsize - slen, "%s:",
1214 if (o->basereg != -1) {
1215 slen += snprintf(output + slen, outbufsize - slen, "%s",
1216 reg_names[(o->basereg -
1220 if (o->indexreg != -1) {
1222 output[slen++] = '+';
1223 slen += snprintf(output + slen, outbufsize - slen, "%s",
1224 reg_names[(o->indexreg -
1228 snprintf(output + slen, outbufsize - slen, "*%d",
1234 if (o->segment & SEG_DISP8) {
1236 uint8_t offset = offs;
1237 if ((int8_t)offset < 0) {
1244 snprintf(output + slen, outbufsize - slen, "%s0x%"PRIx8"",
1246 } else if (o->segment & SEG_DISP16) {
1248 uint16_t offset = offs;
1249 if ((int16_t)offset < 0 && started) {
1253 prefix = started ? "+" : "";
1256 snprintf(output + slen, outbufsize - slen,
1257 "%s0x%"PRIx16"", prefix, offset);
1258 } else if (o->segment & SEG_DISP32) {
1259 if (prefix.asize == 64) {
1261 uint64_t offset = (int64_t)(int32_t)offs;
1262 if ((int32_t)offs < 0 && started) {
1266 prefix = started ? "+" : "";
1269 snprintf(output + slen, outbufsize - slen,
1270 "%s0x%"PRIx64"", prefix, offset);
1273 uint32_t offset = offs;
1274 if ((int32_t) offset < 0 && started) {
1278 prefix = started ? "+" : "";
1281 snprintf(output + slen, outbufsize - slen,
1282 "%s0x%"PRIx32"", prefix, offset);
1285 output[slen++] = ']';
1288 snprintf(output + slen, outbufsize - slen, "<operand%d>",
1292 output[slen] = '\0';
1293 if (segover) { /* unused segment override */
1295 int count = slen + 1;
1297 p[count + 3] = p[count];
1298 strncpy(output, segover, 2);
1304 int32_t eatbyte(uint8_t *data, char *output, int outbufsize)
1306 snprintf(output, outbufsize, "db 0x%02X", *data);