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()
669 int n = 0, i = 0; in sort_reserve_entries() local
674 n++; in sort_reserve_entries()
676 if (n == 0) in sort_reserve_entries()
679 tbl = xmalloc(n * sizeof(*tbl)); in sort_reserve_entries()
686 qsort(tbl, n, sizeof(*tbl), cmp_reserve_info); in sort_reserve_entries()
689 for (i = 0; i < (n-1); i++) in sort_reserve_entries()
691 tbl[n-1]->next = NULL; in sort_reserve_entries()
708 int n = 0, i = 0; in sort_properties() local
712 n++; in sort_properties()
714 if (n == 0) in sort_properties()
717 tbl = xmalloc(n * sizeof(*tbl)); in sort_properties()
722 qsort(tbl, n, sizeof(*tbl), cmp_prop); in sort_properties()
725 for (i = 0; i < (n-1); i++) in sort_properties()
727 tbl[n-1]->next = NULL; in sort_properties()
744 int n = 0, i = 0; in sort_subnodes() local
748 n++; in sort_subnodes()
750 if (n == 0) in sort_subnodes()
753 tbl = xmalloc(n * sizeof(*tbl)); in sort_subnodes()
758 qsort(tbl, n, sizeof(*tbl), cmp_subnode); in sort_subnodes()
761 for (i = 0; i < (n-1); i++) in sort_subnodes()
763 tbl[n-1]->next_sibling = NULL; in sort_subnodes()