Derek Parker 4d88d9ed8d Prefer binary search over tree lookup for FDEs ... FDEs previously were loaded into a red/black tree and searched. This is significantly more expensive than a binary search over a slice. Not sure what I was thinking using a red/black tree - this binary search implementation is significantly more efficient.		2015-02-04 19:22:39 -06:00
..
breakpoints_linux_amd64.go	Improve documentation	2015-02-02 16:09:56 -05:00
proctl_linux_amd64.go	Update error message for missing .debug_frame	2015-01-23 14:59:42 -06:00
proctl_test.go	Report caller file:line in assert helper fn	2015-01-23 14:55:24 -06:00
proctl.go	Prefer binary search over tree lookup for FDEs	2015-02-04 19:22:39 -06:00
threads_linux_amd64.go	migrate to go.sys subrepository	2015-01-25 22:43:47 -06:00
threads.go	Improve documentation	2015-02-02 16:09:56 -05:00
variables_test.go	Added limit to array size (64) and struct member recursion (2) when printing	2015-02-04 13:15:10 -05:00
variables.go	Removed debugging printf	2015-02-04 13:15:10 -05:00