Lines Matching full:num_entries
1220 int32_t num_entries = 0;
1221 for (pTimed = list; pTimed; pTimed = pTimed->next) num_entries += 1;
1222 *num = num_entries;
1223 if (num_entries == 0) return nullptr;
1227 TimedMethod* sorted = new TimedMethod[num_entries];
1230 qsort(sorted, num_entries, sizeof(TimedMethod), compareTimedMethod);
1233 for (ii = 0; ii < num_entries - 1; ++ii) sorted[ii].next = &sorted[ii + 1];
1234 sorted[num_entries - 1].next = nullptr;
