/dragonfly/contrib/binutils-2.27/libiberty/ |
H A D | fibheap.c | 114 if (heap->min == NULL || node->key < heap->min->key) in fibheap_insert() 115 heap->min = node; in fibheap_insert() 117 heap->nodes++; in fibheap_insert() 232 if (fibheap_compare (heap, node, heap->min) <= 0) in fibheap_replace_key_data() 233 heap->min = node; in fibheap_replace_key_data() 279 free (heap); in fibheap_delete() 309 heap->nodes--; in fibheap_extr_min_node() 313 heap->min = NULL; in fibheap_extr_min_node() 391 heap->min = NULL; in fibheap_consolidate() 396 if (heap->min == NULL || fibheap_compare (heap, a[i], heap->min) < 0) in fibheap_consolidate() [all …]
|
/dragonfly/contrib/binutils-2.34/libiberty/ |
H A D | fibheap.c | 114 if (heap->min == NULL || node->key < heap->min->key) in fibheap_insert() 115 heap->min = node; in fibheap_insert() 117 heap->nodes++; in fibheap_insert() 232 if (fibheap_compare (heap, node, heap->min) <= 0) in fibheap_replace_key_data() 233 heap->min = node; in fibheap_replace_key_data() 279 free (heap); in fibheap_delete() 309 heap->nodes--; in fibheap_extr_min_node() 313 heap->min = NULL; in fibheap_extr_min_node() 391 heap->min = NULL; in fibheap_consolidate() 396 if (heap->min == NULL || fibheap_compare (heap, a[i], heap->min) < 0) in fibheap_consolidate() [all …]
|
/dragonfly/contrib/gcc-4.7/libiberty/ |
H A D | fibheap.c | 114 if (heap->min == NULL || node->key < heap->min->key) in fibheap_insert() 115 heap->min = node; in fibheap_insert() 117 heap->nodes++; in fibheap_insert() 232 if (fibheap_compare (heap, node, heap->min) <= 0) in fibheap_replace_key_data() 233 heap->min = node; in fibheap_replace_key_data() 279 free (heap); in fibheap_delete() 309 heap->nodes--; in fibheap_extr_min_node() 313 heap->min = NULL; in fibheap_extr_min_node() 391 heap->min = NULL; in fibheap_consolidate() 396 if (heap->min == NULL || fibheap_compare (heap, a[i], heap->min) < 0) in fibheap_consolidate() [all …]
|
/dragonfly/contrib/gcc-8.0/libiberty/ |
H A D | fibheap.c | 114 if (heap->min == NULL || node->key < heap->min->key) in fibheap_insert() 115 heap->min = node; in fibheap_insert() 117 heap->nodes++; in fibheap_insert() 232 if (fibheap_compare (heap, node, heap->min) <= 0) in fibheap_replace_key_data() 233 heap->min = node; in fibheap_replace_key_data() 279 free (heap); in fibheap_delete() 309 heap->nodes--; in fibheap_extr_min_node() 313 heap->min = NULL; in fibheap_extr_min_node() 391 heap->min = NULL; in fibheap_consolidate() 396 if (heap->min == NULL || fibheap_compare (heap, a[i], heap->min) < 0) in fibheap_consolidate() [all …]
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | fibonacci_heap.c | 128 heap->extract_min (); in test_replace_key() 130 ASSERT_EQ (1, heap->nodes ()); in test_replace_key() 133 delete heap; in test_replace_key() local 155 heap->extract_min (); in test_duplicate_keys() 160 heap->extract_min (); in test_duplicate_keys() 163 delete heap; in test_duplicate_keys() local 263 heap->extract_min (); in test_struct_key() 264 heap->extract_min (); in test_struct_key() 266 heap->extract_min (); in test_struct_key() 268 heap->extract_min (); in test_struct_key() [all …]
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | tree-data-ref.h | 84 VEC(tree,heap) *access_fns; 141 VEC (loop_p, heap) *loop_nest; 143 VEC (tree, heap) *parameters; 318 VEC (loop_p, heap) *loop_nest; 344 DEF_VEC_ALLOC_P(ddr_p,heap); 429 VEC (ddr_p, heap) **, VEC (loop_p, heap) *, 616 VEC (loop_p, heap) **, 617 VEC (ddr_p, heap) **, 674 VEC (int, heap) *vertices; 678 DEF_VEC_ALLOC_P (rdgc, heap); [all …]
|
H A D | tree-loop-distribution.c | 520 VEC (int, heap) *nodes = VEC_alloc (int, heap, 3); in mark_nodes_having_upstream_mem_writes() 540 VEC_free (int, heap, nodes); in mark_nodes_having_upstream_mem_writes() 653 VEC (int, heap) *nodes = VEC_alloc (int, heap, 3); in rdg_flag_vertex_and_dependent() 700 VEC (gimple, heap) *conds = VEC_alloc (gimple, heap, 3); in rdg_flag_loop_exits() 777 VEC (int, heap) **all_components = XNEWVEC (VEC (int, heap) *, n_components); in rdg_build_components() 987 VEC (rdgc, heap) *comps = VEC_alloc (rdgc, heap, 3); in rdg_build_partitions() 988 VEC (int, heap) *foo = VEC_alloc (int, heap, 3); in rdg_build_partitions() 1095 VEC (rdgc, heap) *components = VEC_alloc (rdgc, heap, 3); in ldist_gen() 1096 VEC (bitmap, heap) *partitions = VEC_alloc (bitmap, heap, 3); in ldist_gen() 1097 VEC (int, heap) *other_stores = VEC_alloc (int, heap, 3); in ldist_gen() [all …]
|
H A D | tree-vectorizer.h | 78 DEF_VEC_ALLOC_P (slp_void_p, heap); 84 VEC (slp_void_p, heap) *children; 86 VEC (gimple, heap) *stmts; 88 VEC (gimple, heap) *vec_stmts; 103 DEF_VEC_ALLOC_P(slp_tree, heap); 129 VEC (slp_tree, heap) *loads; 162 VEC (gimple, heap) *def_stmts; 238 VEC (loop_p, heap) *loop_nest; 244 VEC (ddr_p, heap) *ddrs; 351 VEC (ddr_p, heap) *ddrs; [all …]
|
H A D | genextract.c | 74 DEF_VEC_ALLOC_P(locstr,heap); 78 VEC(locstr,heap) *oplocs; 79 VEC(locstr,heap) *duplocs; 80 VEC(int,heap) *dupnums; 81 VEC(char,heap) *pathstr; 178 VEC_free (locstr,heap, acc.oplocs); in gen_insn() 179 VEC_free (locstr,heap, acc.duplocs); in gen_insn() 180 VEC_free (int,heap, acc.dupnums); in gen_insn() 181 VEC_free (char,heap, acc.pathstr); in gen_insn() 204 VEC_safe_push (locstr, heap, *vp, 0); in VEC_safe_set_locstr() [all …]
|
H A D | tree-ssa-uninit.c | 327 DEF_VEC_ALLOC_P(use_pred_info_t, heap); 435 VEC(edge, heap) **dep_chains = 0; in find_predicates() 436 VEC(edge, heap) *cur_chain = 0; in find_predicates() 464 VEC_free (edge, heap, cur_chain); in find_predicates() 535 VEC(edge, heap) **dep_chains = 0; in find_def_preds() 536 VEC(edge, heap) *cur_chain = 0; in find_def_preds() 537 VEC(edge, heap) *def_edges = 0; in find_def_preds() 1098 VEC(gimple, heap) *conds; 1646 VEC(use_pred_info_t, heap) *x = 0; in normalize_preds() 1971 VEC(gimple, heap) *worklist = 0; in execute_late_warn_uninitialized() [all …]
|
H A D | graphite-scop-detection.c | 62 VEC (basic_block, heap) *dom; in get_bb_type() 79 VEC_free (basic_block, heap, dom); in get_bb_type() 128 DEF_VEC_ALLOC_O(sd_region, heap); 135 VEC (sd_region, heap) **target) in move_sd_regions() 143 VEC_free (sd_region, heap, *source); in move_sd_regions() 466 VEC (sd_region, heap) *regions = VEC_alloc (sd_region, heap, 3); in scopdet_basic_block_info() 531 VEC (sd_region, heap) *regions = VEC_alloc (sd_region, heap, 3); in scopdet_basic_block_info() 574 VEC (sd_region, heap) *regions = VEC_alloc (sd_region, heap, 3); in scopdet_basic_block_info() 1177 VEC (sd_region, heap) *regions = VEC_alloc (sd_region, heap, 3); in limit_scops() 1392 VEC (sd_region, heap) *regions = VEC_alloc (sd_region, heap, 3); in build_scops() [all …]
|
H A D | ipa-prop.h | 164 DEF_VEC_ALLOC_O (ipa_param_descriptor_t, heap); 175 VEC (ipa_param_descriptor_t, heap) *descriptors; 184 VEC (tree, heap) *known_vals; 270 DEF_VEC_ALLOC_O (ipa_node_params_t, heap); 275 extern VEC (ipa_node_params_t, heap) *ipa_node_params_vector; 312 VEC_safe_grow_cleared (ipa_node_params_t, heap, in ipa_check_create_node_params() 346 VEC (cgraph_edge_p, heap) **new_edges); 350 VEC (tree, heap) *known_csts, 351 VEC (tree, heap) *known_binfs); 426 DEF_VEC_ALLOC_O (ipa_parm_adjustment_t, heap); [all …]
|
H A D | ree.c | 266 DEF_VEC_ALLOC_O(ext_cand, heap); 502 VEC (rtx, heap) *defs_list; 503 VEC (rtx, heap) *copies_list; 504 VEC (rtx, heap) *modified_list; 505 VEC (rtx, heap) *work_list; 767 VEC (ext_cand, heap) **insn_list, in add_removable_extension() 838 static VEC (ext_cand, heap)* in VEC() argument 872 VEC (ext_cand, heap) *reinsn_list; in find_and_remove_re() 873 VEC (rtx, heap) *reinsn_del_list; in find_and_remove_re() 920 VEC_free (rtx, heap, reinsn_del_list); in find_and_remove_re() [all …]
|
H A D | tree-vect-slp.c | 135 static VEC (slp_oprnd_info, heap) * in VEC() argument 1082 VEC (gimple, heap) *tmp_stmts; in vect_slp_rearrange_stmts() 1464 VEC (int, heap) *load_permutation; in vect_analyze_slp_instance() 1465 VEC (slp_tree, heap) *loads; in vect_analyze_slp_instance() 1468 VEC (gimple, heap) *scalar_stmts; in vect_analyze_slp_instance() 1573 VEC_free (slp_tree, heap, loads); in vect_analyze_slp_instance() 1628 VEC_free (slp_tree, heap, loads); in vect_analyze_slp_instance() 1997 VEC (ddr_p, heap) *ddrs; in vect_slp_analyze_bb_1() 2224 VEC (tree, heap) *voprnds = VEC_alloc (tree, heap, number_of_vectors); in vect_get_constant_vectors() 2399 VEC_free (tree, heap, voprnds); in vect_get_constant_vectors() [all …]
|
H A D | ipa-inline.c | 1142 fibheap_t heap) in lookup_recursive_calls() argument 1154 fibheap_insert (heap, in lookup_recursive_calls() 1174 fibheap_t heap; in recursive_inlining() local 1191 heap = fibheap_new (); in recursive_inlining() 1193 if (fibheap_empty (heap)) in recursive_inlining() 1195 fibheap_delete (heap); in recursive_inlining() 1205 while (!fibheap_empty (heap)) in recursive_inlining() 1257 fibheap_delete (heap); in recursive_inlining() 1302 add_new_edges_to_heap (fibheap_t heap, VEC (cgraph_edge_p, heap) *new_edges) in add_new_edges_to_heap() argument 1393 while (!fibheap_empty (heap)) in inline_small_functions() [all …]
|
H A D | ipa-inline.h | 127 DEF_VEC_ALLOC_O(inline_param_summary_t,heap); 141 VEC (inline_param_summary_t, heap) *param; 146 DEF_VEC_ALLOC_O(inline_edge_summary_t,heap); 147 extern VEC(inline_edge_summary_t,heap) *inline_edge_summary_vec; 154 DEF_VEC_ALLOC_O(edge_growth_cache_entry,heap); 156 extern VEC(int,heap) *node_growth_cache; 157 extern VEC(edge_growth_cache_entry,heap) *edge_growth_cache; 171 VEC (tree, heap) *known_vals, 172 VEC (tree, heap) *known_binfos, 183 bool inline_call (struct cgraph_edge *, bool, VEC (cgraph_edge_p, heap) **, int *);
|
H A D | tree-outof-ssa.c | 45 DEF_VEC_ALLOC_I(source_location,heap); 73 VEC(int,heap) *nodes; 76 VEC(int,heap) *edge_list; 79 VEC(source_location,heap) *edge_locus; 85 VEC(int,heap) *stack; 94 VEC(int,heap) *const_dests; 95 VEC(tree,heap) *const_copies; 98 VEC(source_location,heap) *copy_locus; 377 VEC_free (int, heap, g->stack); in delete_elim_graph() 378 VEC_free (int, heap, g->edge_list); in delete_elim_graph() [all …]
|
H A D | tree-ssa-sccvn.h | 68 VEC (tree, heap) *phiargs; 94 DEF_VEC_ALLOC_O(vn_reference_op_s, heap); 111 VEC (vn_reference_op_s, heap) *operands; 192 void vn_reference_fold_indirect (VEC (vn_reference_op_s, heap) **, 194 void copy_reference_ops_from_ref (tree, VEC(vn_reference_op_s, heap) **); 195 void copy_reference_ops_from_call (gimple, VEC(vn_reference_op_s, heap) **); 197 VEC (vn_reference_op_s, heap) *); 199 VEC (vn_reference_op_s, heap) *, 204 VEC (vn_reference_op_s, heap) *,
|
H A D | tree-vect-stmts.c | 513 VEC(gimple,heap) *worklist; in vect_mark_stmts_to_be_vectorized() 1483 VEC (tree, heap) *ops = VEC_alloc (tree, heap, nops); in vect_get_vec_defs() 1484 VEC (slp_void_p, heap) *vec_defs = VEC_alloc (slp_void_p, heap, nops); in vect_get_vec_defs() 1496 VEC_free (tree, heap, ops); in vect_get_vec_defs() 1595 VEC(tree, heap) *vargs = NULL; in vectorizable_call() 1768 = (VEC (tree, heap) *) in vectorizable_call() 1785 = (VEC (tree, heap) *) in vectorizable_call() 1856 = (VEC (tree, heap) *) in vectorizable_call() 1875 = (VEC (tree, heap) *) in vectorizable_call() 1930 VEC_free (tree, heap, vargs); in vectorizable_call() [all …]
|
H A D | graphite-sese-to-poly.c | 275 VEC (data_reference_p, heap) *drs = VEC_alloc (data_reference_p, heap, 5); in try_generate_gimple_bb() 1401 VEC (gimple, heap) *conditions = VEC_alloc (gimple, heap, 3); in build_sese_conditions() 1402 VEC (gimple, heap) *cases = VEC_alloc (gimple, heap, 3); in build_sese_conditions() 1991 VEC (data_reference_p, heap) *drs = VEC_alloc (data_reference_p, heap, 3); in build_scop_drs() 2089 VEC (gimple, heap) *x = VEC_alloc (gimple, heap, 3); in insert_stmts() 2114 VEC (gimple, heap) *x = VEC_alloc (gimple, heap, 3); in insert_out_of_ssa_copy() 2143 VEC (data_reference_p, heap) *drs = VEC_alloc (data_reference_p, heap, 3); in new_pbb_from_pbb() 2174 VEC (gimple, heap) *x = VEC_alloc (gimple, heap, 3); in insert_out_of_ssa_copy_on_edge() 2998 VEC (gimple, heap) *update = VEC_alloc (gimple, heap, 3); in remove_phi() 3159 VEC (gimple, heap) *in = VEC_alloc (gimple, heap, 10); in rewrite_commutative_reductions_out_of_ssa_close_phi() [all …]
|
H A D | tree-ssa-structalias.c | 313 DEF_VEC_ALLOC_P(varinfo_t, heap); 477 DEF_VEC_ALLOC_O(ce_s, heap); 3426 process_all_all_constraints (VEC (ce_s, heap) *lhsc, VEC (ce_s, heap) *rhsc) in process_all_all_constraints() 3516 VEC_free (ce_s, heap, lhsc); in do_structure_copy() 3517 VEC_free (ce_s, heap, rhsc); in do_structure_copy() 3545 VEC_free (ce_s, heap, rhsc); in make_constraint_to() 3898 VEC_free (ce_s, heap, lhsc); in handle_lhs_call() 4663 VEC_free (ce_s, heap, rhsc); in find_func_aliases() 4664 VEC_free (ce_s, heap, lhsc); in find_func_aliases() 4681 VEC_free (ce_s, heap, ptrc); in process_ipa_clobber() [all …]
|
H A D | vecir.h | 30 DEF_VEC_ALLOC_P(tree,heap); 34 DEF_VEC_ALLOC_P(gimple,heap); 40 DEF_VEC_ALLOC_P(gimple_p,heap); 45 DEF_VEC_ALLOC_P(gimple_seq,heap); 49 DEF_VEC_ALLOC_P(rtx,heap);
|
H A D | tree-predcom.c | 244 DEF_VEC_ALLOC_P (dref, heap); 277 VEC(dref,heap) *refs; 283 VEC(tree,heap) *vars; 286 VEC(tree,heap) *inits; 300 DEF_VEC_ALLOC_P (chain_p, heap); 322 VEC(dref,heap) *refs; 689 VEC_free (edge, heap, exits); in last_always_executed_block() 1565 VEC(tree, heap) **vars, VEC(tree, heap) *inits, in initialize_root_vars_lm() 1616 VEC (tree, heap) *vars; in execute_load_motion() 1657 VEC_free (tree, heap, vars); in execute_load_motion() [all …]
|
/dragonfly/contrib/bzip2/ |
H A D | huffman.c | 36 zz = z; tmp = heap[zz]; \ 37 while (weight[tmp] < weight[heap[zz >> 1]]) { \ 38 heap[zz] = heap[zz >> 1]; \ 52 weight[heap[yy+1]] < weight[heap[yy]]) \ 55 heap[zz] = heap[yy]; \ 75 Int32 heap [ BZ_MAX_ALPHA_SIZE + 2 ]; in BZ2_hbMakeCodeLengths() local 87 heap[0] = 0; in BZ2_hbMakeCodeLengths() 94 heap[nHeap] = i; in BZ2_hbMakeCodeLengths() 101 n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1); in BZ2_hbMakeCodeLengths() 102 n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1); in BZ2_hbMakeCodeLengths() [all …]
|
/dragonfly/contrib/libarchive/libarchive/ |
H A D | archive_read_support_format_iso9660.c | 2299 if (heap->cnt >= heap->allocated) { in register_CE() 2317 memcpy(p, heap->reqs, heap->cnt * sizeof(*p)); in register_CE() 2320 heap->reqs = p; in register_CE() 2337 heap->reqs[hole] = heap->reqs[parent]; in register_CE() 2358 heap->reqs[0] = heap->reqs[--(heap->cnt)]; in next_CE() 2381 heap->reqs[a] = heap->reqs[b]; in next_CE() 2420 next_CE(heap); in read_CE() 3019 if (heap->used >= heap->allocated) { in heap_add_entry() 3060 heap->files[hole] = heap->files[parent]; in heap_add_entry() 3086 heap->files[0] = heap->files[--(heap->used)]; in heap_get_entry() [all …]
|