ban4jp -
/
uIP-1-0_webserver
uIP 1.0 based webserver for LPC1114 + ENC28J60
lib/memb.c@0:685224d2f66d, 2014-06-14 (annotated)
- Committer:
- ban4jp
- Date:
- Sat Jun 14 16:02:21 2014 +0000
- Revision:
- 0:685224d2f66d
initial commit.
Who changed what in which revision?
User | Revision | Line number | New contents of line |
---|---|---|---|
ban4jp | 0:685224d2f66d | 1 | /* |
ban4jp | 0:685224d2f66d | 2 | * Copyright (c) 2004, Swedish Institute of Computer Science. |
ban4jp | 0:685224d2f66d | 3 | * All rights reserved. |
ban4jp | 0:685224d2f66d | 4 | * |
ban4jp | 0:685224d2f66d | 5 | * Redistribution and use in source and binary forms, with or without |
ban4jp | 0:685224d2f66d | 6 | * modification, are permitted provided that the following conditions |
ban4jp | 0:685224d2f66d | 7 | * are met: |
ban4jp | 0:685224d2f66d | 8 | * 1. Redistributions of source code must retain the above copyright |
ban4jp | 0:685224d2f66d | 9 | * notice, this list of conditions and the following disclaimer. |
ban4jp | 0:685224d2f66d | 10 | * 2. Redistributions in binary form must reproduce the above copyright |
ban4jp | 0:685224d2f66d | 11 | * notice, this list of conditions and the following disclaimer in the |
ban4jp | 0:685224d2f66d | 12 | * documentation and/or other materials provided with the distribution. |
ban4jp | 0:685224d2f66d | 13 | * 3. Neither the name of the Institute nor the names of its contributors |
ban4jp | 0:685224d2f66d | 14 | * may be used to endorse or promote products derived from this software |
ban4jp | 0:685224d2f66d | 15 | * without specific prior written permission. |
ban4jp | 0:685224d2f66d | 16 | * |
ban4jp | 0:685224d2f66d | 17 | * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND |
ban4jp | 0:685224d2f66d | 18 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
ban4jp | 0:685224d2f66d | 19 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
ban4jp | 0:685224d2f66d | 20 | * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE |
ban4jp | 0:685224d2f66d | 21 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
ban4jp | 0:685224d2f66d | 22 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
ban4jp | 0:685224d2f66d | 23 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
ban4jp | 0:685224d2f66d | 24 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
ban4jp | 0:685224d2f66d | 25 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
ban4jp | 0:685224d2f66d | 26 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
ban4jp | 0:685224d2f66d | 27 | * SUCH DAMAGE. |
ban4jp | 0:685224d2f66d | 28 | * |
ban4jp | 0:685224d2f66d | 29 | * This file is part of the uIP TCP/IP stack |
ban4jp | 0:685224d2f66d | 30 | * |
ban4jp | 0:685224d2f66d | 31 | * Author: Adam Dunkels <adam@sics.se> |
ban4jp | 0:685224d2f66d | 32 | * |
ban4jp | 0:685224d2f66d | 33 | * $Id: memb.c,v 1.1 2006/06/12 08:21:43 adam Exp $ |
ban4jp | 0:685224d2f66d | 34 | */ |
ban4jp | 0:685224d2f66d | 35 | |
ban4jp | 0:685224d2f66d | 36 | /** |
ban4jp | 0:685224d2f66d | 37 | * \addtogroup memb |
ban4jp | 0:685224d2f66d | 38 | * @{ |
ban4jp | 0:685224d2f66d | 39 | */ |
ban4jp | 0:685224d2f66d | 40 | |
ban4jp | 0:685224d2f66d | 41 | /** |
ban4jp | 0:685224d2f66d | 42 | * \file |
ban4jp | 0:685224d2f66d | 43 | * Memory block allocation routines. |
ban4jp | 0:685224d2f66d | 44 | * \author Adam Dunkels <adam@sics.se> |
ban4jp | 0:685224d2f66d | 45 | */ |
ban4jp | 0:685224d2f66d | 46 | #include <string.h> |
ban4jp | 0:685224d2f66d | 47 | |
ban4jp | 0:685224d2f66d | 48 | #include "memb.h" |
ban4jp | 0:685224d2f66d | 49 | |
ban4jp | 0:685224d2f66d | 50 | /*---------------------------------------------------------------------------*/ |
ban4jp | 0:685224d2f66d | 51 | void |
ban4jp | 0:685224d2f66d | 52 | memb_init(struct memb_blocks *m) |
ban4jp | 0:685224d2f66d | 53 | { |
ban4jp | 0:685224d2f66d | 54 | memset(m->count, 0, m->num); |
ban4jp | 0:685224d2f66d | 55 | memset(m->mem, 0, m->size * m->num); |
ban4jp | 0:685224d2f66d | 56 | } |
ban4jp | 0:685224d2f66d | 57 | /*---------------------------------------------------------------------------*/ |
ban4jp | 0:685224d2f66d | 58 | void * |
ban4jp | 0:685224d2f66d | 59 | memb_alloc(struct memb_blocks *m) |
ban4jp | 0:685224d2f66d | 60 | { |
ban4jp | 0:685224d2f66d | 61 | int i; |
ban4jp | 0:685224d2f66d | 62 | |
ban4jp | 0:685224d2f66d | 63 | for(i = 0; i < m->num; ++i) { |
ban4jp | 0:685224d2f66d | 64 | if(m->count[i] == 0) { |
ban4jp | 0:685224d2f66d | 65 | /* If this block was unused, we increase the reference count to |
ban4jp | 0:685224d2f66d | 66 | indicate that it now is used and return a pointer to the |
ban4jp | 0:685224d2f66d | 67 | memory block. */ |
ban4jp | 0:685224d2f66d | 68 | ++(m->count[i]); |
ban4jp | 0:685224d2f66d | 69 | return (void *)((char *)m->mem + (i * m->size)); |
ban4jp | 0:685224d2f66d | 70 | } |
ban4jp | 0:685224d2f66d | 71 | } |
ban4jp | 0:685224d2f66d | 72 | |
ban4jp | 0:685224d2f66d | 73 | /* No free block was found, so we return NULL to indicate failure to |
ban4jp | 0:685224d2f66d | 74 | allocate block. */ |
ban4jp | 0:685224d2f66d | 75 | return NULL; |
ban4jp | 0:685224d2f66d | 76 | } |
ban4jp | 0:685224d2f66d | 77 | /*---------------------------------------------------------------------------*/ |
ban4jp | 0:685224d2f66d | 78 | char |
ban4jp | 0:685224d2f66d | 79 | memb_free(struct memb_blocks *m, void *ptr) |
ban4jp | 0:685224d2f66d | 80 | { |
ban4jp | 0:685224d2f66d | 81 | int i; |
ban4jp | 0:685224d2f66d | 82 | char *ptr2; |
ban4jp | 0:685224d2f66d | 83 | |
ban4jp | 0:685224d2f66d | 84 | /* Walk through the list of blocks and try to find the block to |
ban4jp | 0:685224d2f66d | 85 | which the pointer "ptr" points to. */ |
ban4jp | 0:685224d2f66d | 86 | ptr2 = (char *)m->mem; |
ban4jp | 0:685224d2f66d | 87 | for(i = 0; i < m->num; ++i) { |
ban4jp | 0:685224d2f66d | 88 | |
ban4jp | 0:685224d2f66d | 89 | if(ptr2 == (char *)ptr) { |
ban4jp | 0:685224d2f66d | 90 | /* We've found to block to which "ptr" points so we decrease the |
ban4jp | 0:685224d2f66d | 91 | reference count and return the new value of it. */ |
ban4jp | 0:685224d2f66d | 92 | if(m->count[i] > 0) { |
ban4jp | 0:685224d2f66d | 93 | /* Make sure that we don't deallocate free memory. */ |
ban4jp | 0:685224d2f66d | 94 | --(m->count[i]); |
ban4jp | 0:685224d2f66d | 95 | } |
ban4jp | 0:685224d2f66d | 96 | return m->count[i]; |
ban4jp | 0:685224d2f66d | 97 | } |
ban4jp | 0:685224d2f66d | 98 | ptr2 += m->size; |
ban4jp | 0:685224d2f66d | 99 | } |
ban4jp | 0:685224d2f66d | 100 | return -1; |
ban4jp | 0:685224d2f66d | 101 | } |
ban4jp | 0:685224d2f66d | 102 | /*---------------------------------------------------------------------------*/ |
ban4jp | 0:685224d2f66d | 103 | |
ban4jp | 0:685224d2f66d | 104 | /** @} */ |