digitalw0lf/hextor

Hextor - Hexadecimal editor and binary data analyzing toolkit

hextor's Issues

Windows native caret

TCP/UDP/COM data sources

Portable build & mode

Workspace saving

Save:
List of open files, position/selection, Each editor settings, Struct/script text, Search results, Bookmarks, ...?

Autosave workspace(s) to special folder if no workspace explicitly selected.

Alternative:
Save some settings, Bookmarks for each file path; restore when same file opened

Printing

Assembler

Compile modified disassembly back into machine code

Re-work toolframes UI

Requirements:
Show different tools simultaneously (e.g. Struct and Asm)
Open several frames of same type for different data ranges/files
Dock to any side of window or floating (even out of main app window)
Each toolframe instance can be either bound to specific editor or unbound (auto-show active editor)
By default frame is unbound, with option to bind to currently shown data
More convenient tool selection for 20+ tools
In future - adding tools with plugins

Graphical file map bar

trying to compile with d10.2.3

missing
intedimagepreoxy coparefram maybe more

Skip bad sectors when reading

Allow working with/dumping partially unreadable external drives

Changed regions list

Improvements for high-DPI screens

1. Adjust icons size
   2. Configurable editor font

Faster MDI

To allow opening 100's of files

NTFS alternate data streams

Shift+Home from bookmark - incorrect selection

D10.2.3 errors

D10.2.3
Could not find uActiveScript;
ctx.NotWriteEmptyField := ANotWriteEmptyField; no such thing NotWriteEmptyField
may be more?

Refresh externally changed file

Plot graph from DS (plugin?)

Unicode in editor pane

• Unicode string detector (utf8, ucs2)
• Show single char for code

Search in previous results

Create backups when saving files

Network sniffer DataSource

Tool for fixing encodings

For given input string, show several variants of encoding conversion

Auto-suggest DataStruct parsing by file mask and/or signature

Struct view columns: addr, size, custom display

Support wildcards when replacing

First of all, thank you for developing this software.

Suggest to add features:
Support wildcards when replacing.

tks.

ML-based data classifier

(very doubt I will ever have enough spare time for it)

Limit Undo memory

Export Hex+Text view

pdf? html?
Include toolframes?

Find and replace function supports multi-threaded processing

For example:
If there are 2000 files to be processed, a single thread will take a long time, but multi-threaded processing will be much faster.

My English is very poor, and all the messages I send to you use translation tools。

Tks.

Compare files and export patch

From discussion #44

1. export patch (oldfile new file patchfilename)
2. clickable list to see the differences and on click jump to the difference
3. option to copy the file offset address (right mouse button, copy address)

any option to undo after save file ?

