Lines Matching defs:num
69 if (p_Mem->current == p_Mem->num)
108 p_Mem->p_MemDbg = (void *)XX_Malloc(sizeof(t_MemDbg) * p_Mem->num);
114 memset(p_Mem->p_MemDbg, ILLEGAL_BASE, sizeof(t_MemDbg) * p_Mem->num);
129 /* Find block num */
140 ASSERT_COND(blockIndex < p_Mem->num);
156 /* Find block num */
162 if (blockIndex >= p_Mem->num)
172 if (blockIndex >= p_Mem->num)
208 uint32_t MEM_ComputePartitionSize(uint32_t num,
229 return ((num * blockSize) + alignment);
235 uint32_t num,
245 allocSize = MEM_ComputePartitionSize(num,
259 num,
279 uint32_t num,
319 p_Mem->p_BlocksStack = (uint8_t **)XX_Malloc(num * sizeof(uint8_t*));
336 p_Mem->num = num;
367 for (i=0; i < num; i++)
395 uint32_t num,
435 p_Mem->p_BlocksStack = (uint8_t **)XX_Malloc(num * sizeof(uint8_t*));
443 p_Mem->p_Bases = (uint8_t **)XX_Malloc((consecutiveMem ? 1 : num) * sizeof(uint8_t*));
449 memset(p_Mem->p_Bases, 0, (consecutiveMem ? 1 : num) * sizeof(uint8_t*));
452 p_Mem->num = num;
481 (alignment + (num * block size)). */
483 XX_MallocSmart((uint32_t)((num * blockSize) + alignment), memPartitionId, 1);
498 for (i = 0; i < num; i++)
514 for (i = 0; i < num; i++)
566 uint32_t num, i;
573 num = p_Mem->consecutiveMem ? 1 : p_Mem->num;
577 for (i=0; i < num; i++)
587 for (i=0; i < num; i++)
647 uint16_t MEM_GetN(t_Handle h_Mem, uint32_t num, void *array[])
663 availableBlocks = (uint32_t)(p_Mem->num - p_Mem->current);
664 if (num > availableBlocks)
666 num = availableBlocks;
669 for (i=0; i < num; i++)
727 for (i=0; i < p_Mem->num; i++)
742 for (i=0; i < p_Mem->num; i++)