Firmware | This is the firmware which controls the Maslow

Note: I'm new to network and dpdk, so there might be some misunderstanding in fundamental concepts...

I want to run 2 instances of dpdk-testpmd on the same host to send and receive traffic over separate NIC.

Configuration:

NIC:

• PMD: MLX5
• version: 5.0-1.0.0.0
• firmware-version: 16.26.1040 (MT_0000000011)
• NUMA-Socket: same
• PCIe: 0000:3b:00.0, 0000:3b:00.1

Update

• DPDK Version: 20.11.1
• Hugepage Total: 32768
• Hugepage Free: 32768

TESTPMD Logs:

I'm using FastAPI and I need to represent different STIX 2 objects (from MITRE ATT&CK) with a corresponding/equivalent Pydantic model in order to return them as a response JSON.

Let's consider the AttackPattern object.

I am working on a CSV data Sheet and want to parse and filter the data out it, While working on a code I found a similar code someone has asked on SO POST there and the author having almost the same H/W data as I see that related to HPE H/W where I have some data and columns are different.

I've trying to work out why someone would write the following section of code in a Arduino loop. To me, it doesnt make sense, why have a return in a if statement? Does it just return to the start of the loop and not carry on with the rest of the loop. Here's the snippet of interest:

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 have a dataframe where i have three columns:

• Modules
• FW_Version
• Óv_Name

Where Column module has three distinct values and each values have its FW_Versionand ÒV_name`

I am looking forward to create a new column for these three distinct values and print the FW_Version below that but but should be aligned against ÒV_name` as shown in expected output.

I have the following XML structure:

This is my first attempt at parsing nested JSON with Ruby. I need to go through the JSON to pull out specific values for "_id", "name", and "type" for instance. I then need to create a reference table so that I can refer to each "_id" and associated information. I also need to combine information from multiple JSON responses. I've been able to get basic information and have tried a few things I've found online. I just need a little assistance with a starting point. If anyone has any ideas of where to start with this I'd really appreciate it.

Devices JSON response hash. Each device starts with _id.

I have an opensource project (https://github.com/WhiteFossa/yiff-l), where I use STM32F103 MCU.

In firmware I have a lot of sprintf's with float parameters, for example: