r_cdi_memory.c 41 KB
Newer Older
hu's avatar
hu committed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284
/*
****************************************************************************
PROJECT : CDI
FILE    : $Id: r_cdi_memory.c 14304 2017-07-17 10:57:05Z matthias.nippert $
============================================================================ 
DESCRIPTION
Common Driver Interface
============================================================================
                            C O P Y R I G H T
============================================================================
                       Copyright (c) 2013 - 2014
                                  by 
                       Renesas Electronics (Europe) GmbH. 
                           Arcadiastrasse 10
                          D-40472 Duesseldorf
                               Germany
                          All rights reserved.
============================================================================
Purpose: only for testing, not for mass production

DISCLAIMER

LICENSEE has read, understood and accepted the terms and conditions defined in
the license agreement, especially the usage rights. In any case, it is
LICENSEE's responsibility to make sure that any user of the software complies
with the terms and conditions of the signed license agreement.

SAMPLE CODE is not part of the licensed software, as such it must not be used in
mass-production applications. It can only be used for evaluation and
demonstration purposes at customer's premises listed in the signed license
agreement.

****************************************************************************
*/

/*******************************************************************************
  Section: Includes
*/

#include "r_typedefs.h"
#include "r_cdi_api.h"
#ifdef USE_ROS
#include "r_os_api.h"
#endif

#ifdef MEM_DEBUG
#include <stdio.h>
#endif


/*******************************************************************************
  Section: Local Variables
*/
/*******************************************************************************
  Variable: locCpuHeapMng

  Local CPU heap manager
  This local variable is initialised once in the function <eeCdi_InitCpuHeapManager>
  with the given parameters.
  This function must be called when initialising the hardware.
  
*/                         
static r_cdi_HeapMng_t locCpuHeapMng;

/*******************************************************************************
  Variable: locVidHeapMng

  Local video heap manager
  This local variable is initialised once in the function <eeCdi_InitVidHeapManager>
  with the given parameters.
  This function must be called when initialising the hardware.
  
*/                         
static r_cdi_HeapMng_t locVidHeapMng;

/*******************************************************************************
  Variable: locSpecialModeHeapMng

  Local SPECIAL_MODE heap manager
    SPECIAL_MODE is a special type of video memory. It is currently only used in DK4-H (-> VMEM).
    If you use SPECIAL_MODE, make sure that your device supports this type of memory.
    
  This local variable is initialised once in the function <eeCdi_InitSpecialModeHeapManager>
  with the given parameters.
  This function must be called when initialising the hardware.
  
*/                         
static r_cdi_HeapMng_t locSpecialModeHeapMng;

/*******************************************************************************
  Variable: locNextCpuBlockIndex

  
  
*/                         
static r_cdi_HpBlkIndex_t locNextCpuBlockIndex = 0u;

/*******************************************************************************
  Variable: locNextVidBlockIndex

  
  
*/                         
static r_cdi_HpBlkIndex_t locNextVidBlockIndex = 0u;

/*******************************************************************************
  Variable: locNextSpecialModeBlockIndex

  
  
*/                         
static r_cdi_HpBlkIndex_t locNextSpecialModeBlockIndex = 0u;

#ifdef USE_ROS
static R_OS_ThreadMutex_t locCdiMemLock;  
#endif

static uint32_t locFreeVideoBlocks = 0u;
static uint32_t locFreeCPUBlocks = 0u;
static uint32_t locFreeSpecialModeBlocks = 0u;
static uint32_t locNextCPUFreeBlockNb = 0u;
static uint32_t locNextVideoFreeBlockNb = 0u;
static uint32_t locNextSpecialModeFreeBlockNb = 0u;


/*******************************************************************************
  Section: Global API Memory Controller Functions
*/

/*******************************************************************************
 Function: R_CDI_InitHeapManager
*/
uint32_t R_CDI_InitHeapManager(
        uint32_t            HeapAddr,
        r_cdi_Heap_t        *HeapMng, 
        r_cdi_HpBlkIndex_t  *HeapIdxList, 
        uint32_t             NbBlocks, 
        uint32_t             BlkSize)
{

    uint32_t err = 0u;
    uint32_t index;
    
    /* If the pointer HeapIdxList is NULL, then the index list will be placed 
       into the memory whose heap we are initializing just now */
    if (0 == HeapIdxList)
    {
        /* How much memory is required for the HeapIdxList */
        const uint32_t HeapIdxListSize = 
                    sizeof(r_cdi_HpBlkIndex_t) * NbBlocks;
        /* Size of the HeapIdxList in terms of Blocks (Rounded UP) */
        const uint32_t HeapIdxListSizeBlks = 
                    (HeapIdxListSize + (BlkSize-1)) / BlkSize;
        /* Number of Blocks left for normal CDI operation */
        const uint32_t NbBlocksInternal = 
                    NbBlocks - HeapIdxListSizeBlks;
        /* Starting point of integrated HeapIdxList */
        r_cdi_HpBlkIndex_t *HeapIdxListInternal = 
                    (r_cdi_HpBlkIndex_t*)(HeapAddr + (BlkSize*NbBlocksInternal));
        
        /* Transfer new information to existing variables */
        HeapIdxList = HeapIdxListInternal;
        NbBlocks =    NbBlocksInternal;
    }
    
    /* test if the pointers different than NULL */
    if ((0 != NbBlocks) && (0 != HeapAddr)  && ( 0 != HeapIdxList) && ( 0 != HeapMng))
    {
        HeapMng->BaseAddr        = HeapAddr;
        HeapMng->NbOfBlock       = NbBlocks;
        HeapMng->BlockSize       = BlkSize;
        HeapMng->BlockIdxList    = HeapIdxList;
        HeapMng->FreeBlocks      = NbBlocks;
        HeapMng->NextFreeBlockNb = 0u;
        HeapMng->NextBlockIdx    = 0u;
        /* Initialise the block list */
        for (index = 0u; index < NbBlocks; index++)
        {
            *HeapIdxList = 0u;
            HeapIdxList++;
        }
        HeapMng->NextBlockIdx++;
    }
    else 
    {
        err = 1u;
    }
#ifdef USE_ROS
    R_OS_ThreadMutexInit(&locCdiMemLock, 0);
#endif
    return err;
}


