block_header.c 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143
  1. /*
  2. * Copyright 2011 Institute of Communication and Computer Systems (ICCS)
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. *
  16. */
  17. #include "block_header.h"
  18. block_header_t * get_header(void *ptr) {
  19. return (block_header_t *) ((char *) ptr - HEADER_SIZE);
  20. }
  21. size_t get_size(void *ptr) {
  22. return get_header(ptr)->size >> 1;
  23. }
  24. #ifdef FUTURE_FEATURES
  25. size_t get_requested_size(void *ptr) {
  26. return get_header(ptr)->requested_size;
  27. }
  28. #endif /* FUTURE_FEATURES */
  29. size_t get_size_availability(void *ptr) {
  30. return get_header(ptr)->size;
  31. }
  32. void set_size_and_free(allocator_t *allocator, void *ptr, size_t size) {
  33. block_header_t *next_block_header;
  34. get_header(ptr)->size = size << 1;
  35. if(allocator->border_ptr != ptr) {
  36. next_block_header = (block_header_t *) ((char *) ptr + get_size(ptr));
  37. next_block_header->previous_size = size << 1;
  38. }
  39. }
  40. void set_size_and_used(allocator_t *allocator, void *ptr, size_t size) {
  41. block_header_t *header, *next_block_header;
  42. header = get_header(ptr);
  43. header->size = size << 1;
  44. header->size |= 1;
  45. if(allocator->border_ptr != ptr) {
  46. next_block_header = (block_header_t *) ((char *) ptr + get_size(ptr));
  47. next_block_header->previous_size = size << 1;
  48. next_block_header->previous_size |= 1;
  49. }
  50. }
  51. #ifdef FUTURE_FEATURES
  52. void set_requested_size(void *ptr, size_t size) {
  53. get_header(ptr)->requested_size = size;
  54. }
  55. #endif /* FUTURE_FEATURES */
  56. void mark_used(allocator_t *allocator, void *ptr) {
  57. block_header_t *next_block_header;
  58. get_header(ptr)->size |= 1;
  59. if(allocator->border_ptr != ptr) {
  60. next_block_header = (block_header_t *) ((char *) ptr + get_size(ptr));
  61. next_block_header->previous_size |= 1;
  62. }
  63. }
  64. void mark_free(allocator_t *allocator, void *ptr) {
  65. block_header_t *next_block_header;
  66. get_header(ptr)->size &= (~ 0x1U);
  67. if(allocator->border_ptr != ptr) {
  68. next_block_header = (block_header_t *) ((char *) ptr + get_size(ptr));
  69. next_block_header->previous_size &= (~ 0x1U);
  70. }
  71. }
  72. #ifdef WITH_OWNERSHIP
  73. void set_owner(void *ptr, heap_t *heap_owner) {
  74. get_header(ptr)->heap_owner = heap_owner;
  75. }
  76. heap_t * get_owner(void *ptr) {
  77. return get_header(ptr)->heap_owner;
  78. }
  79. #endif /* WITH_OWNERSHIP */
  80. bool is_free(void *ptr) {
  81. if(get_header(ptr)->size & (size_t) 1) {
  82. return false;
  83. } else {
  84. return true;
  85. }
  86. }
  87. bool is_previous_free(void *ptr) {
  88. if(get_header(ptr)->previous_size & (size_t) 1) {
  89. return false;
  90. } else {
  91. return true;
  92. }
  93. }
  94. void set_previous_size_availability(void *ptr, size_t previous_size_availability) {
  95. get_header(ptr)->previous_size = previous_size_availability;
  96. }
  97. size_t get_previous_size(void *ptr) {
  98. return get_header(ptr)->previous_size >> 1;
  99. }
  100. size_t get_previous_size_availability(void *ptr) {
  101. return get_header(ptr)->previous_size;
  102. }
  103. void * get_dlprevious(void *ptr) {
  104. return (void *) ((char *) ptr - HEADER_SIZE - get_previous_size(ptr));
  105. }
  106. void * get_dlnext(allocator_t *allocator, void *ptr) {
  107. if(allocator->border_ptr != ptr) {
  108. return (void *) ((char *) ptr + get_size(ptr) + HEADER_SIZE);
  109. } else {
  110. return NULL;
  111. }
  112. }