George Bosilca d56656580a Profiling shows that we spend way to much time (it's relative of course but it's still more ... than I want to) on the constructor and destructor loops. Compress the constructors and destructors array to remove all the useless tests against NULL. Now we use the cache a little bit more efficient. Correct a threading problem in the obj_update function. In the threaded case we have to return the value returned by the ompi_atomic_add function otherwise there are ways leading to the release of an object twice. This commit was SVN r8966.		2006-02-10 21:04:26 +00:00
..
Makefile.am	Add support for lock-free "Last In First Out" lists and add them to the build.	2006-01-23 18:20:53 +00:00
opal_atomic_lifo.c	Add support for lock-free "Last In First Out" lists and add them to the build.	2006-01-23 18:20:53 +00:00
opal_atomic_lifo.h	Do not forget to reset the heaqd of the list after a pop operation.	2006-01-23 19:41:39 +00:00
opal_free_list.c	Update the copyright notices for IU and UTK.	2005-11-05 19:57:48 +00:00
opal_free_list.h	A shorter version of the macro	2006-01-23 19:43:46 +00:00
opal_hash_table.c	Update the copyright notices for IU and UTK.	2005-11-05 19:57:48 +00:00
opal_hash_table.h	Update the copyright notices for IU and UTK.	2005-11-05 19:57:48 +00:00
opal_list.c	Update the copyright notices for IU and UTK.	2005-11-05 19:57:48 +00:00
opal_list.h	Update the copyright notices for IU and UTK.	2005-11-05 19:57:48 +00:00
opal_object.c	Profiling shows that we spend way to much time (it's relative of course but it's still more	2006-02-10 21:04:26 +00:00
opal_object.h	Profiling shows that we spend way to much time (it's relative of course but it's still more	2006-02-10 21:04:26 +00:00
opal_value_array.c	Update the copyright notices for IU and UTK.	2005-11-05 19:57:48 +00:00
opal_value_array.h	Update the copyright notices for IU and UTK.	2005-11-05 19:57:48 +00:00