/*******************************************************************************
 Function: R_CDI_InitCpuHeapManager
*/
uint32_t R_CDI_InitCpuHeapManager(
        uint32_t hpaddr, 
        r_cdi_HpBlkIndex_t *hpblkindexlist, 
        uint32_t nbblk, 
        uint32_t blksize)
{

    uint32_t err = 0u;
    uint32_t index;
    /* test if the pointers different than NULL */
    if ((0 != hpaddr)  && ( 0 != hpblkindexlist))
    {
        locCpuHeapMng.BaseAddr  = hpaddr;
        locCpuHeapMng.NbOfBlock = nbblk;
        locCpuHeapMng.BlockSize = blksize;
        locCpuHeapMng.Type      = CPU;
        locCpuHeapMng.BlockIndexList = hpblkindexlist;
        locFreeCPUBlocks = nbblk;
        locNextCPUFreeBlockNb = 0u;
        /* Initialise the block list */
        for (index = 0u; index < nbblk; index++)
        {
            *hpblkindexlist = 0u;
            hpblkindexlist++;
        }
        locNextCpuBlockIndex++;
    }
    else 
    {
        err = 1u;
    }
#ifdef USE_ROS
    R_OS_ThreadMutexInit(&locCdiMemLock, 0);
#endif
    return err;
}

/*******************************************************************************
 Function: R_CDI_InitVidHeapManager
*/

uint32_t R_CDI_InitVidHeapManager(
        uint32_t hpaddr, 
        r_cdi_HpBlkIndex_t * hpblkindexlist, 
        uint32_t nbblock, 
        uint32_t blksize)
{

    uint32_t err = 0u;
    uint32_t index;
    /* test if the pointers different than NULL */
    if ((0 != hpaddr)  && ( 0 != hpblkindexlist))
    {
        /* Initialise the heap manager */
        locVidHeapMng.BaseAddr  = hpaddr;
        locVidHeapMng.NbOfBlock = nbblock;
        locVidHeapMng.BlockSize = blksize;
        locVidHeapMng.Type      = VIDEO;
        locFreeVideoBlocks      = nbblock;
        locNextVideoFreeBlockNb = 0u;
        locVidHeapMng.BlockIndexList = hpblkindexlist;
        /* Initialise the block list */
        for (index = 0u; index < nbblock; index++)
        {
            *hpblkindexlist = 0u;
            hpblkindexlist++;
        }
        locNextVidBlockIndex++; 
    }
    else 
    {
        err = 1u;
    }
    return err;
}

/*******************************************************************************
 Function: R_CDI_InitSmHeapManager
*/

uint32_t R_CDI_InitSmHeapManager(
        uint32_t hpaddr, 
        r_cdi_HpBlkIndex_t * hpblkindexlist, 
        uint32_t nbblock, 
        uint32_t blksize)
{

    uint32_t err = 0u;
    uint32_t index;
    /* test if the pointers different than NULL */
    if ((0 != hpaddr)  && ( 0 != hpblkindexlist))
    {
        /* Initialise the heap manager */
        locSpecialModeHeapMng.BaseAddr  = hpaddr;
        locSpecialModeHeapMng.NbOfBlock = nbblock;
        locSpecialModeHeapMng.BlockSize = blksize;
        locSpecialModeHeapMng.Type      = SPECIAL_MODE;
        locFreeSpecialModeBlocks        = nbblock;
        locSpecialModeHeapMng.BlockIndexList = hpblkindexlist;
        locNextSpecialModeFreeBlockNb = 0u;
        /* Initialise the block list */
        for (index = 0u; index < nbblock; index++)
        {
            *hpblkindexlist = 0u;
            hpblkindexlist++;
        }
        locNextSpecialModeBlockIndex++; 
    }
    else 
    {
        err = 1u;
    }
    return err;
}

