Lines Matching full:children

45 #define	MAP_CHILDREN		"children"
129 * which are indexed by the number of children. The caller is responsible
339 " children: %llu\n" in dump_map()
406 alloc_new_map(uint64_t children, uint64_t nperms, uint64_t seed, in alloc_new_map() argument
416 map->dm_children = children; in alloc_new_map()
433 * Allocate the fixed permutation map for N children.
436 alloc_fixed_map(uint64_t children, draid_map_t **mapp) in alloc_fixed_map() argument
442 error = vdev_draid_lookup_map(children, &fixed_map); in alloc_fixed_map()
496 uint64_t children = map->dm_children; in eval_resilver() local
498 uint64_t ndisks = children - nspares; in eval_resilver()
503 while (ngroups * (groupwidth) % (children - nspares) != 0) in eval_resilver()
565 * infinite value for permutations which have children that perform in eval_resilver()
568 * there are a large number of children. in eval_resilver()
602 * all children perform an equal amount of work during reconstruction.
607 uint64_t children = map->dm_children; in eval_decluster() local
614 * When there are only 2 children there can be no distributed in eval_decluster()
618 if (children == VDEV_DRAID_MIN_CHILDREN) { in eval_decluster()
637 groupwidth <= MIN(children - nspares, 19); in eval_decluster()
647 for (int f1 = 0; f1 < children; f1++) { in eval_decluster()
665 for (int f2 = f1 + 1; f2 < children; in eval_decluster()
704 eval_maps(uint64_t children, int passes, uint64_t *map_seed, in eval_maps() argument
723 error = alloc_new_map(children, MAP_ROWS_DEFAULT, in eval_maps()
790 "children are required.\n"); in draid_generate()
799 "children are allowed.\n", in draid_generate()
874 for (uint64_t children = min_children; in draid_generate() local
875 children <= max_children; children++) { in draid_generate()
881 error = eval_maps(children, passes, map_seed, &map, in draid_generate()
894 snprintf(key, 7, "%llu", (u_longlong_t)children); in draid_generate()
915 * children instead of exiting. This option is useful as a mechanism in draid_generate()
978 * Lookup hardcoded permutation map for each valid number of children in draid_verify()
983 for (uint64_t children = VDEV_DRAID_MIN_CHILDREN; in draid_verify() local
984 children <= VDEV_DRAID_MAX_CHILDREN; in draid_verify()
985 children++) { in draid_verify()
989 snprintf(key, 8, "%llu", (u_longlong_t)children); in draid_verify()
991 error = alloc_fixed_map(children, &map); in draid_verify()
1037 printf("Error different children: %llu " in draid_verify()
1105 printf("- %llu children: good\n", in draid_verify()
1106 (u_longlong_t)children); in draid_verify()
1143 "children are required.\n"); in draid_dump()
1152 "children are allowed.\n", in draid_dump()
1183 for (uint64_t children = min_children; in draid_dump() local
1184 children <= max_children; children++) { in draid_dump()
1187 snprintf(key, 7, "%llu", (u_longlong_t)children); in draid_dump()
1220 for (uint64_t children = VDEV_DRAID_MIN_CHILDREN; in draid_table() local
1221 children <= VDEV_DRAID_MAX_CHILDREN; in draid_table()
1222 children++) { in draid_table()
1227 snprintf(key, 8, "%llu", (u_longlong_t)children); in draid_table()
1238 children = fnvlist_lookup_uint64(cfg, MAP_CHILDREN); in draid_table()
1243 "/* %2.03f */\n", (u_longlong_t)children, in draid_table()