Відео

Is it possible that the fact the nop instructions don’t consume time consistently as you add them is because a NOP on ARM is not guaranteed to consume time, the processor is allowed to remove them from the pipeline?

I am a bit in the latter camp. You can write an assembler, compiler, or CPU in JavaScript. Please don’t run around screaming that it is the best tool for that job. I start getting upset when people go doable in language X means language X is the best possible tool for job Y. If you boil most tasks down enough they turn into finite state machines. That doesn’t mean an FSM is the most productive way of tackling a task. I am finding other videos pretty cool.

Pdos? Clergy's favourite OS

hmmm i guess 5 dislikes were having a very bad day xd. thanks alot sir for sharing you knowledge with us, i cant wait to finish all of it 🙏🙏do you suggest books or certifications!

Great video! Thank you very much for such high quality content. One question though: The `start` function is written in C. Which means it has a functioning stack somewhere. I guess that is the purpose of `_entry` assembly function to prepare the stack for `start`. How does the c code (or the c compiler) know that the stack must begin at `stack0 + hartid * 4096` for the `start` function?

libopencm3 won't compile on window. Error with the nvic.h linker line 63: from the make file. Did anyone have a work around this since the include Header file is dynamic link

No unit tests?

❤❤❤❤

❤

Best *nix series on youtube by far!! I really hope there will be a continuation!

11:46 just use desmos to illustrate concept lol

Generally kalloc(size_t sz) takes the size of memory to allocate, but in this os code why kallaoc(void) suppose if i want to allocate memory for a structure of 25 bytes, I get whole 4096 bytes, Is this inefficient Correct me if I am wrong

This is simply amazing! Best OS explaining video I've seen so far. Thank you so much and please keep it up!

Too Interesting Please continue the series😊

Another way to define a expression is as: expr: term ("*" term)* term: factor (("+"|'-") factor)* factor: literal | variable | "(" expr ")"

in the uart_usr, shouldn't the if statement check for !overrun ?

nice video

I guess how do you know what is needed to boot the kernel and all the steps required for the architecture? Is there a manual that describes all of that?

24:55 Question: initlock() is passed a pointer to a string (“cons” for example) with type (char *) to retain that information for debugging. But that points to a string in the caller’s data. Can you be sure that the string persists? If it is ephemeral, the pointer would no longer be valid. Do you have to do anything in the code calling initlock() to ensure that the string can always be accessed with the original pointer value? (And yes, this series of videos is amazing. Instant subscription. I’m retired so I no longer write code for embedded CPUs, but your explanations are a delight to follow.)

well explained

excellent tutors! could you share your vscode experience for another video?

A master teacher. Thank you!

Such excellent videos! I havent programmed in a while but this video made me curious so I cloned the project and am playing with xv6 now. Note that instead of the huge Docker image you provided, on my Mac I was able to 'brew' the x-toolchain as described on the MIT project page. Was able to untangle the pointer acrobatics of kinit() by printing out the first 8 bytes at the beginning of every page. The first page seems to have all zero bytes at the beginning (forming the NULL pointer) while the first 8 bytes of subsequent pages point back to the starting location in memory of the previous page. Very cool to see how it works.

I LOVE this series! Please make more!

A nice explanation, just one point, the executor function passed to the promise run immediately after creating the promise

Love this! I was a ASM programmer for PIC microcontrollers in the early 2000's and it rendered me a nice career. I still miss those days, now working with cloud code...

I might be wrong, but 55 bits for addressing is 2^55 or 4 petabytes of addresses? 256 petabytes of potential ram is indeed a really big number!

The humans

I’m not specialist with computer or even coding , these all are new information for me , i think i took more additional formation Thank you so much 🙏🏼

please keep updating!!!!

This series is awesome. I really hope for continuation

Loved these videos, these are rare content. Keep continuing the good work❤

i love you

Please do one on OpenSSL!

awesome

There are very few spots in the video where increasing your font size by 50-75% would cause any issues whatsoever... and it would help incredibly on small screens and old eyes.

As said frequently below: amazing video. You do need to lock the focus on your camera though!

Are PEG Parsers also Parser Combinator ?

In the search for the easiest game engine I ended up learning about Turing machines, Vonn Newman architechture, assembly language, and Virtual Machines.

j link > stlink

YT algorithm finally suggested something good :). Smashed that subscribe button!

Gold Mine!

shouldn't ring buffer stucture be marked as volatile since it is accessed and modified from both interrupt routine and main loop ?

2:12 makefile

10:30 flash memory 15:50 fix make file 17:10 what bootloader do 50:40 main 59:30 vector table offset register

Nice video. The heap metadata for modern OS's is more complicted to accomodate for improving availabilty, fragmentation, etc. This singlely-linked list is generally used for 'fast bins'; bins of small chunks of memory that are too small to worry about optimization on. The main question I have, is why did they call the structure for this memory metadata 'run'? What a terrible name for the memory allocation metadata.

I installed the repository but am getting this error ffor the app: # Build the main application firmware cd app make $ make src/bootloader.S: Assembler messages: src/bootloader.S:3: Error: file not found: ../bootloader/bootloader.bin make: *** [Makefile:171: src/bootloader.o] Error 1

to write javascript on hardware level is completely nonsense. I'm sorry bro but this tutorial is completely out of logic

Are you going to continue the xv6 source code dive series??

When I run make I get the following errors. Seems the Makefile isn't finding something. make[1]: arm-none-eabi-gcc: No such file or directory make[1]: *** [../Makefile.include:41: can.o] Error 127 Failure building: lib/efm32/ezr32wg: code: 2 Failure building: lib/efm32/g: code: 2 Failure building: lib/efm32/gg: code: 2