/brz/remove-bazaar : changes

» Changes from revision 2474.1.64

To get this branch, use:

bzr branch
http://gegoxaren.bato24.eu/bzr/brz/remove-bazaar

From Revision 2474.1.64 to 2474.1.45

expand all

Rev	Summary	Authors	Date
2474.1.64	Fix dirstate benchmarks for new layout. Fix dirstate benchmarks for new layout.	John Arbash Meinel	18 years ago
2474.1.63	Found a small bug in the python version of _read_dirblocks. Found a small bug in the python version of _read_dirblocks. This reveals that the code is not as directly tested as it should be. Consider refactoring all test_dirstate to use both implementations. Or at least at more direct tests.	John Arbash Meinel	18 years ago
2474.1.62	[merge] bzr.dev 2601 [merge] bzr.dev 2601	John Arbash Meinel	18 years ago
2474.1.61	Finish fixing DirState._bisect and the bisect tests Finish fixing DirState._bisect and the bisect tests	John Arbash Meinel	18 years ago
2474.1.60	Get rid of strchr in favor of memchr Get rid of strchr in favor of memchr	John Arbash Meinel	18 years ago
2474.1.59	Make sure to set basename_len. With that patch, the tests pa... Make sure to set basename_len. With that patch, the tests pass.	John Arbash Meinel	18 years ago
2474.1.58	(broken) Try to properly implement DirState._bisect* (broken) Try to properly implement DirState._bisect* Involves rewriting some helper functions. Currently something is wrong.	John Arbash Meinel	18 years ago
2474.1.57	Move code around to refactor according to our pyrex extensio... Move code around to refactor according to our pyrex extension design. This creates a _dirstate_helpers_py.py next to _dirstate_helpers_c.pyx Rather than having a 'bzrlib.compiled.*' directory.	John Arbash Meinel	18 years ago
2474.1.56	Remove a lot of unused definitions. Remove a lot of unused definitions.	John Arbash Meinel	18 years ago
2474.1.55	Remove an unused (and ugly) pyrex function. Remove an unused (and ugly) pyrex function.	John Arbash Meinel	18 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	18 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	18 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	18 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	18 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	18 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	18 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	18 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	18 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	18 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	18 years ago

Older »