I read Linux Observability with BPF, so I’ll leave some notes. This month, Brendan Gregg’s BPF book is also coming out, so I’d like to read that too. Using BPF allows hooking kernel events and safely executing code BPF verifies that the code won’t destroy or crash the system Unlike kernel modules, BPF programs don’t require kernel recompilation After BPF code is verified, BPF bytecode is JIT-compiled to machine instructions BPF programs are loaded into the BPF VM by the bpf syscall Alexei Starovoitov introduced eBPF in early 2014 Old BPF only allowed 2 32-bit registers, but eBPF allows up to 10 64-bit registers In June 2014, eBPF was also extended to user space BPF program types: Can be broadly classified into tracing and networking Socket Filter: First program type to enter the kernel....

I read Kubernetes Complete Guide and will leave some notes here. I’m summarizing commands and mechanisms that I wasn’t usually conscious of. If you want to create small images, base them on scratch or alpine When both ENTRYPOINT and CMD are set, $ENTRYPOINT $CMD is executed Multi-stage build: You can process only in a build-specific container and copy the artifacts to an execution-specific container CNCF sets project maturity in three stages: “Graduated”, “Incubating”, and “Sandbox” When building on-premises, instance sizes on AWS or GCP can be used as a guide Flannel: Configures an overlay network between nodes There is a kubernetes playground provided by Docker, Inc....

I managed to get the USB wireless LAN adapter TP-Link Archer T3U AC1300 working on a Thinkpad X1 Carbon 2015 (Fedora release 29 (Twenty Nine), linux 5.3.6-100.fc29.x86_64), so I’m documenting the procedure. # The official website didn't distribute drivers, so I used rtl88x2bu git clone https://github.com/cilynx/rtl88x2bu cd rtl88x2bu/ git rev-parse HEAD # 962cd6b1660d3dae996f0bde545f641372c28e12 VER=$(sed -n 's/\PACKAGE_VERSION="\(.*\)"/\1/p' dkms.conf) sudo rsync -rvhP ./ /usr/src/rtl88x2bu-${VER} # Move to /usr/src/<module_name>_<module_version> and manage with dkms sudo dkms add -m rtl88x2bu -v ${VER} sudo dkms build -m rtl88x2bu -v ${VER} sudo dkms install -m rtl88x2bu -v ${VER} sudo dkms status sudo modprobe 88x2bu When connecting two types of adapters (onboard adapter and TP-Link adapter) to the same network, priority is determined by metric....

I participated in the Cosmos Half Marathon held in Echigo Yuzawa. The event itself was great, but around halfway through the course, my stomach started feeling bad, and I had to retire at 13km with a frustrating result. There were several lessons learned, so I’m recording them here. First, my meal timing was bad. The start was at 9:30 AM, and I ate a rice ball around 8:00 AM. I should aim to eat 3 hours before the start....

I read TCP Technology Introduction, so I’ll take some notes on the interesting parts, although they’re rather miscellaneous. First, the first half. I’ve heard about network-related topics, but I often forget them if I don’t use them. Chapter 1: Introduction to TCP Transmission efficiency Ethernet frame 1500 bytes, TCP header 60 bytes, IP header 20 bytes Applications can use 1420 bytes Considering Ethernet header 14 bytes and FCS (Frame Check Sequence) 4 bytes, transmission efficiency is $1420/(1500+18) \times 100=93....

ABC #139 D - ModSum If we set $p_1=N, p_2=1, p_3=2, … , p_N=N-1$, then $m_1=0, m_2=1, m_3=2, … , m_N=N-1$. So the answer is the sum of $1, 2, 3, …, N-1$. ABC #139 E - League Represent the match between $i$ and $j$ as vertex $(i,j)$. However, treat the reversed one as the same. Each vertex has the number of matches that should be done before $prev_{(i,j)}$ and a list of next possible matches $next_{(i,j)}$....

I solved several ABC problems but forgot to record them in my blog. I’ll write them all together here. ABC #136 D - Gathering Children Once you enter an RL pair, you can’t escape. Move an even distance and attach to the RL pair. ABC #136 E - Max GCD Sort first, bring small values closer to 0, and bring large values closer to the answer $d$. Calculate the cumulative sum from both forward and backward directions....

This time, problem E was quite difficult. It felt harder than problem F. After listening to the explanation broadcast on Youtube, I finally understood. This is a memo for myself, so the Japanese is rough… ABC #135 D - Digits Parade Let dp[i][j] be the number of cases where the remainder is j when looking up to the i-th digit. ABC #135 E - Golf Prepare X>=0,Y>=0 in advance 1) X+Y is odd AND K is even Return -1....

