Rev 768 | Go to most recent revision | Details | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 767 | palkovsky | 1 | /* |
| 2 | * Copyright (C) 2006 Ondrej Palkovsky |
||
| 3 | * All rights reserved. |
||
| 4 | * |
||
| 5 | * Redistribution and use in source and binary forms, with or without |
||
| 6 | * modification, are permitted provided that the following conditions |
||
| 7 | * are met: |
||
| 8 | * |
||
| 9 | * - Redistributions of source code must retain the above copyright |
||
| 10 | * notice, this list of conditions and the following disclaimer. |
||
| 11 | * - Redistributions in binary form must reproduce the above copyright |
||
| 12 | * notice, this list of conditions and the following disclaimer in the |
||
| 13 | * documentation and/or other materials provided with the distribution. |
||
| 14 | * - The name of the author may not be used to endorse or promote products |
||
| 15 | * derived from this software without specific prior written permission. |
||
| 16 | * |
||
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
||
| 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
||
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||
| 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
| 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
||
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
| 27 | */ |
||
| 28 | |||
| 29 | #include <test.h> |
||
| 30 | #include <mm/slab.h> |
||
| 31 | #include <print.h> |
||
| 32 | #include <proc/thread.h> |
||
| 33 | #include <arch.h> |
||
| 34 | #include <panic.h> |
||
| 35 | #include <mm/frame.h> |
||
| 36 | |||
| 37 | #define ITEM_SIZE 256 |
||
| 38 | |||
| 39 | /** Fill memory with 2 caches, when allocation fails, |
||
| 40 | * free one of the caches. We should have everything in magazines, |
||
| 41 | * now allocation should clean magazines and allow for full allocation. |
||
| 42 | */ |
||
| 43 | static void totalmemtest(void) |
||
| 44 | { |
||
| 45 | slab_cache_t *cache1; |
||
| 46 | slab_cache_t *cache2; |
||
| 47 | int i; |
||
| 48 | |||
| 49 | void *data1, *data2; |
||
| 50 | void *olddata1=NULL, *olddata2=NULL; |
||
| 51 | |||
| 52 | cache1 = slab_cache_create("cache1_tst", ITEM_SIZE, 0, NULL, NULL, 0); |
||
| 53 | cache2 = slab_cache_create("cache2_tst", ITEM_SIZE, 0, NULL, NULL, 0); |
||
| 54 | |||
| 55 | printf("Allocating..."); |
||
| 56 | /* Use atomic alloc, so that we find end of memory */ |
||
| 57 | do { |
||
| 58 | data1 = slab_alloc(cache1, FRAME_ATOMIC); |
||
| 59 | data2 = slab_alloc(cache2, FRAME_ATOMIC); |
||
| 60 | if (!data1 || !data2) { |
||
| 61 | if (data1) |
||
| 62 | slab_free(cache1,data1); |
||
| 63 | if (data2) |
||
| 64 | slab_free(cache2,data2); |
||
| 65 | break; |
||
| 66 | } |
||
| 67 | |||
| 68 | *((void **)data1) = olddata1; |
||
| 69 | *((void **)data2) = olddata2; |
||
| 70 | olddata1 = data1; |
||
| 71 | olddata2 = data2; |
||
| 72 | }while(1); |
||
| 73 | printf("done.\n"); |
||
| 74 | slab_print_list(); |
||
| 75 | /* We do not have memory - now deallocate cache2 */ |
||
| 76 | printf("Deallocating cache2..."); |
||
| 77 | while (olddata2) { |
||
| 78 | data2 = *((void **)olddata2); |
||
| 79 | slab_free(cache2, olddata2); |
||
| 80 | olddata2 = data2; |
||
| 81 | } |
||
| 82 | printf("done.\n"); |
||
| 83 | |||
| 84 | slab_print_list(); |
||
| 85 | printf("Allocating to cache1...\n"); |
||
| 86 | for (i=0; i<30; i++) { |
||
| 87 | data1 = slab_alloc(cache1, FRAME_ATOMIC); |
||
| 88 | if (!data1) { |
||
| 89 | panic("Incorrect memory size - use another test."); |
||
| 90 | } |
||
| 91 | *((void **)data1) = olddata1; |
||
| 92 | olddata1 = data1; |
||
| 93 | } |
||
| 94 | slab_print_list(); |
||
| 95 | while (1) { |
||
| 96 | data1 = slab_alloc(cache1, FRAME_ATOMIC); |
||
| 97 | if (!data1) { |
||
| 98 | break; |
||
| 99 | } |
||
| 100 | *((void **)data1) = olddata1; |
||
| 101 | olddata1 = data1; |
||
| 102 | } |
||
| 103 | slab_print_list(); |
||
| 104 | |||
| 105 | } |
||
| 106 | |||
| 107 | void test(void) |
||
| 108 | { |
||
| 109 | totalmemtest(); |
||
| 110 | } |