Searched refs:parents (Results 1 - 25 of 86) sorted by relevance

1234

/netbsd-current/sys/arch/arm/sunxi/
H A Dsunxi_ccu_mux.c53 if (mux->parents[index] != NULL &&
54 strcmp(mux->parents[index], name) == 0)
81 return mux->parents[index];
H A Dsunxi_ccu_prediv.c110 if (prediv->parents[index] != NULL &&
111 strcmp(prediv->parents[index], name) == 0)
138 return prediv->parents[index];
H A Dsunxi_ccu_div.c114 pname = div->parents[index];
197 if (div->parents[index] != NULL &&
198 strcmp(div->parents[index], name) == 0)
223 return div->parents[0];
228 return div->parents[index];
H A Dsunxi_ccu.h158 const char **parents; member in struct:sunxi_ccu_nm
188 .u.nm.parents = (_parents), \
204 const char **parents; member in struct:sunxi_ccu_div
239 .u.div.parents = (_parents), \
266 const char **parents; member in struct:sunxi_ccu_prediv
299 .u.prediv.parents = (_parents), \
419 const char **parents; member in struct:sunxi_ccu_mux
436 .u.mux.parents = (_parents), \
/netbsd-current/sys/arch/arm/rockchip/
H A Drk_cru_arm.c85 main_parent = rk_cru_clock_find(sc, arm->parents[arm->mux_main]);
86 alt_parent = rk_cru_clock_find(sc, arm->parents[arm->mux_alt]);
88 device_printf(sc->sc_dev, "couldn't get clock parents\n");
92 error = rk_cru_arm_set_parent(sc, clk, arm->parents[arm->mux_alt]);
113 rk_cru_arm_set_parent(sc, clk, arm->parents[arm->mux_main]);
140 main_parent = rk_cru_clock_find(sc, arm->parents[arm->mux_main]);
141 alt_parent = rk_cru_clock_find(sc, arm->parents[arm->mux_alt]);
143 device_printf(sc->sc_dev, "couldn't get clock parents\n");
149 error = rk_cru_arm_set_parent(sc, clk, arm->parents[arm->mux_alt]);
179 rk_cru_arm_set_parent(sc, clk, arm->parents[ar
[all...]
H A Drk_cru_mux.c60 return mux->parents[index];
76 if (strcmp(mux->parents[index], parent) == 0) {
H A Drk_cru_composite.c171 rclk_parent = rk_cru_clock_find(sc, composite->parents[mux]);
175 clk_parent = fdtbus_clock_byname(composite->parents[mux]);
233 return composite->parents[mux];
248 if (strcmp(composite->parents[mux], parent) == 0) {
H A Drk_cru.h100 const char **parents; member in struct:rk_cru_pll
117 .u.pll.parents = (_parents), \
177 const char **parents; member in struct:rk_cru_arm
196 .u.arm.parents = (_parents), \
218 .u.arm.parents = (_parents), \
283 const char **parents; member in struct:rk_cru_composite
305 .u.composite.parents = (_parents), \
382 const char **parents; member in struct:rk_cru_mux
397 .u.mux.parents = (_parents), \
/netbsd-current/sys/arch/arm/nxp/
H A Dimx_ccm_mux.c55 return mux->parents[sel];
68 if (strcmp(mux->parents[sel], parent) == 0) {
H A Dimx_ccm_composite.c120 rclk_parent = imx_ccm_clock_find(sc, composite->parents[mux]);
124 clk_parent = fdtbus_clock_byname(composite->parents[mux]);
178 return composite->parents[mux];
191 if (strcmp(composite->parents[mux], parent) == 0) {
/netbsd-current/external/gpl3/gcc.old/dist/contrib/gcc-changelog/
H A Dgit_update_version.py92 assert len(commit.parents) <= 2
93 commit = commit.parents[-1]
103 assert len(head.parents) <= 2
104 if len(head.parents) == 2:
105 head = head.parents[1]
/netbsd-current/external/gpl3/gcc/dist/contrib/gcc-changelog/
H A Dgit_update_version.py94 assert len(commit.parents) <= 2
95 commit = commit.parents[-1]
105 assert len(head.parents) <= 2
106 if len(head.parents) == 2:
107 head = head.parents[1]
/netbsd-current/sys/arch/arm/nvidia/
H A Dtegra_clock.h57 const char **parents; member in struct:tegra_mux_clk
/netbsd-current/sys/arch/arm/samsung/
H A Dexynos_clock.h52 const char **parents; member in struct:exynos_mux_clk
/netbsd-current/sys/arch/arm/amlogic/
H A Dmeson_clk_mux.c56 return mux->parents[sel];
/netbsd-current/external/gpl3/binutils/dist/gprof/
H A Dsymtab.h97 struct arc *parents; /* List of caller arcs. */
96 struct arc *parents; /* List of caller arcs. */ member in struct:sym::__anon491
/netbsd-current/external/gpl3/gdb.old/dist/gprof/
H A Dsymtab.h97 struct arc *parents; /* List of caller arcs. */
96 struct arc *parents; /* List of caller arcs. */ member in struct:sym::__anon1739
/netbsd-current/external/gpl3/binutils.old/dist/gprof/
H A Dsymtab.h97 struct arc *parents; /* List of caller arcs. */
96 struct arc *parents; /* List of caller arcs. */ member in struct:sym::__anon633
/netbsd-current/external/bsd/tre/dist/lib/
H A Dregexec.c44 int *parents; local
86 parents = submatch_data[i].parents;
87 if (parents != NULL)
88 for (j = 0; parents[j] >= 0; j++)
90 DPRINT(("pmatch[%d] parent %d\n", i, parents[j]));
91 if (pmatch[i].rm_so < pmatch[parents[j]].rm_so
92 || pmatch[i].rm_eo > pmatch[parents[j]].rm_eo)
/netbsd-current/external/gpl3/binutils/dist/libctf/
H A Dctf-dedup.c60 and values, are only 32 bits wide). We track which inputs are parents of
62 traversed in children may cite types in parents, and so that we can process
63 the parents first.)
202 relationships, so we simply sort all types that first appear in parents
222 ctf_id_t's with parents in the process by simply chasing to the parent dict
488 ctf_dict_t **inputs, uint32_t *parents,
555 uint32_t *parents, int input_num, ctf_id_t type,
714 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_num,
743 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_num,
776 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_nu
554 ctf_dedup_rhash_type(ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, uint32_t *parents, int input_num, ctf_id_t type, void *type_id, const ctf_type_t *tp, const char *name, const char *decorated, int kind, int flags, unsigned long depth, int (*populate_fun) (ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, int input_num, ctf_id_t type, void *id, const char *decorated_name, const char *hash)) argument
1013 ctf_dedup_hash_type(ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, uint32_t *parents, int input_num, ctf_id_t type, int flags, unsigned long depth, int (*populate_fun) (ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, int input_num, ctf_id_t type, void *id, const char *decorated_name, const char *hash)) argument
1900 ctf_dedup(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int cu_mapped) argument
2007 ctf_dedup_rwalk_one_output_mapping(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_dynset_t *already_visited, int visited, void *type_id, const char *hval, int (*visit_fun) (const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg, unsigned long depth) argument
2191 ctf_dedup_rwalk_output_mapping(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_dynset_t *already_visited, const char *hval, int (*visit_fun) (const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg, unsigned long depth) argument
2351 ctf_dedup_walk_output_mapping(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int (*visit_fun) (const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg) argument
2492 ctf_dedup_id_to_target(ctf_dict_t *output, ctf_dict_t *target, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_dict_t *input, int input_num, ctf_id_t id) argument
2608 ctf_dedup_emit_type(const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg) argument
2965 ctf_dedup_emit_struct_members(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents) argument
3070 ctf_dedup_emit(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, uint32_t *noutputs, int cu_mapped) argument
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/libctf/
H A Dctf-dedup.c60 and values, are only 32 bits wide). We track which inputs are parents of
62 traversed in children may cite types in parents, and so that we can process
63 the parents first.)
202 relationships, so we simply sort all types that first appear in parents
222 ctf_id_t's with parents in the process by simply chasing to the parent dict
488 ctf_file_t **inputs, uint32_t *parents,
555 uint32_t *parents, int input_num, ctf_id_t type,
697 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_num,
726 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_num,
759 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_nu
554 ctf_dedup_rhash_type(ctf_file_t *fp, ctf_file_t *input, ctf_file_t **inputs, uint32_t *parents, int input_num, ctf_id_t type, void *type_id, const ctf_type_t *tp, const char *name, const char *decorated, int kind, int flags, unsigned long depth, int (*populate_fun) (ctf_file_t *fp, ctf_file_t *input, ctf_file_t **inputs, int input_num, ctf_id_t type, void *id, const char *decorated_name, const char *hash)) argument
993 ctf_dedup_hash_type(ctf_file_t *fp, ctf_file_t *input, ctf_file_t **inputs, uint32_t *parents, int input_num, ctf_id_t type, int flags, unsigned long depth, int (*populate_fun) (ctf_file_t *fp, ctf_file_t *input, ctf_file_t **inputs, int input_num, ctf_id_t type, void *id, const char *decorated_name, const char *hash)) argument
1856 ctf_dedup(ctf_file_t *output, ctf_file_t **inputs, uint32_t ninputs, uint32_t *parents, int cu_mapped) argument
1947 ctf_dedup_rwalk_one_output_mapping(ctf_file_t *output, ctf_file_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_dynset_t *already_visited, int visited, void *type_id, const char *hval, int (*visit_fun) (const char *hval, ctf_file_t *output, ctf_file_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_file_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg, unsigned long depth) argument
2131 ctf_dedup_rwalk_output_mapping(ctf_file_t *output, ctf_file_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_dynset_t *already_visited, const char *hval, int (*visit_fun) (const char *hval, ctf_file_t *output, ctf_file_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_file_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg, unsigned long depth) argument
2291 ctf_dedup_walk_output_mapping(ctf_file_t *output, ctf_file_t **inputs, uint32_t ninputs, uint32_t *parents, int (*visit_fun) (const char *hval, ctf_file_t *output, ctf_file_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_file_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg) argument
2433 ctf_dedup_id_to_target(ctf_file_t *output, ctf_file_t *target, ctf_file_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_file_t *input, int input_num, ctf_id_t id) argument
2549 ctf_dedup_emit_type(const char *hval, ctf_file_t *output, ctf_file_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_file_t *input, ctf_id_t type, void *id, int depth, void *arg) argument
2899 ctf_dedup_emit_struct_members(ctf_file_t *output, ctf_file_t **inputs, uint32_t ninputs, uint32_t *parents) argument
3098 ctf_dedup_emit(ctf_file_t *output, ctf_file_t **inputs, uint32_t ninputs, uint32_t *parents, uint32_t *noutputs, int cu_mapped) argument
[all...]
/netbsd-current/external/gpl3/gdb/dist/libctf/
H A Dctf-dedup.c60 and values, are only 32 bits wide). We track which inputs are parents of
62 traversed in children may cite types in parents, and so that we can process
63 the parents first.)
202 relationships, so we simply sort all types that first appear in parents
222 ctf_id_t's with parents in the process by simply chasing to the parent dict
488 ctf_dict_t **inputs, uint32_t *parents,
555 uint32_t *parents, int input_num, ctf_id_t type,
714 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_num,
743 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_num,
776 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_nu
554 ctf_dedup_rhash_type(ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, uint32_t *parents, int input_num, ctf_id_t type, void *type_id, const ctf_type_t *tp, const char *name, const char *decorated, int kind, int flags, unsigned long depth, int (*populate_fun) (ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, int input_num, ctf_id_t type, void *id, const char *decorated_name, const char *hash)) argument
1013 ctf_dedup_hash_type(ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, uint32_t *parents, int input_num, ctf_id_t type, int flags, unsigned long depth, int (*populate_fun) (ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, int input_num, ctf_id_t type, void *id, const char *decorated_name, const char *hash)) argument
1900 ctf_dedup(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int cu_mapped) argument
2007 ctf_dedup_rwalk_one_output_mapping(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_dynset_t *already_visited, int visited, void *type_id, const char *hval, int (*visit_fun) (const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg, unsigned long depth) argument
2191 ctf_dedup_rwalk_output_mapping(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_dynset_t *already_visited, const char *hval, int (*visit_fun) (const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg, unsigned long depth) argument
2351 ctf_dedup_walk_output_mapping(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int (*visit_fun) (const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg) argument
2492 ctf_dedup_id_to_target(ctf_dict_t *output, ctf_dict_t *target, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_dict_t *input, int input_num, ctf_id_t id) argument
2608 ctf_dedup_emit_type(const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg) argument
2965 ctf_dedup_emit_struct_members(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents) argument
3070 ctf_dedup_emit(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, uint32_t *noutputs, int cu_mapped) argument
[all...]
/netbsd-current/external/gpl3/binutils.old/dist/libctf/
H A Dctf-dedup.c60 and values, are only 32 bits wide). We track which inputs are parents of
62 traversed in children may cite types in parents, and so that we can process
63 the parents first.)
202 relationships, so we simply sort all types that first appear in parents
222 ctf_id_t's with parents in the process by simply chasing to the parent dict
488 ctf_dict_t **inputs, uint32_t *parents,
555 uint32_t *parents, int input_num, ctf_id_t type,
714 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_num,
743 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_num,
776 if ((hval = ctf_dedup_hash_type (fp, input, inputs, parents, input_nu
554 ctf_dedup_rhash_type(ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, uint32_t *parents, int input_num, ctf_id_t type, void *type_id, const ctf_type_t *tp, const char *name, const char *decorated, int kind, int flags, unsigned long depth, int (*populate_fun) (ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, int input_num, ctf_id_t type, void *id, const char *decorated_name, const char *hash)) argument
1013 ctf_dedup_hash_type(ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, uint32_t *parents, int input_num, ctf_id_t type, int flags, unsigned long depth, int (*populate_fun) (ctf_dict_t *fp, ctf_dict_t *input, ctf_dict_t **inputs, int input_num, ctf_id_t type, void *id, const char *decorated_name, const char *hash)) argument
1900 ctf_dedup(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int cu_mapped) argument
2007 ctf_dedup_rwalk_one_output_mapping(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_dynset_t *already_visited, int visited, void *type_id, const char *hval, int (*visit_fun) (const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg, unsigned long depth) argument
2191 ctf_dedup_rwalk_output_mapping(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_dynset_t *already_visited, const char *hval, int (*visit_fun) (const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg, unsigned long depth) argument
2351 ctf_dedup_walk_output_mapping(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int (*visit_fun) (const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg), void *arg) argument
2492 ctf_dedup_id_to_target(ctf_dict_t *output, ctf_dict_t *target, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, ctf_dict_t *input, int input_num, ctf_id_t id) argument
2608 ctf_dedup_emit_type(const char *hval, ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, int already_visited, ctf_dict_t *input, ctf_id_t type, void *id, int depth, void *arg) argument
2965 ctf_dedup_emit_struct_members(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents) argument
3070 ctf_dedup_emit(ctf_dict_t *output, ctf_dict_t **inputs, uint32_t ninputs, uint32_t *parents, uint32_t *noutputs, int cu_mapped) argument
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dvtable-verify.h86 vec<struct vtv_graph_node *> parents; /* Vector of parents in the graph. */ member in struct:vtv_graph_node
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dvtable-verify.h86 vec<struct vtv_graph_node *> parents; /* Vector of parents in the graph. */ member in struct:vtv_graph_node

Completed in 182 milliseconds

1234