Continuation from last time. I solved AtCoder Beginner Contest #130 ~ #133, so I’m summarizing them. I still can’t solve them without explanations… ABC #130 F - Minimum Bounding Box Let dp[i][j] be the number of combinations when the i-th and j-th are partial common substrings. By memoizing the update formula, it can be calculated quickly. ABC #131 F - Must Be Rectangular! Consider the (x,y) coordinates as a bipartite graph....

I solved all CD problems of Atcoder Beginner Contest #116 ~ #129. Also, for #126 ~ #129, EF problems were added, so I solved all of them. For F problems, I referred to explanation PDFs, explanation YouTube videos, and explanation blogs. ABC #126 F - XOR Matching https://atcoder.jp/contests/abc126/submissions/5909511 When M=3, a sequence of length 2^(M+1) has elements like {0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7}. In this case, set it as {<0,1,...,7 excluding K in ascending order> K <7,6,....

I read O’REILLY’s “Concurrency in Go” and am leaving notes for myself. Also, I’ve compiled useful functions for concurrent processing based on the ideas in the book at https://godoc.org/github.com/bobuhiro11/gostream. Race conditions occur when two or more operations must be executed in the correct order, but the program doesn’t guarantee that order. We should aim for logical correctness, and cannot solve it by methods like inserting Sleep functions. The necessary conditions for deadlock are known as the Coffman conditions....

I read the first half of BGP in the Data Center, so I’ll note down what caught my attention. It contained practical content about how to design CLOS networks and how to operate BGP. Since it’s an area I don’t usually deal with, there might be misunderstandings. 1. Introduction to Data Center Networks Communication between servers in a local network is called East-West traffic, and communication between the local network and external networks is called North-South traffic....

Two weeks after the Kyoto Marathon, I participated in the Tokyo Marathon on Sunday, March 3, 2019. This was also my first time applying and participating. It kept raining from before the start until after the finish. Especially waiting for more than 30 minutes before the start without any shelter was tough. In the second half, I was walking about half the time, and my pace was all over the place, but I’m glad I finished safely....

On February 17, 2019 (Sunday), I participated in the Kyoto Marathon 2019. This was my first application and first participation. I’ll record my passing times at each point. Even after the halfway point, I didn’t have to walk for long distances. I brought plenty of supplies like sports yōkan, jelly, and salt candy, so I probably didn’t run out of stamina. I think most marathon races have a 7-hour time limit, but Kyoto Marathon has a 6-hour limit, which is a bit strict....

I solved all CD problems from Atcoder Beginner Contest #1 to #115. I was able to solve about 70% of the C problems and about half of the D problems on my own. I rarely used special algorithms, and I think they can be solved if you can think through them properly. Here are some useful things to note: Try solving the first 1-2 examples by hand. Especially for geometry problems, actually draw them out....

Happy New Year. I have been continuing the development of the x86 emulator, but as six months have passed and the development pace has slowed down, I have decided to make the code public at this point. It is available at https://github.com/bobuhiro11/tiny_x86_emu, so please take a look if you are interested.

Last month, Go 1.11 was released and WebAssembly was experimentally supported. Since the emulator I’m developing is also written in Go, I took this opportunity to port it to WebAssembly. Simply compiling Go to WebAssembly uses the browser console as standard output, but I wanted to output to a div tag, so I manipulated the DOM using the syscall/js package. No other changes were necessary. It’s published at https://bobuhiro11.net/tiny_x86_emu/. It’s still a work in progress, and development on user process execution has been stalled, so I should start working on that soon....

The emulator development has progressed to the point where process switching is possible through mpmain(), scheduler(), and swtch(). The xv6 code at line 334 of proc.c keeps issuing the sti instruction, and it seems to have entered a loop, so I’d like to summarize scheduling and context switching here. The process being switched to performs I/O immediately after being switched in the forkret() and iinit() functions. Here, it enters a sleep state and appears to be waiting for an interrupt....

I read “First Time Reading the 486,” so I’ll note down what caught my attention. It’s helpful since I’m making an emulator. Throughout the book, the diagrams are very clear, so just looking at them is educational. Segments When reading instructions from EIP, the segment pointed to by the CS register is used, and when accessing memory during instruction execution, the segment pointed to by the DS register is used. Also, for stack-related operations like PUSH, POP, CALL, RET, the segment pointed to by the SS register is used....

I want to summarize xv6’s paging. In the kernel main function, the page table and page directory initialization is performed twice. The first initialization of the paging mechanism maps the lower 4MB of virtual addresses 0x0 ~ 0x400000 directly to physical addresses 0x0 ~ 0x400000. Also, virtual addresses 0x80000000 ~ 0x80400000 with 0x80000000 as an offset are also mapped to the same physical addresses 0x0 ~ 0x400000. This paging is only used during kernel initialization....