Lines Matching refs:n
442 cell_t propval_cell_n(struct property *prop, unsigned int n) in propval_cell_n() argument
444 assert(prop->val.len / sizeof(cell_t) > n); in propval_cell_n()
445 return fdt32_to_cpu(*((fdt32_t *)prop->val.val + n)); in propval_cell_n()
703 int n = 0, i = 0; in sort_reserve_entries() local
708 n++; in sort_reserve_entries()
710 if (n == 0) in sort_reserve_entries()
713 tbl = xmalloc(n * sizeof(*tbl)); in sort_reserve_entries()
720 qsort(tbl, n, sizeof(*tbl), cmp_reserve_info); in sort_reserve_entries()
723 for (i = 0; i < (n-1); i++) in sort_reserve_entries()
725 tbl[n-1]->next = NULL; in sort_reserve_entries()
742 int n = 0, i = 0; in sort_properties() local
746 n++; in sort_properties()
748 if (n == 0) in sort_properties()
751 tbl = xmalloc(n * sizeof(*tbl)); in sort_properties()
756 qsort(tbl, n, sizeof(*tbl), cmp_prop); in sort_properties()
759 for (i = 0; i < (n-1); i++) in sort_properties()
761 tbl[n-1]->next = NULL; in sort_properties()
778 int n = 0, i = 0; in sort_subnodes() local
782 n++; in sort_subnodes()
784 if (n == 0) in sort_subnodes()
787 tbl = xmalloc(n * sizeof(*tbl)); in sort_subnodes()
792 qsort(tbl, n, sizeof(*tbl), cmp_subnode); in sort_subnodes()
795 for (i = 0; i < (n-1); i++) in sort_subnodes()
797 tbl[n-1]->next_sibling = NULL; in sort_subnodes()