Home
last modified time | relevance | path

Searched refs:n_children (Results 1 – 25 of 1760) sorted by relevance

12345678910>>...71

/dports/security/pam_krb5-rh/pam_krb5-2.4.13/tests/tools/
H A Dmeanwhile.c48 n_children++; in main()
82 assert(n_children > 0); in main()
83 readycmds[n_children - 1] = argv[++i]; in main()
86 cmds[n_children] = argv[i]; in main()
87 readycmds[n_children] = NULL; in main()
89 if (execs[n_children] == NULL) { in main()
93 sprintf(execs[n_children], "exec %s", cmds[n_children]); in main()
94 children[n_children] = -1; in main()
95 n_children++; in main()
98 for (i = 0; i < n_children; i++) { in main()
[all …]
/dports/audio/zrythm/zrythm-1.0.0-alpha.26.0.13/ext/zix/zix/
H A Dpatree.c105 zix_patree_node_size(n_edges_t n_children) in zix_patree_node_size() argument
108 zix_patree_pad(n_children) + in zix_patree_node_size()
109 (n_children * sizeof(ZixPatreeNode*))); in zix_patree_node_size()
113 realloc_node(ZixPatreeNode* n, int n_children) in realloc_node() argument
149 return n->n_children == 0; in patree_is_leaf()
185 child->n_children = 0; in patree_add_edge()
187 n = realloc_node(n, n->n_children + 1); in patree_add_edge()
192 ++n->n_children; in patree_add_edge()
201 m->n_children = n->n_children + 1; in patree_add_edge()
238 child->n_children = 1; in patree_split_edge()
[all …]
H A Dampatree.c76 for (n_edges_t i = 0; i < node->n_children; ++i) { in zix_ampatree_print_rec()
93 zix_ampatree_node_size(n_edges_t n_children) in zix_ampatree_node_size() argument
99 realloc_node(ZixAMPatreeNode* n, int n_children) in realloc_node() argument
118 for (n_edges_t i = 0; i < n->n_children; ++i) { in zix_ampatree_free_rec()
135 return n->n_children == 0; in patree_is_leaf()
148 for (n_edges_t i = 0; i < n->n_children; ++i) { in zix_ampatree_node_check()
170 child->n_children = 0; in patree_add_edge()
172 n = realloc_node(n, n->n_children + 1); in patree_add_edge()
177 m->n_children = n->n_children + 1; in patree_add_edge()
214 child->n_children = 1; in patree_split_edge()
[all …]
/dports/net/openmpi/openmpi-4.1.1/ompi/patterns/net/
H A Dnetpatterns_multinomial_tree.c109 tree_nodes[node_index].n_children=0; in ompi_netpatterns_setup_multinomial_tree()
120 n_children=n_full_stripes; in ompi_netpatterns_setup_multinomial_tree()
123 n_children++; in ompi_netpatterns_setup_multinomial_tree()
126 tree_nodes[node_index].n_children=n_children; in ompi_netpatterns_setup_multinomial_tree()
127 if( 0 < n_children ) { in ompi_netpatterns_setup_multinomial_tree()
129 malloc(sizeof(int)*n_children); in ompi_netpatterns_setup_multinomial_tree()
137 for( rank=0 ; rank < n_children ; rank++ ) { in ompi_netpatterns_setup_multinomial_tree()
144 n_children=tree_order; in ompi_netpatterns_setup_multinomial_tree()
147 malloc(sizeof(int)*n_children); in ompi_netpatterns_setup_multinomial_tree()
151 for( rank=0 ; rank < n_children ; rank++ ) { in ompi_netpatterns_setup_multinomial_tree()
[all …]
/dports/net/openmpi3/openmpi-3.1.6/ompi/patterns/net/
H A Dnetpatterns_multinomial_tree.c109 tree_nodes[node_index].n_children=0; in ompi_netpatterns_setup_multinomial_tree()
120 n_children=n_full_stripes; in ompi_netpatterns_setup_multinomial_tree()
123 n_children++; in ompi_netpatterns_setup_multinomial_tree()
126 tree_nodes[node_index].n_children=n_children; in ompi_netpatterns_setup_multinomial_tree()
127 if( 0 < n_children ) { in ompi_netpatterns_setup_multinomial_tree()
129 malloc(sizeof(int)*n_children); in ompi_netpatterns_setup_multinomial_tree()
137 for( rank=0 ; rank < n_children ; rank++ ) { in ompi_netpatterns_setup_multinomial_tree()
144 n_children=tree_order; in ompi_netpatterns_setup_multinomial_tree()
147 malloc(sizeof(int)*n_children); in ompi_netpatterns_setup_multinomial_tree()
151 for( rank=0 ; rank < n_children ; rank++ ) { in ompi_netpatterns_setup_multinomial_tree()
[all …]
/dports/sysutils/R-cran-processx/processx/src/supervisor/
H A Dsupervisor.c66 int n_children = 0; variable
145 if (n_children == 0) in kill_children()
149 for (int i=0; i<n_children; i++) { in kill_children()
171 for (int i=0; i<n_children; i++) { in kill_children()
176 n_children = remove_element(children, n_children, i); in kill_children()
181 if (n_children == 0) { in kill_children()
190 for (int i=0; i<n_children; i++) { in kill_children()
414 n_children++; in main()
423 n_children = remove_element(children, n_children, i); in main()
432 for (int i=0; i<n_children; i++) { in main()
[all …]
/dports/x11-toolkits/gtk20/gtk+-2.24.33/modules/other/gail/tests/
H A Dtestcombo.c16 gint n_children, i, j; in _check_children() local
21 n_children = atk_object_get_n_accessible_children (obj); in _check_children()
23 if (n_children > 1) in _check_children()
26 n_children); in _check_children()
29 if (n_children == 2) in _check_children()
49 n_children = atk_object_get_n_accessible_children (child); in _check_children()
50 for (i = 0; i < n_children; i++) in _check_children()
65 gint n_children; in _test_selection() local
72 n_children = atk_object_get_n_accessible_children (list); in _test_selection()
79 n_children - 1)); in _test_selection()
[all …]
/dports/x11-toolkits/gtk30/gtk+-3.24.31/gtk/a11y/
H A Dgtkscrolledwindowaccessible.c34 gint n_children; in G_DEFINE_TYPE() local
69 index = n_children + 1; in G_DEFINE_TYPE()
111 gint n_children; in gtk_scrolled_window_accessible_get_n_children() local
120 n_children = g_list_length (children); in gtk_scrolled_window_accessible_get_n_children()
124 n_children++; in gtk_scrolled_window_accessible_get_n_children()
126 n_children++; in gtk_scrolled_window_accessible_get_n_children()
128 return n_children; in gtk_scrolled_window_accessible_get_n_children()
139 gint n_children; in gtk_scrolled_window_accessible_ref_child() local
155 if (child == n_children) in gtk_scrolled_window_accessible_ref_child()
162 else if (child == n_children + 1 && in gtk_scrolled_window_accessible_ref_child()
[all …]
/dports/x11-toolkits/gtk20/gtk+-2.24.33/modules/other/gail/
H A Dgailscrolledwindow.c83 gint n_children; in gail_scrolled_window_get_n_children() local
95 n_children = g_list_length (children); in gail_scrolled_window_get_n_children()
101 n_children++; in gail_scrolled_window_get_n_children()
103 n_children++; in gail_scrolled_window_get_n_children()
104 return n_children; in gail_scrolled_window_get_n_children()
114 gint n_children; in gail_scrolled_window_ref_child() local
129 if (child == n_children) in gail_scrolled_window_ref_child()
136 else if (child == n_children+1 && in gail_scrolled_window_ref_child()
140 else if (child < n_children) in gail_scrolled_window_ref_child()
162 gint n_children; in gail_scrolled_window_scrollbar_visibility_changed() local
[all …]
H A Dgailscrollbar.c62 gint n_children; in gail_scrollbar_get_index_in_parent() local
81 n_children = g_list_length (children); in gail_scrollbar_get_index_in_parent()
88 n_children = -1; in gail_scrollbar_get_index_in_parent()
95 n_children = -1; in gail_scrollbar_get_index_in_parent()
99 n_children++; in gail_scrollbar_get_index_in_parent()
104 n_children = -1; in gail_scrollbar_get_index_in_parent()
106 return n_children; in gail_scrollbar_get_index_in_parent()
/dports/x11-toolkits/libdazzle/libdazzle-3.42.0/tests/
H A Dtest-list-store-adapter.c27 gint n_children; in test_list_adapter() local
32 n_children = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (adapter), NULL); in test_list_adapter()
33 g_assert_cmpint (n_children, ==, 0); in test_list_adapter()
41 n_children = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (adapter), NULL); in test_list_adapter()
42 g_assert_cmpint (n_children, ==, i + 1); in test_list_adapter()
45 n_children = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (adapter), NULL); in test_list_adapter()
46 g_assert_cmpint (n_children, ==, 100); in test_list_adapter()
51 n_children = gtk_tree_model_iter_n_children (GTK_TREE_MODEL (adapter), NULL); in test_list_adapter()
52 g_assert_cmpint (n_children, ==, 50); in test_list_adapter()
/dports/databases/arrow/apache-arrow-6.0.1/go/arrow/cdata/
H A Dcdata_fulltest.c49 .n_children = 0, in export_int32_type()
78 .n_children = 0, in export_int32_array()
140 .n_children = 0, in test_primitive()
164 .n_children = 0, in test_lists()
187 .n_children = 0, in fill_structs()
233 .n_children = 0, in test_map()
254 out->n_children = 2; in stream_schema()
263 .n_children = 0, in stream_schema()
275 .n_children = 0, in stream_schema()
316 .n_children = 0, in export_str_array()
[all …]
/dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc73 toku_create_new_ftnode(ft_handle, &node, 0, n_children); in toku_testsetup_leaf()
74 for (int i = 0; i < n_children; i++) { in toku_testsetup_leaf()
78 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_leaf()
79 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
82 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_leaf()
83 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
98 for (int i = 0; i < n_children; i++) { in toku_testsetup_nonleaf()
102 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_nonleaf()
103 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_nonleaf()
106 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_nonleaf()
[all …]
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc73 toku_create_new_ftnode(ft_handle, &node, 0, n_children); in toku_testsetup_leaf()
74 for (int i = 0; i < n_children; i++) { in toku_testsetup_leaf()
78 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_leaf()
79 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
82 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_leaf()
83 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
98 for (int i = 0; i < n_children; i++) { in toku_testsetup_nonleaf()
102 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_nonleaf()
103 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_nonleaf()
106 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_nonleaf()
[all …]
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc73 toku_create_new_ftnode(ft_handle, &node, 0, n_children); in toku_testsetup_leaf()
74 for (int i = 0; i < n_children; i++) { in toku_testsetup_leaf()
78 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_leaf()
79 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
82 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_leaf()
83 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
98 for (int i = 0; i < n_children; i++) { in toku_testsetup_nonleaf()
102 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_nonleaf()
103 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_nonleaf()
106 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_nonleaf()
[all …]
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc73 toku_create_new_ftnode(ft_handle, &node, 0, n_children); in toku_testsetup_leaf()
74 for (int i = 0; i < n_children; i++) { in toku_testsetup_leaf()
78 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_leaf()
79 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
82 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_leaf()
83 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
98 for (int i = 0; i < n_children; i++) { in toku_testsetup_nonleaf()
102 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_nonleaf()
103 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_nonleaf()
106 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_nonleaf()
[all …]
/dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc73 toku_create_new_ftnode(ft_handle, &node, 0, n_children); in toku_testsetup_leaf()
74 for (int i = 0; i < n_children; i++) { in toku_testsetup_leaf()
78 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_leaf()
79 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
82 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_leaf()
83 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
98 for (int i = 0; i < n_children; i++) { in toku_testsetup_nonleaf()
102 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_nonleaf()
103 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_nonleaf()
106 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_nonleaf()
[all …]
/dports/databases/mariadb104-server/mariadb-10.4.24/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc74 toku_create_new_ftnode(ft_handle, &node, 0, n_children); in toku_testsetup_leaf()
75 for (int i = 0; i < n_children; i++) { in toku_testsetup_leaf()
79 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_leaf()
80 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
83 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_leaf()
84 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
99 for (int i = 0; i < n_children; i++) { in toku_testsetup_nonleaf()
103 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_nonleaf()
104 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_nonleaf()
107 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_nonleaf()
[all …]
/dports/databases/mariadb104-client/mariadb-10.4.24/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc74 toku_create_new_ftnode(ft_handle, &node, 0, n_children); in toku_testsetup_leaf()
75 for (int i = 0; i < n_children; i++) { in toku_testsetup_leaf()
79 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_leaf()
80 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
83 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_leaf()
84 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
99 for (int i = 0; i < n_children; i++) { in toku_testsetup_nonleaf()
103 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_nonleaf()
104 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_nonleaf()
107 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_nonleaf()
[all …]
/dports/databases/mariadb105-client/mariadb-10.5.15/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc74 toku_create_new_ftnode(ft_handle, &node, 0, n_children); in toku_testsetup_leaf()
75 for (int i = 0; i < n_children; i++) { in toku_testsetup_leaf()
79 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_leaf()
80 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
83 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_leaf()
84 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
99 for (int i = 0; i < n_children; i++) { in toku_testsetup_nonleaf()
103 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_nonleaf()
104 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_nonleaf()
107 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_nonleaf()
[all …]
/dports/databases/mariadb103-client/mariadb-10.3.34/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc74 toku_create_new_ftnode(ft_handle, &node, 0, n_children);
75 for (int i = 0; i < n_children; i++) {
79 DBT *XMALLOC_N(n_children - 1, pivotkeys);
80 for (int i = 0; i + 1 < n_children; i++) {
83 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1);
84 for (int i = 0; i + 1 < n_children; i++) {
99 for (int i = 0; i < n_children; i++) {
103 DBT *XMALLOC_N(n_children - 1, pivotkeys);
104 for (int i = 0; i + 1 < n_children; i++) {
107 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1);
[all …]
/dports/databases/mariadb103-server/mariadb-10.3.34/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc74 toku_create_new_ftnode(ft_handle, &node, 0, n_children); in toku_testsetup_leaf()
75 for (int i = 0; i < n_children; i++) { in toku_testsetup_leaf()
79 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_leaf()
80 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
83 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_leaf()
84 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
99 for (int i = 0; i < n_children; i++) { in toku_testsetup_nonleaf()
103 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_nonleaf()
104 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_nonleaf()
107 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_nonleaf()
[all …]
/dports/databases/mariadb105-server/mariadb-10.5.15/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc74 toku_create_new_ftnode(ft_handle, &node, 0, n_children); in toku_testsetup_leaf()
75 for (int i = 0; i < n_children; i++) { in toku_testsetup_leaf()
79 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_leaf()
80 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
83 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_leaf()
84 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
99 for (int i = 0; i < n_children; i++) { in toku_testsetup_nonleaf()
103 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_nonleaf()
104 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_nonleaf()
107 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_nonleaf()
[all …]
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/ft/
H A Dft-test-helpers.cc73 toku_create_new_ftnode(ft_handle, &node, 0, n_children); in toku_testsetup_leaf()
74 for (int i = 0; i < n_children; i++) { in toku_testsetup_leaf()
78 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_leaf()
79 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
82 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_leaf()
83 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_leaf()
98 for (int i = 0; i < n_children; i++) { in toku_testsetup_nonleaf()
102 DBT *XMALLOC_N(n_children - 1, pivotkeys); in toku_testsetup_nonleaf()
103 for (int i = 0; i + 1 < n_children; i++) { in toku_testsetup_nonleaf()
106 node->pivotkeys.create_from_dbts(pivotkeys, n_children - 1); in toku_testsetup_nonleaf()
[all …]
/dports/x11-fonts/roboto-fonts-ttf/roboto-2.134/third_party/spiro/x3/
H A Dx3common.c44 if (parent->n_children == 0) in x3add_default()
48 !(parent->n_children & (parent->n_children - 1))) in x3add_default()
51 (parent->n_children << 1)); in x3add_default()
86 if (i < w->n_children - 1) in x3vbox_sizereq()
109 for (i = 0; i < w->n_children; i++) in x3vbox_sizealloc()
147 if (w->n_children == 0) in x3vbox_add()
150 !(w->n_children & (w->n_children - 1))) in x3vbox_add()
196 if (w->n_children) { in x3align_sizereq()
215 if (w->n_children) { in x3align_sizealloc()
261 if (w->n_children) { in x3pad_sizereq()
[all …]

12345678910>>...71