bytecode | Python module to modify bytecode | Bytecode library

I am currently learning DirectX 12 and trying to get a demo application running. I am currently stuck at creating a pipeline state object using a root signature. I am using dxc to compile my vertex shader:

I am trying to learn how ELF files are structured and probably how to make one manually.

I am working on aarch64 Linux OS, the ELF files I am inspecting are of elf64-littleaarch64 format.

Also I try to learn by myself, however I got stuck with some questions...

1. When I do xxd code, the first number in each line of the output specifies the address of bytes in the file. But when objdump -D code, the first number is something like 4000b0, however corresponds to 000000b0 in xxd. Why is there a four at the beginning?
2. In objdump, the bytecode is for example 11000a94, which 'means' add w20, w20, #2 in assembly. I know, that 11 is the opcode, but what does 000a94 mean? I thought, it should be the parameters, but I am adding the value 2 and can't find the number 2 in it.

If you have a good article to read, or can help me explain this, I will be very grateful!

I am trying to implement react-native-maps in my App (react native version 64.1)

This is the source I'm using to integrate maps to my app

when I try to sync my project using Android Studio I get these errors (screenshot):

I am trying to lunch my flutter application on my mobile but When I run

I am going to write my own FORTH "engine" in GNU assembler (GAS) for Linux x86-64 (specifically for AMD Ryzen 9 3900X that is siting on my table).

(If it will be success, I may use similar idea for make firmware for retro 6502 and similar home-brewed computer)

I want to add some interesting debugging features, as saving comments with the compiled code in for of "NOP words" with attached strings, which would do nothing in runtime, but when disassembling/printing out already defined words it would print those comment too, so it would not loose all the headers ( a b -- c) and comments like ( here goes this particular little trick ) and I would be able try to define new words with documentation, and later print all definitions in some nice way and make new library from those, which I consider good. (And have switch to just ignore comments for "production release")

I had read too much of optimalization here and I am not able to understand all of that in few weeks, so I will put out microoptimalisation until it will suffer performance problems and then I will start with profiling.

But I want to start with at least decent architectural decisions.

What I understood yet:

• it would be nice, if the programs was run mainly from CPU cache, not from memory
• the cache is filled somehow "automagically", but having related data/code compact and as near as possible may help a lot
• I identified some areas, that would be good candidates for caching and some, that are not so good - I sorted it in order of importance:
  • assembler code - the engine and basic words like "+" - used all the time (fixed size, .text section)
  • both stacks - also used all the time (dynamic, I will probably use rsp for data stack and implement return stack independly - not sure yet, which will be "native" and which "emulated")
  • forth bytecode - the defined and compiled words - used at runtime, when the speed matters (still growing size)
  • variables, constants, strings, other memory allocations (used in runtime)
  • names of words ("DUP", "DROP" - used only when defining new words in compilation phase)
  • comments (used one daily or so)

As there is lot of "heaps" that grows up (well, there is not "free" used, so it may be also stack, or stack growing up) (and two stacks that grows down) I am unsure how to implement it, so the CPU cache will cover it somehow decently.

My idea is to use one "big heap" (and increse it with brk() when needed), and then allocate big chunks of alligned memory on it, implementing "smaller heaps" in each chunk and extend them to another big chunk when the old one is filled up.

I hope, that the cache would automagically get the most used blocks first keep it most of the time and the less used blocks would be mostly ignored by the cache (respective it would occupy only small parts and get read and kicked out all the time), but maybe I did not it correctly.

But maybe is there some better strategy for that?

I am using groovy 2.4.12 with Oracle JVM 1.8. I am trying to understand a bit how groovyc converts the scripts written by end users.

To that end I wrote this simple script:

I'm working on a search that I can use with flutter_typeahed package. I found a package called trie, but it doesn't have null safety so I thought of including that and contribute to the project as well as my own.

Since the entire trie file is quite big, I'm providing a link to pastebin.

This is the Search class that I've written:

I am creating a Smart Contract (BEP20 token) based on the BEP20Token template (https://github.com/binance-chain/bsc-genesis-contract/blob/master/contracts/bep20_template/BEP20Token.template). The public contructor was modified to add some token details. However all of the standard functions are giving compile time issues like Overriding function is missing.

** here is the source code **

I am new to programming, working on a project to explore bytecode for Python. I have several python files with .py extensions and would like to use the dis.dis() function to save the bytecode equivalent of a lot of small programs.

For example, the code below, when run, will return the bytecode of the function (what's in the def part). My problem is that I cannot find a solution to import the files as text/code, for all the functions they define, and run this code over thousands of examples.