aboutsummaryrefslogtreecommitdiff
path: root/gcc/print-rtl.c
blob: 73e3710cea2ebb68cce3380cf1227e1fee548253 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
/* Print RTL for GCC.
   Copyright (C) 1987, 1988, 1992, 1997, 1998, 1999, 2000, 2002, 2003,
   2004, 2005
   Free Software Foundation, Inc.

This file is part of GCC.

GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 2, or (at your option) any later
version.

GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.

You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING.  If not, write to the Free
Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.  */

/* This file is compiled twice: once for the generator programs,
   once for the compiler.  */
#ifdef GENERATOR_FILE
#include "bconfig.h"
#else
#include "config.h"
#endif

#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "rtl.h"

/* These headers all define things which are not available in
   generator programs.  */
#ifndef GENERATOR_FILE
#include "tree.h"
#include "real.h"
#include "flags.h"
#include "hard-reg-set.h"
#include "basic-block.h"
#endif

static FILE *outfile;

static int sawclose = 0;

static int indent;

static void print_rtx (rtx);

/* String printed at beginning of each RTL when it is dumped.
   This string is set to ASM_COMMENT_START when the RTL is dumped in
   the assembly output file.  */
const char *print_rtx_head = "";

/* Nonzero means suppress output of instruction numbers and line number
   notes in debugging dumps.
   This must be defined here so that programs like gencodes can be linked.  */
int flag_dump_unnumbered = 0;

/* Nonzero means use simplified format without flags, modes, etc.  */
int flag_simple = 0;

/* Nonzero if we are dumping graphical description.  */
int dump_for_graph;

#ifndef GENERATOR_FILE
static void
print_decl_name (FILE *outfile, tree node)
{
  if (DECL_NAME (node))
    fputs (IDENTIFIER_POINTER (DECL_NAME (node)), outfile);
  else
    {
      if (TREE_CODE (node) == LABEL_DECL && LABEL_DECL_UID (node) != -1)
	fprintf (outfile, "L." HOST_WIDE_INT_PRINT_DEC, LABEL_DECL_UID (node));
      else
        {
          char c = TREE_CODE (node) == CONST_DECL ? 'C' : 'D';
	  fprintf (outfile, "%c.%u", c, DECL_UID (node));
        }
    }
}

void
print_mem_expr (FILE *outfile, tree expr)
{
  if (TREE_CODE (expr) == COMPONENT_REF)
    {
      if (TREE_OPERAND (expr, 0))
	print_mem_expr (outfile, TREE_OPERAND (expr, 0));
      else
	fputs (" <variable>", outfile);
      fputc ('.', outfile);
      print_decl_name (outfile, TREE_OPERAND (expr, 1));
    }
  else if (TREE_CODE (expr) == INDIRECT_REF)
    {
      fputs (" (*", outfile);
      print_mem_expr (outfile, TREE_OPERAND (expr, 0));
      fputs (")", outfile);
    }
  else if (TREE_CODE (expr) == ALIGN_INDIRECT_REF)
    {
      fputs (" (A*", outfile);
      print_mem_expr (outfile, TREE_OPERAND (expr, 0));
      fputs (")", outfile);
    }
  else if (TREE_CODE (expr) == MISALIGNED_INDIRECT_REF)
    {
      fputs (" (M*", outfile);
      print_mem_expr (outfile, TREE_OPERAND (expr, 0));
      fputs (")", outfile);
    }
  else if (TREE_CODE (expr) == RESULT_DECL)
    fputs (" <result>", outfile);
  else
    {
      fputc (' ', outfile);
      print_decl_name (outfile, expr);
    }
}
#endif

/* Print IN_RTX onto OUTFILE.  This is the recursive part of printing.  */