/*******************************************************************************
 Function: R_CDI_HeapAlloc
*/
uint32_t R_CDI_HeapAlloc(uint32_t size, r_cdi_HpType_t type)
{
    uint32_t addr = 1u;
    uint32_t allocnbblk = 0u;
    uint32_t adjfreeblk = 0u;
    int32_t tmp;
    uint32_t i;
    r_cdi_HeapMng_t *lochpmng;
    r_cdi_HpBlkIndex_t   *locblkindexlist;
    r_cdi_HpBlkIndex_t   startblk;
    r_cdi_HpBlkIndex_t   *currentindex;
    uint32_t  *freeCount;
    uint32_t  *nextBlock;
    uint8_t leave = 0u; 
    r_cdi_HpBlkIndex_t prevBlkIndex = 0;
    r_cdi_HpBlkIndex_t nextBlkIndex = 0;

    
#ifdef USE_ROS
    R_OS_ThreadMutexLock(&locCdiMemLock);
#endif
    /* Check memory type and get the pointer to the corresponding heap manager.*/
    /* if the type is incorrect then 0 is returned */
    if((type == CPU) && (0 != locCpuHeapMng.BaseAddr))
    {
        lochpmng   = &locCpuHeapMng;
        currentindex = &locNextCpuBlockIndex;
        freeCount = &locFreeCPUBlocks;
        nextBlock = &locNextCPUFreeBlockNb;
    } 
    else if((type == SPECIAL_MODE) && (0 != locSpecialModeHeapMng.BaseAddr))
    {
        lochpmng = &locSpecialModeHeapMng;
        currentindex = &locNextSpecialModeBlockIndex;
        freeCount = &locFreeSpecialModeBlocks;  
        nextBlock = &locNextSpecialModeFreeBlockNb; 
    }
    else 
    {
        if((type == VIDEO) && (0 != locVidHeapMng.BaseAddr) )
        {
            lochpmng = &locVidHeapMng;
            currentindex = &locNextVidBlockIndex;
            freeCount = &locFreeVideoBlocks;
            nextBlock = &locNextVideoFreeBlockNb;
        } 
        else 
        {
            addr = 0u;
        }
    }
    if((*freeCount) <= 0)
    {
        addr = 0u;
    }
    
    /* Calculate number of required blocks*/
    if (addr != 0u)
    {
        
        tmp = size;
        /* calculate number of blocks needed*/
        while (tmp > 0)
        {
            allocnbblk++;
            tmp -= lochpmng->BlockSize;;
        }
        /* if not enough blocks left */
        if((*freeCount) <= allocnbblk)
        {
            addr = 0u;
        }
    }
    
    if(addr != 0u) 
    {
        /* Search for n free adjacent blocks */
        locblkindexlist = lochpmng->BlockIndexList;
        addr = 0u;
        i = *nextBlock;
        while (i != ((*nextBlock) - 1)) 
        {
            if (*nextBlock == 0u) 
            {
                if (i == (lochpmng->NbOfBlock - 1)) 
                {
                    leave = 1u; 
                }
            }
            if (0u == leave) 
            {
                if (*(locblkindexlist + i ) == 0u) 
                {
                    if (adjfreeblk == 0u) 
                    {
                        startblk = i;
                    }
                    adjfreeblk++;
                } 
                else 
                {
                    adjfreeblk = 0u;
                    startblk   = 0u;
                }
    
                /* When n free adjacent block are found, all blocks' status are set to used */
                /* Start address is then returned */
                if (adjfreeblk == allocnbblk) 
                {
                    /* If there are blocks before and/or after the current block to be allocated,
                       check their indices and adapt the current block index if necessary. */
                    /* We don't need to check for a previous block, if we are at the start of the list */
                    if (startblk > 0)
                    {
                        prevBlkIndex = *(lochpmng->BlockIndexList + (startblk - 1));
                    }
                    /* We don't need to check for a next block, if we are at the end of the list */
                    if ((startblk + adjfreeblk) < lochpmng->NbOfBlock)
                    {
                        nextBlkIndex = *(lochpmng->BlockIndexList + (startblk + adjfreeblk));
                    }
                    
                    /* Increment the index to be used for allocation if it is already used by the 
                       neighboring blocks */  /* This loop will be executed two times at maximum */
                    while ( ((*currentindex) == prevBlkIndex) || ((*currentindex) == nextBlkIndex) )
                    {
                        (*currentindex)++;
                        if ( 0 == (*currentindex))
                        {
                            (*currentindex) = 1;
                        }
                    }
                    
                    /* Calculate address of allocated memory */
                    addr = lochpmng->BaseAddr + (startblk * lochpmng->BlockSize);
                    /* For the blocks that have been found to be free by above searching pass, 
                       allocate them for this operation by writing the current block index into them. */
                    while(adjfreeblk != 0u) 
                    {
                        *(lochpmng->BlockIndexList + startblk) = *currentindex;
                        startblk++;
                        adjfreeblk--;
                        (*freeCount)--;
                    }
                    
                    /* Increment index for next allocation operation. 
                       In case of an overflow, set index to 1, as zero is reserved for empty blocks. */
                    (*currentindex)++;
                    if ( 0 == (*currentindex))
                    {
                        (*currentindex) = 1;
                    }
                    
                    (*nextBlock) = startblk  % lochpmng->NbOfBlock;
                    leave = 1u; 
                }
                
                if (0u == leave) 
                {    
                    i = (i + 1) % lochpmng->NbOfBlock;
                    if(i == 0u) 
                    {
                        /* we are back to the beginning of the heap */
                        /* then reset the startblock and the adjfreeblk variable*/
                        /* We do not want to have an allocation divided
                           between the end and the start of the heap */
                        
                        adjfreeblk = 0u;
                        startblk   = 0u;
                    }
                }
            } /* end: if (0u == leave)*/
            
            /* check for break conditions */
            if (0 != leave) 
            {
                break; 
            } 
        } /* end: while (i != ((*nextBlock) - 1))  */
    }


    
#ifdef MEM_DEBUG    
    /*  debug code to make a breakpoint32_t on out of memory possible */
    if(!addr)
    {
      if(type==VIDEO)
      {
        addr = 0u; /* break here */
      }
    }
#endif
#ifdef USE_ROS
    R_OS_ThreadMutexUnlock(&locCdiMemLock);
#endif
    return addr;
}



