Subversion Repositories HelenOS-historic

Rev

Rev 533 | Rev 683 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (C) 2005 Jakub Jermar
  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. #ifndef __BUDDY_H__
  30. #define __BUDDY_H__
  31.  
  32. #include <arch/types.h>
  33. #include <typedefs.h>
  34.  
  35. #define BUDDY_SYSTEM_INNER_BLOCK    0xff
  36.  
  37. /** Buddy system operations to be implemented by each implementations. */
  38. struct buddy_system_operations {
  39.     link_t *(* find_buddy)(buddy_system_t *, link_t *);     /**< Return pointer to left-side or right-side buddy for block passed as argument. */
  40.     link_t *(* bisect)(buddy_system_t *, link_t *);         /**< Bisect the block passed as argument and return pointer to the new right-side buddy. */
  41.     link_t *(* coalesce)(buddy_system_t *, link_t *, link_t *); /**< Coalesce two buddies into a bigger block. */
  42.     void (*set_order)(buddy_system_t *, link_t *, __u8);        /**< Set order of block passed as argument. */
  43.     __u8 (*get_order)(buddy_system_t *, link_t *);          /**< Return order of block passed as argument. */
  44.     void (*mark_busy)(buddy_system_t *, link_t *);          /**< Mark block as busy */
  45. };
  46.  
  47. struct buddy_system {
  48.     __u8 max_order;
  49.     link_t *order;
  50.     buddy_system_operations_t *op;
  51.     void *data;             /**< Pointer to be used by the implementation. */
  52. };
  53.  
  54. extern buddy_system_t *buddy_system_create(__u8 max_order, buddy_system_operations_t *op, void *data);
  55. extern link_t *buddy_system_alloc(buddy_system_t *b, __u8 i);
  56. extern bool buddy_system_can_alloc(buddy_system_t *b, __u8 order);
  57. extern void buddy_system_free(buddy_system_t *b, link_t *block);
  58.  
  59. #endif
  60.