static void
print_rtx (rtx in_rtx)
{
  int i = 0;
  int j;
  const char *format_ptr;
  int is_insn;

  if (sawclose)
    {
      if (flag_simple)
	fputc (' ', outfile);
      else
	fprintf (outfile, "\n%s%*s", print_rtx_head, indent * 2, "");
      sawclose = 0;
    }

  if (in_rtx == 0)
    {
      fputs ("(nil)", outfile);
      sawclose = 1;
      return;
    }
  else if (GET_CODE (in_rtx) > NUM_RTX_CODE)
    {
       fprintf (outfile, "(??? bad code %d\n)", GET_CODE (in_rtx));
       sawclose = 1;
       return;
    }

  is_insn = INSN_P (in_rtx);

  /* When printing in VCG format we write INSNs, NOTE, LABEL, and BARRIER
     in separate nodes and therefore have to handle them special here.  */
  if (dump_for_graph
      && (is_insn || NOTE_P (in_rtx)
	  || LABEL_P (in_rtx) || BARRIER_P (in_rtx)))
    {
      i = 3;
      indent = 0;
    }
  else
    {
      /* Print name of expression code.  */
      if (flag_simple && GET_CODE (in_rtx) == CONST_INT)
	fputc ('(', outfile);
      else
	fprintf (outfile, "(%s", GET_RTX_NAME (GET_CODE (in_rtx)));

      if (! flag_simple)
	{
	  if (RTX_FLAG (in_rtx, in_struct))
	    fputs ("/s", outfile);

	  if (RTX_FLAG (in_rtx, volatil))
	    fputs ("/v", outfile);

	  if (RTX_FLAG (in_rtx, unchanging))
	    fputs ("/u", outfile);

	  if (RTX_FLAG (in_rtx, frame_related))
	    fputs ("/f", outfile);

	  if (RTX_FLAG (in_rtx, jump))
	    fputs ("/j", outfile);

	  if (RTX_FLAG (in_rtx, call))
	    fputs ("/c", outfile);

	  if (RTX_FLAG (in_rtx, return_val))
	    fputs ("/i", outfile);

	  /* Print REG_NOTE names for EXPR_LIST and INSN_LIST.  */
	  if (GET_CODE (in_rtx) == EXPR_LIST
	      || GET_CODE (in_rtx) == INSN_LIST)
	    fprintf (outfile, ":%s",
		     GET_REG_NOTE_NAME (GET_MODE (in_rtx)));

	  /* For other rtl, print the mode if it's not VOID.  */
	  else if (GET_MODE (in_rtx) != VOIDmode)
	    fprintf (outfile, ":%s", GET_MODE_NAME (GET_MODE (in_rtx)));
	}
    }

#ifndef GENERATOR_FILE
  if (GET_CODE (in_rtx) == CONST_DOUBLE && FLOAT_MODE_P (GET_MODE (in_rtx)))
    i = 5;
#endif

  /* Get the format string and skip the first elements if we have handled
     them already.  */
  format_ptr = GET_RTX_FORMAT (GET_CODE (in_rtx)) + i;
  for (; i < GET_RTX_LENGTH (GET_CODE (in_rtx)); i++)
    switch (*format_ptr++)
      {
	const char *str;

      case 'T':
	str = XTMPL (in_rtx, i);
	goto string;

      case 'S':
      case 's':
	str = XSTR (in_rtx, i);
      string:

	if (str == 0)
	  fputs (dump_for_graph ? " \\\"\\\"" : " \"\"", outfile);
	else
	  {
	    if (dump_for_graph)
	      fprintf (outfile, " (\\\"%s\\\")", str);
	    else
	      fprintf (outfile, " (\"%s\")", str);
	  }
	sawclose = 1;
	break;

	/* 0 indicates a field for internal use that should not be printed.
	   An exception is the third field of a NOTE, where it indicates
	   that the field has several different valid contents.  */
      case '0':
	if (i == 1 && REG_P (in_rtx))
	  {
	    if (REGNO (in_rtx) != ORIGINAL_REGNO (in_rtx))
	      fprintf (outfile, " [%d]", ORIGINAL_REGNO (in_rtx));
	  }
#ifndef GENERATOR_FILE
	else if (i == 1 && GET_CODE (in_rtx) == SYMBOL_REF)
	  {
	    int flags = SYMBOL_REF_FLAGS (in_rtx);
	    if (flags)
	      fprintf (outfile, " [flags 0x%x]", flags);
	  }
	else if (i == 2 && GET_CODE (in_rtx) == SYMBOL_REF)
	  {
	    tree decl = SYMBOL_REF_DECL (in_rtx);
	    if (decl)
	      print_node_brief (outfile, "", decl, 0);
	  }
#endif
	else if (i == 4 && NOTE_P (in_rtx))
	  {
	    switch (NOTE_LINE_NUMBER (in_rtx))
	      {
	      case NOTE_INSN_EH_REGION_BEG:
	      case NOTE_INSN_EH_REGION_END:
		if (flag_dump_unnumbered)
		  fprintf (outfile, " #");
		else
		  fprintf (outfile, " %d", NOTE_EH_HANDLER (in_rtx));
		sawclose = 1;
		break;

	      case NOTE_INSN_BLOCK_BEG:
	      case NOTE_INSN_BLOCK_END:
		fprintf (outfile, " ");
		if (flag_dump_unnumbered)
		  fprintf (outfile, "#");
		else
		  fprintf (outfile, "%p",
			   (char *) NOTE_BLOCK (in_rtx));
		sawclose = 1;
		break;

	      case NOTE_INSN_BASIC_BLOCK:
		{
#ifndef GENERATOR_FILE
		  basic_block bb = NOTE_BASIC_BLOCK (in_rtx);
		  if (bb != 0)
		    fprintf (outfile, " [bb %d]", bb->index);
#endif
		  break;
	        }

	      case NOTE_INSN_EXPECTED_VALUE:
		indent += 2;
		if (!sawclose)
		  fprintf (outfile, " ");
		print_rtx (NOTE_EXPECTED_VALUE (in_rtx));
		indent -= 2;
		break;

	      case NOTE_INSN_DELETED_LABEL:
		{
		  const char *label = NOTE_DELETED_LABEL_NAME (in_rtx);
		  if (label)
		    fprintf (outfile, " (\"%s\")", label);
		  else
		    fprintf (outfile, " \"\"");
		}
		break;

	      case NOTE_INSN_SWITCH_TEXT_SECTIONS:
		{
#ifndef GENERATOR_FILE
		  basic_block bb = NOTE_BASIC_BLOCK (in_rtx);
		  if (bb != 0)
		    fprintf (outfile, " [bb %d]", bb->index);
#endif
		  break;
		}
		
	      case NOTE_INSN_VAR_LOCATION:
#ifndef GENERATOR_FILE
		fprintf (outfile, " (");
		print_mem_expr (outfile, NOTE_VAR_LOCATION_DECL (in_rtx));
		fprintf (outfile, " ");
		print_rtx (NOTE_VAR_LOCATION_LOC (in_rtx));
		fprintf (outfile, ")");
#endif
		break;

	      default:
		{
		  const char * const str = X0STR (in_rtx, i);

		  if (NOTE_LINE_NUMBER (in_rtx) < 0)
		    ;
		  else if (str == 0)
		    fputs (dump_for_graph ? " \\\"\\\"" : " \"\"", outfile);
		  else
		    {
		      if (dump_for_graph)
		        fprintf (outfile, " (\\\"%s\\\")", str);
		      else
		        fprintf (outfile, " (\"%s\")", str);
		    }
		  break;
		}
	      }
	  }
	break;

      case 'e':
      do_e:
	indent += 2;
	if (!sawclose)
	  fprintf (outfile, " ");
	print_rtx (XEXP (in_rtx, i));
	indent -= 2;
	break;

      case 'E':
      case 'V':
	indent += 2;
	if (sawclose)
	  {
	    fprintf (outfile, "\n%s%*s",
		     print_rtx_head, indent * 2, "");
	    sawclose = 0;
	  }
	fputs (" [", outfile);
	if (NULL != XVEC (in_rtx, i))
	  {
	    indent += 2;
	    if (XVECLEN (in_rtx, i))
	      sawclose = 1;

	    for (j = 0; j < XVECLEN (in_rtx, i); j++)
	      print_rtx (XVECEXP (in_rtx, i, j));

	    indent -= 2;
	  }
	if (sawclose)
	  fprintf (outfile, "\n%s%*s", print_rtx_head, indent * 2, "");

	fputs ("]", outfile);
	sawclose = 1;
	indent -= 2;
	break;

      case 'w':
	if (! flag_simple)
	  fprintf (outfile, " ");
	fprintf (outfile, HOST_WIDE_INT_PRINT_DEC, XWINT (in_rtx, i));
	if (! flag_simple)
	  fprintf (outfile, " [" HOST_WIDE_INT_PRINT_HEX "]",
		   XWINT (in_rtx, i));
	break;

      case 'i':
	if (i == 4 && INSN_P (in_rtx))
	  {
#ifndef GENERATOR_FILE
	    /*  Pretty-print insn locators.  Ignore scoping as it is mostly
		redundant with line number information and do not print anything
		when there is no location information available.  */
	    if (INSN_LOCATOR (in_rtx) && insn_file (in_rtx))
	      fprintf(outfile, " %s:%i", insn_file (in_rtx), insn_line (in_rtx));
#endif
	  }
	else if (i == 6 && NOTE_P (in_rtx))
	  {
	    /* This field is only used for NOTE_INSN_DELETED_LABEL, and
	       other times often contains garbage from INSN->NOTE death.  */
	    if (NOTE_LINE_NUMBER (in_rtx) == NOTE_INSN_DELETED_LABEL)
	      fprintf (outfile, " %d",  XINT (in_rtx, i));
	  }
	else
	  {
	    int value = XINT (in_rtx, i);
	    const char *name;

#ifndef GENERATOR_FILE
	    if (REG_P (in_rtx) && value < FIRST_PSEUDO_REGISTER)
	      fprintf (outfile, " %d %s", REGNO (in_rtx),
		       reg_names[REGNO (in_rtx)]);
	    else if (REG_P (in_rtx)
		     && value <= LAST_VIRTUAL_REGISTER)
	      {
		if (value == VIRTUAL_INCOMING_ARGS_REGNUM)
		  fprintf (outfile, " %d virtual-incoming-args", value);
		else if (value == VIRTUAL_STACK_VARS_REGNUM)
		  fprintf (outfile, " %d virtual-stack-vars", value);
		else if (value == VIRTUAL_STACK_DYNAMIC_REGNUM)
		  fprintf (outfile, " %d virtual-stack-dynamic", value);
		else if (value == VIRTUAL_OUTGOING_ARGS_REGNUM)
		  fprintf (outfile, " %d virtual-outgoing-args", value);
		else if (value == VIRTUAL_CFA_REGNUM)
		  fprintf (outfile, " %d virtual-cfa", value);
		else
		  fprintf (outfile, " %d virtual-reg-%d", value,
			   value-FIRST_VIRTUAL_REGISTER);
	      }
	    else
#endif
	      if (flag_dump_unnumbered
		     && (is_insn || NOTE_P (in_rtx)))
	      fputc ('#', outfile);
	    else
	      fprintf (outfile, " %d", value);

#ifndef GENERATOR_FILE
	    if (REG_P (in_rtx) && REG_ATTRS (in_rtx))
	      {
		fputs (" [", outfile);
		if (ORIGINAL_REGNO (in_rtx) != REGNO (in_rtx))
		  fprintf (outfile, "orig:%i", ORIGINAL_REGNO (in_rtx));
		if (REG_EXPR (in_rtx))
		  print_mem_expr (outfile, REG_EXPR (in_rtx));

		if (REG_OFFSET (in_rtx))
		  fprintf (outfile, "+" HOST_WIDE_INT_PRINT_DEC,
			   REG_OFFSET (in_rtx));
		fputs (" ]", outfile);
	      }
#endif

	    if (is_insn && &INSN_CODE (in_rtx) == &XINT (in_rtx, i)
		&& XINT (in_rtx, i) >= 0
		&& (name = get_insn_name (XINT (in_rtx, i))) != NULL)
	      fprintf (outfile, " {%s}", name);
	    sawclose = 0;
	  }
	break;

      /* Print NOTE_INSN names rather than integer codes.  */

      case 'n':
	if (XINT (in_rtx, i) >= (int) NOTE_INSN_BIAS
	    && XINT (in_rtx, i) < (int) NOTE_INSN_MAX)
	  fprintf (outfile, " %s", GET_NOTE_INSN_NAME (XINT (in_rtx, i)));
	else
	  fprintf (outfile, " %d", XINT (in_rtx, i));
	sawclose = 0;
	break;

      case 'u':
	if (XEXP (in_rtx, i) != NULL)
	  {
	    rtx sub = XEXP (in_rtx, i);
	    enum rtx_code subc = GET_CODE (sub);

	    if (GET_CODE (in_rtx) == LABEL_REF)
	      {
		if (subc == NOTE
		    && NOTE_LINE_NUMBER (sub) == NOTE_INSN_DELETED_LABEL)
		  {
		    if (flag_dump_unnumbered)
		      fprintf (outfile, " [# deleted]");
		    else
		      fprintf (outfile, " [%d deleted]", INSN_UID (sub));
		    sawclose = 0;
		    break;
		  }

		if (subc != CODE_LABEL)
		  goto do_e;
	      }

	    if (flag_dump_unnumbered)
	      fputs (" #", outfile);
	    else
	      fprintf (outfile, " %d", INSN_UID (sub));
	  }
	else
	  fputs (" 0", outfile);
	sawclose = 0;
	break;

      case 'b':
#ifndef GENERATOR_FILE
	if (XBITMAP (in_rtx, i) == NULL)
	  fputs (" {null}", outfile);
	else
	  bitmap_print (outfile, XBITMAP (in_rtx, i), " {", "}");
#endif
	sawclose = 0;
	break;

      case 't':
	fprintf (outfile, " %p", (void *) XTREE (in_rtx, i));
	break;

      case '*':
	fputs (" Unknown", outfile);
	sawclose = 0;
	break;

      case 'B':
#ifndef GENERATOR_FILE
	if (XBBDEF (in_rtx, i))
	  fprintf (outfile, " %i", XBBDEF (in_rtx, i)->index);
#endif
	break;

      default:
	gcc_unreachable ();
      }

  switch (GET_CODE (in_rtx))
    {
#ifndef GENERATOR_FILE
    case MEM:
      fprintf (outfile, " [" HOST_WIDE_INT_PRINT_DEC, MEM_ALIAS_SET (in_rtx));

      if (MEM_EXPR (in_rtx))
	print_mem_expr (outfile, MEM_EXPR (in_rtx));

      if (MEM_OFFSET (in_rtx))
	fprintf (outfile, "+" HOST_WIDE_INT_PRINT_DEC,
		 INTVAL (MEM_OFFSET (in_rtx)));

      if (MEM_SIZE (in_rtx))
	fprintf (outfile, " S" HOST_WIDE_INT_PRINT_DEC,
		 INTVAL (MEM_SIZE (in_rtx)));

      if (MEM_ALIGN (in_rtx) != 1)
	fprintf (outfile, " A%u", MEM_ALIGN (in_rtx));

      fputc (']', outfile);
      break;

    case CONST_DOUBLE:
      if (FLOAT_MODE_P (GET_MODE (in_rtx)))
	{
	  char s[60];

	  real_to_decimal (s, CONST_DOUBLE_REAL_VALUE (in_rtx),
			   sizeof (s), 0, 1);
	  fprintf (outfile, " %s", s);

	  real_to_hexadecimal (s, CONST_DOUBLE_REAL_VALUE (in_rtx),
			       sizeof (s), 0, 1);
	  fprintf (outfile, " [%s]", s);
	}
      break;
#endif

    case CODE_LABEL:
      fprintf (outfile, " [%d uses]", LABEL_NUSES (in_rtx));
      switch (LABEL_KIND (in_rtx))
	{
	  case LABEL_NORMAL: break;
	  case LABEL_STATIC_ENTRY: fputs (" [entry]", outfile); break;
	  case LABEL_GLOBAL_ENTRY: fputs (" [global entry]", outfile); break;
	  case LABEL_WEAK_ENTRY: fputs (" [weak entry]", outfile); break;
	  default: gcc_unreachable ();
	}
      break;

    default:
      break;
    }

  if (dump_for_graph
      && (is_insn || NOTE_P (in_rtx)
	  || LABEL_P (in_rtx) || BARRIER_P (in_rtx)))
    sawclose = 0;
  else
    {
      fputc (')', outfile);
      sawclose = 1;
    }
}

