~bzr-pqm/bzr/bzr.dev : changes

~bzr-pqm/bzr/bzr.dev » Changes from revision 2474.1.57

Rev	Summary	Authors	Date
2474.1.56	Remove a lot of unused definitions. Remove a lot of unused definitions.	John Arbash Meinel	17 years ago
2474.1.55	Remove an unused (and ugly) pyrex function. Remove an unused (and ugly) pyrex function.	John Arbash Meinel	17 years ago
2474.1.54	Optimize the simple case that the strings are the same objec... Optimize the simple case that the strings are the same object. Add some TODO statements that we might consider.	John Arbash Meinel	17 years ago
2474.1.53	Changing Reader.get_next_str (which returns a Python String) Changing Reader.get_next_str (which returns a Python String) into a c function saves a lot of time. Specifically it avoids a GetAttr call, and a PyObject_CallObject This drops the times down to: ...test__read_dirblocks_20k_tree_0_parents_c OK 122ms/ 2561ms ...test__read_dirblocks_20k_tree_0_parents_py OK 235ms/ 2606ms ...test__read_dirblocks_20k_tree_1_parent_c OK 175ms/ 2797ms ...test__read_dirblocks_20k_tree_1_parent_py OK 358ms/ 3014ms ...test__read_dirblocks_20k_tree_2_parents_c OK 259ms/ 2992ms ...test__read_dirblocks_20k_tree_2_parents_py OK 498ms/ 3232ms We are close to being 2x faster than the python implementation.	John Arbash Meinel	17 years ago
2474.1.52	Add a benchmark timing how long it takes to add ~20k entries... Add a benchmark timing how long it takes to add ~20k entries to a DirState object.	John Arbash Meinel	17 years ago
2474.1.51	Fix one benchmark so it is actually writing data instead of ... Fix one benchmark so it is actually writing data instead of a null block.	John Arbash Meinel	17 years ago
2474.1.50	Refactor a bit to make benchmark setup time faster. Refactor a bit to make benchmark setup time faster.	John Arbash Meinel	17 years ago
2474.1.49	Add DirState.save() benchmarks. Add DirState.save() benchmarks. At this point it doesn't seem a huge overhead (857ms for 20k entries with 2 parents on a slow machine) But something we might look into in the future	John Arbash Meinel	17 years ago
2474.1.48	Just recording a benchmark on my fast machine Just recording a benchmark on my fast machine _read_dirblocks_20k_tree_0_parents_c OK 158ms/ 2632ms _read_dirblocks_20k_tree_0_parents_py OK 247ms/ 2648ms _read_dirblocks_20k_tree_1_parent_c OK 224ms/ 5493ms _read_dirblocks_20k_tree_1_parent_py OK 324ms/ 5558ms _read_dirblocks_20k_tree_2_parents_c OK 279ms/ 6675ms _read_dirblocks_20k_tree_2_parents_py OK 435ms/ 6847ms	John Arbash Meinel	17 years ago
2474.1.47	Change the names of the functions from c_foo and py_foo to f... Change the names of the functions from c_foo and py_foo to foo_c and foo_py This makes it easier to search for 'def foo*' and means that benchmark results are next to eachother, rather than far apart.	John Arbash Meinel	17 years ago
2474.1.46	Finish implementing _c_read_dirblocks for any number of pare... Finish implementing _c_read_dirblocks for any number of parents. bench_dirstate.BenchmarkDirState.test__c_read_dirblocks_20k_tree_0_parents OK 367ms/ 4353ms bench_dirstate.BenchmarkDirState.test__c_read_dirblocks_20k_tree_1_parent OK 594ms/ 8958ms bench_dirstate.BenchmarkDirState.test__c_read_dirblocks_20k_tree_2_parents OK 842ms/ 10490ms bench_dirstate.BenchmarkDirState.test__py_read_dirblocks_20k_tree_0_parents OK 560ms/ 4298ms bench_dirstate.BenchmarkDirState.test__py_read_dirblocks_20k_tree_1_parent OK 692ms/ 8658ms bench_dirstate.BenchmarkDirState.test__py_read_dirblocks_20k_tree_2_parents OK 1006ms/ 10710ms So overall the performance benefit is about 15-30%	John Arbash Meinel	17 years ago
2474.1.45	Add benchmarks to see how reading the dirstate changes when ... Add benchmarks to see how reading the dirstate changes when you have parents. Currently, the C implementation is slower than python, but partially that is because it is not optimized (at all).	John Arbash Meinel	17 years ago
2474.1.44	Use cmp_by_dirs in _iter_changes, it saves a bit of time. Use cmp_by_dirs in _iter_changes, it saves a bit of time. When I initially wrote it, I thought they wouldn't be called often, but I realize now they are evaluated when we have unknown/ignored files on disk.	John Arbash Meinel	17 years ago
2474.1.43	[merge] bzr.dev 2483 [merge] bzr.dev 2483	John Arbash Meinel	17 years ago
2474.1.42	fix benchmark names, refactor to avoid 'create_path_names' o... fix benchmark names, refactor to avoid 'create_path_names' overhead.	John Arbash Meinel	17 years ago
2474.1.41	Change the name of cmp_dirblock_strings to cmp_by_dirs Change the name of cmp_dirblock_strings to cmp_by_dirs And refactor the test cases so that we test both the python version and the C version. Also, add benchmarks for both. It shows that the C version is approx 10x faster.	John Arbash Meinel	17 years ago
2474.1.40	(python-only) Shave a bit of time off by calling binascii.b2... (python-only) Shave a bit of time off by calling binascii.b2a_base64 I should have looked closer, base64.encodestring() is a Legacy api, which just wraps binascii.b2a_base64. On 21k pack_stat calls, it drops us from around 784ms to 281ms	John Arbash Meinel	17 years ago
2474.1.39	Clean up and remove unused functions. Clean up and remove unused functions.	John Arbash Meinel	17 years ago
2474.1.38	Finally, faster than text.split() (156ms) Finally, faster than text.split() (156ms) By iterating over the fields directly, we don't have to create Python strings for the dirname field (only when it changes), or for the size field or is_executable fields. A lot fewer python objects means faster parsing.	John Arbash Meinel	17 years ago
2474.1.37	get_next() returns the length of the string, get_next() returns the length of the string, preparing for having a _get_entry... which parses rather than extracting to a list first	John Arbash Meinel	17 years ago

Older »