This is a work in progress by someone who is learning about Binary Ninja.
References
- https://api.binary.ninja/binaryninja.binaryview-module.html
- https://gist.github.com/psifertex/6fbc7532f536775194edd26290892ef7
Get database name
| VERSION = \"1.0.0\" | |
| PREFIX ?= out | |
| INCDIR = include | |
| SRCDIR = src | |
| LANG = c | |
| OBJDIR = .obj | |
| MODULE ?= binary_name | |
| CC ?= gcc |
This is a work in progress by someone who is learning about Binary Ninja.
References
Get database name
| #!/usr/bin/env bash | |
| sudo hdiutil create -o /tmp/Monterey -size 16g -volname Monterey -layout SPUD -fs HFS+J | |
| sudo hdiutil attach /tmp/Monterey.dmg -noverify -mountpoint /Volumes/Monterey | |
| sudo /Applications/Install\ macOS\ Monterey.app/Contents/Resources/createinstallmedia --volume /Volumes/Monterey --nointeraction | |
| hdiutil eject -force /Volumes/Install\ macOS\ Monterey | |
| hdiutil convert /tmp/Monterey.dmg -format UDTO -o ~/Downloads/Monterey | |
| mv -v ~/Downloads/Monterey.cdr ~/Downloads/Monterey.iso | |
| sudo rm -fv /tmp/Monterey.dmg |
| /* | |
| Simple stack Virtual Machine | |
| Version 1.0 | |
| by DreamVB | |
| This is a simple example of how to code a simple VM in C | |
| At the moment this vm only supports a small amount of instruction I hope to add more as I learn more. | |
| This version has some hard coded example that you can test in the vm. Next version I plan to load the examples from files. | |
| If you like this code, or if you have some improvements I can make drop me a message below: |
| // Tic Tac Toe in C. V1.0 by James 26/05/2019 | |
| // This is my first bigger C project. It was actually a lot easier than a I | |
| // thought it would be! It's not great, but it works perfectly decently. | |
| // I started working on it sometime around 4 in the morning, and I'm done before | |
| // 7 in the morning. So I didn't spend much time on it. | |
| // Also, I can't really claim I did the check function myself, though. The first time | |
| // I ever made tic tac toe (in C#), I ended up writing looping functions which could |
Andy Thomason is a Senior Programmer at Genomics PLC. He has been witing graphics systems, games and compilers since the '70s and specialises in code performance.
| import random | |
| import typing.List | |
| def thanos_sort(a: List[int]) -> List[int]: | |
| '''Removes half of the list until it's perfectly balanced, like all things should be.''' | |
| def _perfectly_balanced(a: List[int]) -> bool: | |
| like_all_things_should_be = True | |
| #pragma once | |
| #define DYN_ARR_OF(type) struct { \ | |
| type *data; \ | |
| type *endptr; \ | |
| uint32_t capacity; \ | |
| } | |
| #if !defined(__cplusplus) | |
| #define decltype(x) void* |