/* Print an rtx on the current line of FILE.  Initially indent IND
   characters.  */

void
print_inline_rtx (FILE *outf, rtx x, int ind)
{
  int oldsaw = sawclose;
  int oldindent = indent;

  sawclose = 0;
  indent = ind;
  outfile = outf;
  print_rtx (x);
  sawclose = oldsaw;
  indent = oldindent;
}

/* Call this function from the debugger to see what X looks like.  */

void
debug_rtx (rtx x)
{
  outfile = stderr;
  sawclose = 0;
  print_rtx (x);
  fprintf (stderr, "\n");
}

/* Count of rtx's to print with debug_rtx_list.
   This global exists because gdb user defined commands have no arguments.  */

int debug_rtx_count = 0;	/* 0 is treated as equivalent to 1 */

/* Call this function to print list from X on.

   N is a count of the rtx's to print. Positive values print from the specified
   rtx on.  Negative values print a window around the rtx.
   EG: -5 prints 2 rtx's on either side (in addition to the specified rtx).  */

void
debug_rtx_list (rtx x, int n)
{
  int i,count;
  rtx insn;

  count = n == 0 ? 1 : n < 0 ? -n : n;

  /* If we are printing a window, back up to the start.  */

  if (n < 0)
    for (i = count / 2; i > 0; i--)
      {
	if (PREV_INSN (x) == 0)
	  break;
	x = PREV_INSN (x);
      }

  for (i = count, insn = x; i > 0 && insn != 0; i--, insn = NEXT_INSN (insn))
    {
      debug_rtx (insn);
      fprintf (stderr, "\n");
    }
}

/* Call this function to print an rtx list from START to END inclusive.  */

void
debug_rtx_range (rtx start, rtx end)
{
  while (1)
    {
      debug_rtx (start);
      fprintf (stderr, "\n");
      if (!start || start == end)
	break;
      start = NEXT_INSN (start);
    }
}

/* Call this function to search an rtx list to find one with insn uid UID,
   and then call debug_rtx_list to print it, using DEBUG_RTX_COUNT.
   The found insn is returned to enable further debugging analysis.  */

rtx
debug_rtx_find (rtx x, int uid)
{
  while (x != 0 && INSN_UID (x) != uid)
    x = NEXT_INSN (x);
  if (x != 0)
    {
      debug_rtx_list (x, debug_rtx_count);
      return x;
    }
  else
    {
      fprintf (stderr, "insn uid %d not found\n", uid);
      return 0;
    }
}

/* External entry point for printing a chain of insns
   starting with RTX_FIRST onto file OUTF.
   A blank line separates insns.

   If RTX_FIRST is not an insn, then it alone is printed, with no newline.  */

void
print_rtl (FILE *outf, rtx rtx_first)
{
  rtx tmp_rtx;

  outfile = outf;
  sawclose = 0;

  if (rtx_first == 0)
    {
      fputs (print_rtx_head, outf);
      fputs ("(nil)\n", outf);
    }
  else
    switch (GET_CODE (rtx_first))
      {
      case INSN:
      case JUMP_INSN:
      case CALL_INSN:
      case NOTE:
      case CODE_LABEL:
      case BARRIER:
	for (tmp_rtx = rtx_first; tmp_rtx != 0; tmp_rtx = NEXT_INSN (tmp_rtx))
	  if (! flag_dump_unnumbered
	      || !NOTE_P (tmp_rtx) || NOTE_LINE_NUMBER (tmp_rtx) < 0)
	    {
	      fputs (print_rtx_head, outfile);
	      print_rtx (tmp_rtx);
	      fprintf (outfile, "\n");
	    }
	break;

      default:
	fputs (print_rtx_head, outfile);
	print_rtx (rtx_first);
      }
}

/* Like print_rtx, except specify a file.  */
/* Return nonzero if we actually printed anything.  */

int
print_rtl_single (FILE *outf, rtx x)
{
  outfile = outf;
  sawclose = 0;
  if (! flag_dump_unnumbered
      || !NOTE_P (x) || NOTE_LINE_NUMBER (x) < 0)
    {
      fputs (print_rtx_head, outfile);
      print_rtx (x);
      putc ('\n', outf);
      return 1;
    }
  return 0;
}


/* Like print_rtl except without all the detail; for example,
   if RTX is a CONST_INT then print in decimal format.  */

