Simone Mentasti / Mbed 2 deprecated AcquisizioneIMU

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:   F7_Ethernet mbed HTS221 LPS22HB LSM303AGR LSM6DSL

Fork of Nucleo_F746ZG_Ethernet by Dieter Graef

mbed-rtos/rtx/TARGET_CORTEX_A/rt_Memory.c@0:f9b6112278fe, 2016-06-18 (annotated)

Committer:
DieterGraef
Date:
Sat Jun 18 10:49:12 2016 +0000
Revision:
0:f9b6112278fe
Ethernet for the NUCLEO STM32F746 Board Testprogram uses DHCP and NTP to set the clock

Who changed what in which revision?

UserRevisionLine numberNew contents of line
DieterGraef 0:f9b6112278fe 1 /*----------------------------------------------------------------------------
DieterGraef 0:f9b6112278fe 2 * RL-ARM - RTX
DieterGraef 0:f9b6112278fe 3 *----------------------------------------------------------------------------
DieterGraef 0:f9b6112278fe 4 * Name: RT_MEMORY.C
DieterGraef 0:f9b6112278fe 5 * Purpose: Interface functions for Dynamic Memory Management System
DieterGraef 0:f9b6112278fe 6 * Rev.: V4.70
DieterGraef 0:f9b6112278fe 7 *----------------------------------------------------------------------------
DieterGraef 0:f9b6112278fe 8 *
DieterGraef 0:f9b6112278fe 9 * Copyright (c) 1999-2009 KEIL, 2009-2013 ARM Germany GmbH
DieterGraef 0:f9b6112278fe 10 * All rights reserved.
DieterGraef 0:f9b6112278fe 11 * Redistribution and use in source and binary forms, with or without
DieterGraef 0:f9b6112278fe 12 * modification, are permitted provided that the following conditions are met:
DieterGraef 0:f9b6112278fe 13 * - Redistributions of source code must retain the above copyright
DieterGraef 0:f9b6112278fe 14 * notice, this list of conditions and the following disclaimer.
DieterGraef 0:f9b6112278fe 15 * - Redistributions in binary form must reproduce the above copyright
DieterGraef 0:f9b6112278fe 16 * notice, this list of conditions and the following disclaimer in the
DieterGraef 0:f9b6112278fe 17 * documentation and/or other materials provided with the distribution.
DieterGraef 0:f9b6112278fe 18 * - Neither the name of ARM nor the names of its contributors may be used
DieterGraef 0:f9b6112278fe 19 * to endorse or promote products derived from this software without
DieterGraef 0:f9b6112278fe 20 * specific prior written permission.
DieterGraef 0:f9b6112278fe 21 *
DieterGraef 0:f9b6112278fe 22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
DieterGraef 0:f9b6112278fe 23 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
DieterGraef 0:f9b6112278fe 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
DieterGraef 0:f9b6112278fe 25 * ARE DISCLAIMED. IN NO EVENT SHALL COPYRIGHT HOLDERS AND CONTRIBUTORS BE
DieterGraef 0:f9b6112278fe 26 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
DieterGraef 0:f9b6112278fe 27 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
DieterGraef 0:f9b6112278fe 28 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
DieterGraef 0:f9b6112278fe 29 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
DieterGraef 0:f9b6112278fe 30 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
DieterGraef 0:f9b6112278fe 31 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
DieterGraef 0:f9b6112278fe 32 * POSSIBILITY OF SUCH DAMAGE.
DieterGraef 0:f9b6112278fe 33 *---------------------------------------------------------------------------*/
DieterGraef 0:f9b6112278fe 34
DieterGraef 0:f9b6112278fe 35 #include "rt_TypeDef.h"
DieterGraef 0:f9b6112278fe 36 #include "rt_Memory.h"
DieterGraef 0:f9b6112278fe 37
DieterGraef 0:f9b6112278fe 38
DieterGraef 0:f9b6112278fe 39 /* Functions */
DieterGraef 0:f9b6112278fe 40
DieterGraef 0:f9b6112278fe 41 // Initialize Dynamic Memory pool
DieterGraef 0:f9b6112278fe 42 // Parameters:
DieterGraef 0:f9b6112278fe 43 // pool: Pointer to memory pool
DieterGraef 0:f9b6112278fe 44 // size: Size of memory pool in bytes
DieterGraef 0:f9b6112278fe 45 // Return: 0 - OK, 1 - Error
DieterGraef 0:f9b6112278fe 46
DieterGraef 0:f9b6112278fe 47 int rt_init_mem (void *pool, U32 size) {
DieterGraef 0:f9b6112278fe 48 MEMP *ptr;
DieterGraef 0:f9b6112278fe 49
DieterGraef 0:f9b6112278fe 50 if ((pool == NULL) || (size < sizeof(MEMP))) return (1);
DieterGraef 0:f9b6112278fe 51
DieterGraef 0:f9b6112278fe 52 ptr = (MEMP *)pool;
DieterGraef 0:f9b6112278fe 53 ptr->next = (MEMP *)((U32)pool + size - sizeof(MEMP *));
DieterGraef 0:f9b6112278fe 54 ptr->next->next = NULL;
DieterGraef 0:f9b6112278fe 55 ptr->len = 0;
DieterGraef 0:f9b6112278fe 56
DieterGraef 0:f9b6112278fe 57 return (0);
DieterGraef 0:f9b6112278fe 58 }
DieterGraef 0:f9b6112278fe 59
DieterGraef 0:f9b6112278fe 60 // Allocate Memory from Memory pool
DieterGraef 0:f9b6112278fe 61 // Parameters:
DieterGraef 0:f9b6112278fe 62 // pool: Pointer to memory pool
DieterGraef 0:f9b6112278fe 63 // size: Size of memory in bytes to allocate
DieterGraef 0:f9b6112278fe 64 // Return: Pointer to allocated memory
DieterGraef 0:f9b6112278fe 65
DieterGraef 0:f9b6112278fe 66 void *rt_alloc_mem (void *pool, U32 size) {
DieterGraef 0:f9b6112278fe 67 MEMP *p, *p_search, *p_new;
DieterGraef 0:f9b6112278fe 68 U32 hole_size;
DieterGraef 0:f9b6112278fe 69
DieterGraef 0:f9b6112278fe 70 if ((pool == NULL) || (size == 0)) return NULL;
DieterGraef 0:f9b6112278fe 71
DieterGraef 0:f9b6112278fe 72 /* Add header offset to 'size' */
DieterGraef 0:f9b6112278fe 73 size += sizeof(MEMP);
DieterGraef 0:f9b6112278fe 74 /* Make sure that block is 4-byte aligned */
DieterGraef 0:f9b6112278fe 75 size = (size + 3) & ~3;
DieterGraef 0:f9b6112278fe 76
DieterGraef 0:f9b6112278fe 77 p_search = (MEMP *)pool;
DieterGraef 0:f9b6112278fe 78 while (1) {
DieterGraef 0:f9b6112278fe 79 hole_size = (U32)p_search->next - (U32)p_search;
DieterGraef 0:f9b6112278fe 80 hole_size -= p_search->len;
DieterGraef 0:f9b6112278fe 81 /* Check if hole size is big enough */
DieterGraef 0:f9b6112278fe 82 if (hole_size >= size) break;
DieterGraef 0:f9b6112278fe 83 p_search = p_search->next;
DieterGraef 0:f9b6112278fe 84 if (p_search->next == NULL) {
DieterGraef 0:f9b6112278fe 85 /* Failed, we are at the end of the list */
DieterGraef 0:f9b6112278fe 86 return NULL;
DieterGraef 0:f9b6112278fe 87 }
DieterGraef 0:f9b6112278fe 88 }
DieterGraef 0:f9b6112278fe 89
DieterGraef 0:f9b6112278fe 90 if (p_search->len == 0) {
DieterGraef 0:f9b6112278fe 91 /* No block is allocated, set the Length of the first element */
DieterGraef 0:f9b6112278fe 92 p_search->len = size;
DieterGraef 0:f9b6112278fe 93 p = (MEMP *)(((U32)p_search) + sizeof(MEMP));
DieterGraef 0:f9b6112278fe 94 } else {
DieterGraef 0:f9b6112278fe 95 /* Insert new list element into the memory list */
DieterGraef 0:f9b6112278fe 96 p_new = (MEMP *)((U32)p_search + p_search->len);
DieterGraef 0:f9b6112278fe 97 p_new->next = p_search->next;
DieterGraef 0:f9b6112278fe 98 p_new->len = size;
DieterGraef 0:f9b6112278fe 99 p_search->next = p_new;
DieterGraef 0:f9b6112278fe 100 p = (MEMP *)(((U32)p_new) + sizeof(MEMP));
DieterGraef 0:f9b6112278fe 101 }
DieterGraef 0:f9b6112278fe 102
DieterGraef 0:f9b6112278fe 103 return (p);
DieterGraef 0:f9b6112278fe 104 }
DieterGraef 0:f9b6112278fe 105
DieterGraef 0:f9b6112278fe 106 // Free Memory and return it to Memory pool
DieterGraef 0:f9b6112278fe 107 // Parameters:
DieterGraef 0:f9b6112278fe 108 // pool: Pointer to memory pool
DieterGraef 0:f9b6112278fe 109 // mem: Pointer to memory to free
DieterGraef 0:f9b6112278fe 110 // Return: 0 - OK, 1 - Error
DieterGraef 0:f9b6112278fe 111
DieterGraef 0:f9b6112278fe 112 int rt_free_mem (void *pool, void *mem) {
DieterGraef 0:f9b6112278fe 113 MEMP *p_search, *p_prev, *p_return;
DieterGraef 0:f9b6112278fe 114
DieterGraef 0:f9b6112278fe 115 if ((pool == NULL) || (mem == NULL)) return (1);
DieterGraef 0:f9b6112278fe 116
DieterGraef 0:f9b6112278fe 117 p_return = (MEMP *)((U32)mem - sizeof(MEMP));
DieterGraef 0:f9b6112278fe 118
DieterGraef 0:f9b6112278fe 119 /* Set list header */
DieterGraef 0:f9b6112278fe 120 p_prev = NULL;
DieterGraef 0:f9b6112278fe 121 p_search = (MEMP *)pool;
DieterGraef 0:f9b6112278fe 122 while (p_search != p_return) {
DieterGraef 0:f9b6112278fe 123 p_prev = p_search;
DieterGraef 0:f9b6112278fe 124 p_search = p_search->next;
DieterGraef 0:f9b6112278fe 125 if (p_search == NULL) {
DieterGraef 0:f9b6112278fe 126 /* Valid Memory block not found */
DieterGraef 0:f9b6112278fe 127 return (1);
DieterGraef 0:f9b6112278fe 128 }
DieterGraef 0:f9b6112278fe 129 }
DieterGraef 0:f9b6112278fe 130
DieterGraef 0:f9b6112278fe 131 if (p_prev == NULL) {
DieterGraef 0:f9b6112278fe 132 /* First block to be released, only set length to 0 */
DieterGraef 0:f9b6112278fe 133 p_search->len = 0;
DieterGraef 0:f9b6112278fe 134 } else {
DieterGraef 0:f9b6112278fe 135 /* Discard block from chain list */
DieterGraef 0:f9b6112278fe 136 p_prev->next = p_search->next;
DieterGraef 0:f9b6112278fe 137 }
DieterGraef 0:f9b6112278fe 138
DieterGraef 0:f9b6112278fe 139 return (0);
DieterGraef 0:f9b6112278fe 140 }