perf: use a binary search for kallsyms lookup

[xh4n3]

The /proc/kallsyms can be more than 100k lines, a sequential search can be slow.
Since the getAllSyms() already sorted the kallsyms array, we can do a binary search for kallsyms lookup.

I did a performance compare locally between the two methods, result:

=== RUN   TestGetSymPtFromBpfLocationPerformance
    kallsyms_test.go:56: old_method cost: 11.123334464s
        new_method cost: 66.415172ms
--- PASS: TestGetSymPtFromBpfLocationPerformance (11.19s)

[CLAassistant]

All committers have signed the CLA.