/dragonfly/contrib/libarchive/libarchive/ |
H A D | archive_read_disk_posix.c | 202 struct tree { struct 215 int tree_errno; argument 225 int depth; 226 int openCount; 227 int maxOpenCount; 231 struct stat lst; 232 struct stat st; 233 int descend; 234 int nlink; 238 struct entry_sparse { [all …]
|
/dragonfly/contrib/binutils-2.27/ld/ |
H A D | ldexp.c | 346 fold_unary (etree_type *tree) in fold_unary() 421 fold_binary (etree_type *tree) in fold_binary() 650 fold_trinary (etree_type *tree) in fold_trinary() 660 fold_name (etree_type *tree) in fold_name() 900 is_dot (const etree_type *tree) in is_dot() 943 is_dot_ne_0 (const etree_type *tree) in is_dot_ne_0() 955 is_dot_plus_0 (const etree_type *tree) in is_dot_plus_0() 967 is_align_conditional (const etree_type *tree) in is_align_conditional() 998 exp_fold_tree_1 (etree_type *tree) in exp_fold_tree_1() 1245 exp_fold_tree_no_dot (etree_type *tree) in exp_fold_tree_no_dot() [all …]
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | hooks.c | 275 hook_void_tree (tree) in hook_void_tree() argument 280 hook_void_rtx_tree (rtx, tree) in hook_void_rtx_tree() argument 290 hook_void_tree_treeptr (tree, tree *) in hook_void_tree_treeptr() argument 300 hook_bool_tree_false (tree) in hook_bool_tree_false() argument 312 hook_bool_tree_true (tree) in hook_bool_tree_true() argument 324 hook_bool_tree_tree_false (tree, tree) in hook_bool_tree_tree_false() argument 330 hook_bool_tree_tree_true (tree, tree) in hook_bool_tree_tree_true() argument 389 hook_rtx_tree_int_null (tree, int) in hook_rtx_tree_int_null() argument 423 hook_tree_tree_int_treep_bool_null (tree, int, tree *, bool) in hook_tree_tree_int_treep_bool_null() argument 429 hook_tree_tree_tree_null (tree, tree) in hook_tree_tree_tree_null() argument [all …]
|
H A D | gimple-match-head.c | 81 tree (*valueize)(tree)) in gimple_resimplify1() argument 144 tree (*valueize)(tree)) in gimple_resimplify2() argument 217 tree (*valueize)(tree)) in gimple_resimplify3() argument 442 gimple_seq *seq, tree (*valueize)(tree)) in gimple_simplify() argument 465 gimple_seq *seq, tree (*valueize)(tree)) in gimple_simplify() argument 499 gimple_seq *seq, tree (*valueize)(tree)) in gimple_simplify() argument 529 gimple_seq *seq, tree (*valueize)(tree)) in gimple_simplify() argument 551 gimple_seq *seq, tree (*valueize)(tree)) in gimple_simplify() argument 574 gimple_seq *seq, tree (*valueize)(tree)) in gimple_simplify() argument 618 tree (*valueize)(tree), tree (*top_valueize)(tree)) in gimple_simplify() argument [all …]
|
/dragonfly/contrib/binutils-2.34/ld/ |
H A D | ldexp.c | 366 fold_unary (etree_type *tree) in fold_unary() 527 fold_binary (etree_type *tree) in fold_binary() 673 fold_trinary (etree_type *tree) in fold_trinary() 686 fold_name (etree_type *tree) in fold_name() 917 is_dot (const etree_type *tree) in is_dot() 960 is_dot_ne_0 (const etree_type *tree) in is_dot_ne_0() 972 is_dot_plus_0 (const etree_type *tree) in is_dot_plus_0() 998 exp_fold_tree_1 (etree_type *tree) in exp_fold_tree_1() 1258 exp_fold_tree_no_dot (etree_type *tree) in exp_fold_tree_no_dot() 1268 exp_value_fold (etree_type *tree) in exp_value_fold() [all …]
|
/dragonfly/crypto/libressl/crypto/x509/ |
H A D | pcy_tree.c | 96 tree_print(char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) in tree_print() 145 X509_POLICY_TREE *tree; in tree_init() local 342 const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_add_unmatched() 368 X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_link_unmatched() 401 X509_POLICY_TREE *tree) in tree_link_any() 428 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) in tree_prune() 501 tree_calculate_authority_set(X509_POLICY_TREE *tree, in tree_calculate_authority_set() 545 tree_calculate_user_set(X509_POLICY_TREE *tree, in tree_calculate_user_set() 602 tree_evaluate(X509_POLICY_TREE *tree) in tree_evaluate() 633 X509_policy_tree_free(X509_POLICY_TREE *tree) in X509_policy_tree_free() [all …]
|
H A D | pcy_lib.c | 69 X509_policy_tree_level_count(const X509_POLICY_TREE *tree) in X509_policy_tree_level_count() 77 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i) in X509_policy_tree_get0_level()
|
/dragonfly/contrib/ldns/ |
H A D | radix.c | 116 ldns_radix_t* tree; in ldns_radix_create() local 134 ldns_radix_init(ldns_radix_t* tree) in ldns_radix_init() 150 ldns_radix_free(ldns_radix_t* tree) in ldns_radix_free() 168 ldns_radix_insert(ldns_radix_t* tree, uint8_t* key, radix_strlen_t len, in ldns_radix_insert() 334 ldns_radix_search(ldns_radix_t* tree, const uint8_t* key, radix_strlen_t len) in ldns_radix_search() 380 ldns_radix_find_less_equal(ldns_radix_t* tree, const uint8_t* key, in ldns_radix_find_less_equal() 480 ldns_radix_first(const ldns_radix_t* tree) in ldns_radix_first() 499 ldns_radix_last(const ldns_radix_t* tree) in ldns_radix_last() 624 ldns_radix_printf(FILE* fd, const ldns_radix_t* tree) in ldns_radix_printf() 773 ldns_radix_find_prefix(ldns_radix_t* tree, uint8_t* key, in ldns_radix_find_prefix() [all …]
|
/dragonfly/contrib/gcc-4.7/libobjc/ |
H A D | init.c | 203 objc_class_tree *tree, *prev; in create_tree_of_subclasses_inherited_from() local 237 __objc_tree_insert_class (objc_class_tree *tree, Class class) in __objc_tree_insert_class() 325 objc_class_tree *tree; in objc_tree_insert_class() local 350 objc_preorder_traverse (objc_class_tree *tree, in objc_preorder_traverse() argument 363 objc_postorder_traverse (objc_class_tree *tree, in objc_postorder_traverse() argument 377 __objc_tree_print (objc_class_tree *tree, int level) in __objc_tree_print() 441 __objc_send_load (objc_class_tree *tree, in __objc_send_load() 452 __objc_destroy_class_tree_node (objc_class_tree *tree, in __objc_destroy_class_tree_node()
|
/dragonfly/contrib/grep/src/ |
H A D | kwset.c | 61 struct tree struct 63 struct tree *llink; /* Left link; MUST be first field. */ argument 64 struct tree *rlink; /* Right link (to larger labels). */ argument 67 char balance; /* Difference in depths of subtrees. */ argument 79 struct tree *links; /* Tree of edges leaving this node. */ argument 331 enqueue (struct tree *tree, struct trie **last) in enqueue() 344 treefails (struct tree const *tree, struct trie const *fail, in treefails() 381 treedelta (struct tree const *tree, ptrdiff_t depth, unsigned char delta[]) in treedelta() 412 treenext (struct tree const *tree, struct trie *next[]) in treenext() 781 struct tree const *tree; in acexec_trans() local
|
/dragonfly/contrib/gcc-8.0/gcc/c-family/ |
H A D | c-attribs.c | 789 handle_asan_odr_indicator_attribute (tree *, tree, tree, int, bool *) in handle_asan_odr_indicator_attribute() argument 798 handle_stack_protect_attribute (tree *node, tree name, tree, int, in handle_stack_protect_attribute() argument 1158 handle_no_reorder_attribute (tree *pnode, in handle_no_reorder_attribute() argument 2440 handle_alloc_align_attribute (tree *node, tree, tree args, int, in handle_alloc_align_attribute() argument 2465 handle_assume_aligned_attribute (tree *, tree, tree args, int, in handle_assume_aligned_attribute() argument 2573 handle_omp_declare_simd_attribute (tree *, tree, tree, int, bool *) in handle_omp_declare_simd_attribute() argument 2630 handle_omp_declare_target_attribute (tree *, tree, tree, int, bool *) in handle_omp_declare_target_attribute() argument 3525 handle_returns_nonnull_attribute (tree *node, tree, tree, int, in handle_returns_nonnull_attribute() argument 3541 handle_designated_init_attribute (tree *node, tree name, tree, int, in handle_designated_init_attribute() argument 3557 handle_fallthrough_attribute (tree *, tree name, tree, int, in handle_fallthrough_attribute() argument [all …]
|
/dragonfly/contrib/zlib-1.2/ |
H A D | trees.c | 161 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument 165 # define send_code(s, c, tree) \ argument 430 #define pqremove(s, tree, top) \ argument 441 #define smaller(tree, n, m, depth) \ argument 451 local void pqdownheap(s, tree, k) in pqdownheap() argument 490 ct_data *tree = desc->dyn_tree; local 572 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument 619 ct_data *tree = desc->dyn_tree; local 703 local void scan_tree (s, tree, max_code) in scan_tree() argument 748 local void send_tree (s, tree, max_code) in send_tree() argument
|
/dragonfly/sys/vfs/hammer2/zlib/ |
H A D | hammer2_zlib_trees.c | 163 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument 167 # define send_code(s, c, tree) \ argument 436 #define pqremove(s, tree, top) \ argument 447 #define smaller(tree, n, m, depth) \ argument 459 pqdownheap(deflate_state *s, ct_data *tree, int k) /* the tree to restore, node to move down */ in pqdownheap() 495 ct_data *tree = desc->dyn_tree; in gen_bitlen() local 580 gen_codes (ct_data *tree, int max_code, ushf *bl_count) in gen_codes() 626 ct_data *tree = desc->dyn_tree; in build_tree() local 712 scan_tree (deflate_state *s, ct_data *tree, int max_code) in scan_tree() 758 send_tree (deflate_state *s, ct_data *tree, int max_code) /* same as above */ in send_tree()
|
/dragonfly/usr.sbin/makefs/hammer2/zlib/ |
H A D | hammer2_zlib_trees.c | 163 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument 167 # define send_code(s, c, tree) \ argument 436 #define pqremove(s, tree, top) \ argument 447 #define smaller(tree, n, m, depth) \ argument 459 pqdownheap(deflate_state *s, ct_data *tree, int k) /* the tree to restore, node to move down */ in pqdownheap() 495 ct_data *tree = desc->dyn_tree; in gen_bitlen() local 580 gen_codes (ct_data *tree, int max_code, ushf *bl_count) in gen_codes() 626 ct_data *tree = desc->dyn_tree; in build_tree() local 712 scan_tree (deflate_state *s, ct_data *tree, int max_code) in scan_tree() 758 send_tree (deflate_state *s, ct_data *tree, int max_code) /* same as above */ in send_tree()
|
/dragonfly/sbin/hammer2/zlib/ |
H A D | hammer2_zlib_trees.c | 163 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument 167 # define send_code(s, c, tree) \ argument 436 #define pqremove(s, tree, top) \ argument 447 #define smaller(tree, n, m, depth) \ argument 459 pqdownheap(deflate_state *s, ct_data *tree, int k) /* the tree to restore, node to move down */ in pqdownheap() 495 ct_data *tree = desc->dyn_tree; in gen_bitlen() local 580 gen_codes (ct_data *tree, int max_code, ushf *bl_count) in gen_codes() 626 ct_data *tree = desc->dyn_tree; in build_tree() local 712 scan_tree (deflate_state *s, ct_data *tree, int max_code) in scan_tree() 758 send_tree (deflate_state *s, ct_data *tree, int max_code) /* same as above */ in send_tree()
|
/dragonfly/contrib/ncurses/ncurses/trace/ |
H A D | trace_tries.c | 46 recur_tries(TRIES * tree, unsigned level) in recur_tries() 70 _nc_trace_tries(TRIES * tree) in _nc_trace_tries()
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | tree-ssa-threadedge.c | 48 VEC(tree,heap) *ssa_name_values; in VEC() argument 139 remove_temporary_equivalences (VEC(tree, heap) **stack) in remove_temporary_equivalences() 162 record_temporary_equivalence (tree x, tree y, VEC(tree, heap) **stack) in record_temporary_equivalence() 185 record_temporary_equivalences_from_phis (edge e, VEC(tree, heap) **stack) in record_temporary_equivalences_from_phis() 286 VEC(tree, heap) **stack, in record_temporary_equivalences_from_stmts_at_dest() 737 VEC(tree, heap) **stack, in thread_across_edge()
|
H A D | ipa-cp.c | 1102 VEC (tree, heap) *known_vals, in ipa_get_indirect_edge_target() 1163 VEC (tree, heap) *known_csts, in devirtualization_time_bonus() 1257 VEC (tree, heap) **known_csts, in gather_context_independent_values() 1683 VEC (tree, heap) *known_vals) in ipcp_discover_new_direct_edges() 1999 VEC (tree, heap) *known_vals, in create_specialized_node() 2068 VEC (tree, heap) *known_vals, in find_more_values_for_callers_subset() 2204 move_binfos_to_values (VEC (tree, heap) *known_vals, in move_binfos_to_values()
|
/dragonfly/contrib/ncurses/ncurses/base/ |
H A D | tries.c | 91 _nc_remove_key(TRIES ** tree, unsigned code) in _nc_remove_key() 123 _nc_remove_string(TRIES ** tree, const char *string) in _nc_remove_string()
|
/dragonfly/contrib/gcc-8.0/gcc/cp/ |
H A D | cp-lang.c | 96 objcp_tsubst_copy_and_build (tree /*t*/, in objcp_tsubst_copy_and_build() argument
|
/dragonfly/sys/dev/netif/ath/ath/ |
H A D | if_ath_sysctl.c | 786 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctl_alq_attach() local 815 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctlattach() local 1033 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctl_stats_attach_rxphyerr() local 1051 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctl_stats_attach_intr() local 1069 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctl_stats_attach() local 1318 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctl_hal_attach() local
|
/dragonfly/sys/dev/drm/amd/display/dc/dcn10/ |
H A D | dcn10_mpc.c | 114 struct mpcc *mpc1_get_mpcc_for_dpp(struct mpc_tree *tree, int dpp_id) in mpc1_get_mpcc_for_dpp() 178 struct mpc_tree *tree, in mpc1_insert_plane() 266 struct mpc_tree *tree, in mpc1_remove_mpcc() 369 struct mpc_tree *tree) in mpc1_init_mpcc_list_from_hw()
|
/dragonfly/contrib/gcc-4.7/gcc/c-family/ |
H A D | c-ada-spec.c | 621 int (*cpp_check)(tree, cpp_operation)) in dump_ada_nodes() 723 int (*cpp_check)(tree, cpp_operation), in print_generic_ada_decl() 1668 int (*cpp_check)(tree, cpp_operation), int spc) in dump_template_types() 1691 int (*cpp_check)(tree, cpp_operation), int spc) in dump_ada_template() 1788 int (*cpp_check)(tree, cpp_operation), int spc, in dump_generic_ada_node() 2263 int (*cpp_check)(tree, cpp_operation), int spc) in print_ada_methods() 2292 int (*cpp_check)(tree, cpp_operation), int spc) in dump_nested_types() 2509 int (*cpp_check)(tree, cpp_operation), int spc) in print_ada_declaration() 3045 int (*cpp_check)(tree, cpp_operation), int spc, in print_ada_struct_decl() 3228 int (*cpp_check)(tree, cpp_operation)) in dump_ads() [all …]
|
/dragonfly/usr.bin/bc/ |
H A D | bc.y | 57 struct tree { struct 80 static void free_tree(void); argument
|
/dragonfly/contrib/gcc-4.7/gcc/cp/ |
H A D | search.c | 1571 dfs_walk_all (tree binfo, tree (*pre_fn) (tree, void *), in dfs_walk_all() 1614 dfs_walk_once_r (tree binfo, tree (*pre_fn) (tree, void *), in dfs_walk_once_r() 1691 dfs_walk_once (tree binfo, tree (*pre_fn) (tree, void *), in dfs_walk_once() 1736 dfs_walk_once_accessible_r (tree binfo, bool friends_p, bool once, in dfs_walk_once_accessible_r() 1806 dfs_walk_once_accessible (tree binfo, bool friends_p, in dfs_walk_once_accessible()
|