Searched refs:n_children (Results 1 – 9 of 9) sorted by relevance
| /external/bluetooth/glib/tests/ |
| D | timeloop-closure.c | 14 static int n_children = 3; variable
193 n_children = atoi(argv[1]); in main()
198 printf ("Children: %d Iters: %d\n", n_children, n_iters); in main()
200 n_active_children = n_children; in main()
201 for (i = 0; i < n_children; i++) in main()
219 (n_iters * n_children)); in main()
|
| D | timeloop-basic.c | 16 static int n_children = 3; variable
173 n_children = atoi(argv[1]); in main()
178 printf ("Children: %d Iters: %d\n", n_children, n_iters); in main()
180 n_active_children = n_children; in main()
181 for (i = 0; i < n_children; i++) in main()
231 (n_iters * n_children)); in main()
|
| D | timeloop.c | 13 static int n_children = 3; variable
187 n_children = atoi(argv[1]); in main()
192 printf ("Children: %d Iters: %d\n", n_children, n_iters); in main()
194 n_active_children = n_children; in main()
195 for (i = 0; i < n_children; i++) in main()
213 (n_iters * n_children)); in main()
|
| /external/valgrind/main/massif/ |
| D | ms_main.c | 559 UInt n_children; // number of children member
580 UInt n_children; member
633 xpt->n_children = 0; in new_XPt()
646 tl_assert(parent->n_children <= parent->max_children); in add_child_xpt()
647 if (parent->n_children == parent->max_children) { in add_child_xpt()
663 parent->children[ parent->n_children++ ] = child; in add_child_xpt()
710 for (i = 0; i < xpt->n_children; i++) { in dup_XTree()
715 n_insig_children = xpt->n_children - n_sig_children; in dup_XTree()
724 sxpt->Sig.n_children = n_child_sxpts; in dup_XTree()
736 for (i = 0; i < xpt->n_children; i++) { in dup_XTree()
[all …]
|
| D | ms_print.in | 197 my $n_children = $1;
218 for (my $i = 0; $i < $n_children; $i++) {
220 my $child_midfix2 = ( $i+1 == $n_children ? " " : "| " );
242 if (0 == $n_children) {
|
| /external/bluetooth/glib/gio/xdgmime/ |
| D | xdgmimecache.c | 215 xdg_uint32_t n_children = GET_UINT32 (cache->buffer, offset + 24); in cache_magic_matchlet_compare() local
222 if (n_children == 0) in cache_magic_matchlet_compare()
225 for (i = 0; i < n_children; i++) in cache_magic_matchlet_compare()
452 xdg_uint32_t n_children; in cache_glob_node_lookup_suffix() local
478 n_children = GET_UINT32 (cache->buffer, offset + 12 * mid + 4); in cache_glob_node_lookup_suffix()
484 n_children, child_offset, in cache_glob_node_lookup_suffix()
493 while (n < n_mime_types && i < n_children) in cache_glob_node_lookup_suffix()
965 xdg_uint32_t n_children; in dump_glob_node() local
971 n_children = GET_UINT32 (cache->buffer, offset + 8); in dump_glob_node()
981 for (i = 0; i < n_children; i++) in dump_glob_node()
|
| /external/ppp/pppd/ |
| D | main.c | 193 static int n_children; /* # child processes still running */ variable
624 if (n_children > 0) {
629 dbglog("Waiting for %d child processes...", n_children);
633 while (n_children > 0 && !childwait_done) {
1755 ++n_children;
1798 if (n_children == 0) in reap_kids()
1803 --n_children; in reap_kids()
|
| /external/bluetooth/glib/gobject/ |
| D | gtype.c | 226 guint n_children : 12; member
455 i = pnode->n_children++; in type_node_any_new_W()
456 pnode->children = g_renew (GType, pnode->children, pnode->n_children); in type_node_any_new_W()
461 node->n_children = 0; in type_node_any_new_W()
516 g_assert (pnode->n_children < MAX_N_CHILDREN); in type_node_new_W()
876 for (i = 0; i < pnode->n_children && !node; i++) in find_conforming_child_type_L()
1216 for (i = 0; i < node->n_children; i++) in type_node_add_iface_entry_W()
1258 for (i = 0; i < node->n_children; i++) in type_add_interface_Wm()
3266 guint *n_children) in g_type_children() argument
3276 children = g_new (GType, node->n_children + 1); in g_type_children()
[all …]
|
| D | gtype.h | 659 guint *n_children);
|