/*******************************************************************************
 Function: R_CDI_Alloc
*/
void * R_CDI_Alloc(r_cdi_Heap_t *HeapMng, uint32_t Size)
{
    uint32_t            addr           = 1u;
    uint32_t            allocNbBlocks  = 0u;
    uint32_t            adjfreeblk     = 0u;
    int32_t             tmp;
    uint32_t            i;
    r_cdi_Heap_t       *lochpmng;
    r_cdi_HpBlkIndex_t  *locblkindexlist;
    r_cdi_HpBlkIndex_t  startblk;
    r_cdi_HpBlkIndex_t *currentindex;
    r_cdi_HpBlkIndex_t *freeCount;
    r_cdi_HpBlkIndex_t *nextBlock;
    uint8_t             leave = 0u; 
    r_cdi_HpBlkIndex_t prevBlkIndex = 0;
    r_cdi_HpBlkIndex_t nextBlkIndex = 0;
    
#ifdef USE_ROS
    R_OS_ThreadMutexLock(&locCdiMemLock);
#endif
    if(0 != HeapMng->BaseAddr)
    {
        lochpmng        = HeapMng;
        currentindex    = &(HeapMng->NextBlockIdx);
        freeCount       = &(HeapMng->FreeBlocks);
        nextBlock       = &(HeapMng->NextFreeBlockNb);
    } 
    else 
    {
        addr = 0u;
    }
    if((*freeCount) <= 0)
    {
        addr = 0u;
    }
    
    if (0 == Size)
    {
        addr = 0u;
    }
    
    /* Calculate number of required blocks*/
    if (addr != 0u)
    {
        tmp = Size;
        /* calculate number of blocks needed*/
        while (tmp > 0)
        {
            allocNbBlocks++;
            tmp -= lochpmng->BlockSize;
        }
        /* if not enough blocks left */
        if((*freeCount) < allocNbBlocks)
        {
            addr = 0u;
        }
    }
    
    if(addr != 0u) 
    {
        /* Search for n free adjacent blocks */
        locblkindexlist = lochpmng->BlockIdxList;
        addr = 0u;
        i = *nextBlock;
        /* Search through the block index until we are at the starting point again */
        while (i != ((*nextBlock) - 1)) 
        {
            if (0u == leave) 
            {
                /* If block index states that the current block is free, take it as starting point */
                /* With the following iterations, check that the adjacent block are also free */
                if (*(locblkindexlist + i ) == 0u) 
                {
                    if (adjfreeblk == 0u) 
                    {
                        startblk = i;
                    }
                    adjfreeblk++;
                } 
                else 
                {
                    adjfreeblk = 0u;
                    startblk   = 0u;
                }
    
                /* When n free adjacent block are found, all blocks' status are set to used*/
                /* Start address is then returned */
                if (adjfreeblk == allocNbBlocks) 
                {
                    /* If there are blocks before and/or after the current block to be allocated,
                       check their indices and adapt the current block index if necessary. */
                    /* We don't need to check for a previous block, if we are at the start of the list */
                    if (startblk > 0)
                    {
                        prevBlkIndex = *(lochpmng->BlockIdxList + (startblk - 1));
                    }
                    /* We don't need to check for a next block, if we are at the end of the list */
                    if ((startblk + adjfreeblk) < lochpmng->NbOfBlock)
                    {
                        nextBlkIndex = *(lochpmng->BlockIdxList + (startblk + adjfreeblk));
                    }
                    
                    /* Increment the index to be used for allocation if it is already used by the 
                       neighboring blocks */  /* This loop will be executed two times at maximum */
                    while ( ((*currentindex) == prevBlkIndex) || ((*currentindex) == nextBlkIndex) )
                    {
                        (*currentindex)++;
                        if ( 0 == (*currentindex))
                        {
                            (*currentindex) = 1;
                        }
                    }

                    /* Calculate address of allocated memory */
                    addr = lochpmng->BaseAddr + (startblk * lochpmng->BlockSize);
                    /* Reserve allocated memory in the block index */
                    while(adjfreeblk != 0u) 
                    {
                        *(lochpmng->BlockIdxList + startblk) = *currentindex;
                        startblk++;
                        adjfreeblk--;
                        (*freeCount)--;
                    }
                    /* Increase the index that uniquely identifies one allocation operation */
                    /* In case of an overflow, set index to 1, as zero is reserved for empty blocks. */
                    (*currentindex)++;
                    if ( 0 == (*currentindex))
                    {
                        (*currentindex) = 1;
                    }
                    /* Set next free block number to be directly behind the just allocated memory */
                    (*nextBlock) = startblk  % lochpmng->NbOfBlock;
                    leave = 1u; 
                }
                
                /* Special case: When the starting point was zero, stop when we reach the end of the index */
                if (*nextBlock == 0u) 
                {
                    if (i == (lochpmng->NbOfBlock - 1)) 
                    {
                       leave = 1u; 
                    }
                }

                /* Proceed to go through the block index with each iteration */
                if (0u == leave) 
                {    
                    i = (i + 1) % lochpmng->NbOfBlock;
                    if(i == 0u) 
                    {
                        /* we are back to the beginning of the heap */
                        /* then reset the startblock and the adjfreeblk variable*/
                        /* We do not want to have an allocation divided
                           between the end and the start of the heap */
                        
                        adjfreeblk = 0u;
                        startblk   = 0u;
                    }
                }
            } /* if (0u == leave)*/
            /* check for break conditions */
            if (0 != leave) 
            {
                break; 
            } 
        } /* while (i != ((*nextBlock) - 1))  */
    }
    
#ifdef MEM_DEBUG    
    /*  debug code to make a breakpoint32_t on out of memory possible */
    if(!addr)
    {
        addr = 0u; /* break here */
    }
#endif
#ifdef USE_ROS
    R_OS_ThreadMutexUnlock(&locCdiMemLock);
#endif
    return (void *)addr;
}

