mm_granmark.c 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124
  1. /****************************************************************************
  2. * mm/mm_gran/mm_granmark.c
  3. *
  4. * Copyright (C) 2012, 2014 Gregory Nutt. All rights reserved.
  5. * Author: Gregory Nutt <gnutt@nuttx.org>
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions
  9. * are met:
  10. *
  11. * 1. Redistributions of source code must retain the above copyright
  12. * notice, this list of conditions and the following disclaimer.
  13. * 2. Redistributions in binary form must reproduce the above copyright
  14. * notice, this list of conditions and the following disclaimer in
  15. * the documentation and/or other materials provided with the
  16. * distribution.
  17. * 3. Neither the name NuttX nor the names of its contributors may be
  18. * used to endorse or promote products derived from this software
  19. * without specific prior written permission.
  20. *
  21. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  22. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  23. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
  24. * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
  25. * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
  26. * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
  27. * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
  28. * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
  29. * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  30. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
  31. * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  32. * POSSIBILITY OF SUCH DAMAGE.
  33. *
  34. ****************************************************************************/
  35. /****************************************************************************
  36. * Included Files
  37. ****************************************************************************/
  38. #include <nuttx/config.h>
  39. #include <assert.h>
  40. #include <nuttx/mm/gran.h>
  41. #include "mm_gran/mm_gran.h"
  42. #ifdef CONFIG_GRAN
  43. /****************************************************************************
  44. * Public Functions
  45. ****************************************************************************/
  46. /****************************************************************************
  47. * Name: gran_mark_allocated
  48. *
  49. * Description:
  50. * Mark a range of granules as allocated.
  51. *
  52. * Input Parameters:
  53. * priv - The granule heap state structure.
  54. * alloc - The address of the allocation.
  55. * ngranules - The number of granules allocated
  56. *
  57. * Returned Value:
  58. * None
  59. *
  60. ****************************************************************************/
  61. void gran_mark_allocated(FAR struct gran_s *priv, uintptr_t alloc,
  62. unsigned int ngranules)
  63. {
  64. unsigned int granno;
  65. unsigned int gatidx;
  66. unsigned int gatbit;
  67. unsigned int avail;
  68. uint32_t gatmask;
  69. /* Determine the granule number of the allocation */
  70. granno = (alloc - priv->heapstart) >> priv->log2gran;
  71. /* Determine the GAT table index associated with the allocation */
  72. gatidx = granno >> 5;
  73. gatbit = granno & 31;
  74. /* Mark bits in the GAT entry or entries */
  75. avail = 32 - gatbit;
  76. if (ngranules > avail)
  77. {
  78. /* Mark bits in the first GAT entry */
  79. gatmask = 0xffffffff << gatbit;
  80. DEBUGASSERT((priv->gat[gatidx] & gatmask) == 0);
  81. priv->gat[gatidx] |= gatmask;
  82. ngranules -= avail;
  83. /* Mark bits in the second GAT entry */
  84. gatmask = 0xffffffff >> (32 - ngranules);
  85. DEBUGASSERT((priv->gat[gatidx+1] & gatmask) == 0);
  86. priv->gat[gatidx+1] |= gatmask;
  87. }
  88. /* Handle the case where where all of the granules come from one entry */
  89. else
  90. {
  91. /* Mark bits in a single GAT entry */
  92. gatmask = 0xffffffff >> (32 - ngranules);
  93. gatmask <<= gatbit;
  94. DEBUGASSERT((priv->gat[gatidx] & gatmask) == 0);
  95. priv->gat[gatidx] |= gatmask;
  96. return;
  97. }
  98. }
  99. #endif /* CONFIG_GRAN */