sometime modified file can not run, or need to check ,so need to undo and save back again :(

Unit tests: Struct->Json

Search for all strings

Ansi, Utf8, Ucs2
Toolbar button -> Dialog with options -> Search results list

repo/symlink issues

There's a couple files in the repo that look suspect:

clayne@dorian:~/git/hextor/Source (master +=) $ git reset --hard
error: unable to create symlink Source/uOleAutoAPIWrapper.pas: File name too long
error: unable to create symlink Source/uSkipList.pas: File name too long
fatal: Could not reset index file to revision 'HEAD'.

strace snippet:

newfstatat(AT_FDCWD, "Source/uSkipList.pas", 0x7ffca4fa6808, AT_SYMLINK_NOFOLLOW) = -1 ENOENT (No such file or directory)
symlink("unit uSkipList;\n\ninterface\n\nuses\n  Types, SysUtils, Classes, RTLConsts, Generics.Collections, Generics.Defaults,\n  {Graphics,} Math;\n\ntype\n  TSkipListSet<T> = class(TEnumerable<T>)\n  private type\n    PT = ^T;\n    PItem = ^TItem;\n    TItem = record\n      Next, Down, Up: PItem;\n      ChildCount: Integer;\n      Value: PT;\n    end;\n    TItemPath = array of PItem;\n  public type\n    TElement = T;\n    TEnumerator = class(TEnumerator<T>)\n    private\n      FOwner: TSkipListSet<T>;\n      FItem: PItem;\n      FLastItem: PItem;  // If assigned, enumeration stops after this item\n      FInited: Boolean;\n    protected\n      function DoGetCurrent: T; override;\n      function DoMoveNext: Boolean; override;\n    public\n      constructor Create(Owner: TSkipListSet<T>);\n    end;\n    // For auto-refcounting\n    IEnumerableRange = interface(IInterface)\n      function GetEnumerator: TEnumerator;\n    end;\n    TEnumerableRange = class(TInterfacedObject, IEnumerableRange)\n    protected\n      FOwner: TSkipListSet<T>;\n      FFirstItem, FLastItem: PItem;\n    public\n      constructor Create(Owner: TSkipListSet<T>);\n      function GetEnumerator: TEnumerator;\n    end;\n  private\n    FComparer: IComparer<T>;\n    FLevels, FProb: Byte;\n    FHeads: array of PItem;\n    FOnNotify: TCollectionNotifyEvent<T>;\n    FOwnsObjects: Boolean;\n    function FindItemLEQ(const Key: T): TItemPath;\n    function FindItemLE(const Key: T): TItemPath;\n    function Insert(Path: TItemPath; Value: T): PItem;\n    function Promote(After: PItem; Item: PItem): PItem;\n    function DoExtract(const Key: T; Action: TCollectionNotification): T;\n  protected\n    function DoGetEnumerator: TEnumerator<T>; override;\n    procedure Notify(const Item: T; Action: TCollectionNotification); virtual;\n  public\n    constructor Create(ALevels: Byte = 4; AProb: Byte = 4; AComparer: IComparer<T> = nil);\n    destructor Destroy; override;\n    procedure Clear;\n    procedure AddOrSet(Value: T);\n    function TryFetch(const Key: T; var Value: T): Boolean;\n    // \315\340\365\356\344\350\362 \375\353\345\354\345\355\362 \361\362\360\356\343\356 \354\345\355\374\370\345 \363\352\340\347\340\355\355\356\343\356\n    function FindLE(const Key: T; var Value: T): Boolean;\n    // \315\340\365\356\344\350\362 \375\353\345\354\345\355\362 \354\345\355\374\370\350\351 \350\353\350 \360\340\342\355\373\351 \363\352\340\347\340\355\355\356\354\363\n    function FindLEQ(const Key: T; var Value: T): Boolean;\n    // \315\340\365\356\344\350\362 \375\353\345\354\345\355\362 \361\362\360\356\343\356 \341\356\353\374\370\345 \363\352\340\347\340\355\355\356\343\356\n    function FindGE(const Key: T; var Value: T): Boolean;\n    // \315\340\365\356\344\350\362 \375\353\345\354\345\355\362 \341\356\353\374\370\350\351 \350\353\350 \360\340\342\355\373\351 \363\352\340\347\340\355\355\356\354\363\n    function FindGEQ(const Key: T; var Value: T): Boolean;\n    function HasKey(const Key: T): Boolean;\n    // \302\356\347\342\360\340\371\340\345\362 \347\355\340\367\345\355\350\345 \350 \363\344\340\353\377\345\362 \345\343\356 \350\347 \361\357\350\361\352\340\n    function Extract(const Key: T): T;\n    procedure Remove(const Key: T);\n    function Get(const Key: T): T;\n    function First: T;\n    // \302\356\347\342\360\340\371\340\345\362 Enumerator \344\353\377 \375\353\345\354\345\355\362\340 \354\345\355\374\370\345\343\356 \350\353\350 \360\340\342\355\356\343\356 \363\352\340\347\340\355\355\356\354\363\n    function GetEnumeratorLEQ(const Key: T): TEnumerator;\n    // \302\356\347\342\360\340\371\340\345\362 Enumerator \344\353\377 \375\353\345\354\345\355\362\340 \361\362\360\356\343\356 \354\345\355\374\370\345 \363\352\340\347\340\355\355\356\343\356\n    function GetEnumeratorLE(const Key: T): TEnumerator;\n    // \302\356\347\342\360\340\371\340\345\362 Enumerator \344\353\377 \375\353\345\354\345\355\362\340 \341\356\353\374\370\345\343\356 \350\353\350 \360\340\342\355\356\343\356 \363\352\340\347\340\355\355\356\354\363\n    function GetEnumeratorGEQ(const Key: T): TEnumerator;\n    // \302\356\347\342\360\340\371\340\345\362 Enumerator \344\353\377 \375\353\345\354\345\355\362\340 \361\362\360\356\343\356 \341\356\353\374\370\345 \363\352\340\347\340\355\355\356\343\356\n    function GetEnumeratorGE(const Key: T): TEnumerator;\n//    function GetEnumeratorForRange(const FirstKey, LastKey: T): TEnumerator;\n    function EnumerateRange(const FirstKey, LastKey: T): IEnumerableRange;\n    function EnumerateFrom(const FirstKey: T): IEnumerableRange;\n    function Count(): Integer;\n    function IsEmpty(): Boolean;\n    property OnNotify: TCollectionNotifyEvent<T> read FOnNotify write FOnNotify;\n    property OwnsObjects: Boolean read FOwnsObjects write FOwnsObjects;\n    //    procedure DebugDraw(Canvas: TCanvas; R: TRect);\n  end;\n\n  TSkipListMap<TKey, TValue> = class(TSkipListSet<TPair<TKey, TValue>>)\n  public\n    constructor Create(ALevels: Byte = 4; AProb: Byte = 4; AComparer: IComparer<TKey> = nil);\n    procedure AddOrSet(const Key: TKey; Value: TValue);\n    function TryFetch(const Key: TKey; var Value: TValue): Boolean;\n    function HasKey(const Key: TKey): Boolean;\n    procedure Remove(const Key: TKey);\n    function Extract(const Key: TKe"..., "Source/uSkipList.pas") = -1 ENAMETOOLONG (File name too long)

The issue was created here: 37519a3

I.e. the actual content of the files (which normally points to the symlink target) is now the files themselves yet git still thinks the files are symlinks. The commit itself references changing them to hard links but last I checked git has no ability to represent hard links via a surrogate inode or otherwise.

Byte distribution histogram

DataStruct enhancements

• typedef
• #define
• #include
• #color
• #hint
• while
• break
• bit fields
• union

Script API Docs

Open/edit HEX files

Intel HEX https://en.wikipedia.org/wiki/Intel_HEX
Motorola S-record https://en.wikipedia.org/wiki/SREC_(file_format)

Pattern coloring