/*******************************************************************************
 Function: R_CDI_AllocAlign
 */
void * R_CDI_AllocAlign(r_cdi_Heap_t *HeapMng, uint32_t Size, uint32_t Alignment)
{
    uint32_t            addr           = 1u;
    uint32_t            allocNbBlocks  = 0u;
    uint32_t            adjfreeblk     = 0u;
    int32_t             tmp;
    uint32_t            i;
    uint32_t            align          = 1u;
    uint32_t            alignOffset    = 0u;
    r_cdi_Heap_t       *lochpmng;
    r_cdi_HpBlkIndex_t  *locblkindexlist;
    r_cdi_HpBlkIndex_t  startblk       = 0u;
    r_cdi_HpBlkIndex_t *currentindex;
    r_cdi_HpBlkIndex_t *freeCount;
    r_cdi_HpBlkIndex_t *nextBlock;
    uint8_t             leave = 0u; 
    r_cdi_HpBlkIndex_t prevBlkIndex = 0;
    r_cdi_HpBlkIndex_t nextBlkIndex = 0;
    
#ifdef USE_ROS
    R_OS_ThreadMutexLock(&locCdiMemLock);
#endif
    if(0 != HeapMng->BaseAddr)
    {
        lochpmng        = HeapMng;
        currentindex    = &(HeapMng->NextBlockIdx);
        freeCount       = &(HeapMng->FreeBlocks);
        nextBlock       = &(HeapMng->NextFreeBlockNb);
    } 
    else 
    {
        addr = 0u;
    }
    if((*freeCount) <= 0)
    {
        addr = 0u;
    }
    
    /* Calculate number of required blocks*/
    if (addr != 0u)
    {
        tmp = Size;
        /* calculate number of blocks needed*/
        while (tmp > 0)
        {
            allocNbBlocks++;
            tmp -= lochpmng->BlockSize;
        }
        /* if not enough blocks left */
        if((*freeCount) <= allocNbBlocks)
        {
            addr = 0u;
        }
    }
    
    /* Calculate alignment of block index number to mathc required alignment */
    if (Alignment != 0)
    {
        /* If <Alignment> is smaller than <BlockSize>, the alignment is given inherently. */
        /* <Alignment> and <BlockSize> are expected to be powers of two, 
           otherwise a correct alignment might be technically imposssible */
        /* The requested <Alignment> can be bigger than the alignment of <BaseAddr>.
           As long as the <BaseAddr> is aligned to <BlockSize>, this function will 
           find an address which is aligned to the system's address space. */
        if (Alignment >= lochpmng->BlockSize)
        {
            uint32_t virtualIndex;
            
            align = Alignment / lochpmng->BlockSize;
            
            /* What "virtual index" would the first block of our index list have 
               if we started counting at the address 0x00000000 ? */
            virtualIndex = lochpmng->BaseAddr / lochpmng->BlockSize;
            
            /* If the virtual index is not a multiple of our alignment <align>, 
               we need to add an offset. */
            alignOffset = (virtualIndex % align);
        }
    }
    if(addr != 0u) 
    {
        /* Search for n free adjacent blocks */
        locblkindexlist = lochpmng->BlockIdxList;
        addr = 0u;
        i = *nextBlock;
        /* Search through the block index until we are at the starting point again */
        while (i != ((*nextBlock) - 1)) 
        {
            /* Special case: When the starting point was zero, stop when we reach the end of the index */
            if (*nextBlock == 0u) 
            {
                if (i == (lochpmng->NbOfBlock - 1)) 
                {
                   leave = 1u; 
                }
            }
            if (0u == leave) 
            {
                /* If block index states that the current block is free, take it as starting point */
                /* With the following iterations, check that the adjacent block are also free */
                if (*(locblkindexlist + i ) == 0u) 
                {
                    /* Only take it as a starting point if it matches our alignment requirement */
                    /*  .. or if a starting point was already found */
                    if ((startblk != 0) || (((i+alignOffset) % align) == 0u))
                    {
                        if (adjfreeblk == 0u) 
                        {
                            startblk = i;
                        }
                        
                        adjfreeblk++;
                    }
                } 
                else 
                {
                    adjfreeblk = 0u;
                    startblk   = 0u;
                }
    
                /* When n free adjacent block are found, all blocks' status are set to used*/
                /* Start address is then returned */
                if (adjfreeblk == allocNbBlocks) 
                {
                    /* If there are blocks before and/or after the current block to be allocated,
                       check their indices and adapt the current block index if necessary. */
                    /* We don't need to check for a previous block, if we are at the start of the list */
                    if (startblk > 0)
                    {
                        prevBlkIndex = *(lochpmng->BlockIdxList + (startblk - 1));
                    }
                    /* We don't need to check for a next block, if we are at the end of the list */
                    if ((startblk + adjfreeblk) < lochpmng->NbOfBlock)
                    {
                        nextBlkIndex = *(lochpmng->BlockIdxList + (startblk + adjfreeblk));
                    }
                    
                    /* Increment the index to be used for allocation if it is already used by the 
                       neighboring blocks */  /* This loop will be executed two times at maximum */
                    while ( ((*currentindex) == prevBlkIndex) || ((*currentindex) == nextBlkIndex) )
                    {
                        (*currentindex)++;
                        if ( 0 == (*currentindex))
                        {
                            (*currentindex) = 1;
                        }
                    }

                    /* Calculate address of allocated memory */
                    addr = lochpmng->BaseAddr + (startblk * lochpmng->BlockSize);
                    /* Reserve allocated memory in the block index */
                    while(adjfreeblk != 0u) 
                    {
                        *(lochpmng->BlockIdxList + startblk) = *currentindex;
                        startblk++;
                        adjfreeblk--;
                        (*freeCount)--;
                    }
                    /* Increase the index that uniquely identifies one allocation operation */
                    /* In case of an overflow, set index to 1, as zero is reserved for empty blocks. */
                    (*currentindex)++;
                    if ( 0 == (*currentindex))
                    {
                        (*currentindex) = 1;
                    }
                    /* Set next free block number to be directly behind the just allocated memory */
                    (*nextBlock) = startblk  % lochpmng->NbOfBlock;
                    leave = 1u; 
                }
                
                /* Proceed to go through the block index with each iteration */
                if (0u == leave) 
                {    
                    i = (i + 1) % lochpmng->NbOfBlock;
                    if(i == 0u) 
                    {
                        /* we are back to the beginning of the heap */
                        /* then reset the startblock and the adjfreeblk variable*/
                        /* We do not want to have an allocation divided
                           between the end and the start of the heap */
                        
                        adjfreeblk = 0u;
                        startblk   = 0u;
                    }
                }
            } /* if (0u == leave)*/
            /* check for break conditions */
            if (0 != leave) 
            {
                break; 
            } 
        } /* while (i != ((*nextBlock) - 1))  */
    }
    
#ifdef MEM_DEBUG    
    /*  debug code to make a breakpoint on out of memory possible */
    if(!addr)
    {
        addr = 0u; /* break here */
    }
#endif
#ifdef USE_ROS
    R_OS_ThreadMutexUnlock(&locCdiMemLock);
#endif
    
    return (void *)addr;
}