void
print_simple_rtl (FILE *outf, rtx x)
{
  flag_simple = 1;
  print_rtl (outf, x);
  flag_simple = 0;
}
l opt">= element->prev = 0; head->first = element; } /* If this index is less than that of the current element, it goes someplace before the current element. */ else if (indx < head->indx) { for (ptr = head->current; ptr->prev != 0 && ptr->prev->indx > indx; ptr = ptr->prev) ; if (ptr->prev) ptr->prev->next = element; else head->first = element; element->prev = ptr->prev; element->next = ptr; ptr->prev = element; } /* Otherwise, it must go someplace after the current element. */ else { for (ptr = head->current; ptr->next != 0 && ptr->next->indx < indx; ptr = ptr->next) ; if (ptr->next) ptr->next->prev = element; element->next = ptr->next; element->prev = ptr; ptr->next = element; } /* Set up so this is the first element searched. */ head->current = element; head->indx = indx; } /* Insert a new uninitialized element into bitmap HEAD after element ELT. If ELT is NULL, insert the element at the start. Return the new element. */ static bitmap_element * bitmap_elt_insert_after (bitmap head, bitmap_element *elt, unsigned int indx) { bitmap_element *node = bitmap_element_allocate (head); node->indx = indx; if (!elt) { if (!head->current) { head->current = node; head->indx = indx; } node->next = head->first; if (node->next) node->next->prev = node; head->first = node; node->prev = NULL; } else { gcc_assert (head->current); node->next = elt->next; if (node->next) node->next->prev = node; elt->next = node; node->prev = elt; } return node; } /* Copy a bitmap to another bitmap. */ void bitmap_copy (bitmap to, const_bitmap from) { const bitmap_element *from_ptr; bitmap_element *to_ptr = 0; bitmap_clear (to); /* Copy elements in forward direction one at a time. */ for (from_ptr = from->first; from_ptr; from_ptr = from_ptr->next) { bitmap_element *to_elt = bitmap_element_allocate (to); to_elt->indx = from_ptr->indx; memcpy (to_elt->bits, from_ptr->bits, sizeof (to_elt->bits)); /* Here we have a special case of bitmap_element_link, for the case where we know the links are being entered in sequence. */ if (to_ptr == 0) { to->first = to->current = to_elt; to->indx = from_ptr->indx; to_elt->next = to_elt->prev = 0; } else { to_elt->prev = to_ptr; to_elt->next = 0; to_ptr->next = to_elt; } to_ptr = to_elt; } } /* Find a bitmap element that would hold a bitmap's bit. Update the `current' field even if we can't find an element that would hold the bitmap's bit to make eventual allocation faster. */ static inline bitmap_element * bitmap_find_bit (bitmap head, unsigned int bit) { bitmap_element *element; unsigned int indx = bit / BITMAP_ELEMENT_ALL_BITS; #ifdef GATHER_STATISTICS head->desc->nsearches++; #endif if (head->current == 0 || head->indx == indx) return head->current; if (head->indx < indx) /* INDX is beyond head->indx. Search from head->current forward. */ for (element = head->current; element->next != 0 && element->indx < indx; element = element->next) ; else if (head->indx / 2 < indx) /* INDX is less than head->indx and closer to head->indx than to 0. Search from head->current backward. */ for (element = head->current; element->prev != 0 && element->indx > indx; element = element->prev) ; else /* INDX is less than head->indx and closer to 0 than to head->indx. Search from head->first forward. */ for (element = head->first; element->next != 0 && element->indx < indx; element = element->next) ; /* `element' is the nearest to the one we want. If it's not the one we want, the one we want doesn't exist. */ head->current = element; head->indx = element->indx; if (element != 0 && element->indx != indx) element = 0; return element; } /* Clear a single bit in a bitmap. Return true if the bit changed. */ bool bitmap_clear_bit (bitmap head, int bit) { bitmap_element *const ptr = bitmap_find_bit (head, bit); if (ptr != 0) { unsigned bit_num = bit % BITMAP_WORD_BITS; unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS; BITMAP_WORD bit_val = ((BITMAP_WORD) 1) << bit_num; bool res = (ptr->bits[word_num] & bit_val) != 0; if (res) ptr->bits[word_num] &= ~bit_val; /* If we cleared the entire word, free up the element. */ if (bitmap_element_zerop (ptr)) bitmap_element_free (head, ptr); return res; } return false; } /* Set a single bit in a bitmap. Return true if the bit changed. */ bool bitmap_set_bit (bitmap head, int bit) { bitmap_element *ptr = bitmap_find_bit (head, bit); unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS; unsigned bit_num = bit % BITMAP_WORD_BITS; BITMAP_WORD bit_val = ((BITMAP_WORD) 1) << bit_num; if (ptr == 0) { ptr = bitmap_element_allocate (head); ptr->indx = bit / BITMAP_ELEMENT_ALL_BITS; ptr->bits[word_num] = bit_val; bitmap_element_link (head, ptr); return true; } else { bool res = (ptr->bits[word_num] & bit_val) == 0; if (res) ptr->bits[word_num] |= bit_val; return res; } } /* Return whether a bit is set within a bitmap. */ int bitmap_bit_p (bitmap head, int bit) { bitmap_element *ptr; unsigned bit_num; unsigned word_num; ptr = bitmap_find_bit (head, bit); if (ptr == 0) return 0; bit_num = bit % BITMAP_WORD_BITS; word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS; return (ptr->bits[word_num] >> bit_num) & 1; } #if GCC_VERSION < 3400 /* Table of number of set bits in a character, indexed by value of char. */ static const unsigned char popcount_table[] = { 0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5, 1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6, 1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6, 2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7, 1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6, 2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7, 2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7, 3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8, }; static unsigned long bitmap_popcount (BITMAP_WORD a) { unsigned long ret = 0; unsigned i; /* Just do this the table way for now */ for (i = 0; i < BITMAP_WORD_BITS; i+= 8) ret += popcount_table[(a >> i) & 0xff]; return ret; } #endif /* Count the number of bits set in the bitmap, and return it. */ unsigned long bitmap_count_bits (const_bitmap a) { unsigned long count = 0; const bitmap_element *elt; unsigned ix; for (elt = a->first; elt; elt = elt->next) { for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++) { #if GCC_VERSION >= 3400 /* Note that popcountl matches BITMAP_WORD in type, so the actual size of BITMAP_WORD is not material. */ count += __builtin_popcountl (elt->bits[ix]); #else count += bitmap_popcount (elt->bits[ix]); #endif } } return count; } /* Return true if the bitmap has a single bit set. Otherwise return false. */ bool bitmap_single_bit_set_p (const_bitmap a) { unsigned long count = 0; const bitmap_element *elt; unsigned ix; if (bitmap_empty_p (a)) return false; elt = a->first; /* As there are no completely empty bitmap elements, a second one means we have more than one bit set. */ if (elt->next != NULL) return false; for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++) { #if GCC_VERSION >= 3400 /* Note that popcountl matches BITMAP_WORD in type, so the actual size of BITMAP_WORD is not material. */ count += __builtin_popcountl (elt->bits[ix]); #else count += bitmap_popcount (elt->bits[ix]); #endif if (count > 1) return false; } return count == 1; } /* Return the bit number of the first set bit in the bitmap. The bitmap must be non-empty. */ unsigned bitmap_first_set_bit (const_bitmap a) { const bitmap_element *elt = a->first; unsigned bit_no; BITMAP_WORD word; unsigned ix; gcc_assert (elt); bit_no = elt->indx * BITMAP_ELEMENT_ALL_BITS; for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++) { word = elt->bits[ix]; if (word) goto found_bit; } gcc_unreachable (); found_bit: bit_no += ix * BITMAP_WORD_BITS; #if GCC_VERSION >= 3004 gcc_assert (sizeof(long) == sizeof (word)); bit_no += __builtin_ctzl (word); #else /* Binary search for the first set bit. */ #if BITMAP_WORD_BITS > 64 #error "Fill out the table." #endif #if BITMAP_WORD_BITS > 32 if (!(word & 0xffffffff)) word >>= 32, bit_no += 32; #endif if (!(word & 0xffff)) word >>= 16, bit_no += 16; if (!(word & 0xff)) word >>= 8, bit_no += 8; if (!(word & 0xf)) word >>= 4, bit_no += 4; if (!(word & 0x3)) word >>= 2, bit_no += 2; if (!(word & 0x1)) word >>= 1, bit_no += 1; gcc_assert (word & 1); #endif return bit_no; } /* Return the bit number of the first set bit in the bitmap. The bitmap must be non-empty. */ unsigned bitmap_last_set_bit (const_bitmap a) { const bitmap_element *elt = a->current ? a->current : a->first; unsigned bit_no; BITMAP_WORD word; int ix; gcc_assert (elt); while (elt->next) elt = elt->next; bit_no = elt->indx * BITMAP_ELEMENT_ALL_BITS; for (ix = BITMAP_ELEMENT_WORDS - 1; ix >= 0; ix--) { word = elt->bits[ix]; if (word) goto found_bit; } gcc_unreachable (); found_bit: bit_no += ix * BITMAP_WORD_BITS; /* Binary search for the last set bit. */ #if GCC_VERSION >= 3004 gcc_assert (sizeof(long) == sizeof (word)); bit_no += sizeof (long) * 8 - __builtin_ctzl (word); #else #if BITMAP_WORD_BITS > 64 #error "Fill out the table." #endif #if BITMAP_WORD_BITS > 32 if ((word & 0xffffffff00000000)) word >>= 32, bit_no += 32; #endif if (word & 0xffff0000) word >>= 16, bit_no += 16; if (!(word & 0xff00)) word >>= 8, bit_no += 8; if (!(word & 0xf0)) word >>= 4, bit_no += 4; if (!(word & 12)) word >>= 2, bit_no += 2; if (!(word & 2)) word >>= 1, bit_no += 1; #endif gcc_assert (word & 1); return bit_no; } /* DST = A & B. */ void bitmap_and (bitmap dst, const_bitmap a, const_bitmap b) { bitmap_element *dst_elt = dst->first; const bitmap_element *a_elt = a->first; const bitmap_element *b_elt = b->first; bitmap_element *dst_prev = NULL; gcc_assert (dst != a && dst != b); if (a == b) { bitmap_copy (dst, a); return; } while (a_elt && b_elt) { if (a_elt->indx < b_elt->indx) a_elt = a_elt->next; else if (b_elt->indx < a_elt->indx) b_elt = b_elt->next; else { /* Matching elts, generate A & B. */ unsigned ix; BITMAP_WORD ior = 0; if (!dst_elt) dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx); else dst_elt->indx = a_elt->indx; for (ix = BITMAP_ELEMENT_WORDS; ix--;) { BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix]; dst_elt->bits[ix] = r; ior |= r; } if (ior) { dst_prev = dst_elt; dst_elt = dst_elt->next; } a_elt = a_elt->next; b_elt = b_elt->next; } } /* Ensure that dst->current is valid. */ dst->current = dst->first; bitmap_elt_clear_from (dst, dst_elt); gcc_assert (!dst->current == !dst->first); if (dst->current) dst->indx = dst->current->indx; } /* A &= B. */ void bitmap_and_into (bitmap a, const_bitmap b) { bitmap_element *a_elt = a->first; const bitmap_element *b_elt = b->first; bitmap_element *next; if (a == b) return; while (a_elt && b_elt) { if (a_elt->indx < b_elt->indx) { next = a_elt->next; bitmap_element_free (a, a_elt); a_elt = next; } else if (b_elt->indx < a_elt->indx) b_elt = b_elt->next; else { /* Matching elts, generate A &= B. */ unsigned ix; BITMAP_WORD ior = 0; for (ix = BITMAP_ELEMENT_WORDS; ix--;) { BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix]; a_elt->bits[ix] = r; ior |= r; } next = a_elt->next; if (!ior) bitmap_element_free (a, a_elt); a_elt = next; b_elt = b_elt->next; } } bitmap_elt_clear_from (a, a_elt); gcc_assert (!a->current == !a->first); gcc_assert (!a->current || a->indx == a->current->indx); } /* Insert an element equal to SRC_ELT after DST_PREV, overwriting DST_ELT if non-NULL. CHANGED is true if the destination bitmap had already been changed; the new value of CHANGED is returned. */ static inline bool bitmap_elt_copy (bitmap dst, bitmap_element *dst_elt, bitmap_element *dst_prev, const bitmap_element *src_elt, bool changed) { if (!changed && dst_elt && dst_elt->indx == src_elt->indx) { unsigned ix; for (ix = BITMAP_ELEMENT_WORDS; ix--;) if (src_elt->bits[ix] != dst_elt->bits[ix]) { dst_elt->bits[ix] = src_elt->bits[ix]; changed = true; } } else { changed = true; if (!dst_elt) dst_elt = bitmap_elt_insert_after (dst, dst_prev, src_elt->indx); else dst_elt->indx = src_elt->indx; memcpy (dst_elt->bits, src_elt->bits, sizeof (dst_elt->bits)); } return changed; } /* DST = A & ~B */ bool bitmap_and_compl (bitmap dst, const_bitmap a, const_bitmap b) { bitmap_element *dst_elt = dst->first; const bitmap_element *a_elt = a->first; const bitmap_element *b_elt = b->first; bitmap_element *dst_prev = NULL; bitmap_element **dst_prev_pnext = &dst->first; bool changed = false; gcc_assert (dst != a && dst != b); if (a == b) { changed = !bitmap_empty_p (dst); bitmap_clear (dst); return changed; } while (a_elt) { while (b_elt && b_elt->indx < a_elt->indx) b_elt = b_elt->next; if (!b_elt || b_elt->indx > a_elt->indx) { changed = bitmap_elt_copy (dst, dst_elt, dst_prev, a_elt, changed); dst_prev = *dst_prev_pnext; dst_prev_pnext = &dst_prev->next; dst_elt = *dst_prev_pnext; a_elt = a_elt->next; } else { /* Matching elts, generate A & ~B. */ unsigned ix; BITMAP_WORD ior = 0; if (!changed && dst_elt && dst_elt->indx == a_elt->indx) { for (ix = BITMAP_ELEMENT_WORDS; ix--;) { BITMAP_WORD r = a_elt->bits[ix] & ~b_elt->bits[ix]; if (dst_elt->bits[ix] != r) { changed = true; dst_elt->bits[ix] = r; } ior |= r; } } else { bool new_element; if (!dst_elt || dst_elt->indx > a_elt->indx) { dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx); new_element = true; } else { dst_elt->indx = a_elt->indx; new_element = false; } for (ix = BITMAP_ELEMENT_WORDS; ix--;) { BITMAP_WORD r = a_elt->bits[ix] & ~b_elt->bits[ix]; dst_elt->bits[ix] = r; ior |= r; } if (ior) changed = true; else { changed |= !new_element; bitmap_element_free (dst, dst_elt); dst_elt = *dst_prev_pnext; } } if (ior) { dst_prev = *dst_prev_pnext; dst_prev_pnext = &dst_prev->next; dst_elt = *dst_prev_pnext; } a_elt = a_elt->next; b_elt = b_elt->next; } } /* Ensure that dst->current is valid. */ dst->current = dst->first; if (dst_elt) { changed = true; bitmap_elt_clear_from (dst, dst_elt); } gcc_assert (!dst->current == !dst->first); if (dst->current) dst->indx = dst->current->indx; return changed; } /* A &= ~B. Returns true if A changes */ bool bitmap_and_compl_into (bitmap a, const_bitmap b) { bitmap_element *a_elt = a->first; const bitmap_element *b_elt = b->first; bitmap_element *next; BITMAP_WORD changed = 0; if (a == b) { if (bitmap_empty_p (a)) return false; else { bitmap_clear (a); return true; } } while (a_elt && b_elt) { if (a_elt->indx < b_elt->indx) a_elt = a_elt->next; else if (b_elt->indx < a_elt->indx) b_elt = b_elt->next; else { /* Matching elts, generate A &= ~B. */ unsigned ix; BITMAP_WORD ior = 0; for (ix = BITMAP_ELEMENT_WORDS; ix--;) { BITMAP_WORD cleared = a_elt->bits[ix] & b_elt->bits[ix]; BITMAP_WORD r = a_elt->bits[ix] ^ cleared; a_elt->bits[ix] = r; changed |= cleared; ior |= r; } next = a_elt->next; if (!ior) bitmap_element_free (a, a_elt); a_elt = next; b_elt = b_elt->next; } } gcc_assert (!a->current == !a->first); gcc_assert (!a->current || a->indx == a->current->indx); return changed != 0; } /* Set COUNT bits from START in HEAD. */ void bitmap_set_range (bitmap head, unsigned int start, unsigned int count) { unsigned int first_index, end_bit_plus1, last_index; bitmap_element *elt, *elt_prev; unsigned int i; if (!count) return; first_index = start / BITMAP_ELEMENT_ALL_BITS; end_bit_plus1 = start + count; last_index = (end_bit_plus1 - 1) / BITMAP_ELEMENT_ALL_BITS; elt = bitmap_find_bit (head, start); /* If bitmap_find_bit returns zero, the current is the closest block to the result. Otherwise, just use bitmap_element_allocate to ensure ELT is set; in the loop below, ELT == NULL means "insert at the end of the bitmap". */ if (!elt) { elt = bitmap_element_allocate (head); elt->indx = first_index; bitmap_element_link (head, elt); } gcc_assert (elt->indx == first_index); elt_prev = elt->prev; for (i = first_index; i <= last_index; i++) { unsigned elt_start_bit = i * BITMAP_ELEMENT_ALL_BITS; unsigned elt_end_bit_plus1 = elt_start_bit + BITMAP_ELEMENT_ALL_BITS; unsigned int first_word_to_mod; BITMAP_WORD first_mask; unsigned int last_word_to_mod; BITMAP_WORD last_mask; unsigned int ix; if (!elt || elt->indx != i) elt = bitmap_elt_insert_after (head, elt_prev, i); if (elt_start_bit <= start) { /* The first bit to turn on is somewhere inside this elt. */ first_word_to_mod = (start - elt_start_bit) / BITMAP_WORD_BITS; /* This mask should have 1s in all bits >= start position. */ first_mask = (((BITMAP_WORD) 1) << ((start % BITMAP_WORD_BITS))) - 1; first_mask = ~first_mask; } else { /* The first bit to turn on is below this start of this elt. */ first_word_to_mod = 0; first_mask = ~(BITMAP_WORD) 0; } if (elt_end_bit_plus1 <= end_bit_plus1) { /* The last bit to turn on is beyond this elt. */ last_word_to_mod = BITMAP_ELEMENT_WORDS - 1; last_mask = ~(BITMAP_WORD) 0; } else { /* The last bit to turn on is inside to this elt. */ last_word_to_mod = (end_bit_plus1 - elt_start_bit) / BITMAP_WORD_BITS; /* The last mask should have 1s below the end bit. */ last_mask = (((BITMAP_WORD) 1) << ((end_bit_plus1 % BITMAP_WORD_BITS))) - 1; } if (first_word_to_mod == last_word_to_mod) { BITMAP_WORD mask = first_mask & last_mask; elt->bits[first_word_to_mod] |= mask; } else { elt->bits[first_word_to_mod] |= first_mask; if (BITMAP_ELEMENT_WORDS > 2) for (ix = first_word_to_mod + 1; ix < last_word_to_mod; ix++) elt->bits[ix] = ~(BITMAP_WORD) 0; elt->bits[last_word_to_mod] |= last_mask; } elt_prev = elt; elt = elt->next; } head->current = elt ? elt : elt_prev; head->indx = head->current->indx; } /* Clear COUNT bits from START in HEAD. */ void bitmap_clear_range (bitmap head, unsigned int start, unsigned int count) { unsigned int first_index, end_bit_plus1, last_index; bitmap_element *elt; if (!count) return; first_index = start / BITMAP_ELEMENT_ALL_BITS; end_bit_plus1 = start + count; last_index = (end_bit_plus1 - 1) / BITMAP_ELEMENT_ALL_BITS; elt = bitmap_find_bit (head, start); /* If bitmap_find_bit returns zero, the current is the closest block to the result. If the current is less than first index, find the next one. Otherwise, just set elt to be current. */ if (!elt) { if (head->current) { if (head->indx < first_index) { elt = head->current->next; if (!elt) return; } else elt = head->current; } else return; } while (elt && (elt->indx <= last_index)) { bitmap_element * next_elt = elt->next; unsigned elt_start_bit = (elt->indx) * BITMAP_ELEMENT_ALL_BITS; unsigned elt_end_bit_plus1 = elt_start_bit + BITMAP_ELEMENT_ALL_BITS; if (elt_start_bit >= start && elt_end_bit_plus1 <= end_bit_plus1) /* Get rid of the entire elt and go to the next one. */ bitmap_element_free (head, elt); else { /* Going to have to knock out some bits in this elt. */ unsigned int first_word_to_mod; BITMAP_WORD first_mask; unsigned int last_word_to_mod; BITMAP_WORD last_mask; unsigned int i; bool clear = true; if (elt_start_bit <= start) { /* The first bit to turn off is somewhere inside this elt. */ first_word_to_mod = (start - elt_start_bit) / BITMAP_WORD_BITS; /* This mask should have 1s in all bits >= start position. */ first_mask = (((BITMAP_WORD) 1) << ((start % BITMAP_WORD_BITS))) - 1; first_mask = ~first_mask; } else { /* The first bit to turn off is below this start of this elt. */ first_word_to_mod = 0; first_mask = 0; first_mask = ~first_mask; } if (elt_end_bit_plus1 <= end_bit_plus1) { /* The last bit to turn off is beyond this elt. */ last_word_to_mod = BITMAP_ELEMENT_WORDS - 1; last_mask = 0; last_mask = ~last_mask; } else { /* The last bit to turn off is inside to this elt. */ last_word_to_mod = (end_bit_plus1 - elt_start_bit) / BITMAP_WORD_BITS; /* The last mask should have 1s below the end bit. */ last_mask = (((BITMAP_WORD) 1) << (((end_bit_plus1) % BITMAP_WORD_BITS))) - 1; } if (first_word_to_mod == last_word_to_mod) { BITMAP_WORD mask = first_mask & last_mask; elt->bits[first_word_to_mod] &= ~mask; } else { elt->bits[first_word_to_mod] &= ~first_mask; if (BITMAP_ELEMENT_WORDS > 2) for (i = first_word_to_mod + 1; i < last_word_to_mod; i++) elt->bits[i] = 0; elt->bits[last_word_to_mod] &= ~last_mask; } for (i = 0; i < BITMAP_ELEMENT_WORDS; i++) if (elt->bits[i]) { clear = false; break; } /* Check to see if there are any bits left. */ if (clear) bitmap_element_free (head, elt); } elt = next_elt; } if (elt) { head->current = elt; head->indx = head->current->indx; } } /* A = ~A & B. */ void bitmap_compl_and_into (bitmap a, const_bitmap b) { bitmap_element *a_elt = a->first; const bitmap_element *b_elt = b->first; bitmap_element *a_prev = NULL; bitmap_element *next; gcc_assert (a != b); if (bitmap_empty_p (a)) { bitmap_copy (a, b); return; } if (bitmap_empty_p (b)) { bitmap_clear (a); return; } while (a_elt || b_elt) { if (!b_elt || (a_elt && a_elt->indx < b_elt->indx)) { /* A is before B. Remove A */ next = a_elt->next; a_prev = a_elt->prev; bitmap_element_free (a, a_elt); a_elt = next; } else if (!a_elt || b_elt->indx < a_elt->indx) { /* B is before A. Copy B. */ next = bitmap_elt_insert_after (a, a_prev, b_elt->indx); memcpy (next->bits, b_elt->bits, sizeof (next->bits)); a_prev = next; b_elt = b_elt->next; } else { /* Matching elts, generate A = ~A & B. */ unsigned ix; BITMAP_WORD ior = 0; for (ix = BITMAP_ELEMENT_WORDS; ix--;) { BITMAP_WORD cleared = a_elt->bits[ix] & b_elt->bits[ix]; BITMAP_WORD r = b_elt->bits[ix] ^ cleared; a_elt->bits[ix] = r; ior |= r; } next = a_elt->next; if (!ior) bitmap_element_free (a, a_elt); else a_prev = a_elt; a_elt = next; b_elt = b_elt->next; } } gcc_assert (!a->current == !a->first); gcc_assert (!a->current || a->indx == a->current->indx); return; } /* Insert an element corresponding to A_ELT | B_ELT after DST_PREV, overwriting DST_ELT if non-NULL. CHANGED is true if the destination bitmap had already been changed; the new value of CHANGED is returned. */ static inline bool bitmap_elt_ior (bitmap dst, bitmap_element *dst_elt, bitmap_element *dst_prev, const bitmap_element *a_elt, const bitmap_element *b_elt, bool changed) { gcc_assert (a_elt || b_elt); if (a_elt && b_elt && a_elt->indx == b_elt->indx) { /* Matching elts, generate A | B. */ unsigned ix; if (!changed && dst_elt && dst_elt->indx == a_elt->indx) { for (ix = BITMAP_ELEMENT_WORDS; ix--;) { BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix]; if (r != dst_elt->bits[ix]) { dst_elt->bits[ix] = r; changed = true; } } } else { changed = true; if (!dst_elt) dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx); else dst_elt->indx = a_elt->indx; for (ix = BITMAP_ELEMENT_WORDS; ix--;) { BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix]; dst_elt->bits[ix] = r; } } } else { /* Copy a single element. */ const bitmap_element *src; if (!b_elt || (a_elt && a_elt->indx < b_elt->indx)) src = a_elt; else src = b_elt; gcc_assert (src); changed = bitmap_elt_copy (dst, dst_elt, dst_prev, src, changed); } return changed; } /* DST = A | B. Return true if DST changes. */ bool bitmap_ior (bitmap dst, const_bitmap a, const_bitmap b) { bitmap_element *dst_elt = dst->first; const bitmap_element *a_elt = a->first; const bitmap_element *b_elt = b->first; bitmap_element *dst_prev = NULL; bitmap_element **dst_prev_pnext = &dst->first; bool changed = false; gcc_assert (dst != a && dst != b); while (a_elt || b_elt) { changed = bitmap_elt_ior (dst, dst_elt, dst_prev, a_elt, b_elt, changed); if (a_elt && b_elt && a_elt->indx == b_elt->indx) { a_elt = a_elt->next; b_elt = b_elt->next; } else { if (a_elt && (!b_elt || a_elt->indx <= b_elt->indx)) a_elt = a_elt->next; else if (b_elt && (!a_elt || b_elt->indx <= a_elt->indx)) b_elt = b_elt->next; } dst_prev = *dst_prev_pnext; dst_prev_pnext = &dst_prev->next; dst_elt = *dst_prev_pnext; } if (dst_elt) { changed = true; bitmap_elt_clear_from (dst, dst_elt); } gcc_assert (!dst->current == !dst->first); if (dst->current) dst->indx = dst->current->indx; return changed; } /* A |= B. Return true if A changes. */ bool bitmap_ior_into (bitmap a, const_bitmap b) { bitmap_element *a_elt = a->first; const bitmap_element *b_elt = b->first; bitmap_element *a_prev = NULL; bitmap_element **a_prev_pnext = &a->first; bool changed = false; if (a == b) return false; while (b_elt) { /* If A lags behind B, just advance it. */ if (!a_elt || a_elt->indx == b_elt->indx) { changed = bitmap_elt_ior (a, a_elt, a_prev, a_elt, b_elt, changed); b_elt = b_elt->next; } else if (a_elt->indx > b_elt->indx) { changed = bitmap_elt_copy (a, NULL, a_prev, b_elt, changed); b_elt = b_elt->next; } a_prev = *a_prev_pnext; a_prev_pnext = &a_prev->next; a_elt = *a_prev_pnext; } gcc_assert (!a->current == !a->first); if (a->current) a->indx = a->current->indx; return changed; } /* DST = A ^ B */ void bitmap_xor (bitmap dst, const_bitmap a, const_bitmap b) { bitmap_element *dst_elt = dst->first; const bitmap_element *a_elt = a->first; const bitmap_element *b_elt = b->first; bitmap_element *dst_prev = NULL; gcc_assert (dst != a && dst != b); if (a == b) { bitmap_clear (dst); return; } while (a_elt || b_elt) { if (a_elt && b_elt && a_elt->indx == b_elt->indx) { /* Matching elts, generate A ^ B. */ unsigned ix; BITMAP_WORD ior = 0; if (!dst_elt) dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx); else dst_elt->indx = a_elt->indx; for (ix = BITMAP_ELEMENT_WORDS; ix--;) { BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix]; ior |= r; dst_elt->bits[ix] = r; } a_elt = a_elt->next; b_elt = b_elt->next; if (ior) { dst_prev = dst_elt; dst_elt = dst_elt->next; } } else { /* Copy a single element. */ const bitmap_element *src; if (!b_elt || (a_elt && a_elt->indx < b_elt->indx)) { src = a_elt; a_elt = a_elt->next; } else { src = b_elt; b_elt = b_elt->next; } if (!dst_elt) dst_elt = bitmap_elt_insert_after (dst, dst_prev, src->indx); else dst_elt->indx = src->indx; memcpy (dst_elt->bits, src->bits, sizeof (dst_elt->bits)); dst_prev = dst_elt; dst_elt = dst_elt->next; } } /* Ensure that dst->current is valid. */ dst->current = dst->first; bitmap_elt_clear_from (dst, dst_elt); gcc_assert (!dst->current == !dst->first); if (dst->current) dst->indx = dst->current->indx; } /* A ^= B */ void bitmap_xor_into (bitmap a, const_bitmap b) { bitmap_element *a_elt = a->first; const bitmap_element *b_elt = b->first; bitmap_element *a_prev = NULL; if (a == b) { bitmap_clear (a); return; } while (b_elt) { if (!a_elt || b_elt->indx < a_elt->indx) { /* Copy b_elt. */ bitmap_element *dst = bitmap_elt_insert_after (a, a_prev, b_elt->indx); memcpy (dst->bits, b_elt->bits, sizeof (dst->bits)); a_prev = dst; b_elt = b_elt->next; } else if (a_elt->indx < b_elt->indx) { a_prev = a_elt; a_elt = a_elt->next; } else { /* Matching elts, generate A ^= B. */ unsigned ix; BITMAP_WORD ior = 0; bitmap_element *next = a_elt->next; for (ix = BITMAP_ELEMENT_WORDS; ix--;) { BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix]; ior |= r; a_elt->bits[ix] = r; } b_elt = b_elt->next; if (ior) a_prev = a_elt; else bitmap_element_free (a, a_elt); a_elt = next; } } gcc_assert (!a->current == !a->first); if (a->current) a->indx = a->current->indx; } /* Return true if two bitmaps are identical. We do not bother with a check for pointer equality, as that never occurs in practice. */ bool bitmap_equal_p (const_bitmap a, const_bitmap b) { const bitmap_element *a_elt; const bitmap_element *b_elt; unsigned ix; for (a_elt = a->first, b_elt = b->first; a_elt && b_elt; a_elt = a_elt->next, b_elt = b_elt->next) { if (a_elt->indx != b_elt->indx) return false; for (ix = BITMAP_ELEMENT_WORDS; ix--;) if (a_elt->bits[ix] != b_elt->bits[ix]) return false; } return !a_elt && !b_elt; } /* Return true if A AND B is not empty. */ bool bitmap_intersect_p (const_bitmap a, const_bitmap b) { const bitmap_element *a_elt; const bitmap_element *b_elt; unsigned ix; for (a_elt = a->first, b_elt = b->first; a_elt && b_elt;) { if (a_elt->indx < b_elt->indx) a_elt = a_elt->next; else if (b_elt->indx < a_elt->indx) b_elt = b_elt->next; else { for (ix = BITMAP_ELEMENT_WORDS; ix--;) if (a_elt->bits[ix] & b_elt->bits[ix]) return true; a_elt = a_elt->next; b_elt = b_elt->next; } } return false; } /* Return true if A AND NOT B is not empty. */ bool bitmap_intersect_compl_p (const_bitmap a, const_bitmap b) { const bitmap_element *a_elt; const bitmap_element *b_elt; unsigned ix; for (a_elt = a->first, b_elt = b->first; a_elt && b_elt;) { if (a_elt->indx < b_elt->indx) return true; else if (b_elt->indx < a_elt->indx) b_elt = b_elt->next; else { for (ix = BITMAP_ELEMENT_WORDS; ix--;) if (a_elt->bits[ix] & ~b_elt->bits[ix]) return true; a_elt = a_elt->next; b_elt = b_elt->next; } } return a_elt != NULL; } /* DST = A | (FROM1 & ~FROM2). Return true if DST changes. */ bool bitmap_ior_and_compl (bitmap dst, const_bitmap a, const_bitmap b, const_bitmap kill) { bool changed = false; bitmap_element *dst_elt = dst->first; const bitmap_element *a_elt = a->first; const bitmap_element *b_elt = b->first; const bitmap_element *kill_elt = kill->first; bitmap_element *dst_prev = NULL; bitmap_element **dst_prev_pnext = &dst->first; gcc_assert (dst != a && dst != b && dst != kill); /* Special cases. We don't bother checking for bitmap_equal_p (b, kill). */ if (b == kill || bitmap_empty_p (b)) { changed = !bitmap_equal_p (dst, a); if (changed) bitmap_copy (dst, a); return changed; } if (bitmap_empty_p (kill)) return bitmap_ior (dst, a, b); if (bitmap_empty_p (a)) return bitmap_and_compl (dst, b, kill); while (a_elt || b_elt) { bool new_element = false; if (b_elt) while (kill_elt && kill_elt->indx < b_elt->indx) kill_elt = kill_elt->next; if (b_elt && kill_elt && kill_elt->indx == b_elt->indx && (!a_elt || a_elt->indx >= b_elt->indx)) { bitmap_element tmp_elt; unsigned ix; BITMAP_WORD ior = 0; tmp_elt.indx = b_elt->indx; for (ix = BITMAP_ELEMENT_WORDS; ix--;) { BITMAP_WORD r = b_elt->bits[ix] & ~kill_elt->bits[ix]; ior |= r; tmp_elt.bits[ix] = r; } if (ior) { changed = bitmap_elt_ior (dst, dst_elt, dst_prev, a_elt, &tmp_elt, changed); new_element = true; if (a_elt && a_elt->indx == b_elt->indx) a_elt = a_elt->next; } b_elt = b_elt->next; kill_elt = kill_elt->next; } else { changed = bitmap_elt_ior (dst, dst_elt, dst_prev, a_elt, b_elt, changed); new_element = true; if (a_elt && b_elt && a_elt->indx == b_elt->indx) { a_elt = a_elt->next; b_elt = b_elt->next; } else { if (a_elt && (!b_elt || a_elt->indx <= b_elt->indx)) a_elt = a_elt->next; else if (b_elt && (!a_elt || b_elt->indx <= a_elt->indx)) b_elt = b_elt->next; } } if (new_element) { dst_prev = *dst_prev_pnext; dst_prev_pnext = &dst_prev->next; dst_elt = *dst_prev_pnext; } } if (dst_elt) { changed = true; bitmap_elt_clear_from (dst, dst_elt); } gcc_assert (!dst->current == !dst->first); if (dst->current) dst->indx = dst->current->indx; return changed; } /* A |= (FROM1 & ~FROM2). Return true if A changes. */ bool bitmap_ior_and_compl_into (bitmap a, const_bitmap from1, const_bitmap from2) { bitmap_head tmp; bool changed; bitmap_initialize (&tmp, &bitmap_default_obstack); bitmap_and_compl (&tmp, from1, from2); changed = bitmap_ior_into (a, &tmp); bitmap_clear (&tmp); return changed; } /* A |= (B & C). Return true if A changes. */ bool bitmap_ior_and_into (bitmap a, const_bitmap b, const_bitmap c) { bitmap_element *a_elt = a->first; const bitmap_element *b_elt = b->first; const bitmap_element *c_elt = c->first; bitmap_element and_elt; bitmap_element *a_prev = NULL; bitmap_element **a_prev_pnext = &a->first; bool changed = false; unsigned ix; if (b == c) return bitmap_ior_into (a, b); if (bitmap_empty_p (b) || bitmap_empty_p (c)) return false; and_elt.indx = -1; while (b_elt && c_elt) { BITMAP_WORD overall; /* Find a common item of B and C. */ while (b_elt->indx != c_elt->indx) { if (b_elt->indx < c_elt->indx) { b_elt = b_elt->next; if (!b_elt) goto done; } else { c_elt = c_elt->next; if (!c_elt) goto done; } } overall = 0; and_elt.indx = b_elt->indx; for (ix = BITMAP_ELEMENT_WORDS; ix--;) { and_elt.bits[ix] = b_elt->bits[ix] & c_elt->bits[ix]; overall |= and_elt.bits[ix]; } b_elt = b_elt->next; c_elt = c_elt->next; if (!overall) continue; /* Now find a place to insert AND_ELT. */ do { ix = a_elt ? a_elt->indx : and_elt.indx; if (ix == and_elt.indx) changed = bitmap_elt_ior (a, a_elt, a_prev, a_elt, &and_elt, changed); else if (ix > and_elt.indx) changed = bitmap_elt_copy (a, NULL, a_prev, &and_elt, changed); a_prev = *a_prev_pnext; a_prev_pnext = &a_prev->next; a_elt = *a_prev_pnext; /* If A lagged behind B/C, we advanced it so loop once more. */ } while (ix < and_elt.indx); } done: gcc_assert (!a->current == !a->first); if (a->current) a->indx = a->current->indx; return changed; } /* Debugging function to print out the contents of a bitmap. */ void debug_bitmap_file (FILE *file, const_bitmap head) { const bitmap_element *ptr; fprintf (file, "\nfirst = %p current = %p indx = %u\n", (void *) head->first, (void *) head->current, head->indx); for (ptr = head->first; ptr; ptr = ptr->next) { unsigned int i, j, col = 26; fprintf (file, "\t%p next = %p prev = %p indx = %u\n\t\tbits = {", (const void*) ptr, (const void*) ptr->next, (const void*) ptr->prev, ptr->indx); for (i = 0; i < BITMAP_ELEMENT_WORDS; i++) for (j = 0; j < BITMAP_WORD_BITS; j++) if ((ptr->bits[i] >> j) & 1) { if (col > 70) { fprintf (file, "\n\t\t\t"); col = 24; } fprintf (file, " %u", (ptr->indx * BITMAP_ELEMENT_ALL_BITS + i * BITMAP_WORD_BITS + j)); col += 4; } fprintf (file, " }\n"); } } /* Function to be called from the debugger to print the contents of a bitmap. */ void debug_bitmap (const_bitmap head) { debug_bitmap_file (stdout, head); } /* Function to print out the contents of a bitmap. Unlike debug_bitmap_file, it does not print anything but the bits. */ void bitmap_print (FILE *file, const_bitmap head, const char *prefix, const char *suffix) { const char *comma = ""; unsigned i; bitmap_iterator bi; fputs (prefix, file); EXECUTE_IF_SET_IN_BITMAP (head, 0, i, bi) { fprintf (file, "%s%d", comma, i); comma = ", "; } fputs (suffix, file); } #ifdef GATHER_STATISTICS /* Used to accumulate statistics about bitmap sizes. */ struct output_info { HOST_WIDEST_INT size; int count; }; /* Called via htab_traverse. Output bitmap descriptor pointed out by SLOT and update statistics. */ static int print_statistics (void **slot, void *b) { struct bitmap_descriptor *d = (struct bitmap_descriptor *) *slot; struct output_info *i = (struct output_info *) b; char s[4096]; if (d->allocated) { const char *s1 = d->file; const char *s2; while ((s2 = strstr (s1, "gcc/"))) s1 = s2 + 4; sprintf (s, "%s:%i (%s)", s1, d->line, d->function); s[41] = 0; fprintf (stderr, "%-41s %8d %15"HOST_WIDEST_INT_PRINT"d %15" HOST_WIDEST_INT_PRINT"d %15"HOST_WIDEST_INT_PRINT"d %10d\n", s, d->created, d->allocated, d->peak, d->current, d->nsearches); i->size += d->allocated; i->count += d->created; } return 1; } #endif /* Output per-bitmap memory usage statistics. */ void dump_bitmap_statistics (void) { #ifdef GATHER_STATISTICS struct output_info info; if (!bitmap_desc_hash) return; fprintf (stderr, "\nBitmap Overall " " Allocated Peak Leak searched " " per search\n"); fprintf (stderr, "---------------------------------------------------------------------------------\n"); info.count = 0; info.size = 0; htab_traverse (bitmap_desc_hash, print_statistics, &info); fprintf (stderr, "---------------------------------------------------------------------------------\n"); fprintf (stderr, "%-40s %9d %15"HOST_WIDEST_INT_PRINT"d\n", "Total", info.count, info.size); fprintf (stderr, "---------------------------------------------------------------------------------\n"); #endif } /* Compute hash of bitmap (for purposes of hashing). */ hashval_t bitmap_hash (const_bitmap head) { const bitmap_element *ptr; BITMAP_WORD hash = 0; int ix; for (ptr = head->first; ptr; ptr = ptr->next) { hash ^= ptr->indx; for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++) hash ^= ptr->bits[ix]; } return (hashval_t)hash; } #include "gt-bitmap.h"