Lines Matching refs:n
442 cell_t propval_cell_n(struct property *prop, 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()
696 int n = 0, i = 0; in sort_reserve_entries() local
701 n++; in sort_reserve_entries()
703 if (n == 0) in sort_reserve_entries()
706 tbl = xmalloc(n * sizeof(*tbl)); in sort_reserve_entries()
713 qsort(tbl, n, sizeof(*tbl), cmp_reserve_info); in sort_reserve_entries()
716 for (i = 0; i < (n-1); i++) in sort_reserve_entries()
718 tbl[n-1]->next = NULL; in sort_reserve_entries()
735 int n = 0, i = 0; in sort_properties() local
739 n++; in sort_properties()
741 if (n == 0) in sort_properties()
744 tbl = xmalloc(n * sizeof(*tbl)); in sort_properties()
749 qsort(tbl, n, sizeof(*tbl), cmp_prop); in sort_properties()
752 for (i = 0; i < (n-1); i++) in sort_properties()
754 tbl[n-1]->next = NULL; in sort_properties()
771 int n = 0, i = 0; in sort_subnodes() local
775 n++; in sort_subnodes()
777 if (n == 0) in sort_subnodes()
780 tbl = xmalloc(n * sizeof(*tbl)); in sort_subnodes()
785 qsort(tbl, n, sizeof(*tbl), cmp_subnode); in sort_subnodes()
788 for (i = 0; i < (n-1); i++) in sort_subnodes()
790 tbl[n-1]->next_sibling = NULL; in sort_subnodes()