Author: Remi Meier <[email protected]>
Branch: stmgc-c7
Changeset: r72905:29fff73e1c07
Date: 2014-08-19 13:51 +0200
http://bitbucket.org/pypy/pypy/changeset/29fff73e1c07/
Log: found a new TODO which would allow pypy-stm to outperform pypy on
quick_sort.py
diff --git a/TODO b/TODO
--- a/TODO
+++ b/TODO
@@ -28,6 +28,14 @@
------------------------------------------------------------
+stm_read() should also be optimized (moved out of loops). E.g.
+quick_sort.py suffers a 30% slowdown because it uses deque.locate()
+extensively. This method happens to have a *very* tight loop
+where the read barrier has a big negative effect and could
+actually be moved out.
+
+------------------------------------------------------------
+
__pypy__.thread.getsegmentlimit():
XXX This limit is so far a compile time option (STM_NB_SEGMENTS in
_______________________________________________
pypy-commit mailing list
[email protected]
https://mail.python.org/mailman/listinfo/pypy-commit
