Home
last modified time | relevance | path

Searched refs:freeList (Results 1 – 8 of 8) sorted by relevance

/kernel/liteos_a/kernel/base/vm/
Dlos_vm_phys.c138 list = &seg->freeList[i]; in OsVmPhysFreeListInit()
172 list = &seg->freeList[order]; in OsVmPhysFreeListAddUnsafe()
187 list = &seg->freeList[page->order]; in OsVmPhysFreeListDelUnsafe()
279 list = &seg->freeList[VM_LIST_ORDER_MAX - 1]; in OsVmPhysLargeAlloc()
317 list = &seg->freeList[newOrder]; in OsVmPhysPagesAlloc()
Dlos_vm_dump.c493 segFreePages += ((1 << flindex) * seg->freeList[flindex].listCnt); in OsVmPhySegPagesGet()
525 listCount[flindex] = seg->freeList[flindex].listCnt; in OsVmPhysDump()
/kernel/liteos_a/kernel/base/include/
Dlos_vm_phys.h78 struct VmFreeList freeList[VM_LIST_ORDER_MAX]; /* The free pages in the buddy list */ member
/kernel/liteos_m/kernel/include/
Dlos_memory.h553 struct OsMemFreeNodeHead *freeList[OS_MEM_FREE_LIST_COUNT]; member
/kernel/liteos_m/testsuites/sample/kernel/mem/
DIt_los_mem.h127 struct TestMemFreeNodeHead *freeList[OS_MEM_FREE_LIST_COUNT]; member
/kernel/liteos_a/kernel/base/mem/tlsf/
Dlos_memory.c159 struct OsMemFreeNodeHead *freeList[OS_MEM_FREE_LIST_COUNT]; member
643 for (node = poolHead->freeList[index]; node != NULL; node = node->next) { in OsMemFindCurSuitableBlock()
708 return poolHead->freeList[index]; in OsMemFindNextSuitableBlock()
723 struct OsMemFreeNodeHead *firstNode = pool->freeList[listIndex]; in OsMemListAdd()
729 pool->freeList[listIndex] = node; in OsMemListAdd()
736 if (node == pool->freeList[listIndex]) { in OsMemListDelete()
737 pool->freeList[listIndex] = node->next; in OsMemListDelete()
1676 for (tmpNode = pool->freeList[index]; tmpNode != NULL; tmpNode = tmpNode->next) { in OsMemPoolHeadCheck()
1984 node = poolInfo->freeList[index]; in LOS_MemFreeNodeShow()
/kernel/liteos_m/kernel/src/mm/
Dlos_memory.c668 for (node = poolHead->freeList[index]; node != NULL; node = node->next) {
732 return poolHead->freeList[index];
749 struct OsMemFreeNodeHead *firstNode = pool->freeList[listIndex];
755 pool->freeList[listIndex] = node;
762 if (node == pool->freeList[listIndex]) {
763 pool->freeList[listIndex] = node->next;
1679 for (tmpNode = pool->freeList[index]; tmpNode != NULL; tmpNode = tmpNode->next) {
2015 node = poolInfo->freeList[index];
/kernel/linux/patches/linux-5.10/imx8mm_patch/patches/drivers/
D0038_linux_drivers_mxc.patch59996 + gcsEVENT_QUEUE_PTR freeList;
71748 + if (Event->freeList == gcvNULL)
71754 + * Queue = Event->freeList;
71755 + Event->freeList = Event->freeList->next;
71782 + Queue->next = Event->freeList;
71783 + Event->freeList = Queue;
72179 + eventObj->repoList[i].next = eventObj->freeList;
72180 + eventObj->freeList = &eventObj->repoList[i];
74176 + gcskNODE_PTR freeList;
74275 + gcskHEAP_PTR freeList = gcvNULL;
[all …]