/*******************************************************************************
 Function: R_CDI_HeapResetNextFreeBlockNb
*/
uint32_t R_CDI_HeapResetNextFreeBlockNb(r_cdi_HpType_t type)
{
    uint32_t err = 0u;
    
    switch (type)
    {
    case CPU:
        locNextCPUFreeBlockNb = 1u;
        break;
    case SPECIAL_MODE:
        locNextSpecialModeFreeBlockNb = 1u;
        break;
    case VIDEO:
        locNextVideoFreeBlockNb = 1u;
        break;
    default:
        err = 1u;
        break;
    }
    return err;
}

/*******************************************************************************
 Function: R_CDI_Free
*/
 uint32_t R_CDI_Free(uint32_t Addr, r_cdi_Heap_t *HeapMng)
{
    
    uint32_t            i;
    uint32_t            err = 0u;
    int32_t             blknb;
    r_cdi_Heap_t        *lochpmng;
    r_cdi_HpBlkIndex_t  *locblkindexlist;
    r_cdi_HpBlkIndex_t  blkindex;
    r_cdi_HpBlkIndex_t  *freeCount;
    r_cdi_HpBlkIndex_t  *nextBlock;

#ifdef USE_ROS
    R_OS_ThreadMutexLock(&locCdiMemLock);
#endif
    if(Addr != 0u)
    {
        lochpmng  = HeapMng;
        freeCount = &(HeapMng->FreeBlocks);
        nextBlock = &(HeapMng->NextFreeBlockNb);
    
        /* Calculate block number from addr */
        blknb =  (Addr - (lochpmng->BaseAddr)) / (lochpmng->BlockSize);
        locblkindexlist = lochpmng->BlockIdxList;
        blkindex = locblkindexlist[blknb];
        
        /* If this memory manager is used in an environment, 
           where the pointer of the allocated memory are aligned upwards outside of the CDI, 
           the resulting pointer might leaved the first block of several that are assigned to this allocation operation. */
        /* In such an environment, the "Free" routine must first seach the lowest index number 
           with the same Block ID before starting the cleanup. */

        if(Addr < lochpmng->BaseAddr)
        {
            err = 2u;   /* address is below managed range of this Heap */
        }
        else if (Addr >= (lochpmng->BaseAddr + (lochpmng->BlockSize*lochpmng->NbOfBlock)))
        {
            err = 2u;   /* address is above managed range of this Heap */
        }
        else if (blkindex == 0u)
        {
            err = 2u;   /* already free */
        }
        else
        {
            (*nextBlock) = blknb;
            i = blknb;
            while (locblkindexlist[i] == blkindex)
            {
                locblkindexlist[i] = 0u;
                i++;
                (*freeCount)++;

                /* Stop deallocation if we leave the range of the block index list */
                if (i>lochpmng->NbOfBlock)
                {
                    break;
                }
            }
            /* Reset block index to zero, if all blocks are deallocated */
            if (lochpmng->NbOfBlock == HeapMng->FreeBlocks)
            {
                HeapMng->NextFreeBlockNb = 0u;
            }
        } 
    }
#ifdef USE_ROS
    R_OS_ThreadMutexUnlock(&locCdiMemLock);
#endif

    return err;
}


