| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | place bots fairly | Sven M. Hallberg | 2023-04-10 |
| | | | | | | | | | | | | | The trick is to consider not the final offsets at first, but the places between the free bytes. Select one for each bot uniformly at random; a heap is an appropriate data structure to store them. Pick a random permuation for the order of the bots and iterate over the positions from start to end. Compute the eventual offsets by adding to each the amount of space allocated so far. Thus we obtain any possible placement all over the available memory without bias. | ||
| * | rename Source to Code | Sven M. Hallberg | 2023-04-10 |
| | | | | | | Source is what goes into the assembler, not what comes out of it. Resisted the temptation to call it "text". ;P | ||
| * | Bug Emile! Bug! :P | Tommy Markstein | 2023-04-09 |
| | | |||
| * | Should work, lol | Emile | 2023-04-09 |
 |
index : r2wars | |
| A golang implementation of radare2 | emile |
| about summary refs log tree commit diff |
generated by cgit-pink 1.4.1
