Changeset 1eec0b0 for doc/theses/mubeen_zulfiqar_MMath/allocator.tex
- Timestamp:
- Feb 22, 2022, 2:42:45 PM (3 years ago)
- Branches:
- ADT, ast-experimental, enum, master, pthread-emulation, qualifiedEnum
- Children:
- 5cefa43
- Parents:
- 5c216b4
- git-author:
- Peter A. Buhr <pabuhr@…> (02/20/22 20:37:23)
- git-committer:
- Peter A. Buhr <pabuhr@…> (02/22/22 14:42:45)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/theses/mubeen_zulfiqar_MMath/allocator.tex
r5c216b4 r1eec0b0 24 24 \end{itemize} 25 25 26 The new features added to uHeapLmmm (incl. @malloc \_size@ routine)26 The new features added to uHeapLmmm (incl. @malloc_size@ routine) 27 27 \CFA alloc interface with examples. 28 28 … … 99 99 \begin{itemize} 100 100 \item 101 The bump allocation is concurrent as memory taken from sbrk is sharded across all heaps as bump allocation reserve. The lock on bump allocation (on memory taken from sbrk) will only be contended if KTs >N. The contention on sbrk area is less likely as it will only happen in the case if heaps assigned to two KTs get short of bump allocation reserve simultanously.102 \item 103 N heaps are created at the start of the program and destroyed at the end of program. When a KT is created, we only assign it to one of the heaps. When a KT is destroyed, we only dissociate it from the assigned heap but we do not destroy that heap. That heap will go back to our pool-of-heaps, ready to be used by some new KT. And if that heap was shared among multiple KTs (like the case of KTs >N) then, on deletion of one KT, that heap will be still in-use of the other KTs. This will prevent creation and deletion of heaps during run-time as heaps are re-usable which helps in keeping low-memory footprint.101 The bump allocation is concurrent as memory taken from sbrk is sharded across all heaps as bump allocation reserve. The lock on bump allocation (on memory taken from sbrk) will only be contended if KTs $<$ N. The contention on sbrk area is less likely as it will only happen in the case if heaps assigned to two KTs get short of bump allocation reserve simultanously. 102 \item 103 N heaps are created at the start of the program and destroyed at the end of program. When a KT is created, we only assign it to one of the heaps. When a KT is destroyed, we only dissociate it from the assigned heap but we do not destroy that heap. That heap will go back to our pool-of-heaps, ready to be used by some new KT. And if that heap was shared among multiple KTs (like the case of KTs $<$ N) then, on deletion of one KT, that heap will be still in-use of the other KTs. This will prevent creation and deletion of heaps during run-time as heaps are re-usable which helps in keeping low-memory footprint. 104 104 \item 105 105 It is possible to use sharing and stealing techniques to share/find unused storage, when a free list is unused or empty. … … 113 113 114 114 \section{Added Features and Methods} 115 To improve the UHeapLmmm allocator (FIX ME: cite uHeapLmmm) interface and make it more user friendly, we added a few more routines to the C allocator. Also, we built a CFA (FIX ME: cite cforall) interface on top of C interface to increase the usability of the allocator.115 To improve the UHeapLmmm allocator (FIX ME: cite uHeapLmmm) interface and make it more user friendly, we added a few more routines to the C allocator. Also, we built a \CFA (FIX ME: cite cforall) interface on top of C interface to increase the usability of the allocator. 116 116 117 117 \subsection{C Interface} 118 118 We added a few more features and routines to the allocator's C interface that can make the allocator more usable to the programmers. THese features will programmer more control on the dynamic memory allocation. 119 119 120 \subs ubsection void * aalloc( size\_t dim, size\_t elemSize )121 aallocis an extension of malloc. It allows programmer to allocate a dynamic array of objects without calculating the total size of array explicitly. The only alternate of this routine in the other allocators is calloc but calloc also fills the dynamic memory with 0 which makes it slower for a programmer who only wants to dynamically allocate an array of objects without filling it with 0.122 \paragraph{Usage} 123 aalloctakes two parameters.124 125 \begin{itemize} 126 \item 127 dim: number of objects in the array128 \item 129 elemSize: size of the object in the array.130 \end{itemize} 131 It returns address of dynamic object allocatoed on heap that can contain dim number of objects of the size elemSize. On failure, it returns NULLpointer.132 133 \subs ubsection void * resize( void * oaddr, size\_t size )134 resize is an extension of relloc. It allows programmer to reuse a cuurently allocated dynamic object with a new size requirement. Its alternate in the other allocators is reallocbut relloc also copy the data in old object to the new object which makes it slower for the programmer who only wants to reuse an old dynamic object for a new size requirement but does not want to preserve the data in the old object to the new object.135 \paragraph{Usage} 136 resizetakes two parameters.137 138 \begin{itemize} 139 \item 140 oaddr: the address of the old object that needs to be resized.141 \item 142 size: the new size requirement of the to which the old object needs to be resized.143 \end{itemize} 144 It returns an object that is of the size given but it does not preserve the data in the old object. On failure, it returns NULLpointer.145 146 \subs ubsection void * resize( void * oaddr, size\_t nalign, size\_t size )147 This resize is an extension of the above resize(FIX ME: cite above resize). In addition to resizing the size of of an old object, it can also realign the old object to a new alignment requirement.120 \subsection{\lstinline{void * aalloc( size_t dim, size_t elemSize )}} 121 @aalloc@ is an extension of malloc. It allows programmer to allocate a dynamic array of objects without calculating the total size of array explicitly. The only alternate of this routine in the other allocators is calloc but calloc also fills the dynamic memory with 0 which makes it slower for a programmer who only wants to dynamically allocate an array of objects without filling it with 0. 122 \paragraph{Usage} 123 @aalloc@ takes two parameters. 124 125 \begin{itemize} 126 \item 127 @dim@: number of objects in the array 128 \item 129 @elemSize@: size of the object in the array. 130 \end{itemize} 131 It returns address of dynamic object allocatoed on heap that can contain dim number of objects of the size elemSize. On failure, it returns a @NULL@ pointer. 132 133 \subsection{\lstinline{void * resize( void * oaddr, size_t size )}} 134 @resize@ is an extension of relloc. It allows programmer to reuse a cuurently allocated dynamic object with a new size requirement. Its alternate in the other allocators is @realloc@ but relloc also copy the data in old object to the new object which makes it slower for the programmer who only wants to reuse an old dynamic object for a new size requirement but does not want to preserve the data in the old object to the new object. 135 \paragraph{Usage} 136 @resize@ takes two parameters. 137 138 \begin{itemize} 139 \item 140 @oaddr@: the address of the old object that needs to be resized. 141 \item 142 @size@: the new size requirement of the to which the old object needs to be resized. 143 \end{itemize} 144 It returns an object that is of the size given but it does not preserve the data in the old object. On failure, it returns a @NULL@ pointer. 145 146 \subsection{\lstinline{void * resize( void * oaddr, size_t nalign, size_t size )}} 147 This @resize@ is an extension of the above @resize@ (FIX ME: cite above resize). In addition to resizing the size of of an old object, it can also realign the old object to a new alignment requirement. 148 148 \paragraph{Usage} 149 149 This resize takes three parameters. It takes an additional parameter of nalign as compared to the above resize (FIX ME: cite above resize). … … 151 151 \begin{itemize} 152 152 \item 153 oaddr: the address of the old object that needs to be resized.154 \item 155 nalign: the new alignment to which the old object needs to be realigned.156 \item 157 size: the new size requirement of the to which the old object needs to be resized.158 \end{itemize} 159 It returns an object with the size and alignment given in the parameters. On failure, it returns a NULLpointer.160 161 \subs ubsection void * amemalign( size\_t alignment, size\_t dim, size\_t elemSize )153 @oaddr@: the address of the old object that needs to be resized. 154 \item 155 @nalign@: the new alignment to which the old object needs to be realigned. 156 \item 157 @size@: the new size requirement of the to which the old object needs to be resized. 158 \end{itemize} 159 It returns an object with the size and alignment given in the parameters. On failure, it returns a @NULL@ pointer. 160 161 \subsection{\lstinline{void * amemalign( size_t alignment, size_t dim, size_t elemSize )}} 162 162 amemalign is a hybrid of memalign and aalloc. It allows programmer to allocate an aligned dynamic array of objects without calculating the total size of the array explicitly. It frees the programmer from calculating the total size of the array. 163 163 \paragraph{Usage} … … 166 166 \begin{itemize} 167 167 \item 168 alignment: the alignment to which the dynamic array needs to be aligned.169 \item 170 dim: number of objects in the array171 \item 172 elemSize: size of the object in the array.173 \end{itemize} 174 It returns a dynamic array of objects that has the capacity to contain dim number of objects of the size of elemSize. The returned dynamic array is aligned to the given alignment. On failure, it returns NULLpointer.175 176 \subs ubsection void * cmemalign( size\_t alignment, size\_t dim, size\_t elemSize )168 @alignment@: the alignment to which the dynamic array needs to be aligned. 169 \item 170 @dim@: number of objects in the array 171 \item 172 @elemSize@: size of the object in the array. 173 \end{itemize} 174 It returns a dynamic array of objects that has the capacity to contain dim number of objects of the size of elemSize. The returned dynamic array is aligned to the given alignment. On failure, it returns a @NULL@ pointer. 175 176 \subsection{\lstinline{void * cmemalign( size_t alignment, size_t dim, size_t elemSize )}} 177 177 cmemalign is a hybrid of amemalign and calloc. It allows programmer to allocate an aligned dynamic array of objects that is 0 filled. The current way to do this in other allocators is to allocate an aligned object with memalign and then fill it with 0 explicitly. This routine provides both features of aligning and 0 filling, implicitly. 178 178 \paragraph{Usage} … … 181 181 \begin{itemize} 182 182 \item 183 alignment: the alignment to which the dynamic array needs to be aligned.184 \item 185 dim: number of objects in the array186 \item 187 elemSize: size of the object in the array.188 \end{itemize} 189 It returns a dynamic array of objects that has the capacity to contain dim number of objects of the size of elemSize. The returned dynamic array is aligned to the given alignment and is 0 filled. On failure, it returns NULLpointer.190 191 \subs ubsection size\_t malloc\_alignment( void * addr )192 malloc\_alignmentreturns the alignment of a currently allocated dynamic object. It allows the programmer in memory management and personal bookkeeping. It helps the programmer in verofying the alignment of a dynamic object especially in a scenerio similar to prudcer-consumer where a producer allocates a dynamic object and the consumer needs to assure that the dynamic object was allocated with the required alignment.193 \paragraph{Usage} 194 malloc\_alignmenttakes one parameters.195 196 \begin{itemize} 197 \item 198 addr: the address of the currently allocated dynamic object.199 \end{itemize} 200 malloc\_alignmentreturns the alignment of the given dynamic object. On failure, it return the value of default alignment of the uHeapLmmm allocator.201 202 \subs ubsection bool malloc\_zero\_fill( void * addr )203 malloc\_zero\_fillreturns whether a currently allocated dynamic object was initially zero filled at the time of allocation. It allows the programmer in memory management and personal bookkeeping. It helps the programmer in verifying the zero filled property of a dynamic object especially in a scenerio similar to prudcer-consumer where a producer allocates a dynamic object and the consumer needs to assure that the dynamic object was zero filled at the time of allocation.204 \paragraph{Usage} 205 malloc\_zero\_filltakes one parameters.206 207 \begin{itemize} 208 \item 209 addr: the address of the currently allocated dynamic object.210 \end{itemize} 211 malloc\_zero\_fillreturns true if the dynamic object was initially zero filled and return false otherwise. On failure, it returns false.212 213 \subs ubsection size\_t malloc\_size( void * addr )214 malloc\_size returns the allocation size of a currently allocated dynamic object. It allows the programmer in memory management and personal bookkeeping. It helps the programmer in verofying the alignment of a dynamic object especially in a scenerio similar to prudcer-consumer where a producer allocates a dynamic object and the consumer needs to assure that the dynamic object was allocated with the required size. Its current alternate in the other allocators is malloc\_usable\_size. But, malloc\_size is different from malloc\_usable\_size as malloc\_usabe\_size returns the total data capacity of dynamic object including the extra space at the end of the dynamic object. On the other hand, malloc\_sizereturns the size that was given to the allocator at the allocation of the dynamic object. This size is updated when an object is realloced, resized, or passed through a similar allocator routine.215 \paragraph{Usage} 216 malloc\_sizetakes one parameters.217 218 \begin{itemize} 219 \item 220 addr: the address of the currently allocated dynamic object.221 \end{itemize} 222 malloc\_sizereturns the allocation size of the given dynamic object. On failure, it return zero.223 224 \subs ubsection void * realloc( void * oaddr, size\_t nalign, size\_t size )225 This realloc is an extension of the default realloc (FIX ME: cite default realloc). In addition to reallocating an old object and preserving the data in old object, it can also realign the old object to a new alignment requirement.226 \paragraph{Usage} 227 This realloc takes three parameters. It takes an additional parameter of nalign as compared to the default realloc.228 229 \begin{itemize} 230 \item 231 oaddr: the address of the old object that needs to be reallocated.232 \item 233 nalign: the new alignment to which the old object needs to be realigned.234 \item 235 size: the new size requirement of the to which the old object needs to be resized.236 \end{itemize} 237 It returns an object with the size and alignment given in the parameters that preserves the data in the old object. On failure, it returns a NULLpointer.238 239 \subsection{ CFA Malloc Interface}240 We added some routines to the malloc interface of CFA. These routines can only be used in CFA and not in our standalone uHeapLmmm allocator as these routines use some features that are only provided byCFA and not by C. It makes the allocator even more usable to the programmers.241 CFA provides the liberty to know the returned type of a call to the allocator. So, mainly in these added routines, we removed the object size parameter from the routine as allocator can calculate the size of the object from the returned type.242 243 \subs ubsection T * malloc( void )183 @alignment@: the alignment to which the dynamic array needs to be aligned. 184 \item 185 @dim@: number of objects in the array 186 \item 187 @elemSize@: size of the object in the array. 188 \end{itemize} 189 It returns a dynamic array of objects that has the capacity to contain dim number of objects of the size of elemSize. The returned dynamic array is aligned to the given alignment and is 0 filled. On failure, it returns a @NULL@ pointer. 190 191 \subsection{\lstinline{size_t malloc_alignment( void * addr )}} 192 @malloc_alignment@ returns the alignment of a currently allocated dynamic object. It allows the programmer in memory management and personal bookkeeping. It helps the programmer in verofying the alignment of a dynamic object especially in a scenerio similar to prudcer-consumer where a producer allocates a dynamic object and the consumer needs to assure that the dynamic object was allocated with the required alignment. 193 \paragraph{Usage} 194 @malloc_alignment@ takes one parameters. 195 196 \begin{itemize} 197 \item 198 @addr@: the address of the currently allocated dynamic object. 199 \end{itemize} 200 @malloc_alignment@ returns the alignment of the given dynamic object. On failure, it return the value of default alignment of the uHeapLmmm allocator. 201 202 \subsection{\lstinline{bool malloc_zero_fill( void * addr )}} 203 @malloc_zero_fill@ returns whether a currently allocated dynamic object was initially zero filled at the time of allocation. It allows the programmer in memory management and personal bookkeeping. It helps the programmer in verifying the zero filled property of a dynamic object especially in a scenerio similar to prudcer-consumer where a producer allocates a dynamic object and the consumer needs to assure that the dynamic object was zero filled at the time of allocation. 204 \paragraph{Usage} 205 @malloc_zero_fill@ takes one parameters. 206 207 \begin{itemize} 208 \item 209 @addr@: the address of the currently allocated dynamic object. 210 \end{itemize} 211 @malloc_zero_fill@ returns true if the dynamic object was initially zero filled and return false otherwise. On failure, it returns false. 212 213 \subsection{\lstinline{size_t malloc_size( void * addr )}} 214 @malloc_size@ returns the allocation size of a currently allocated dynamic object. It allows the programmer in memory management and personal bookkeeping. It helps the programmer in verofying the alignment of a dynamic object especially in a scenerio similar to prudcer-consumer where a producer allocates a dynamic object and the consumer needs to assure that the dynamic object was allocated with the required size. Its current alternate in the other allocators is @malloc_usable_size@. But, @malloc_size@ is different from @malloc_usable_size@ as @malloc_usabe_size@ returns the total data capacity of dynamic object including the extra space at the end of the dynamic object. On the other hand, @malloc_size@ returns the size that was given to the allocator at the allocation of the dynamic object. This size is updated when an object is realloced, resized, or passed through a similar allocator routine. 215 \paragraph{Usage} 216 @malloc_size@ takes one parameters. 217 218 \begin{itemize} 219 \item 220 @addr@: the address of the currently allocated dynamic object. 221 \end{itemize} 222 @malloc_size@ returns the allocation size of the given dynamic object. On failure, it return zero. 223 224 \subsection{\lstinline{void * realloc( void * oaddr, size_t nalign, size_t size )}} 225 This @realloc@ is an extension of the default @realloc@ (FIX ME: cite default @realloc@). In addition to reallocating an old object and preserving the data in old object, it can also realign the old object to a new alignment requirement. 226 \paragraph{Usage} 227 This @realloc@ takes three parameters. It takes an additional parameter of nalign as compared to the default @realloc@. 228 229 \begin{itemize} 230 \item 231 @oaddr@: the address of the old object that needs to be reallocated. 232 \item 233 @nalign@: the new alignment to which the old object needs to be realigned. 234 \item 235 @size@: the new size requirement of the to which the old object needs to be resized. 236 \end{itemize} 237 It returns an object with the size and alignment given in the parameters that preserves the data in the old object. On failure, it returns a @NULL@ pointer. 238 239 \subsection{\CFA Malloc Interface} 240 We added some routines to the malloc interface of \CFA. These routines can only be used in \CFA and not in our standalone uHeapLmmm allocator as these routines use some features that are only provided by \CFA and not by C. It makes the allocator even more usable to the programmers. 241 \CFA provides the liberty to know the returned type of a call to the allocator. So, mainly in these added routines, we removed the object size parameter from the routine as allocator can calculate the size of the object from the returned type. 242 243 \subsection{\lstinline{T * malloc( void )}} 244 244 This malloc is a simplified polymorphic form of defualt malloc (FIX ME: cite malloc). It does not take any parameter as compared to default malloc that takes one parameter. 245 245 \paragraph{Usage} 246 246 This malloc takes no parameters. 247 It returns a dynamic object of the size of type T. On failure, it return NULLpointer.248 249 \subs ubsection T * aalloc( size\_t dim )247 It returns a dynamic object of the size of type @T@. On failure, it returns a @NULL@ pointer. 248 249 \subsection{\lstinline{T * aalloc( size_t dim )}} 250 250 This aalloc is a simplified polymorphic form of above aalloc (FIX ME: cite aalloc). It takes one parameter as compared to the above aalloc that takes two parameters. 251 251 \paragraph{Usage} … … 254 254 \begin{itemize} 255 255 \item 256 dim: required number of objects in the array.257 \end{itemize} 258 It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type T. On failure, it return NULLpointer.259 260 \subs ubsection T * calloc( size\_t dim )256 @dim@: required number of objects in the array. 257 \end{itemize} 258 It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type @T@. On failure, it returns a @NULL@ pointer. 259 260 \subsection{\lstinline{T * calloc( size_t dim )}} 261 261 This calloc is a simplified polymorphic form of defualt calloc (FIX ME: cite calloc). It takes one parameter as compared to the default calloc that takes two parameters. 262 262 \paragraph{Usage} … … 265 265 \begin{itemize} 266 266 \item 267 dim: required number of objects in the array.268 \end{itemize} 269 It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type T. On failure, it return NULLpointer.270 271 \subs ubsection T * resize( T * ptr, size\_t size )272 This resize is a simplified polymorphic form of above resize (FIX ME: cite resize with alignment). It takes two parameters as compared to the above resize that takes three parameters. It frees the programmer from explicitly mentioning the alignment of the allocation as CFA provides gives allocator the liberty to get the alignment of the returned type.267 @dim@: required number of objects in the array. 268 \end{itemize} 269 It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type @T@. On failure, it returns a @NULL@ pointer. 270 271 \subsection{\lstinline{T * resize( T * ptr, size_t size )}} 272 This resize is a simplified polymorphic form of above resize (FIX ME: cite resize with alignment). It takes two parameters as compared to the above resize that takes three parameters. It frees the programmer from explicitly mentioning the alignment of the allocation as \CFA provides gives allocator the liberty to get the alignment of the returned type. 273 273 \paragraph{Usage} 274 274 This resize takes two parameters. … … 276 276 \begin{itemize} 277 277 \item 278 ptr: address of the old object.279 \item 280 size: the required size of the new object.281 \end{itemize} 282 It returns a dynamic object of the size given in paramters. The returned object is aligned to the alignemtn of type T. On failure, it return NULLpointer.283 284 \subs ubsection T * realloc( T * ptr, size\_t size )285 This realloc is a simplified polymorphic form of defualt realloc (FIX ME: cite realloc with align). It takes two parameters as compared to the above realloc that takes three parameters. It frees the programmer from explicitly mentioning the alignment of the allocation asCFA provides gives allocator the liberty to get the alignment of the returned type.286 \paragraph{Usage} 287 This realloctakes two parameters.288 289 \begin{itemize} 290 \item 291 ptr: address of the old object.292 \item 293 size: the required size of the new object.294 \end{itemize} 295 It returns a dynamic object of the size given in paramters that preserves the data in the given object. The returned object is aligned to the alignemtn of type T. On failure, it return NULLpointer.296 297 \subs ubsection T * memalign( size\_t align )278 @ptr@: address of the old object. 279 \item 280 @size@: the required size of the new object. 281 \end{itemize} 282 It returns a dynamic object of the size given in paramters. The returned object is aligned to the alignemtn of type @T@. On failure, it returns a @NULL@ pointer. 283 284 \subsection{\lstinline{T * realloc( T * ptr, size_t size )}} 285 This @realloc@ is a simplified polymorphic form of defualt @realloc@ (FIX ME: cite @realloc@ with align). It takes two parameters as compared to the above @realloc@ that takes three parameters. It frees the programmer from explicitly mentioning the alignment of the allocation as \CFA provides gives allocator the liberty to get the alignment of the returned type. 286 \paragraph{Usage} 287 This @realloc@ takes two parameters. 288 289 \begin{itemize} 290 \item 291 @ptr@: address of the old object. 292 \item 293 @size@: the required size of the new object. 294 \end{itemize} 295 It returns a dynamic object of the size given in paramters that preserves the data in the given object. The returned object is aligned to the alignemtn of type @T@. On failure, it returns a @NULL@ pointer. 296 297 \subsection{\lstinline{T * memalign( size_t align )}} 298 298 This memalign is a simplified polymorphic form of defualt memalign (FIX ME: cite memalign). It takes one parameters as compared to the default memalign that takes two parameters. 299 299 \paragraph{Usage} … … 302 302 \begin{itemize} 303 303 \item 304 align: the required alignment of the dynamic object.305 \end{itemize} 306 It returns a dynamic object of the size of type T that is aligned to given parameter align. On failure, it return NULLpointer.307 308 \subs ubsection T * amemalign( size\_t align, size\_t dim )304 @align@: the required alignment of the dynamic object. 305 \end{itemize} 306 It returns a dynamic object of the size of type @T@ that is aligned to given parameter align. On failure, it returns a @NULL@ pointer. 307 308 \subsection{\lstinline{T * amemalign( size_t align, size_t dim )}} 309 309 This amemalign is a simplified polymorphic form of above amemalign (FIX ME: cite amemalign). It takes two parameter as compared to the above amemalign that takes three parameters. 310 310 \paragraph{Usage} … … 313 313 \begin{itemize} 314 314 \item 315 align: required alignment of the dynamic array.316 \item 317 dim: required number of objects in the array.318 \end{itemize} 319 It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type T. The returned object is aligned to the given parameter align. On failure, it return NULLpointer.320 321 \subs ubsection T * cmemalign( size\_t align, size\_t dim )315 @align@: required alignment of the dynamic array. 316 \item 317 @dim@: required number of objects in the array. 318 \end{itemize} 319 It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type @T@. The returned object is aligned to the given parameter align. On failure, it returns a @NULL@ pointer. 320 321 \subsection{\lstinline{T * cmemalign( size_t align, size_t dim )}} 322 322 This cmemalign is a simplified polymorphic form of above cmemalign (FIX ME: cite cmemalign). It takes two parameter as compared to the above cmemalign that takes three parameters. 323 323 \paragraph{Usage} … … 326 326 \begin{itemize} 327 327 \item 328 align: required alignment of the dynamic array. 329 \item 330 dim: required number of objects in the array. 331 \end{itemize} 332 It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type T. The returned object is aligned to the given parameter align and is zero filled. On failure, it return NULL pointer. 333 334 \subsubsection T * aligned\_alloc( size\_t align ) 335 This aligned\_alloc is a simplified polymorphic form of defualt aligned\_alloc (FIX ME: cite aligned\_alloc). It takes one parameter as compared to the default aligned\_alloc that takes two parameters. 336 \paragraph{Usage} 337 This aligned\_alloc takes one parameter. 338 339 \begin{itemize} 340 \item 341 align: required alignment of the dynamic object. 342 \end{itemize} 343 It returns a dynamic object of the size of type T that is aligned to the given parameter. On failure, it return NULL pointer. 344 345 \subsubsection int posix\_memalign( T ** ptr, size\_t align ) 346 This posix\_memalign is a simplified polymorphic form of defualt posix\_memalign (FIX ME: cite posix\_memalign). It takes two parameters as compared to the default posix\_memalign that takes three parameters. 347 \paragraph{Usage} 348 This posix\_memalign takes two parameter. 349 350 \begin{itemize} 351 \item 352 ptr: variable address to store the address of the allocated object. 353 \item 354 align: required alignment of the dynamic object. 355 \end{itemize} 356 357 It stores address of the dynamic object of the size of type T in given parameter ptr. This object is aligned to the given parameter. On failure, it return NULL pointer. 358 359 \subsubsection T * valloc( void ) 360 This valloc is a simplified polymorphic form of defualt valloc (FIX ME: cite valloc). It takes no parameters as compared to the default valloc that takes one parameter. 361 \paragraph{Usage} 362 valloc takes no parameters. 363 It returns a dynamic object of the size of type T that is aligned to the page size. On failure, it return NULL pointer. 364 365 \subsubsection T * pvalloc( void ) 366 This pcvalloc is a simplified polymorphic form of defualt pcvalloc (FIX ME: cite pcvalloc). It takes no parameters as compared to the default pcvalloc that takes one parameter. 367 \paragraph{Usage} 368 pvalloc takes no parameters. 369 It returns a dynamic object of the size that is calcutaed by rouding the size of type T. The returned object is also aligned to the page size. On failure, it return NULL pointer. 370 371 \subsection Alloc Interface 372 In addition to improve allocator interface both for CFA and our standalone allocator uHeapLmmm in C. We also added a new alloc interface in CFA that increases usability of dynamic memory allocation. 328 @align@: required alignment of the dynamic array. 329 \item 330 @dim@: required number of objects in the array. 331 \end{itemize} 332 It returns a dynamic object that has the capacity to contain dim number of objects, each of the size of type @T@. The returned object is aligned to the given parameter align and is zero filled. On failure, it returns a @NULL@ pointer. 333 334 \subsection{\lstinline{T * aligned_alloc( size_t align )}} 335 This @aligned_alloc@ is a simplified polymorphic form of defualt @aligned_alloc@ (FIX ME: cite @aligned_alloc@). It takes one parameter as compared to the default @aligned_alloc@ that takes two parameters. 336 \paragraph{Usage} 337 This @aligned_alloc@ takes one parameter. 338 339 \begin{itemize} 340 \item 341 @align@: required alignment of the dynamic object. 342 \end{itemize} 343 It returns a dynamic object of the size of type @T@ that is aligned to the given parameter. On failure, it returns a @NULL@ pointer. 344 345 \subsection{\lstinline{int posix_memalign( T ** ptr, size_t align )}} 346 This @posix_memalign@ is a simplified polymorphic form of defualt @posix_memalign@ (FIX ME: cite @posix_memalign@). It takes two parameters as compared to the default @posix_memalign@ that takes three parameters. 347 \paragraph{Usage} 348 This @posix_memalign@ takes two parameter. 349 350 \begin{itemize} 351 \item 352 @ptr@: variable address to store the address of the allocated object. 353 \item 354 @align@: required alignment of the dynamic object. 355 \end{itemize} 356 357 It stores address of the dynamic object of the size of type @T@ in given parameter ptr. This object is aligned to the given parameter. On failure, it returns a @NULL@ pointer. 358 359 \subsection{\lstinline{T * valloc( void )}} 360 This @valloc@ is a simplified polymorphic form of defualt @valloc@ (FIX ME: cite @valloc@). It takes no parameters as compared to the default @valloc@ that takes one parameter. 361 \paragraph{Usage} 362 @valloc@ takes no parameters. 363 It returns a dynamic object of the size of type @T@ that is aligned to the page size. On failure, it returns a @NULL@ pointer. 364 365 \subsection{\lstinline{T * pvalloc( void )}} 366 \paragraph{Usage} 367 @pvalloc@ takes no parameters. 368 It returns a dynamic object of the size that is calcutaed by rouding the size of type @T@. The returned object is also aligned to the page size. On failure, it returns a @NULL@ pointer. 369 370 \subsection{Alloc Interface} 371 In addition to improve allocator interface both for \CFA and our standalone allocator uHeapLmmm in C. We also added a new alloc interface in \CFA that increases usability of dynamic memory allocation. 373 372 This interface helps programmers in three major ways. 374 373 … … 379 378 Parametre Positions: alloc interface frees programmers from remembering parameter postions in call to routines. 380 379 \item 381 Object Size: alloc interface does not require programmer to mention the object size as CFA allows allocator to determince the object size from returned type of alloc call.382 \end{itemize} 383 384 Alloc interface uses polymorphism, backtick routines (FIX ME: cite backtick) and ttype parameters of CFA (FIX ME: cite ttype) to provide a very simple dynamic memory allocation interface to the programmers. The new interfece has just one routine name alloc that can be used to perform a wide range of dynamic allocations. The parameters use backtick functions to provide a similar-to named parameters feature for our alloc interface so that programmers do not have to remember parameter positions in alloc call except the position of dimension (dim) parameter.385 386 \subs ubsection{Routine: T * alloc( ... )}387 Call to alloc wihout any parameter returns one object of size of type Tallocated dynamically.380 Object Size: alloc interface does not require programmer to mention the object size as \CFA allows allocator to determince the object size from returned type of alloc call. 381 \end{itemize} 382 383 Alloc interface uses polymorphism, backtick routines (FIX ME: cite backtick) and ttype parameters of \CFA (FIX ME: cite ttype) to provide a very simple dynamic memory allocation interface to the programmers. The new interfece has just one routine name alloc that can be used to perform a wide range of dynamic allocations. The parameters use backtick functions to provide a similar-to named parameters feature for our alloc interface so that programmers do not have to remember parameter positions in alloc call except the position of dimension (dim) parameter. 384 385 \subsection{Routine: \lstinline{T * alloc( ... )}} 386 Call to alloc wihout any parameter returns one object of size of type @T@ allocated dynamically. 388 387 Only the dimension (dim) parameter for array allocation has the fixed position in the alloc routine. If programmer wants to allocate an array of objects that the required number of members in the array has to be given as the first parameter to the alloc routine. 389 alocc routine accepts six kinds of arguments. Using different combinations of tha parameters, different kind of allocations can be performed. Any combincation of parameters can be used together except `realloc and `resize that should not be used simultanously in one call to routine as it creates ambiguity about whether to reallocate or resize a currently allocated dynamic object. If both `resize and `reallocare used in a call to alloc then the latter one will take effect or unexpected resulted might be produced.388 alocc routine accepts six kinds of arguments. Using different combinations of tha parameters, different kind of allocations can be performed. Any combincation of parameters can be used together except @`realloc@ and @`resize@ that should not be used simultanously in one call to routine as it creates ambiguity about whether to reallocate or resize a currently allocated dynamic object. If both @`resize@ and @`realloc@ are used in a call to alloc then the latter one will take effect or unexpected resulted might be produced. 390 389 391 390 \paragraph{Dim} 392 This is the only parameter in the alloc routine that has a fixed-position and it is also the only parameter that does not use a backtick function. It has to be passed at the first position to alloc call in-case of an array allocation of objects of type T.393 It represents the required number of members in the array allocation as in CFA's aalloc (FIX ME: cite aalloc).394 This parameter should be of type size\_t.395 396 Example: int a = alloc( 5 )391 This is the only parameter in the alloc routine that has a fixed-position and it is also the only parameter that does not use a backtick function. It has to be passed at the first position to alloc call in-case of an array allocation of objects of type @T@. 392 It represents the required number of members in the array allocation as in \CFA's aalloc (FIX ME: cite aalloc). 393 This parameter should be of type @size_t@. 394 395 Example: @int a = alloc( 5 )@ 397 396 This call will return a dynamic array of five integers. 398 397 399 398 \paragraph{Align} 400 This parameter is position-free and uses a backtick routine align ( `align). The parameter passed with `align should be of type size\_t. If the alignment parameter is not a power of two or is less than the default alignment of the allocator (that can be found out using routine libAlign inCFA) then the passed alignment parameter will be rejected and the default alignment will be used.401 402 Example: int b = alloc( 5 , 64`align )399 This parameter is position-free and uses a backtick routine align (@`align@). The parameter passed with @`align@ should be of type @size_t@. If the alignment parameter is not a power of two or is less than the default alignment of the allocator (that can be found out using routine libAlign in \CFA) then the passed alignment parameter will be rejected and the default alignment will be used. 400 401 Example: @int b = alloc( 5 , 64`align )@ 403 402 This call will return a dynamic array of five integers. It will align the allocated object to 64. 404 403 405 404 \paragraph{Fill} 406 This parameter is position-free and uses a backtick routine fill ( `fill). In case of realloc, only the extra space after copying the data in the old object will be filled with given parameter.405 This parameter is position-free and uses a backtick routine fill (@`fill@). In case of @realloc@, only the extra space after copying the data in the old object will be filled with given parameter. 407 406 Three types of parameters can be passed using `fill. 408 407 409 408 \begin{itemize} 410 409 \item 411 char: A char can be passed with `fillto fill the whole dynamic allocation with the given char recursively till the end of required allocation.412 \item 413 Object of returned type: An object of type of returned type can be passed with `fillto fill the whole dynamic allocation with the given object recursively till the end of required allocation.414 \item 415 Dynamic object of returned type: A dynamic object of type of returned type can be passed with `fill to fill the dynamic allocation with the given dynamic object. In this case, the allocated memory is not filled recursively till the end of allocation. The filling happen untill the end object passed to `fillor the end of requested allocation reaches.416 \end{itemize} 417 418 Example: int b = alloc( 5 , 'a'`fill )410 @char@: A char can be passed with @`fill@ to fill the whole dynamic allocation with the given char recursively till the end of required allocation. 411 \item 412 Object of returned type: An object of type of returned type can be passed with @`fill@ to fill the whole dynamic allocation with the given object recursively till the end of required allocation. 413 \item 414 Dynamic object of returned type: A dynamic object of type of returned type can be passed with @`fill@ to fill the dynamic allocation with the given dynamic object. In this case, the allocated memory is not filled recursively till the end of allocation. The filling happen untill the end object passed to @`fill@ or the end of requested allocation reaches. 415 \end{itemize} 416 417 Example: @int b = alloc( 5 , 'a'`fill )@ 419 418 This call will return a dynamic array of five integers. It will fill the allocated object with character 'a' recursively till the end of requested allocation size. 420 419 421 Example: int b = alloc( 5 , 4`fill )420 Example: @int b = alloc( 5 , 4`fill )@ 422 421 This call will return a dynamic array of five integers. It will fill the allocated object with integer 4 recursively till the end of requested allocation size. 423 422 424 Example: int b = alloc( 5 , a`fill ) where ais a pointer of int type423 Example: @int b = alloc( 5 , a`fill )@ where @a@ is a pointer of int type 425 424 This call will return a dynamic array of five integers. It will copy data in a to the returned object non-recursively untill end of a or the newly allocated object is reached. 426 425 427 426 \paragraph{Resize} 428 This parameter is position-free and uses a backtick routine resize ( `resize). It represents the old dynamic object (oaddr) that the programmer wants to427 This parameter is position-free and uses a backtick routine resize (@`resize@). It represents the old dynamic object (oaddr) that the programmer wants to 429 428 \begin{itemize} 430 429 \item … … 435 434 fill with something. 436 435 \end{itemize} 437 The data in old dynamic object will not be preserved in the new object. The type of object passed to `resizeand the returned type of alloc call can be different.438 439 Example: int b = alloc( 5 , a`resize )436 The data in old dynamic object will not be preserved in the new object. The type of object passed to @`resize@ and the returned type of alloc call can be different. 437 438 Example: @int b = alloc( 5 , a`resize )@ 440 439 This call will resize object a to a dynamic array that can contain 5 integers. 441 440 442 Example: int b = alloc( 5 , a`resize , 32`align )441 Example: @int b = alloc( 5 , a`resize , 32`align )@ 443 442 This call will resize object a to a dynamic array that can contain 5 integers. The returned object will also be aligned to 32. 444 443 445 Example: int b = alloc( 5 , a`resize , 32`align , 2`fill)444 Example: @int b = alloc( 5 , a`resize , 32`align , 2`fill )@ 446 445 This call will resize object a to a dynamic array that can contain 5 integers. The returned object will also be aligned to 32 and will be filled with 2. 447 446 448 447 \paragraph{Realloc} 449 This parameter is position-free and uses a backtick routine realloc (`realloc). It represents the old dynamic object (oaddr) that the programmer wants to448 This parameter is position-free and uses a backtick routine @realloc@ (@`realloc@). It represents the old dynamic object (oaddr) that the programmer wants to 450 449 \begin{itemize} 451 450 \item … … 456 455 fill with something. 457 456 \end{itemize} 458 The data in old dynamic object will be preserved in the new object. The type of object passed to `reallocand the returned type of alloc call cannot be different.459 460 Example: int b = alloc( 5 , a`realloc )457 The data in old dynamic object will be preserved in the new object. The type of object passed to @`realloc@ and the returned type of alloc call cannot be different. 458 459 Example: @int b = alloc( 5 , a`realloc )@ 461 460 This call will realloc object a to a dynamic array that can contain 5 integers. 462 461 463 Example: int b = alloc( 5 , a`realloc , 32`align )462 Example: @int b = alloc( 5 , a`realloc , 32`align )@ 464 463 This call will realloc object a to a dynamic array that can contain 5 integers. The returned object will also be aligned to 32. 465 464 466 Example: int b = alloc( 5 , a`realloc , 32`align , 2`fill)465 Example: @int b = alloc( 5 , a`realloc , 32`align , 2`fill )@ 467 466 This call will resize object a to a dynamic array that can contain 5 integers. The returned object will also be aligned to 32. The extra space after copying data of a to the returned object will be filled with 2.
Note: See TracChangeset
for help on using the changeset viewer.