summaryrefslogtreecommitdiff
path: root/gcc/sbitmap.h
Commit message (Collapse)AuthorAgeFilesLines
* sbitmap.h (sbitmap_ptr, [...]): Move from here...Steven Bosscher2010-05-231-3/+0
| | | | | | | | | | | * sbitmap.h (sbitmap_ptr, const_sbitmap_ptr): Move from here... * sbitmap.c: ...to here to internalize sbitmap element access. Do not include tm.h, rtl.h, flags.h, hard-reg-set.h, and obstack.h. Explain why basic-block.h is included. * function.h: Include tm.h for CUMULATIVE_ARGS. * Makefile.in: Update dependencies. From-SVN: r159749
* coretypes.h (struct simple_bitmap_def, [...]): New core types.Steven Bosscher2010-05-221-3/+2
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | gcc/ChangeLog: * coretypes.h (struct simple_bitmap_def, sbitmap, const_sbitmap): New core types. * sbitmap.h (struct sbitmap_def): Do not typedef here. * sbitmap.c: Include sbitmap.h. * basic-block.h: Do not include bitmap.h, sbitmap.h, partition.h, hard-reg-set.h. Split everything related to regsets out from here... * regset.h: ...to here. New file. * df.h: Include regset.h and sbitmap.h. * tree-flow.h: Likewise. * cfgloop.h: Likewise. * except.h: Do not include sbitmap.h. Include hashtab.h. * cgraph.h: Include vec.h and function.h. * reload.h (struct insn_chain): Change types of live_throughout and dead_or_set from regset_head to bitmap_head. (compute_use_by_pseudos): Be defined also if regset.h is not included. * ira-int.h (struct ira_spilled_reg_stack_slot): Change type of spilled_regs from regset_head to bitmap_head to avoid dependency in regset.h. * sel-sched-ir.h: Include regset.h. * reload.c: Include df.h before reload.h. * caller-save.c: Likewise. * reload1.c: Likewise. * ira.c: Likewise. (mark_elimination): Update type of r to bitmap, consistent with DF_LR_IN. * dominance.c: Include bitmap.h. * modulo-sched.c: Include df.h. * cfganal.c: Include bitmap.h and sbitmap.h. * cfgbuild.c: Include sbitmap.h. * lcm.c: Include sbitmap.h. * gcse.c (alloc_gcse_mem): Allocate regset with ALLOC_REG_SET. * domwalk.c: Include sbitmap.h, exclude ggc.h. * cfgexpand.c: Inlcude bitmap.h and sbitmap.h. * cselib.c: Include bitmap.h. * tree-optimize.c: Include regset.h. * stmt.c: Include bitmap.h. * Makefile.in: Update dependencies. cp/ChangeLog * semantics.c: Include bitmap.h. * Make-lang.in: Update dependencies. From-SVN: r159746
* sbitmap.c (sbitmap_range_empty_p): New function.Kenneth Zadeck2008-04-211-1/+2
| | | | | | | | | 2008-04-24 Kenneth Zadeck <zadeck@naturalbridge.com> * sbitmap.c (sbitmap_range_empty_p): New function. * sbitmap.h (sbitmap_range_empty_p): New function. * bitmap.h: Now includes obstack.h. From-SVN: r134529
* Change copyright header to refer to version 3 of the GNU General Public ↵Nick Clifton2007-07-261-4/+3
| | | | | | License and to point readers at the COPYING3 file and the FSF's license web page. From-SVN: r126948
* sbitmap.c (sbitmap_verify_popcount, [...]): Constify.Kaveh R. Ghazi2007-07-251-30/+32
| | | | | | | | | | | | | | | | | | | | | | | | | | | * sbitmap.c (sbitmap_verify_popcount, sbitmap_alloc_with_popcount, sbitmap_copy, sbitmap_copy_n, sbitmap_equal, sbitmap_empty_p, sbitmap_union_of_diff_cg, sbitmap_union_of_diff, sbitmap_not, sbitmap_difference, sbitmap_any_common_bits, sbitmap_a_and_b_cg, sbitmap_a_and_b, sbitmap_a_xor_b_cg, sbitmap_a_xor_b, sbitmap_a_or_b_cg, sbitmap_a_or_b, sbitmap_a_subset_b_p, sbitmap_a_or_b_and_c_cg, sbitmap_a_or_b_and_c, sbitmap_a_and_b_or_c_cg, sbitmap_a_and_b_or_c, sbitmap_first_set_bit, sbitmap_last_set_bit, dump_sbitmap, dump_sbitmap_file, debug_sbitmap, popcount_table, sbitmap_popcount): Constify. * sbitmap.h (const_sbitmap, const_sbitmap_ptr): New. (sbitmap_iterator, sbitmap_iter_init, dump_sbitmap, dump_sbitmap_file, sbitmap_copy, sbitmap_copy_n, sbitmap_equal, sbitmap_empty_p, sbitmap_union_of_diff, sbitmap_union_of_diff_cg, sbitmap_difference, sbitmap_not, sbitmap_a_or_b_and_c, sbitmap_a_or_b_and_c_cg, sbitmap_a_and_b_or_c, sbitmap_a_and_b_or_c_cg, sbitmap_any_common_bits, sbitmap_a_and_b, sbitmap_a_and_b_cg, sbitmap_a_or_b, sbitmap_a_or_b_cg, sbitmap_a_xor_b, sbitmap_a_xor_b_cg, sbitmap_a_subset_b_p, sbitmap_first_set_bit, sbitmap_last_set_bit, debug_sbitmap, sbitmap_popcount, sbitmap_verify_popcount): Constify. From-SVN: r126929
* Merge dataflow branch into mainlineDaniel Berlin2007-06-111-1/+3
| | | | From-SVN: r125624
* sbitmap.c (BITMAP_DEBUGGING): New macro.Daniel Berlin2006-12-281-11/+50
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 2006-12-27 Daniel Berlin <dberlin@dberlin.org> * sbitmap.c (BITMAP_DEBUGGING): New macro. (do_popcount): Ditto. (sbitmap_verify_popcount): New function. (sbitmap_alloc): Set popcount to NULL, remove set of bytes member. (sbitmap_alloc_with_popcount): New function. (sbitmap_resize): Remove uses of bytes member and update popcount. (sbitmap_realloc): Remove uses of bytes member. (sbitmap_copy): Copy popcount. (sbitmap_copy_n): New function. (sbitmap_zero): Update popcount cache. (sbitmap_ones): Ditto. (sbitmap_a_and_b): Ditto. (sbitmap_a_or_b): Ditto. (sbitmap_a_xor_b): Ditto. (sbitmap_union_of_diff_cg): Assert non-existence of popcount cache. (sbitmap_union_of_diff): Ditto. (sbitmap_not): Ditto. (sbitmap_difference): Ditto. (sbitmap_a_and_b_cg): Ditto. (sbitmap_a_xor_b_cg): Ditto. (sbitmap_a_or_b_cg): Ditto. (sbitmap_a_or_b_and_c_cg): Ditto. (sbitmap_a_and_b_or_c_cg): Ditto. (sbitmap_intersection_of_succs): Ditto. (sbitmap_intersection_of_preds): Ditto. (sbitmap_union_of_succs): Ditto. (sbitmap_union_of_preds): Ditto. (popcount_table): New. (sbitmap_elt_popcount): New function. (sbitmap_popcount): Ditto. * sbitmap.h (sbitmap): Remove bytes member. Add popcount member. (SET_BIT): Macro turned into function. (RESET_BIT): Ditto. (SBITMAP_SIZE_BYTES): New macro. (sbitmap_free): Free popcount too. (sbitmap_alloc_with_popcount): New prototype. (sbitmap_copy_n): Ditto. (sbitmap_verify_popcount): Ditto. From-SVN: r120237
* Update FSF address.Kelley Cook2005-06-251-2/+2
| | | | From-SVN: r101317
* sbitmap.h (sbitmap_iter_init): Consistently treat bit_num as the current bit ↵Kazu Hirata2005-06-071-3/+4
| | | | | | | | | index with no modulo. * sbitmap.h (sbitmap_iter_init): Consistently treat bit_num as the current bit index with no modulo. From-SVN: r100720
* sbitmap.h (sbitmap_iterator, [...]): New.Kazu Hirata2005-06-071-30/+80
| | | | | | | | | | | * sbitmap.h (sbitmap_iterator, sbitmap_iter_init, sbitmap_iter_cond, sbitmap_iter_next): New. * bt-load.c, cfganal.c, combine.c, ddg.c, flow.c, modulo-sched.c, sbitmap.c, sched-rgn.c, tree-into-ssa.c, tree-outof-ssa.c, tree-ssa-alias.c, tree-ssa-live.c: Update uses of EXECUTE_IF_SET_IN_SBITMAP to the new style. From-SVN: r100709
* sbitmap.c (sbitmap_any_common_bits): New function.Jeff Law2004-11-301-0/+1
| | | | | | | | | | | | * sbitmap.c (sbitmap_any_common_bits): New function. * sbitmap.h (sbitmap_any_common_bits): Prototype. * modulo-sched.c (sms_schedule_by_order): Use sbitmap_any_common_bits No longer allocate/free "psp", "pss" sbitmaps. * tree-ssa-alias.c (compute_flow_insensitive_aliasing): Similarly for the "res" sbitmap. (group_aliases): Similarly. From-SVN: r91550
* sbitmap.h (EXECUTE_IF_SET_IN_SBITMAP): Don't access PTR beyond its end.Kazu Hirata2004-10-221-8/+15
| | | | | | | * sbitmap.h (EXECUTE_IF_SET_IN_SBITMAP): Don't access PTR beyond its end. From-SVN: r89475
* sbitmap.h (EXECUTE_IF_SET_IN_SBITMAP): Speed up by shifting the currently ↵Kazu Hirata2004-10-181-19/+13
| | | | | | | | | visited word to right. * sbitmap.h (EXECUTE_IF_SET_IN_SBITMAP): Speed up by shifting the currently visited word to right. From-SVN: r89259
* bitmap.c, [...]: Update copyright.Kazu Hirata2004-10-151-1/+1
| | | | | | | | | | | | | | | | * bitmap.c, bitmap.h, builtin-attrs.def, cfglayout.h, collect2.h, conflict.c, coretypes.h, coverage.h, errors.h, gcc.h, gcov-dump.c, gen-protos.c, gencheck.c, gencodes.c, genconstants.c, gengenrtl.c, genmodes.c, genpeep.c, gensupport.h, graph.h, gthr-gnat.c, gthr-gnat.h, gthr-posix.c, gthr-posix.h, hard-reg-set.h, hwint.h, integrate.h, libgcc2.c, lists.c, machmode.def, mips-tdump.c, opts.h, params.c, predict.def, predict.h, protoize.c, reload.h, resource.h, rtl-error.c, sbitmap.c, sbitmap.h, sreal.c, tlink.c, tree-dump.h, tree-inline.h, unwind-dw2-fde.c, unwind-dw2.c, unwind-sjlj.c, value-prof.h: Update copyright. From-SVN: r89097
* re PR rtl-optimization/13987 (compile time regression while compile ↵Andrew Pinski2004-08-301-2/+2
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | fold-const.i) 2004-08-30 Andrew Pinski <apinski@apple.com> PR rtl-opt/13987 * config.host (use_long_long_for_widest_fast_int): New, default is off. (ia64-*-hpux*): Enable use_long_long_for_widest_fast_int. * configure.ac: If use_long_long_for_widest_fast_int, then define USE_LONG_LONG_FOR_WIDEST_FAST_INT. * configure: Regenerate. * config.in: Regenerate. * hwint.h (HOST_WIDEST_FAST_INT, HOST_BITS_PER_WIDEST_FAST_INT): New: widest integer type supported efficiently in hardware for the host. * sbitmap.h (SBITMAP_ELT_BITS): Define based on HOST_BITS_PER_WIDEST_FAST_INT. (SBITMAP_ELT_TYPE): Define based on HOST_WIDEST_FAST_INT. * hard-reg-set.h (HARD_REG_ELT_TYPE): Define based on HOST_WIDEST_FAST_INT instead of HOST_WIDE_INT. (HARD_REG_SET_LONGS): Likewise. (UHOST_BITS_PER_WIDE_INT): Likewise. Change the checks for the fast cases to be based on HOST_BITS_PER_WIDES_FAST_INT instead of HOST_BITS_PER_WIDE_INT. From-SVN: r86816
* Merge tree-ssa-20020619-branch into mainline.Diego Novillo2004-05-131-0/+1
| | | | From-SVN: r81764
* sbitmap.c: Convert prototypes to ISO C90.Andreas Jaeger2003-07-061-51/+44
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | * sbitmap.c: Convert prototypes to ISO C90. * sbitmap.h: Likewise. * scan-decls.c: Likewise. * scan.c: Likewise. * sched-deps.c: Likewise. * sched-ebb.c: Likewise. * sched-int.h: Likewise. * sched-rgn.c: Likewise. * sched-vis.c: Likewise. * sibcall.c: Likewise. * simplify-rtx.c: Likewise. * sreal.c: Likewise. * sreal.h: Likewise. * ssa-ccp.c: Likewise. * ssa-dce.c: Likewise. * ssa.c: Likewise. * ssa.h: Likewise. * stack.h: Likewise. * stmt.c: Likewise. * stor-layout.c: Likewise. * stringpool.c: Likewise. * target.h: Likewise. * timevar.c: Likewise. * timevar.h: Likewise. * tlink.c: Likewise. * tracer.c: Likewise. * tree-inline.c: Likewise. * tree-inline.h: Likewise. * tree.c: Likewise. * tree.h: Likewise. From-SVN: r69002
* sbitmap.c (sbitmap_resize): New function.Roger Sayle2003-02-181-1/+2
| | | | | | | | * sbitmap.c (sbitmap_resize): New function. * sbitmap.h (sbitmap_resize): Prototype here. * recog.c (split_all_insns): Use sbitmap_resize. From-SVN: r63058
* [multiple changes]Michael Matz2002-07-151-0/+29
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 2002-07-15 Michael Matz <matz@suse.de>, Daniel Berlin <dberlin@dberlin.org>, Denis Chertykov <denisc@overta.ru> Add a new register allocator. * ra.c: New file. * ra.h: New file. * ra-build.c: New file. * ra-colorize.c: New file. * ra-debug.c: New file. * ra-rewrite.c: New file. * Makefile.in (ra.o, ra-build.o, ra-colorize.o, ra-debug.o, (ra-rewrite.o): New .o files for libbackend.a. (GTFILES): Add basic-block.h. * toplev.c (flag_new_regalloc): New. (f_options): New option "new-ra". (rest_of_compilation): Call initialize_uninitialized_subregs() only for the old allocator. If flag_new_regalloc is set, call new allocator, instead of local_alloc(), global_alloc() and friends. * doc/invoke.texi: Document -fnew-ra. * basic-block.h (FOR_ALL_BB): New. * config/rs6000/rs6000.c (print_operand): Write small constants as @l+80. * df.c (read_modify_subreg_p): Narrow down cases for a rmw subreg. (df_reg_table_realloc): Make size at least as large as max_reg_num(). (df_insn_table_realloc): Size argument now is absolute, not relative. Changed all callers. * gengtype.c (main): Add the pseudo-type "HARD_REG_SET". * regclass.c (reg_scan_mark_refs): Ignore NULL rtx's. 2002-06-20 Michael Matz <matz@suse.de> * df.h (struct ref.id): Make unsigned. * df.c (df_bb_reg_def_chain_create): Remove unsigned cast. 2002-06-13 Michael Matz <matz@suse.de> * df.h (DF_REF_MODE_CHANGE): New flag. * df.c (df_def_record_1, df_uses_record): Set this flag for refs involving subregs with invalid mode changes, when CLASS_CANNOT_CHANGE_MODE is defined. 2002-05-07 Michael Matz <matz@suse.de> * reload1.c (fixup_abnormal_edges): Don't insert on NULL edge. 2002-05-03 Michael Matz <matz@suse.de> * sbitmap.c (sbitmap_difference): Accept sbitmaps of different size. Sat Feb 2 18:58:07 2002 Denis Chertykov <denisc@overta.ru> * regclass.c (regclass): Work with all regs which have sets or refs. (reg_scan_mark_refs): Count regs inside (clobber ...). 2002-01-04 Michael Matz <matzmich@cs.tu-berlin.de> * df.c (df_ref_record): Correctly calculate SUBREGs of hardregs. (df_bb_reg_def_chain_create, df_bb_reg_use_chain_create): Only add new refs. (df_bb_refs_update): Don't clear insns_modified here, ... (df_analyse): ... but here. * sbitmap.c (dump_sbitmap_file): New. (debug_sbitmap): Use it. * sbitmap.h (dump_sbitmap_file): Add prototype. 2001-08-07 Daniel Berlin <dan@cgsoftware.com> * df.c (df_insn_modify): Grow the UID table if necessary, rather than assume all emits go through df_insns_modify. 2001-07-26 Daniel Berlin <dan@cgsoftware.com> * regclass.c (reg_scan_mark_refs): When we increase REG_N_SETS, increase REG_N_REFS (like flow does), so that regclass doesn't think a reg is useless, and thus, not calculate a class, when it really should have. 2001-01-28 Daniel Berlin <dberlin@redhat.com> * sbitmap.h (EXECUTE_IF_SET_IN_SBITMAP_REV): New macro, needed for dataflow analysis. From-SVN: r55458
* sbitmap.c (sbitmap_union_of_diff, [...]): Do not return changed status.Richard Henderson2002-04-091-7/+16
| | | | | | | | | | | | | * sbitmap.c (sbitmap_union_of_diff, sbitmap_a_and_b, sbitmap_a_xor_b, sbitmap_a_or_b, sbitmap_a_or_b_and_c, sbitmap_a_and_b_or_c): Do not return changed status. (sbitmap_union_of_diff_cg, sbitmap_a_and_b_cg, sbitmap_a_xor_b_cg, sbitmap_a_or_b_cg, sbitmap_a_or_b_and_c_cg, sbitmap_a_and_b_or_c_cg): New functions that do return changed status. * sbitmap.h: Update decls. * gcse.c, lcm.c: Use _cg functions as needed. From-SVN: r52094
* predict.c: Fix formatting.Kazu Hirata2002-01-221-2/+2
| | | | | | | | | | | | | | | | | | | | | | * predict.c: Fix formatting. * print-tree.c: Likewise. * protoize.c: Likewise. * real.h: Likewise. * rtl.h: Likewise. * sbitmap.h: Likewise. * scan.c: Likewise. * sched-deps.c: Likewise. * sched-vis.c: Likewise. * sdbout.c: Likewise. * sibcall.c: Likewise. * ssa.c: Likewise. * ssa-ccp.c: Likewise. * ssa-dce.c: Likewise. * stmt.c: Likewise. * stor-layout.c: Likewise. * system.h: Likewise. From-SVN: r49074
* Makefile.in, [...]: replace "GNU CC" with "GCC".Lars Brinkhoff2001-08-221-12/+12
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | * Makefile.in, alias.c, basic-block.h, bb-reorder.c, bitmap.c, bitmap.h, builtin-types.def, builtins.c, builtins.def, c-aux-info.c, c-common.c, c-common.def, c-common.h, c-convert.c, c-decl.c, c-dump.c, c-dump.h, c-errors.c, c-format.c, c-lang.c, c-lex.c, c-lex.h, c-parse.in, c-pragma.c, c-pragma.h, c-semantics.c, c-tree.h, c-typeck.c, caller-save.c, calls.c, collect2.c, collect2.h, combine.c, conditions.h, config.gcc, configure.frag, configure.in, conflict.c, convert.c, convert.h, cppspec.c, crtstuff.c, cse.c, cselib.c, cselib.h, dbxout.c, dbxout.h, defaults.h, dependence.c, df.c, df.h, diagnostic.c, diagnostic.h, doloop.c, dominance.c, dwarf.h, dwarf2.h, dwarf2asm.c, dwarf2asm.h, dwarf2out.c, dwarf2out.h, dwarfout.c, emit-rtl.c, errors.c, errors.h, except.c, except.h, exgettext, explow.c, expmed.c, expr.c, expr.h, final.c, fixproto, flags.h, flow.c, fold-const.c, fp-test.c, function.c, function.h, gbl-ctors.h, gcc.c, gcc.h, gcc.hlp, gccspec.c, gcov-io.h, gcse.c, genattr.c, genattrtab.c, gencheck.c, gencodes.c, genconfig.c, genemit.c, genextract.c, genflags.c, gengenrtl.c, genmultilib, genopinit.c, genoutput.c, genpeep.c, genrecog.c, gensupport.c, gensupport.h, ggc-callbacks.c, ggc-common.c, ggc-none.c, ggc-page.c, ggc-simple.c, ggc.h, global.c, graph.c, graph.h, gthr-aix.h, gthr-dce.h, gthr-posix.h, gthr-rtems.h, gthr-single.h, gthr-solaris.h, gthr-vxworks.h, gthr-win32.h, gthr.h, haifa-sched.c, halfpic.c, halfpic.h, hard-reg-set.h, hwint.h, ifcvt.c, input.h, insn-addr.h, integrate.c, integrate.h, jump.c, lcm.c, libgcc2.c, libgcc2.h, lists.c, local-alloc.c, loop.c, loop.h, machmode.def, machmode.h, main.c, mbchar.c, mbchar.h, mips-tdump.c, mips-tfile.c, mklibgcc.in, mkmap-flat.awk, mkmap-symver.awk, optabs.c, output.h, params.c, params.def, params.h, predict.c, predict.def, predict.h, prefix.c, prefix.h, print-rtl.c, print-tree.c, profile.c, protoize.c, read-rtl.c, real.c, real.h, recog.c, recog.h, reg-stack.c, regclass.c, regmove.c, regrename.c, regs.h, reload.c, reload.h, reload1.c, reorg.c, resource.c, resource.h, rtl.c, rtl.def, rtl.h, rtlanal.c, sbitmap.c, sbitmap.h, sched-deps.c, sched-ebb.c, sched-int.h, sched-rgn.c, sched-vis.c, sdbout.c, sdbout.h, sibcall.c, simplify-rtx.c, ssa-ccp.c, ssa-dce.c, ssa.c, ssa.h, stmt.c, stor-layout.c, stringpool.c, system.h, timevar.c, timevar.def, timevar.h, tlink.c, toplev.c, toplev.h, tree.c, tree.def, tree.h, tsystem.h, unroll.c, unwind-dw2-fde.c, unwind-dw2-fde.h, unwind-dw2.c, unwind-pe.h, unwind-sjlj.c, unwind.h, unwind.inc, varasm.c, varray.c, varray.h, xcoffout.c, xcoffout.h: replace "GNU CC" with "GCC". From-SVN: r45105
* [multiple changes]Daniel Berlin2001-07-291-0/+2
| | | | | | | | | | | | | | | | 2001-07-27 Daniel Berlin <dan@cgsoftware.com> * regclass.c (reg_scan_mark_refs): Increment REG_N_REFS when we increment REG_N_SETS. 2001-07-26 Daniel Berlin <dan@cgsoftware.com> * sbitmap.h: New prototype for sbitmap_a_xor_b. * sbitmap.c (sbitmap_a_xor_b): New function. #ifdef the basic block stuff on the define IN_GCC. From-SVN: r44460
* Standardize header guards.Richard Henderson2001-05-251-3/+3
| | | | From-SVN: r42615
* bb-reorder.c (get_next_bb_note, [...]): Prototype.Kaveh R. Ghazi2000-05-041-0/+1
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | * bb-reorder.c (get_next_bb_note, get_prev_bb_note): Prototype. * diagnostic (vbuild_message_string, build_message_string, build_location_prefix, output_get_prefix, init_output_buffer, output_notice, vline_wrapper_message_with_location, v_message_with_decl, default_print_error_function): De-constify. (set_real_maximum_length): Prototype. * diagnostic.h (struct output_buffer, init_output_buffer, output_get_prefix, output_set_prefix): De-constify. * function.c (init_function_start): Constify. * gensupport.c (remove_constraints, process_rtx): Prototype. * gthr-posix.h: Indent uses of #pragma. * objc/objc-act.c (ggc_mark_imp_list, ggc_mark_hash_table): Prototype. * predict.c (find_expected_value): Delete prototype. (expected_value_to_br_prob): Initialize variable `ev_reg'. * sbitmap.h (debug_sbitmap): Prototype. * ssa.c (compute_coalesced_reg_partition): Prototype. * stor-layout.c (debug_rli): Prototype. * tree.h (round_down): Prototype. (init_function_start): Constify. ch: * ch-tree.h (init_function_start): Constify. From-SVN: r33675
* * sbitmap.h (EXECUTE_IF_SET_IN_SBITMAP): Revert last change.Richard Kenner2000-04-141-14/+14
| | | | From-SVN: r33153
* sbitmap.h: Whitespace changes and use upper-case macro args.Richard Kenner2000-04-101-77/+76
| | | | | | | | | | | | | | | | | | | | | | * sbitmap.h: Whitespace changes and use upper-case macro args. (struct simple_bitmap_def): All sizes now unsigned. (EXECUTE_IF_SET_IN_SBITMAP): Internal vars now _X instead of X_. * sbitmap.c (sbitmap_alloc): N_ELMS now unsigned; also local vars. (sbitmap_vector_alloc): Parms and local vars now unsigned. (sbitmap_zero): Cast bzero arg to PTR. (sbitmap_vector_zero, sbitmap_vector_one): Parm and Local var unsigned. (sbitmap_union_of_diffs): Change loop index to unsigned and rework loop to make structure clearer. (sbitmap_not, sbitmap_difference, sbitmap_a_and_b): Likewise. (sbitmap_a_or_b, sbitmap_a_subset_b_p, sbitmap_a_or_b_and_c): Likewise. (sbitmap_a_and_b_or_c): Likewise. (sbitmap_intersection_of_succs): Minor cleanups. (sbitmap_intersection_of_preds, sbitmap_union_of_succs): Likewise. (sbitmap_union_of_preds): Likewise. (sbitmap_first_set_bit, dump_sbitmap): Local variables now unsigned. (debug_sbitmap): New function. From-SVN: r33059
* * sbitmap.h: Make SBITMAP_ELT_BITS unsigned.Brad Lucier2000-02-111-1/+1
| | | | From-SVN: r31912
* gansidecl.h (PROTO, [...]): Delete macros.Kaveh R. Ghazi2000-01-311-2/+2
| | | | | | | | | * gansidecl.h (PROTO, VPROTO, PVPROTO): Delete macros. * sbitmap.h (sbitmap_first_set_bit, sbitmap_last_set_bit): PROTO -> PARAMS. From-SVN: r31716
* [multiple changes]Jason Eckhardt2000-01-291-0/+3
| | | | | | | | | | | | | | | | | | | | | | | | | Fri Jan 7 19:48:04 CET 2000 Jan Hubicka <jh@suse.cz> * sbitmap.c (sbitmap_first_set_bit, sbitmap_last_set_bit): New function. * sbitmap.h (sbitmap_first_set_bit, sbitmap_last_set_bit): Declare. * basic_block.h (FLOW_LOOP_FIRST_BLOCK): New macro. (FLOW_LOOP_LAST_BLOCK): Likewise. 2000-01-21 Michael Hayes <m.hayes@elec.canterbury.ac.nz> * basic-block.h (struct loop): New fields 'first' and 'last'. * flow.c (flow_loops_find): Compute loop->first and loop->last. (flow_loops_dump): Use loop->first to check for NOTE_INSN_LOOP_BEG and loop->last to check for NOTE_INSN_LOOP_END. Fri Jan 28 10:57:58 2000 Jason Eckhardt <jle@cygnus.com> * predict.c (estimate_probability): Use the new FIRST and LAST fields of the loop descriptor rather than HEADER and LATCH. Also added missing break statements as well making some coding style modifications as suggested by Michael Hayes. From-SVN: r31679
* Update copyrightsKaveh Ghazi2000-01-171-1/+1
| | | | From-SVN: r31465
* reload.c: PROTO -> PARAMS.Kaveh R. Ghazi2000-01-171-23/+23
| | | | | | | | | | | | | | | | | | * reload.c: PROTO -> PARAMS. * reload.h: Likewise. * reload1.c: Likewise. * reorg.c: Likewise. * resource.h: Likewise. * rtl.c: Likewise. * rtl.h: Likewise. * rtlanal.c: Likewise. * sbitmap.h: Likewise. * sdbout.c: Likewise. * stack.h: Likewise. * stmt.c: Likewise. * system.h: Likewise. From-SVN: r31461
* flow.c (flow_nodes_print, [...]): New functions.Michael Hayes1999-11-301-0/+5
| | | | | | | | | | | | | | | | | | | | * flow.c (flow_nodes_print, flow_loops_cfg_dump): New functions. (flow_loop_nested_p, flow_loops_dump, flow_loops_free): Likewise. (flow_loop_exits_find, flow_loop_nodes_find): Likewise. (flow_depth_first_order_compute, flow_loop_pre_header_find): Likewise. (flow_loop_tree_node_add, flow_loops_tree_build): Likewise. (flow_loop_level_compute, low_loops_level_compute): Likewise. (flow_loops_find, flow_loop_outside_edge_p): Likewise. * basic-block.h: Protect from multiple inclusion. (flow_loops_find, flow_loops_free, flow_loop_dump): Add protoypes. (struct loops, struct loop): Define structures. * sbitmap.c (sbitmap_a_subset_b_p): New function. * sbitmap.h: Protect from multiple inclusion. (sbitmap_a_subset_b_p): Add prototype. * Makefile.in (LOOP_H): New macro. (stmt.o, integrate.o, loop.o, unroll.o): Replace loop.h with LOOP_H. From-SVN: r30720
* sbitmap.h (sbitmap_intersection_of_succs): Add prototype.Andrew MacLeod1999-08-251-0/+9
| | | | | | | | | | | | | | | | | | | | | | | | | | Wed Aug 25 13:55:47 EDT 1999 Andrew MacLeod <amacleod@cygnus.com> * sbitmap.h (sbitmap_intersection_of_succs): Add prototype. (sbitmap_intersection_of_preds, sbitmap_union_of_succs, sbitmap_union_of_preds): Add prototypes. * sbitmap.c (sbitmap_intersection_of_succs): New function to compute the intersection of successors with the new flow graph structures. (sbitmap_intersection_of_preds): New function to compute the intersection of predecessors with the new flow graph structures. (sbitmap_union_of_succs): New function to compute the union of successors with the new flow graph structures. (sbitmap_union_of_preds): New function to compute the union of predecessors with the new flow graph structures. * gcse.c (compute_rdm, compute_available): Use new sbitmap routines. (expr_reaches_here_p): Use edge and basic_block structures instead of s_preds and s_succs. (compute_cprop_avinout): Use new sbitmap routines. (pre_expr_reaches_here_p): Use edge and basic_block structures instead of s_preds and s_succs. * flow.c (compute_flow_dominators): Compute dominators using edges and basic blocks instead of s_preds and s_succs. From-SVN: r28866
* c-aux-info.c (data_type, [...]): Qualify a char* with the `const' keyword.Kaveh R. Ghazi1999-03-061-1/+1
| | | | | | | | | | | | | | | | | | | | | | | | | * c-aux-info.c (data_type, affix_data_type, gen_decl, gen_formal_list_for_type, gen_formal_list_for_func_def, gen_type): Qualify a char* with the `const' keyword. * c-common.c (declare_hidden_char_array, add_attribute, if_elt, declare_function_name, decl_attributes, format_char_info, check_format_info, binary_op_error): Likewise. * cexp.y (yyerror, error, pedwarn, warning, token): Likewise. * gcse.c (dump_hash_table): Likewise. * integrate.c (function_cannot_inline_p): Likewise * optabs.c: Include insn-config.h earlier. (init_libfuncs, init_integral_libfuncs, init_floating_libfuncs): Qualify a char* with the `const' keyword. * real.c (asctoe24, asctoe53, asctoe64, asctoe113, asctoe, asctoeg, mtherr, ereal_atof): Likewise. * real.h (ereal_atof): Likewise. * sbitmap.c (dump_sbitmap_vector): Likewise. * sbitmap.h (dump_sbitmap_vector): Likewise. * stmt.c (nesting, n_occurrences, expand_start_case): Likewise. * toplev.c (rest_of_compilation): Likewise. * tree.h (function_cannot_inline_p, expand_start_case): Likewise. From-SVN: r25614
* Makefile.in (OBJECTS): Add sbitmap.o.Richard Henderson1999-01-111-0/+122
* Makefile.in (OBJECTS): Add sbitmap.o. (BASIC_BLOCK_H): Add sbitmap.h. * basic-block.h: Move simple bitmap code to sbitmap.h. * flow.c: Move simple bitmap code to sbitmap.c * sbitmap.h, sbitmap.c: New files. From-SVN: r24628