http://www.g-brain.net/tutorials/writing-linux-programs-in-raw-binary.txt
http://www.g-brain.net/tutorials/writing-linux-programs-in-raw-binary.txt

linux system call

Documents the journey from C code to assembly to machine code very nicely.

good coders code, great reuse

asm_new = disassemble(update) asm_new_adjusted = adjust(asm_new, asm_old) asm_diff = bsdiff(asm_old, asm_new_adjusted) transmit asm_diff client:

We want smaller updates because it narrows the window of vulnerability. If the update is a tenth of the size, we can push ten times as many per unit of bandwidth. We have enough users that this means more users will be protected earlier. A secondary benefit is that a smaller update will work better for users who don't have great connectivity.

Software Updates: Courgette

nice update tool for smaller patches

VERY TINY BINARY DIFFS released by Google and Open Sourced.

A new differential compression algorithm for making Google Chrome updates significantly smaller. Courgette transforms the program into the primitive assembly language and does the diffing at the assembly level

逆アセンブルの差分？ server: asm_old = disassemble(original) asm_new = disassemble(update) asm_new_adjusted = adjust(asm_new, asm_old) asm_diff = bsdiff(asm_old, asm_new_adjusted) transmit asm_diff client: receive asm_diff asm_old = disassemble(original) asm_new_adjusted = bspatch(asm_old, asm_diff) update = assemble(asm_new_adjusted)

This header file is called “bithacks.h” and it contains various macros for bit manipulations. I also wrote tests for all the macros in the “bithacks-test.c” program. The most beautiful part of “bithacks.h” is the “B8” macro that allows to write something like ” x = B8(10101010) ” and turns it into ” x = 170 ” (because 10101010 in binary is 170 in decimal). I have not yet added B16 and B32 macros but I will add them when I publish the article on advanced bithacks. The credit for the B8 idea goes to Tom Torfs who was the first to write it.

うわお。オレも計算機使ってる

いつもgoogle電卓だなー。in hexで16進数になる。

いやあ、面白い

- やねうらお−よっちゃんイカを食べながら年収1億円稼げる(かも知れない)仕事術

Quick, what is the fastest way to search a sorted array? Binary search, right? Wrong. There is actually a method called interpolation search, in which, rather than pessimistically looking in the middle of the array, you use a model of the key distribution to predict the location of the key and look there.

Interploating search with alogrithm