/*******************************************************************************
 Function: R_CDI_HeapFree
*/
uint32_t R_CDI_HeapFree(uint32_t addr, r_cdi_HpType_t type)
{
    
    uint32_t i, vidsize;
    uint32_t err = 0u;
    int32_t blknb;
    r_cdi_HeapMng_t      *lochpmng;
    r_cdi_HpBlkIndex_t   *locblkindexlist;
    r_cdi_HpBlkIndex_t   blkindex;
    uint32_t           *freeCount;
    uint32_t           *nextBlock;

#ifdef USE_ROS
    R_OS_ThreadMutexLock(&locCdiMemLock);
#endif
    if(addr != 0u)
    {
        
        /* Check memory type and get the pointer to the corresponding heap manager.*/
        /* if the type is incorrect then 1 is returned */
        /* Have to add check on addr, because if short in CPU memory Video is allocated*/
        /* No other way to know it... */
        vidsize = locVidHeapMng.BlockSize*locVidHeapMng.NbOfBlock;
        if((type == VIDEO) || ((addr >= locVidHeapMng.BaseAddr) && (addr < (locVidHeapMng.BaseAddr + vidsize))))
        {
            lochpmng = &locVidHeapMng;
            freeCount = &locFreeVideoBlocks;
            nextBlock = &locNextVideoFreeBlockNb;
        } 
        else if(type == SPECIAL_MODE)
        {
            lochpmng = &locSpecialModeHeapMng;
            freeCount = &locFreeSpecialModeBlocks;
            nextBlock = &locNextSpecialModeFreeBlockNb;
        } 
        else 
        {
            if(type == CPU)
{
                lochpmng = &locCpuHeapMng;
                freeCount = &locFreeCPUBlocks;
                nextBlock = &locNextCPUFreeBlockNb;
            } 
            else 
            {
                err = 1u;
            }
        }
        
        if (err == 0u)
        {
            /* Calculate block number from addr */
            blknb =  (addr - (lochpmng->BaseAddr)) / (lochpmng->BlockSize);
            locblkindexlist = lochpmng->BlockIndexList;
            blkindex = locblkindexlist[blknb];
            
            if(addr < lochpmng->BaseAddr)
            {
                err = 2u;   /* address is below managed range of this Heap */
            }
            else if (addr >= (lochpmng->BaseAddr + (lochpmng->BlockSize*lochpmng->NbOfBlock)))
            {
                err = 2u;   /* address is above managed range of this Heap */
            }
            else if (blkindex == 0u)
            {
                err = 2u;   /* already free */
            }
            else
            {
                if((*nextBlock)> (uint32_t)blknb)
                {
                    (*nextBlock) = blknb;
                }
                
                i = blknb;
                while (locblkindexlist[i] == blkindex)
                {
                    locblkindexlist[i] = 0u;
                    i++;
                    (*freeCount)++;
                    
                    /* Stop deallocation if we leave the range of the block index list */
                    if (i>lochpmng->NbOfBlock)
                    {
                        break;
                    }
                }
                
            } 
        }
    }
#ifdef USE_ROS
    R_OS_ThreadMutexUnlock(&locCdiMemLock);
#endif

    return err;
}

