Lines Matching refs:n
441 cell_t propval_cell_n(struct property *prop, int n) in propval_cell_n() argument
443 assert(prop->val.len / sizeof(cell_t) >= n); in propval_cell_n()
444 return fdt32_to_cpu(*((fdt32_t *)prop->val.val + n)); in propval_cell_n()
668 int n = 0, i = 0; in sort_reserve_entries() local
673 n++; in sort_reserve_entries()
675 if (n == 0) in sort_reserve_entries()
678 tbl = xmalloc(n * sizeof(*tbl)); in sort_reserve_entries()
685 qsort(tbl, n, sizeof(*tbl), cmp_reserve_info); in sort_reserve_entries()
688 for (i = 0; i < (n-1); i++) in sort_reserve_entries()
690 tbl[n-1]->next = NULL; in sort_reserve_entries()
707 int n = 0, i = 0; in sort_properties() local
711 n++; in sort_properties()
713 if (n == 0) in sort_properties()
716 tbl = xmalloc(n * sizeof(*tbl)); in sort_properties()
721 qsort(tbl, n, sizeof(*tbl), cmp_prop); in sort_properties()
724 for (i = 0; i < (n-1); i++) in sort_properties()
726 tbl[n-1]->next = NULL; in sort_properties()
743 int n = 0, i = 0; in sort_subnodes() local
747 n++; in sort_subnodes()
749 if (n == 0) in sort_subnodes()
752 tbl = xmalloc(n * sizeof(*tbl)); in sort_subnodes()
757 qsort(tbl, n, sizeof(*tbl), cmp_subnode); in sort_subnodes()
760 for (i = 0; i < (n-1); i++) in sort_subnodes()
762 tbl[n-1]->next_sibling = NULL; in sort_subnodes()