- Dec 16, 2012
-
-
Oliver Sander authored
That should allow for about one million processors. When that proves to be insufficient I'll gladly increase the number again. [[Imported from SVN: r8460]]
-
Oliver Sander authored
Allocate them on the heap instead. I want't to make the _MAX value much larger, to accommodate for higher processors numbers. Allocating arrays of that size on the stack would possibly make the stack overflow. [[Imported from SVN: r8459]]
-
Oliver Sander authored
Appearently this originated as a backup of wop.c which ended up in the VCS by accident. I hasn't been touched since 1997, and the code compiles happily without it. [[Imported from SVN: r8458]]
-
Oliver Sander authored
[[Imported from SVN: r8457]]
-
- Dec 10, 2012
-
-
Oliver Sander authored
[[Imported from SVN: r8456]]
-
Oliver Sander authored
[[Imported from SVN: r8455]]
-
- Dec 09, 2012
-
-
Oliver Sander authored
They are generated by the AutoTools, I don't really know what they do. [[Imported from SVN: r8454]]
-
Oliver Sander authored
[[Imported from SVN: r8453]]
-
Oliver Sander authored
[[Imported from SVN: r8452]]
-
Oliver Sander authored
The method for splitting b-tree nodes was just not quite correct. The new unit test caused valgrind complaints when nodes were split. This fix has been provided by the DROPS team at RWTH Aachen. Kudos to Sven Gross and Jörg Grande. [[Imported from SVN: r8451]]
-
Oliver Sander authored
[[Imported from SVN: r8450]]
-
Oliver Sander authored
[[Imported from SVN: r8449]]
-
Oliver Sander authored
[[Imported from SVN: r8448]]
-
Oliver Sander authored
[[Imported from SVN: r8447]]
-
Oliver Sander authored
Core counts increase every day, and a recent patch has changed to DDD_PROC and DDD_GID types to allow for larger bit numbers. It is somewhat unfortunate that there are two places which specify the default number of bits. [[Imported from SVN: r8446]]
-
Oliver Sander authored
[[Imported from SVN: r8445]]
-
- Dec 05, 2012
-
-
Oliver Sander authored
[[Imported from SVN: r8444]]
-
Oliver Sander authored
[[Imported from SVN: r8443]]
-
Oliver Sander authored
(we're on the way to exascale computing :-) ) [[Imported from SVN: r8442]]
-
- Dec 04, 2012
-
-
Oliver Sander authored
[[Imported from SVN: r8441]]
-
Oliver Sander authored
[[Imported from SVN: r8440]]
-
- Dec 02, 2012
-
-
Oliver Sander authored
DDD needs to know about the structure of the data types it is supposed to transfer. We never told it about the things we added when compiling for Dune. This never seemed to cause any trouble, I guess because all Dune-only data is local anyway. This patch still adds the extra information. You never know :-) [[Imported from SVN: r8439]]
-
- Nov 26, 2012
-
-
Oliver Sander authored
Patch by Markus Blatt [[Imported from SVN: r8438]]
-
- Nov 07, 2012
-
-
Oliver Sander authored
[[Imported from SVN: r8437]]
-
- Nov 05, 2012
-
-
Oliver Sander authored
[[Imported from SVN: r8436]]
-
- Oct 23, 2012
-
-
Oliver Sander authored
Makes Apple people happy. Patch by Christoph Grüninger. Thanks! [[Imported from SVN: r8435]]
-
Oliver Sander authored
The field is only there for Dune, and Dune only uses it in sequential grids. [[Imported from SVN: r8434]]
-
Oliver Sander authored
This allows to compile with -std=c++0x Thanks to Carsten Gräser for pointing this out. [[Imported from SVN: r8433]]
-
- Oct 13, 2012
-
-
Oliver Sander authored
Avoids warnings with neuer AutoConf versions. Patch by Christoph Grüninger [[Imported from SVN: r8432]]
-
- Oct 04, 2012
-
-
Oliver Sander authored
See Dune FlySpray # 1162 [[Imported from SVN: r8431]]
-
- Oct 03, 2012
-
-
Oliver Sander authored
[[Imported from SVN: r8430]]
-
Oliver Sander authored
InsertElement needs to find the neighbors of a newly inserted element. Previously, there were two methods: a linear (in time) method which needs preallocated memory, and a quadratic method with less memory requirements. If the grid was small enough, then the linear algorithm was used, otherwise, it was the quadratic one. However, the quadratic one takes such a long time as to be effectively useless. Hence this patch removes the quadratic algorithm. If there is not enough space for the linear algorithm, an error message is produced, which contains instructions on how to increase the available memory. [[Imported from SVN: r8429]]
-
- Sep 21, 2012
-
-
Oliver Sander authored
[[Imported from SVN: r8428]]
-
Oliver Sander authored
[[Imported from SVN: r8427]]
-
- Sep 20, 2012
-
-
Oliver Sander authored
This fixes some edge communication bugs for 2d grids. [[Imported from SVN: r8426]]
-
Oliver Sander authored
This fixes the Dune partitionType method for edges for levels > 0. [[Imported from SVN: r8425]]
-
Oliver Sander authored
[[Imported from SVN: r8424]]
-
Oliver Sander authored
This fixes the Dune partitionType method for edges in 2D on level 0 [[Imported from SVN: r8423]]
-
Oliver Sander authored
[[Imported from SVN: r8422]]
-
Oliver Sander authored
[[Imported from SVN: r8421]]
-