Free the persistence of memory software for linux

subPersistence is an abstract, light-weight yet flexible framework for working with O/R persistence mappers. It provides for independence of a specific O/R mapper such as Hibernate or Castor.
While you can use Hibernate or Castor (or other O/R mappers) directly, coupling your application too tightly to those can be a bad thing. subPersistence makes it easy to switch underlying O/R mappers, thereby decoupling the application layer from those.
It abstracts away differences between the mappers, while still making it possible to use their specific features if needed.
Enhancements:
- This version updates to Java 5 features such as Generics and is the first version to require Hibernate 3.

The Linux Memory Game project is a childrens (and adults) game based on the card game.
The Linux Memory Game is an X11 game using GTK+ library for children ages 3 and up. It is a lot more than the card game "Memory".
It has five skill levels, the higher ones are challenging to adults as well. Additionally, one can choose from the menu to match 2 cards or 3 cards, or match different cards.
This last "different card" mode can be a very good teaching tool for teaching languages, concepts, or association.
Main features:
- Extensible - add new images yourself without having to make changes to the program.
- Five skill levels appropriate for the youngest and the ones with the best brains.
- Can play two card matching or three card matching (more challenging!)
- Can set to match different cards. This can be used with apropriately designed pictures to teach children (or adults) words, concepts, or another language.
Enhancements:
- Fixed overflow bug in pixmaps_jump.

Martian Memory project consists of a simple memory game.
Martian Memory is a simple memory game oriented to kids, featuring the Pachi el marcianos world characters.
The goal of the game is to pick up two identical chips from a board that contains 32. The game contains very nice visual effects, sounds, and very nice music composed by Jonne Valtonen.
Installing
Just do:
./configure
make
make install (as root).
Enhancements:
- Added the -f or --fullscreen switch.
- Changed some chips (removed bloody ones) the game is now "child safe".
- program exits if close window or press [F10].
- if two scores are equal they are ordered by minor time.
- time stops during a combo FX.
- the hiscores screen displays a "press right mouse button to return" sign.

The goal of RUMT is to check the memory of a computer over a long period of time and almost-real load conditions without having to interrupt the services.

RUMT exploits the possibility of some Unix kernels to selectivly disable some memory areas while still accessing them through the /dev/mem device. The principle of RUMT is to write pseudo-random data in these disabled memory areas, and later check them. This principle and the original code for the deterministic pseudo-random generator are from David Madore.

This distribution contains another variant on the same theme: URUMT allocates a large chunk of memory, locks it in memory using the mlock(2) system call, and scans /dev/mem to find where in physical memory the allocated area is. Then it continuously runs the same tests in that memory.

URUMT can not be used to test a particular area of memory: the kernel will give it whatever physical memory it feels like. But URUMT can be restarted now and then, hopefully getting different physical memory each time.

This is perfect if you suspect you have bad bits, but do not know at all where they are. Once you have sighted the bad bits, you can use a plain RUMT to test more extensively the neighborhood.

Guarded Memory Move project gets handy when you have to study buffer overflows and you need to catch them together with a "good" stack image. When a stack overflow has been exploited, the back trace is already gone together with good information about parameters and local variables, that are of vital importance when trying to understand how the attacker is trying to work out the exploit. The GMM library uses dynamic function call interception to catch the most common functions that are used by attackers to exploit stack buffers.
The GMM library uses the LD_PRELOAD capability and offers two services to the user. First of all, it avoids buffer overflow to allow the attacker to execute shell-code on your machine. Second, in case where an exploit is detected, the stack content is saved and a segmentation fault is triggered. The resulting core dump will then have all the necessary information to debug the exploit and fix the software. Internally, the library insert itself between the application and the glibc library and intercept functions that might lead to buffer overflow exploits. Before calling the glibc core function, the GMM layer saves part of the stack frame above the caller to a temporary location in its frame.
It also stores the previous three return addresses in its local storage before calling the glibc core function. When the core function returns, the GMM code samples again the previously recorded return addresses and, if they differ, it restores the previously saved stack frame and issue a segmentation fault. This with a clean stack frame, so that it can be inspected with a debugger. While other solutions exist to detect buffer overflow exploits, like for example StackGuard and StackShield, those differs from GMM in many ways. They live as gcc patches and do require you to rebuild your application to use their functionalities. The good of this approach is that every single function is protected against buffer overflows.
The bad of this solution is that every single function is protected against buffer overflows. That is, performance regression on the whole application, even if this is not really a huge problem when hunting for buffer overflows. Another solution similar to GMM is LibSafe, but it does not save and restore the stack frame by making it unusable for debugging. But lets see how GMM differs from the above listed solutions. First of all, GMM works everywhere there are stack frames and the gcc and glibc duo. That means that it is not limited to i386 only. And now the real reason for the GMM existence.
Enhancements:
- GCCs __builtin_return_address and __builtin_frame_address seems to return garbage instead of NULL at the last frame. This release fixes the problem.

Monkeys Memory is an implementation of the classic game of memory. Classic Game of Memory written in mono where you can play against other people (on the same computer, network game is not implemented jet) or against Computer (there is 2 type of computer player).

There is more level of game from tiny level to very big one.

DBPrim project is a library providing basic building blocks for creating in-memory databases.
Main features:
- Linked lists
- Hash tables with optional auto-resize
- Memory-efficient sparse matrices built on hash tables
- Red-black trees.