Add FS #10214. Initial commit of the original PDa code for the GSoC Pure Data plugin project of Wincent Balin. Stripped some non-sourcefiles and added a rockbox readme that needs a bit more info from Wincent. Is added to CATEGORIES and viewers, but not yet to SUBDIRS (ie doesn't build yet)

git-svn-id: svn://svn.rockbox.org/rockbox/trunk@21044 a1c6a512-1295-4272-9138-f99709370657

1 files changed, 140 insertions, 0 deletions

diff --git a/apps/plugins/pdbox/dbestfit-3.3/mytest.c b/apps/plugins/pdbox/dbestfit-3.3/mytest.c
new file mode 100644
index 0000000000..bf338b72ef
--- /dev/null
+++ b/apps/plugins/pdbox/dbestfit-3.3/mytest.c
@@ -0,0 +1,140 @@
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "bmalloc.h"
+
+int main(int argc, char **argv)
+{
+  void *pointers[5];
+  int i;
+  void *area;
+
+  for(i=0; i<5; i++)
+    pointers[i] = malloc(8000);
+
+  if(argc>1) {
+    switch(argv[1][0]) {
+    case '1':
+      for(i=0; i<5; i++) {
+        add_pool(pointers[i], 4000);
+        add_pool((char *)pointers[i]+4000, 4000);
+      }
+      break;
+    case '2':
+      area = malloc(20000);
+      add_pool(area, 3000);
+      add_pool((char *)area+6000, 3000);
+      add_pool((char *)area+3000, 3000);
+      add_pool((char *)area+12000, 3000);
+      add_pool((char *)area+9000, 3000);
+      break;
+    case '3':
+      {
+        void *ptr[10];
+        area = malloc(20000);
+        add_pool(area, 20000);
+
+        printf(" ** TEST USAGE\n");
+        for(i=0; i<9; i++)
+          ptr[i]=bmalloc(200);
+        print_lists();
+        for(i=0; i<9; i++)
+          bfree(ptr[i]);
+        printf(" ** END OF TEST USAGE\n");
+      }
+      
+      break;
+    case '4':
+      {
+        void *ptr[10];
+        area = malloc(20000);
+        add_pool(area, 20000);
+
+        ptr[0]=bmalloc(4080);
+        print_lists();
+        bfree(ptr[0]);
+        printf(" ** END OF TEST USAGE\n");
+      }
+      
+      break;
+    }
+  }
+  else
+    for(i=4; i>=0; i--)
+      add_pool(pointers[i], 8000-i*100);
+
+  print_lists();
+
+  return 0;
+}
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "bmalloc.h"
+
+int main(int argc, char **argv)
+{
+  void *pointers[5];
+  int i;
+  void *area;
+
+  for(i=0; i<5; i++)
+    pointers[i] = malloc(8000);
+
+  if(argc>1) {
+    switch(argv[1][0]) {
+    case '1':
+      for(i=0; i<5; i++) {
+        add_pool(pointers[i], 4000);
+        add_pool((char *)pointers[i]+4000, 4000);
+      }
+      break;
+    case '2':
+      area = malloc(20000);
+      add_pool(area, 3000);
+      add_pool((char *)area+6000, 3000);
+      add_pool((char *)area+3000, 3000);
+      add_pool((char *)area+12000, 3000);
+      add_pool((char *)area+9000, 3000);
+      break;
+    case '3':
+      {
+        void *ptr[10];
+        area = malloc(20000);
+        add_pool(area, 20000);
+
+        printf(" ** TEST USAGE\n");
+        for(i=0; i<9; i++)
+          ptr[i]=bmalloc(200);
+        print_lists();
+        for(i=0; i<9; i++)
+          bfree(ptr[i]);
+        printf(" ** END OF TEST USAGE\n");
+      }
+      
+      break;
+    case '4':
+      {
+        void *ptr[10];
+        area = malloc(20000);
+        add_pool(area, 20000);
+
+        ptr[0]=bmalloc(4080);
+        print_lists();
+        bfree(ptr[0]);
+        printf(" ** END OF TEST USAGE\n");
+      }
+      
+      break;
+    }
+  }
+  else
+    for(i=4; i>=0; i--)
+      add_pool(pointers[i], 8000-i*100);
+
+  print_lists();
+
+  return 0;
+}