/*******************************************************************************
 Function: R_CDI_HeapFreeAll
*/
uint32_t R_CDI_HeapFreeAll(r_cdi_HpType_t type)
{
    
    uint32_t err = 0u;
    int32_t tmp;
    r_cdi_HeapMng_t *lochpmng;
    r_cdi_HpBlkIndex_t   *locblkindexlist;
    
#ifdef USE_ROS
    R_OS_ThreadMutexLock(&locCdiMemLock);
#endif
    /* Check memory type and get the pointer to the corresponding heap manager.*/
    /* if the type is incorrect then 1 is returned */
    if(type == CPU)
    {
        lochpmng   = &locCpuHeapMng;
        locNextCpuBlockIndex = 1u;
    } 
    else if(type == SPECIAL_MODE)
    {
        lochpmng = &locSpecialModeHeapMng;
        locNextSpecialModeBlockIndex = 1u;
    
    } 
    else 
    {
        if(type == VIDEO)
        {
            lochpmng = &locVidHeapMng;
            locNextVidBlockIndex = 1u;
        } 
        else 
        {
            err = 1u;
        }
    }
    
    if (err == 0u)
    {
        locblkindexlist = lochpmng->BlockIndexList;
        tmp = lochpmng->NbOfBlock - 1;
        while(tmp >= 0)
        {
            locblkindexlist[tmp] = 0u;
            tmp--;
        }
    }
#ifdef USE_ROS
    R_OS_ThreadMutexUnlock(&locCdiMemLock);
#endif
    return err;
}

/*******************************************************************************
 Function: R_CDI_GetHeapSize
*/
uint32_t R_CDI_GetHeapSize(uint32_t addr, r_cdi_HpType_t type)
{
    
    uint32_t i;
    uint32_t size = 0u;
    uint32_t blknb;
    uint32_t vidsize;
    r_cdi_HeapMng_t *lochpmng;
    r_cdi_HpBlkIndex_t   *locblkindexlist;
    r_cdi_HpBlkIndex_t    blkindex;

#ifdef USE_ROS
    R_OS_ThreadMutexLock(&locCdiMemLock);
#endif
    /* Check memory type and get the pointer to the corresponding heap manager.*/
    /* if the type is incorrect then 1 is returned */
    /* Have to add check on addr, because if short in CPU memory Video is allocated*/
        /* No other way to know it... */
    vidsize = locVidHeapMng.BlockSize*locVidHeapMng.NbOfBlock;
    if((type == VIDEO) || ((addr >= locVidHeapMng.BaseAddr) && (addr < (locVidHeapMng.BaseAddr + vidsize))))
    {
        lochpmng = &locVidHeapMng;
    } 
    else 
    {
        if(type == CPU)
        {
            lochpmng   = &locCpuHeapMng;
        } 
        else
        {
            if(type == SPECIAL_MODE)
            {
                lochpmng   = &locSpecialModeHeapMng;
            }
            else
            {
                lochpmng = 0u;
            }
        }
    }
    
    if (0 != lochpmng)
    {
        /* Calculate block number from addr */
        blknb = (addr - (lochpmng->BaseAddr)) / (lochpmng->BlockSize);
        locblkindexlist = lochpmng->BlockIndexList;
        blkindex = locblkindexlist[blknb];
        i = blknb;
        while (locblkindexlist[i] == blkindex)
        {
            size += lochpmng->BlockSize;
            i++;
        }
        /* if no match found, then return size = 0 */
    }
#ifdef USE_ROS
    R_OS_ThreadMutexUnlock(&locCdiMemLock);
#endif
    return size;
}

/*******************************************************************************
 Function: R_CDI_GetVidHeapBlockSize
*/
uint32_t R_CDI_GetVidHeapBlockSize(void)
{
    return locVidHeapMng.BlockSize;
}    

/*******************************************************************************
 Function: R_CDI_GetVidHeapBlockMax
*/
uint32_t R_CDI_GetVidHeapBlockMax(void)
{
    return locVidHeapMng.NbOfBlock;
}

/*******************************************************************************
 Function: R_CDI_GetVidHeapBlockUsed
*/
uint32_t R_CDI_GetVidHeapBlockUsed(void)
{
    return (locVidHeapMng.NbOfBlock-locFreeVideoBlocks);
}

/*******************************************************************************
 Function: R_CDI_GetCpuHeapBlockSize
*/
uint32_t R_CDI_GetCpuHeapBlockSize(void)
{
    return locCpuHeapMng.BlockSize;
}    

/*******************************************************************************
 Function: R_CDI_GetCpuHeapBlockMax
*/
uint32_t R_CDI_GetCpuHeapBlockMax(void)
{
    return locCpuHeapMng.NbOfBlock;
}

/*******************************************************************************
 Function: R_CDI_GetCpuHeapBlockUsed
*/
uint32_t R_CDI_GetCpuHeapBlockUsed(void)
{
    return (locCpuHeapMng.NbOfBlock-locFreeCPUBlocks);
}