X-Git-Url: https://wimlib.net/git/?p=wimlib;a=blobdiff_plain;f=src%2Flzms_common.c;h=57c17d4d3a5a1ba9bf3b5acff6edcbfeb0a0cb4b;hp=b23a2785fff907dad62f92a749cda041957b7b9c;hb=76689b1cac26c545260568997ae7fb949846f302;hpb=0df43a3aae79370b2af28bce29b0d463cc18247a diff --git a/src/lzms_common.c b/src/lzms_common.c index b23a2785..57c17d4d 100644 --- a/src/lzms_common.c +++ b/src/lzms_common.c @@ -351,9 +351,13 @@ lzms_get_num_offset_slots(size_t uncompressed_size) } void -lzms_init_probability_entries(struct lzms_probability_entry *entries, size_t count) +lzms_init_probabilities(struct lzms_probabilites *probs) { - for (size_t i = 0; i < count; i++) { + struct lzms_probability_entry *entries = + (struct lzms_probability_entry *)probs; + size_t num_entries = sizeof(struct lzms_probabilites) / + sizeof(struct lzms_probability_entry); + for (size_t i = 0; i < num_entries; i++) { entries[i].num_recent_zero_bits = LZMS_INITIAL_PROBABILITY; entries[i].recent_bits = LZMS_INITIAL_RECENT_BITS; } @@ -440,62 +444,69 @@ translate_if_needed(u8 *data, u8 *p, s32 *last_x86_pos, max_trans_offset = LZMS_X86_MAX_TRANSLATION_OFFSET; - if ((*p & 0xFE) == 0xE8) { - if (*p & 0x01) { - /* 0xE9: Jump relative */ - p += 4; - } else { - /* 0xE8: Call relative. Note: 'max_trans_offset' must - * be halved for this instruction. This means that we - * must be more confident that we are in a region of x86 - * machine code before we will do a translation for this - * particular instruction. */ - opcode_nbytes = 1; - max_trans_offset /= 2; - goto have_opcode; - } - } else if ((*p & 0xFB) == 0x48) { - if (*p & 0x04) { - /* 0x4C */ - if (*(p + 1) == 0x8D) { - if ((*(p + 2) & 0x7) == 0x5) { - /* Load effective address relative (x86_64) */ - opcode_nbytes = 3; - goto have_opcode; - } - } - } else { - /* 0x48 */ - if (*(p + 1) == 0x8B) { - if (*(p + 2) == 0x5 || *(p + 2) == 0xD) { - /* Load relative (x86_64) */ - opcode_nbytes = 3; - goto have_opcode; - } - } else if (*(p + 1) == 0x8D) { - if ((*(p + 2) & 0x7) == 0x5) { - /* Load effective address relative (x86_64) */ - opcode_nbytes = 3; - goto have_opcode; - } - } - } - } else { - if (*p & 0x0F) { - /* 0xFF */ - if (*(p + 1) == 0x15) { - /* Call indirect */ + /* + * p[0] has one of the following values: + * 0x48 0x4C 0xE8 0xE9 0xF0 0xFF + */ + + if (p[0] >= 0xF0) { + if (p[0] & 0x0F) { + /* 0xFF (instruction group) */ + if (p[1] == 0x15) { + /* Call indirect relative */ opcode_nbytes = 2; goto have_opcode; } } else { - /* 0xF0 */ - if (*(p + 1) == 0x83 && *(p + 2) == 0x05) { + /* 0xF0 (lock prefix) */ + if (p[1] == 0x83 && p[2] == 0x05) { /* Lock add relative */ opcode_nbytes = 3; goto have_opcode; } } + } else if (p[0] <= 0x4C) { + + /* 0x48 or 0x4C. In 64-bit code this is a REX prefix byte with + * W=1, R=[01], X=0, and B=0, and it will be followed by the + * actual opcode, then additional bytes depending on the opcode. + * We are most interested in several common instructions that + * access data relative to the instruction pointer. These use a + * 1-byte opcode, followed by a ModR/M byte, followed by a + * 4-byte displacement. */ + + /* Test: does the ModR/M byte indicate RIP-relative addressing? + * Note: there seems to be a mistake in the format here; the + * mask really should be 0xC7 instead of 0x07 so that both the + * MOD and R/M fields of ModR/M are tested, not just R/M. */ + if ((p[2] & 0x07) == 0x05) { + /* Check for the LEA (load effective address) or MOV + * (move) opcodes. For MOV there are additional + * restrictions, although it seems they are only helpful + * due to the overly lax ModR/M test. */ + if (p[1] == 0x8D || + (p[1] == 0x8B && !(p[0] & 0x04) && !(p[2] & 0xF0))) + { + opcode_nbytes = 3; + goto have_opcode; + } + } + } else { + if (p[0] & 0x01) { + /* 0xE9: Jump relative. Theoretically this would be + * useful to translate, but in fact it's explicitly + * excluded. Most likely it creates too many false + * positives for the detection algorithm. */ + p += 4; + } else { + /* 0xE8: Call relative. This is a common case, so it + * uses a reduced max_trans_offset. In other words, we + * have to be more confident that the data actually is + * x86 machine code before we'll do the translation. */ + opcode_nbytes = 1; + max_trans_offset >>= 1; + goto have_opcode; + } } return p + 1; @@ -505,15 +516,15 @@ have_opcode: p += opcode_nbytes; if (undo) { if (i - *last_x86_pos <= max_trans_offset) { - u32 n = get_unaligned_u32_le(p); - put_unaligned_u32_le(n - i, p); + u32 n = get_unaligned_le32(p); + put_unaligned_le32(n - i, p); } - target16 = i + get_unaligned_u16_le(p); + target16 = i + get_unaligned_le16(p); } else { - target16 = i + get_unaligned_u16_le(p); + target16 = i + get_unaligned_le16(p); if (i - *last_x86_pos <= max_trans_offset) { - u32 n = get_unaligned_u32_le(p); - put_unaligned_u32_le(n + i, p); + u32 n = get_unaligned_le32(p); + put_unaligned_le32(n + i, p); } }