scientific-method-engine 16.1.0__tar.gz → 17.0.0__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/PKG-INFO +1 -1
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/pyproject.toml +1 -1
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/cli.py +2 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/reports.py +91 -14
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_x86.py +105 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/.gitignore +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/LICENSE +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/README.md +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/__init__.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/__main__.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ClearNoReturnFunctions.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/CreateFunctions.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ExportBoundedFlow.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ExportCallEdges.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ExportFunctionFingerprints.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ExportFunctionInventory.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/MergeFallThroughFragment.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/RecoverCitedFunctions.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/RepairReturningCallers.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportCallArguments.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportCallPaths.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportCallSitesWithScalars.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportCallsToRange.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportConstantFirstArgumentCalls.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportDataBytes.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportDecompileMatches.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportDecompileWindow.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportFilePatternInMemory.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportFirstArgumentCallSummary.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportFunctionScalarConstants.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportFunctionSummary.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportInstructionContext.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportInstructionWindow.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportMemoryBlockForFileOffset.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportMemoryBlocks.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportRandomnessCandidates.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportRangeBoundaries.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportReferences.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportScalarConstants.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportStringReferences.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/ReportSymbolReferences.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/scientificmethod/FirstArgumentLookBack.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/scientificmethod/InstructionStart.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/scientificmethod/OperandConstants.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/ghidra/scientificmethod/Xxh3.java +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/__init__.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/argument_frames.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/dispatch.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/effect_order.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/image.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/inventory.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/loops.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/machine.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/memory_scopes.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/pcode.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/pcode_backend.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/pe.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/reach.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/relational.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/result_flow.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/trace.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/src/scientific_method_engine/x86/values.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/oracle.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_continuation_budget.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_dispatch.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_effect_order.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_enter_frames.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_entry_frame.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_indirect_far_transfers.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_interrupt_models.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_inventory_check.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_join_terms.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_loops.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_memory_scopes.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_nested_frame_request.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_oracle.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_pe.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_reach.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_relational_controls.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_return_checks.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_successor_rule.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_table_continuations.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_term_limit.py +0 -0
- {scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_volatile_memory.py +0 -0
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
Metadata-Version: 2.5
|
|
2
2
|
Name: scientific-method-engine
|
|
3
|
-
Version:
|
|
3
|
+
Version: 17.0.0
|
|
4
4
|
Summary: Bounded instruction-derived x86 evidence reports for segmented MZ/FBOV and PE32/i386 code.
|
|
5
5
|
Project-URL: Source, https://github.com/kibertoad/refurbished-dinosaurs-toolkit/tree/main/packages/scientific-method-engine
|
|
6
6
|
Author: kibertoad
|
|
@@ -5,7 +5,7 @@ build-backend = "hatchling.build"
|
|
|
5
5
|
[project]
|
|
6
6
|
name = "scientific-method-engine"
|
|
7
7
|
# The release workflow writes the published version from the package's release tag.
|
|
8
|
-
version = "
|
|
8
|
+
version = "17.0.0"
|
|
9
9
|
description = "Bounded instruction-derived x86 evidence reports for segmented MZ/FBOV and PE32/i386 code."
|
|
10
10
|
readme = "README.md"
|
|
11
11
|
requires-python = ">=3.12"
|
|
@@ -28,6 +28,8 @@ USAGE = ("Usage: scientific-method-engine <operand|operand-candidates|target|bou
|
|
|
28
28
|
"that inventory names and lists each target no row starts at: inside another row's body or outside every row,\n"
|
|
29
29
|
"with one calling site, near or far, and whether an entry-path call, a contested one or only raw bytes call it;\n"
|
|
30
30
|
"a target inside an instruction the entry-path walk established from another start names it as insideInstruction.\n"
|
|
31
|
+
"uses matches accesses whose footprint intersects query offset..offset+width; its rawCandidates give each unreached\n"
|
|
32
|
+
"operand's encoded displacement, width, access, segment register and intersection, and never count as uses.\n"
|
|
31
33
|
"trace, arguments, effects, returns, guards, memory and allocation check relationalControls:\n"
|
|
32
34
|
"a violated control fails the report; an undecided one is reported and never counts as held.\n"
|
|
33
35
|
"A lastWriter control with an address inspects that memory at its checkpoint anchors without a read.\n"
|
|
@@ -22,8 +22,8 @@ def entries(image):
|
|
|
22
22
|
|
|
23
23
|
|
|
24
24
|
def memory_width(ins, operand):
|
|
25
|
-
# Capstone reports the LDS/LES source as a word, but the load reads the full selector:offset pointer.
|
|
26
|
-
return 2 + ins.operands[0].size if ins.mnemonic in ("lds", "les") else operand.size
|
|
25
|
+
# Capstone reports the LDS/LES/LSS/LFS/LGS source as a word, but the load reads the full selector:offset pointer.
|
|
26
|
+
return 2 + ins.operands[0].size if ins.mnemonic in ("lds", "les", "lss", "lfs", "lgs") else operand.size
|
|
27
27
|
|
|
28
28
|
|
|
29
29
|
# Capstone reports several x87 stores (fst, fstp m32/m64, fist, fistp m16/m32, fnstcw) as reads and frstor
|
|
@@ -336,6 +336,73 @@ def _caller_continuations(image, stop, reason, stack, limit, cache, modeled=froz
|
|
|
336
336
|
return rows, []
|
|
337
337
|
|
|
338
338
|
|
|
339
|
+
# Memory operands whose Capstone size is not the bytes the instruction touches: x87 environment and
|
|
340
|
+
# state images, and FXSAVE/XSAVE areas. Their footprint is reported as unknown, never as Capstone's size.
|
|
341
|
+
UNKNOWN_FOOTPRINT = frozenset(("fnstenv", "fstenv", "fldenv", "fnsave", "fsave", "frstor", "fxsave", "fxrstor",
|
|
342
|
+
"fxsave64", "fxrstor64", "xsave", "xrstor", "xsaveopt", "xsavec", "xsaves", "xrstors"))
|
|
343
|
+
|
|
344
|
+
|
|
345
|
+
def footprint_width(ins, operand):
|
|
346
|
+
"""The bytes the memory operand ``operand`` of ``ins`` touches, or None when no established source gives
|
|
347
|
+
them: the mnemonics of ``UNKNOWN_FOOTPRINT``, and an operand Capstone gives no size."""
|
|
348
|
+
return None if base_mnemonic(ins) in UNKNOWN_FOOTPRINT or not operand.size else memory_width(ins, operand)
|
|
349
|
+
|
|
350
|
+
|
|
351
|
+
def _footprint(ins, operand, start, offset, width):
|
|
352
|
+
"""How the memory operand ``operand`` of ``ins``, starting at offset ``start``, meets the query field
|
|
353
|
+
``[offset, offset + width)``: ``(width, wraps, intersection)``, or None when it cannot meet it.
|
|
354
|
+
|
|
355
|
+
A footprint that runs past the top of the instruction's address space (64 KiB for a 16-bit address
|
|
356
|
+
size, 4 GiB for a 32-bit one) wraps to zero. An operand of unknown width extends upward from its start
|
|
357
|
+
by an unknown amount, so it may meet the field when it starts below the field's end, and has no width,
|
|
358
|
+
wrap or intersection; it is not followed past the top of the address space."""
|
|
359
|
+
space = 1 << 8 * ins.addr_size
|
|
360
|
+
size = footprint_width(ins, operand)
|
|
361
|
+
if size is None:
|
|
362
|
+
return None if start >= offset + width else (None, None, None)
|
|
363
|
+
pieces = [(start, min(start + size, space))] + ([(0, start + size - space)] if start + size > space else [])
|
|
364
|
+
hits = [(max(offset, a), min(offset + width, z)) for a, z in pieces if max(offset, a) < min(offset + width, z)]
|
|
365
|
+
return (size, start + size > space, {"start": hits[0][0], "end": hits[0][1]}) if hits else None
|
|
366
|
+
|
|
367
|
+
|
|
368
|
+
def _overlapping(intervals, starts, at, size):
|
|
369
|
+
"""The instructions of ``intervals`` (sorted ``(start, end)`` pairs, with ``starts`` their starts) that
|
|
370
|
+
intersect ``[at, at + size)``, other than one starting at ``at``."""
|
|
371
|
+
# At most 15 bytes precede a partly overlapping x86 instruction.
|
|
372
|
+
lo, hi = bisect_right(starts, at - 15), bisect_right(starts, at + size - 1)
|
|
373
|
+
return [{"site": a, "end": z} for a, z in intervals[lo:hi] if a != at and a < at + size and z > at]
|
|
374
|
+
|
|
375
|
+
|
|
376
|
+
def _raw_footprints(ins, offset, width, mode):
|
|
377
|
+
"""The explicit memory operands of ``ins`` whose encoded footprint may intersect the query field
|
|
378
|
+
``[offset, offset + width)`` with an access the query ``mode`` asks for, with each one's encoded start,
|
|
379
|
+
width, direction and intersection.
|
|
380
|
+
|
|
381
|
+
The encoded start is the displacement, wrapped to the instruction's address size; ``addressRegisters``
|
|
382
|
+
names the base and index registers that move the real address away from it. ``_footprint`` decides
|
|
383
|
+
whether it meets the field. An operand with no access (LEA) is kept under every mode, since what the
|
|
384
|
+
formed address is used for is unknown."""
|
|
385
|
+
rows = []
|
|
386
|
+
for index, operand in enumerate(ins.operands):
|
|
387
|
+
if operand.type != X86_OP_MEM:
|
|
388
|
+
continue
|
|
389
|
+
# LEA forms an address and touches no memory.
|
|
390
|
+
access = [] if ins.mnemonic == "lea" else memory_access(ins, operand)
|
|
391
|
+
if access and mode != "both" and mode not in access:
|
|
392
|
+
continue
|
|
393
|
+
mem = operand.mem
|
|
394
|
+
start = mem.disp & ((1 << 8 * ins.addr_size) - 1)
|
|
395
|
+
footprint = _footprint(ins, operand, start, offset, width)
|
|
396
|
+
if footprint is None:
|
|
397
|
+
continue
|
|
398
|
+
size, wraps, intersection = footprint
|
|
399
|
+
rows.append({"operandIndex": index, "displacement": start,
|
|
400
|
+
"addressRegisters": [ins.reg_name(r) for r in (mem.base, mem.index) if r],
|
|
401
|
+
"width": size, "wraps": wraps, "intersection": intersection, "access": access,
|
|
402
|
+
"effectiveSegmentRegister": segment_register(ins, mem)})
|
|
403
|
+
return rows
|
|
404
|
+
|
|
405
|
+
|
|
339
406
|
def uses(image, config):
|
|
340
407
|
query = config.get("query", {})
|
|
341
408
|
offset = integer(query.get("offset"), 0, image.mask, "query offset")
|
|
@@ -498,16 +565,20 @@ def uses(image, config):
|
|
|
498
565
|
segment_value, offset_value, segment_name = state.address(ins, operand)
|
|
499
566
|
except StopPath as error:
|
|
500
567
|
gaps.append({"site": at, "reason": str(error)}); continue
|
|
501
|
-
size =
|
|
568
|
+
size = footprint_width(ins, operand)
|
|
502
569
|
off = offset_value.number
|
|
503
|
-
|
|
504
|
-
if off is not None and
|
|
570
|
+
footprint = None if off is None else _footprint(ins, operand, off, offset, width)
|
|
571
|
+
if off is not None and footprint is None:
|
|
505
572
|
continue
|
|
573
|
+
# A concrete footprint overlaps the field when it starts inside it, or below it with a known
|
|
574
|
+
# width. One of unknown width, or one that reaches the field only by wrapping past the top of
|
|
575
|
+
# the offset space, is a possible alias.
|
|
576
|
+
overlaps = off is not None and (offset <= off < offset + width or off < offset and footprint[0] is not None)
|
|
506
577
|
for kind in kinds:
|
|
507
578
|
# A concrete segment query cannot bind an unpropagated DS/SS.
|
|
508
579
|
conditional.append({"site": at, "kind": kind, "width": size,
|
|
509
580
|
"segment": segment_value.report(), "offset": offset_value.report(),
|
|
510
|
-
"value": unknown(f"CFG-operand:{at}", size * 8).report(),
|
|
581
|
+
"value": unknown(f"CFG-operand:{at}", None if size is None else size * 8).report(),
|
|
511
582
|
"effectiveSegmentRegister": segment_name,
|
|
512
583
|
"address": "overlaps query" if overlaps and segment is None else "possible alias",
|
|
513
584
|
"classification": ("unverified overlapping instruction path" if at in unverified else
|
|
@@ -522,18 +593,26 @@ def uses(image, config):
|
|
|
522
593
|
raw = []
|
|
523
594
|
scanned_bytes = 0
|
|
524
595
|
byte_limit = scan_limit(image, config.get("scanLimit", 65536))
|
|
596
|
+
# Only entry-path instructions reject a raw candidate's boundary. The walk leaves contested
|
|
597
|
+
# instructions and rejected starts out of seen, since they prove nothing.
|
|
598
|
+
verified = sorted((at, at + ins.size) for at, ins in seen.items())
|
|
599
|
+
verified_starts = [a for a, _ in verified]
|
|
525
600
|
for r in image.regions:
|
|
526
601
|
for at in range(r["start"], r["end"]):
|
|
527
602
|
if scanned_bytes >= byte_limit:
|
|
528
603
|
gaps.append({"region": r["name"], "unsearchedStart": at, "end": r["end"], "reason": "raw scan limit"})
|
|
529
604
|
break
|
|
530
605
|
scanned_bytes += 1
|
|
531
|
-
ins = image.decode(at)
|
|
532
606
|
# An instruction the walk past a stop decoded (one past a PE32 port access) is already inventoried above.
|
|
533
|
-
|
|
534
|
-
|
|
607
|
+
ins = image.decode(at) if at not in seen and at not in after_stop else None
|
|
608
|
+
footprints = _raw_footprints(ins, offset, width, mode) if ins else []
|
|
609
|
+
if footprints:
|
|
535
610
|
if len(raw) < result_limit:
|
|
536
|
-
|
|
611
|
+
inside = _overlapping(verified, verified_starts, at, ins.size)
|
|
612
|
+
raw.append({"site": at, "size": ins.size, "classification": "unverified operand candidate",
|
|
613
|
+
"boundary": "rejectedOverlap" if inside else "unresolvedBoundary",
|
|
614
|
+
"overlapsVerified": inside, "mnemonic": ins.mnemonic, "prefixes": prefixes(ins),
|
|
615
|
+
"operands": footprints})
|
|
537
616
|
else:
|
|
538
617
|
gaps.append({"reason": "raw candidate limit"}); break
|
|
539
618
|
truncated = len(matches) + len(unresolved) + len(conditional) > result_limit
|
|
@@ -600,9 +679,7 @@ def operand_candidates(image, config):
|
|
|
600
679
|
literal = operand.mem.disp if operand.type == X86_OP_MEM else operand.imm
|
|
601
680
|
if literal & image.mask != value:
|
|
602
681
|
continue
|
|
603
|
-
|
|
604
|
-
lo, hi = bisect_right(starts, at - 15), bisect_right(starts, at + ins.size - 1)
|
|
605
|
-
overlaps = [{"site": a, "end": z} for a, z in intervals[lo:hi] if a != at and a < at + ins.size and z > at]
|
|
682
|
+
overlaps = _overlapping(intervals, starts, at, ins.size)
|
|
606
683
|
memory = operand.type == X86_OP_MEM and ins.mnemonic != "lea" and bool(operand.access & (CS_AC_READ | CS_AC_WRITE))
|
|
607
684
|
classification = ("unresolvedBoundary" if at in ambiguous else
|
|
608
685
|
"verifiedMemoryUses" if at in seen and memory else
|
|
@@ -615,7 +692,7 @@ def operand_candidates(image, config):
|
|
|
615
692
|
continue
|
|
616
693
|
rows.append({"site": at, "end": at + ins.size, "operandIndex": index,
|
|
617
694
|
"operandKind": "memory" if operand.type == X86_OP_MEM else "immediate",
|
|
618
|
-
"width":
|
|
695
|
+
"width": memory_width(ins, operand) if operand.type == X86_OP_MEM else operand.size,
|
|
619
696
|
"prefixes": prefixes(ins), "mnemonic": ins.mnemonic,
|
|
620
697
|
"access": [name for flag, name in ((CS_AC_READ, "read"), (CS_AC_WRITE, "write")) if operand.access & flag],
|
|
621
698
|
"effectiveSegmentRegister": segment_register(ins, operand.mem) if operand.type == X86_OP_MEM else None,
|
|
@@ -2593,6 +2593,111 @@ class ReporterTests(unittest.TestCase):
|
|
|
2593
2593
|
r = report("c3 a1 ff 01 c3", "uses", query={"offset": 0x200, "width": 1})
|
|
2594
2594
|
self.assertEqual([c["site"] for c in r["rawCandidates"]], [1])
|
|
2595
2595
|
|
|
2596
|
+
def raw_footprints(self, code, **query):
|
|
2597
|
+
r = report(code, "uses", query=query)
|
|
2598
|
+
return {c["site"]: c for c in r["rawCandidates"]}
|
|
2599
|
+
|
|
2600
|
+
def test_raw_candidates_report_each_operand_footprint_against_the_field(self):
|
|
2601
|
+
# ret; then unreached: mov [30],ax; mov [31],ax; mov [32],ax; mov [33],al; mov [34],ax; ret
|
|
2602
|
+
rows = self.raw_footprints("c3 89 06 1e 00 89 06 1f 00 89 06 20 00 88 06 21 00 89 06 22 00 c3",
|
|
2603
|
+
offset=32, width=2)
|
|
2604
|
+
# The store touching the field from below and the one past its end stay out.
|
|
2605
|
+
self.assertNotIn(1, rows)
|
|
2606
|
+
self.assertNotIn(17, rows)
|
|
2607
|
+
footprint = {at: [(o["displacement"], o["width"], o["intersection"], o["access"]) for o in rows[at]["operands"]]
|
|
2608
|
+
for at in (5, 9, 13)}
|
|
2609
|
+
self.assertEqual(footprint, {
|
|
2610
|
+
5: [(31, 2, {"start": 32, "end": 33}, ["write"])],
|
|
2611
|
+
9: [(32, 2, {"start": 32, "end": 34}, ["write"])],
|
|
2612
|
+
13: [(33, 1, {"start": 33, "end": 34}, ["write"])]})
|
|
2613
|
+
row = rows[5]
|
|
2614
|
+
self.assertEqual((row["classification"], row["boundary"], row["overlapsVerified"], row["mnemonic"]),
|
|
2615
|
+
("unverified operand candidate", "unresolvedBoundary", [], "mov"))
|
|
2616
|
+
self.assertEqual((row["operands"][0]["effectiveSegmentRegister"], row["operands"][0]["addressRegisters"],
|
|
2617
|
+
row["operands"][0]["wraps"], row["operands"][0]["operandIndex"]), ("ds", [], False, 0))
|
|
2618
|
+
|
|
2619
|
+
def test_raw_candidate_footprint_keeps_segment_override_and_address_registers(self):
|
|
2620
|
+
# ret; es: mov [bx+32],ax; mov ax,[bp+32]; ret
|
|
2621
|
+
rows = self.raw_footprints("c3 26 89 47 20 8b 46 20 c3", offset=32, width=2)
|
|
2622
|
+
es, ss = rows[1]["operands"][0], rows[5]["operands"][0]
|
|
2623
|
+
self.assertEqual((es["effectiveSegmentRegister"], es["addressRegisters"], es["access"]), ("es", ["bx"], ["write"]))
|
|
2624
|
+
self.assertEqual(rows[1]["prefixes"], [0x26])
|
|
2625
|
+
self.assertEqual((ss["effectiveSegmentRegister"], ss["addressRegisters"], ss["access"]), ("ss", ["bp"], ["read"]))
|
|
2626
|
+
|
|
2627
|
+
def test_raw_candidate_footprint_wraps_past_the_top_of_the_offset_space(self):
|
|
2628
|
+
rows = self.raw_footprints("c3 89 06 ff ff c3", offset=0, width=1)
|
|
2629
|
+
self.assertEqual([(o["wraps"], o["intersection"]) for o in rows[1]["operands"]], [(True, {"start": 0, "end": 1})])
|
|
2630
|
+
|
|
2631
|
+
def test_raw_candidate_of_unknown_footprint_has_no_width_and_stays_when_it_starts_below_the_field(self):
|
|
2632
|
+
# ret; fnsave [16]; fnsave [80]; ret. Capstone's operand size is not the saved state's size.
|
|
2633
|
+
rows = self.raw_footprints("c3 dd 36 10 00 dd 36 50 00 c3", offset=64, width=2)
|
|
2634
|
+
self.assertEqual(list(rows), [1])
|
|
2635
|
+
self.assertEqual([(o["width"], o["wraps"], o["intersection"], o["access"]) for o in rows[1]["operands"]],
|
|
2636
|
+
[(None, None, None, ["write"])])
|
|
2637
|
+
|
|
2638
|
+
def test_raw_candidate_footprint_of_far_pointer_loads_and_lea(self):
|
|
2639
|
+
# ret; les ax,[31]; lss sp,[30]; lea ax,[32]; ret
|
|
2640
|
+
rows = self.raw_footprints("c3 c4 06 1f 00 0f b2 26 1e 00 8d 06 20 00 c3", offset=32, width=2)
|
|
2641
|
+
self.assertEqual([(o["width"], o["intersection"]) for o in rows[1]["operands"]], [(4, {"start": 32, "end": 34})])
|
|
2642
|
+
self.assertEqual([(o["width"], o["intersection"]) for o in rows[5]["operands"]], [(4, {"start": 32, "end": 34})])
|
|
2643
|
+
self.assertEqual(rows[10]["operands"][0]["access"], [])
|
|
2644
|
+
|
|
2645
|
+
def test_cfg_operand_past_a_stop_takes_the_raw_candidate_footprint(self):
|
|
2646
|
+
# int 3 stops the trace. Past it: fnsave [16], of unknown width below the field, a possible alias;
|
|
2647
|
+
# fnsave [80], past the field's end, left out; mov [0x30],ax, a word below the field, left out.
|
|
2648
|
+
r = report("cd 03 dd 36 10 00 dd 36 50 00 89 06 30 00 c3", "uses", query={"offset": 64, "width": 2})
|
|
2649
|
+
self.assertEqual([(e["site"], e["address"]) for e in r["conditionalAccesses"]], [(2, "possible alias")])
|
|
2650
|
+
# Capstone's size for FNSAVE (4) is not the saved state's size, so the row claims no width.
|
|
2651
|
+
row = r["conditionalAccesses"][0]
|
|
2652
|
+
self.assertEqual((row["width"], row["value"]["bits"]), (None, None))
|
|
2653
|
+
self.assertEqual(r["rawCandidates"], [])
|
|
2654
|
+
# A word at 0xFFFF reaches offset 0 only by wrapping, so it is a possible alias, never an overlap.
|
|
2655
|
+
r = report("cd 03 89 06 ff ff c3", "uses", query={"offset": 0, "width": 1})
|
|
2656
|
+
self.assertEqual([(e["site"], e["address"]) for e in r["conditionalAccesses"]], [(2, "possible alias")])
|
|
2657
|
+
# A word starting below the field overlaps it.
|
|
2658
|
+
r = report("cd 03 89 06 3f 00 c3", "uses", query={"offset": 64, "width": 2}, controls=[2])
|
|
2659
|
+
self.assertEqual([(e["site"], e["address"]) for e in r["conditionalAccesses"]], [(2, "overlaps query")])
|
|
2660
|
+
|
|
2661
|
+
def test_raw_candidates_keep_the_query_access_mode(self):
|
|
2662
|
+
# ret; then unreached: mov ax,[32]; mov [32],ax; lea ax,[32]; ret
|
|
2663
|
+
code = "c3 8b 06 20 00 89 06 20 00 8d 06 20 00 c3"
|
|
2664
|
+
self.assertEqual(list(self.raw_footprints(code, offset=32, width=2)), [1, 5, 9])
|
|
2665
|
+
# A write query drops the read; LEA stays, since the use of the address it forms is unknown.
|
|
2666
|
+
r = report(code, "uses", query={"offset": 32, "width": 2, "access": "write"})
|
|
2667
|
+
self.assertEqual([c["site"] for c in r["rawCandidates"]], [5, 9])
|
|
2668
|
+
r = report(code, "uses", query={"offset": 32, "width": 2, "access": "read"})
|
|
2669
|
+
self.assertEqual([c["site"] for c in r["rawCandidates"]], [1, 9])
|
|
2670
|
+
|
|
2671
|
+
def test_raw_candidate_displacement_takes_the_instruction_address_size(self):
|
|
2672
|
+
# ret; then unreached: a32 mov [0x1001f],ax; a32 mov [31],ax; ret. In 16-bit code the 32-bit
|
|
2673
|
+
# displacement is not cut to 16 bits, so only the second store meets the field.
|
|
2674
|
+
rows = self.raw_footprints("c3 67 89 05 1f 00 01 00 67 89 05 1f 00 00 00 c3", offset=32, width=2)
|
|
2675
|
+
self.assertEqual(list(rows), [8])
|
|
2676
|
+
self.assertEqual([(o["displacement"], o["intersection"]) for o in rows[8]["operands"]], [(31, {"start": 32, "end": 33})])
|
|
2677
|
+
|
|
2678
|
+
def test_far_pointer_load_width_is_the_pcode_load_size(self):
|
|
2679
|
+
# memory_width corrects Capstone's word for LDS/LES/LSS/LFS/LGS; SLEIGH's LOAD gives the same size.
|
|
2680
|
+
cases = {False: ["c5 06 20 00", "c4 06 20 00", "0f b2 26 20 00", "0f b4 06 20 00", "0f b5 06 20 00",
|
|
2681
|
+
"66 c4 06 20 00", "66 0f b2 26 20 00"],
|
|
2682
|
+
True: ["c5 05 20 00 00 00", "0f b2 25 20 00 00 00", "66 0f b5 05 20 00 00 00"]}
|
|
2683
|
+
for flat, codes in cases.items():
|
|
2684
|
+
decoder = capstone.Cs(capstone.CS_ARCH_X86, capstone.CS_MODE_32 if flat else capstone.CS_MODE_16)
|
|
2685
|
+
decoder.detail = True
|
|
2686
|
+
context = pypcode.Context("x86:LE:32:default" if flat else "x86:LE:16:Real Mode")
|
|
2687
|
+
for text in codes:
|
|
2688
|
+
code = bytes.fromhex(text)
|
|
2689
|
+
ins = next(decoder.disasm(code, 0))
|
|
2690
|
+
loads = [o.output.size for o in context.translate(code, max_instructions=1).ops
|
|
2691
|
+
if o.opcode == pypcode.OpCode.LOAD]
|
|
2692
|
+
memory = [o for o in ins.operands if o.type == capstone.x86.X86_OP_MEM][0]
|
|
2693
|
+
self.assertEqual([reports.memory_width(ins, memory)], loads, text)
|
|
2694
|
+
|
|
2695
|
+
def test_raw_candidate_inside_a_verified_instruction_is_a_rejected_overlap(self):
|
|
2696
|
+
# mov ax,20a3h; add bl,al; ret. The bytes from 1 also decode as mov [32],ax.
|
|
2697
|
+
rows = self.raw_footprints("b8 a3 20 00 c3 c3", offset=32, width=2)
|
|
2698
|
+
self.assertEqual((rows[1]["boundary"], rows[1]["overlapsVerified"]),
|
|
2699
|
+
("rejectedOverlap", [{"site": 0, "end": 3}, {"site": 3, "end": 5}]))
|
|
2700
|
+
|
|
2596
2701
|
def test_linear_write_invalidates_alias_under_its_last_byte(self):
|
|
2597
2702
|
r = report("b8 00 20 8e c0 26 c6 07 55 c7 06 0f 00 34 12 26 8a 07 c3", registers={"ds": 0x1fff})
|
|
2598
2703
|
write = [e for e in events(r, "write") if e["width"] == 2][0]
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
{scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_effect_order.py
RENAMED
|
File without changes
|
{scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_enter_frames.py
RENAMED
|
File without changes
|
{scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_entry_frame.py
RENAMED
|
File without changes
|
|
File without changes
|
{scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_interrupt_models.py
RENAMED
|
File without changes
|
{scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_inventory_check.py
RENAMED
|
File without changes
|
{scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_join_terms.py
RENAMED
|
File without changes
|
|
File without changes
|
{scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_memory_scopes.py
RENAMED
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
{scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_return_checks.py
RENAMED
|
File without changes
|
{scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_successor_rule.py
RENAMED
|
File without changes
|
|
File without changes
|
{scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_term_limit.py
RENAMED
|
File without changes
|
{scientific_method_engine-16.1.0 → scientific_method_engine-17.0.0}/tests/test_volatile_memory.py
RENAMED
|
File without changes
|