Lines Matching defs:ke

204 	KextNode *ke;
215 ke = (KextNode *)kalloc(sizeof(KextNode));
216 if (!ke) {
220 memset(ke, 0, sizeof(KextNode));
222 ke->kext = kext;
223 ke->loadTag = kmod_info->id;
224 ke->address = kmod_info->address;
225 ke->address_end = kmod_info->address + kmod_info->size;
227 SLIST_INIT(&ke->classList);
228 TAILQ_INIT(&ke->userClientCallList);
232 RB_INSERT(KextTree, &kextHead, ke);
233 RB_INSERT(KextAddressTree, &kextAddressHead, ke);
863 KextNode *ke;
867 RB_FOREACH(ke, KextTree, &kextHead) {
868 stats->loadTag = ke->loadTag;
869 ke->kext->getSizeInfo(&stats->loadSize, &stats->wiredSize);
871 stats->classes = ke->classes;
874 SLIST_FOREACH(ce, &ke->classList, lLink) {
878 stats = (IOStatisticsKext *)((void*)((char*)stats + sizeof(IOStatisticsKext) + (ke->classes * sizeof(uint32_t))));
886 KextNode *ke;
888 RB_FOREACH(ke, KextTree, &kextHead) {
889 stats->allocatedSize = ke->memoryCounters[kIOStatisticsMalloc];
890 stats->freedSize = ke->memoryCounters[kIOStatisticsFree];
891 stats->allocatedAlignedSize = ke->memoryCounters[kIOStatisticsMallocAligned];
892 stats->freedAlignedSize = ke->memoryCounters[kIOStatisticsFreeAligned];
893 stats->allocatedContiguousSize = ke->memoryCounters[kIOStatisticsMallocContiguous];
894 stats->freedContiguousSize = ke->memoryCounters[kIOStatisticsFreeContiguous];
895 stats->allocatedPageableSize = ke->memoryCounters[kIOStatisticsMallocPageable];
896 stats->freedPageableSize = ke->memoryCounters[kIOStatisticsFreePageable];
905 KextNode *ke;
908 RB_FOREACH(ke, KextTree, &kextHead) {
909 SLIST_FOREACH(ce, &ke->classList, lLink) {
923 KextNode *ke;
926 RB_FOREACH(ke, KextTree, &kextHead) {
927 SLIST_FOREACH(ce, &ke->classList, lLink) {
999 KextNode *ke;
1001 RB_FOREACH(ke, KextTree, &kextHead) {
1002 strncpy(kextIDs->identifier, ke->kext->getIdentifierCString(), kIOStatisticsDriverNameLength);
1011 KextNode *ke;
1014 RB_FOREACH(ke, KextTree, &kextHead) {
1015 SLIST_FOREACH(ce, &ke->classList, lLink) {
1026 KextNode *ke;
1031 RB_FOREACH(ke, KextTree, &kextHead) {
1032 SLIST_FOREACH(wlc, &ke->workLoopList, link) {
1033 stats->kextLoadTag = ke->loadTag;
1215 KextNode *found = NULL, *ke = NULL;
1229 ke = RB_ROOT(&kextAddressHead);
1230 while (ke) {
1231 if (*scanAddr < ke->address) {
1232 ke = RB_LEFT(ke, addressLink);
1235 if ((*scanAddr < ke->address_end) && (*scanAddr >= ke->address)) {
1236 if (!ke->kext->isKernelComponent()) {
1237 return ke;
1239 found = ke;
1242 ke = RB_RIGHT(ke, addressLink);
1261 KextNode *ke;
1267 ke = getKextNodeFromBacktrace(FALSE);
1268 if (ke) {
1269 OSAddAtomic(size, &ke->memoryCounters[index]);
1270 releaseKextNode(ke);