| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158 |
- /* ----------------------------------------------------------------------
- * Project: CMSIS DSP Library
- * Title: ArrayMemory.cpp
- * Description: Array Memory Manager
- *
- * $Date: 20. June 2019
- * $Revision: V1.0.0
- *
- * Target Processor: Cortex-M cores
- * -------------------------------------------------------------------- */
- /*
- * Copyright (C) 2010-2019 ARM Limited or its affiliates. All rights reserved.
- *
- * SPDX-License-Identifier: Apache-2.0
- *
- * Licensed under the Apache License, Version 2.0 (the License); you may
- * not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an AS IS BASIS, WITHOUT
- * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
- #include "ArrayMemory.h"
- #include <stdlib.h>
- #include <string.h>
- #include <math.h>
- namespace Client {
- ArrayMemory::ArrayMemory(char* ptr, size_t bufferLength,int aligned, bool tail)
- {
- this->m_ptr=ptr;
- this->m_currentPtr=ptr;
- this->alignSize = aligned;
- this->tail=tail;
- this->m_bufferLength = bufferLength;
- this->m_generation=0;
- this->memError=false;
- memset((void*)ptr, 0, bufferLength);
- }
- // By default there is alignment and tail
- ArrayMemory::ArrayMemory(char* ptr, size_t bufferLength)
- {
- this->m_ptr=ptr;
- this->m_currentPtr=ptr;
- // Align on 64 bits per default
- this->alignSize = 8;
- this->tail=true;
- this->m_bufferLength = bufferLength;
- this->m_generation=0;
- this->memError=false;
- memset((void*)ptr, 0, bufferLength);
- }
-
- bool ArrayMemory::HasMemError()
- {
- return(this->memError);
- }
- size_t ArrayMemory::getTailSize()
- {
- if (this->tail)
- {
- return(16);
- }
- else
- {
- return(0);
- }
- }
- char *ArrayMemory::NewBuffer(size_t length)
- {
- if (length == 0)
- {
- return(NULL);
- }
-
- size_t tailSize = 0;
- // Add a tail of 16 bytes corresponding to the max number of lanes.
- tailSize = this->getTailSize();
-
- // Compute some offset to align the new buffer to be allocated
- if (this->alignSize > 0)
- {
- unsigned long offset;
- unsigned long pad;
- offset=(unsigned long)(this->m_currentPtr - this->m_ptr);
- pad = this->alignSize*ceil(1.0*offset / (1.0*this->alignSize)) - offset;
- //printf("new = %ld, old = %ld\n",pad,offset);
- this->m_currentPtr += pad;
- }
- // Return NULL is no more enough memory in array
- if (this->m_currentPtr + length + tailSize < this->m_ptr + m_bufferLength)
- {
- char *result=this->m_currentPtr;
- this->m_currentPtr += length + tailSize;
- return(result);
- }
- else
- {
- this->memError=true;
- return(NULL);
- }
- }
- bool ArrayMemory::IsTailEmpty(char *ptr, size_t length)
- {
- if ((ptr == NULL) || (length == 0))
- {
- return(true);
- }
- else
- {
- char *p=ptr + length;
- bool isEmpty=true;
-
- for(int i=0; i < this->getTailSize() ; i++)
- {
- //printf("%d\n",p[i]);
- if (p[i] != 0)
- {
- isEmpty = false;
- }
- }
- return(isEmpty);
- }
- }
-
- /** Reset memory
- The full C buffer is set to 0
- Current pointer is moved to start of buffer
- Memory generation is incremented (which is
- indirectly unvalidating all patterns.
- If the patterns are not reloaded after this, they'll return NULL
- when trying to access their pointer.
- )
- */
- void ArrayMemory::FreeMemory()
- {
- memset(this->m_ptr, 0, this->m_bufferLength);
- this->m_currentPtr=this->m_ptr;
- this->m_generation++;
- this->memError=false;
- }
- }
|