Lines Matching refs:nr_entries
267 static int load_verify_vtpm_itree(struct mem_group_hdr *hdr, int base, int nr_entries,
271 static int load_verify_vtpm_itree(struct mem_group_hdr *hdr, int base, int nr_entries, in load_verify_vtpm_itree() argument
278 while (nr_entries > incr * hsize) in load_verify_vtpm_itree()
282 lsize = 1 + (nr_entries - 1) / incr; in load_verify_vtpm_itree()
288 if (nr_entries <= hsize) in load_verify_vtpm_itree()
289 return load_verify_vtpm_pages(hdr->v, base, nr_entries, hash, loc, mgr, group_key); in load_verify_vtpm_itree()
291 for (i = 0; i * incr < nr_entries; i++) { in load_verify_vtpm_itree()
296 if (nr_entries - i * incr < incr) in load_verify_vtpm_itree()
297 child_entries = nr_entries - i * incr; in load_verify_vtpm_itree()
409 static int load_verify_group_itree(struct mem_tpm_mgr *dst, int base, int nr_entries,
412 static int load_verify_group_itree(struct mem_tpm_mgr *dst, int base, int nr_entries, in load_verify_group_itree() argument
417 if (nr_entries <= hsize) { in load_verify_group_itree()
418 for(i=0; i < nr_entries; i++) { in load_verify_group_itree()
432 while (nr_entries > incr * hsize) in load_verify_group_itree()
435 for (i = 0; i * incr < nr_entries; i++) { in load_verify_group_itree()
440 if (nr_entries - i * incr < incr) in load_verify_group_itree()
441 child_entries = nr_entries - i * incr; in load_verify_group_itree()