Junichi Katsu / Mbed 2 deprecated WallbotR4_BTLE

Important changes to repositories hosted on mbed.com

Mbed hosted mercurial repositories are deprecated and are due to be permanently deleted in July 2026.

To keep a copy of this software download the repository Zip archive or clone locally using Mercurial.

It is also possible to export all your personal repositories from the account settings page.

Dependencies:   FatFileSystem HighSpeedAnalogIn TB6612FNG2 mbed

btstack/memory_pool.c@0:373bcb197dc8, 2013-05-10 (annotated)

Committer:
jksoft
Date:
Fri May 10 11:48:07 2013 +0000
Revision:
0:373bcb197dc8
?????????

Who changed what in which revision?

UserRevisionLine numberNew contents of line
jksoft 0:373bcb197dc8 1 /*
jksoft 0:373bcb197dc8 2 * Copyright (C) 2011 by Matthias Ringwald
jksoft 0:373bcb197dc8 3 *
jksoft 0:373bcb197dc8 4 * Redistribution and use in source and binary forms, with or without
jksoft 0:373bcb197dc8 5 * modification, are permitted provided that the following conditions
jksoft 0:373bcb197dc8 6 * are met:
jksoft 0:373bcb197dc8 7 *
jksoft 0:373bcb197dc8 8 * 1. Redistributions of source code must retain the above copyright
jksoft 0:373bcb197dc8 9 * notice, this list of conditions and the following disclaimer.
jksoft 0:373bcb197dc8 10 * 2. Redistributions in binary form must reproduce the above copyright
jksoft 0:373bcb197dc8 11 * notice, this list of conditions and the following disclaimer in the
jksoft 0:373bcb197dc8 12 * documentation and/or other materials provided with the distribution.
jksoft 0:373bcb197dc8 13 * 3. Neither the name of the copyright holders nor the names of
jksoft 0:373bcb197dc8 14 * contributors may be used to endorse or promote products derived
jksoft 0:373bcb197dc8 15 * from this software without specific prior written permission.
jksoft 0:373bcb197dc8 16 *
jksoft 0:373bcb197dc8 17 * THIS SOFTWARE IS PROVIDED BY MATTHIAS RINGWALD AND CONTRIBUTORS
jksoft 0:373bcb197dc8 18 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
jksoft 0:373bcb197dc8 19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
jksoft 0:373bcb197dc8 20 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL MATTHIAS
jksoft 0:373bcb197dc8 21 * RINGWALD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
jksoft 0:373bcb197dc8 22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
jksoft 0:373bcb197dc8 23 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
jksoft 0:373bcb197dc8 24 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
jksoft 0:373bcb197dc8 25 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
jksoft 0:373bcb197dc8 26 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
jksoft 0:373bcb197dc8 27 * THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
jksoft 0:373bcb197dc8 28 * SUCH DAMAGE.
jksoft 0:373bcb197dc8 29 *
jksoft 0:373bcb197dc8 30 */
jksoft 0:373bcb197dc8 31
jksoft 0:373bcb197dc8 32 /*
jksoft 0:373bcb197dc8 33 * memory_pool.c
jksoft 0:373bcb197dc8 34 *
jksoft 0:373bcb197dc8 35 * Fixed-size block allocation
jksoft 0:373bcb197dc8 36 *
jksoft 0:373bcb197dc8 37 * Free blocks are kept in singly linked list
jksoft 0:373bcb197dc8 38 *
jksoft 0:373bcb197dc8 39 */
jksoft 0:373bcb197dc8 40
jksoft 0:373bcb197dc8 41 #include <btstack/memory_pool.h>
jksoft 0:373bcb197dc8 42 #include <stddef.h>
jksoft 0:373bcb197dc8 43
jksoft 0:373bcb197dc8 44 typedef struct node {
jksoft 0:373bcb197dc8 45 struct node * next;
jksoft 0:373bcb197dc8 46 } node_t;
jksoft 0:373bcb197dc8 47
jksoft 0:373bcb197dc8 48 void memory_pool_create(memory_pool_t *pool, void * storage, int count, int block_size){
jksoft 0:373bcb197dc8 49 node_t *free_blocks = (node_t*) pool;
jksoft 0:373bcb197dc8 50 char *mem_ptr = (char *) storage;
jksoft 0:373bcb197dc8 51 int i;
jksoft 0:373bcb197dc8 52
jksoft 0:373bcb197dc8 53 // create singly linked list of all available blocks
jksoft 0:373bcb197dc8 54 free_blocks->next = NULL;
jksoft 0:373bcb197dc8 55 for (i = 0 ; i < count ; i++){
jksoft 0:373bcb197dc8 56 memory_pool_free(pool, mem_ptr);
jksoft 0:373bcb197dc8 57 mem_ptr += block_size;
jksoft 0:373bcb197dc8 58 }
jksoft 0:373bcb197dc8 59 }
jksoft 0:373bcb197dc8 60
jksoft 0:373bcb197dc8 61 void * memory_pool_get(memory_pool_t *pool){
jksoft 0:373bcb197dc8 62 node_t *free_blocks = (node_t*) pool;
jksoft 0:373bcb197dc8 63
jksoft 0:373bcb197dc8 64 if (!free_blocks->next) return NULL;
jksoft 0:373bcb197dc8 65
jksoft 0:373bcb197dc8 66 // remove first
jksoft 0:373bcb197dc8 67 node_t *node = free_blocks->next;
jksoft 0:373bcb197dc8 68 free_blocks->next = node->next;
jksoft 0:373bcb197dc8 69
jksoft 0:373bcb197dc8 70 return (void*) node;
jksoft 0:373bcb197dc8 71 }
jksoft 0:373bcb197dc8 72
jksoft 0:373bcb197dc8 73 void memory_pool_free(memory_pool_t *pool, void * block){
jksoft 0:373bcb197dc8 74 node_t *free_blocks = (node_t*) pool;
jksoft 0:373bcb197dc8 75 node_t *node = (node_t*) block;
jksoft 0:373bcb197dc8 76 // add block as node to list
jksoft 0:373bcb197dc8 77 node->next = free_blocks->next;
jksoft 0:373bcb197dc8 78 free_blocks->next = node;
jksoft 0:373bcb197dc8 79 }