* config/riscv/riscv.c: Remove unnecessary includes. Reorder
[official-gcc.git] / gcc / ada / exp_ch11.adb
blob8711c89d0eb483b2c2aa67052f4a11cf5fff7d01
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- E X P _ C H 1 1 --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 1992-2016, Free Software Foundation, Inc. --
10 -- --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
20 -- --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
23 -- --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Debug; use Debug;
28 with Einfo; use Einfo;
29 with Elists; use Elists;
30 with Errout; use Errout;
31 with Exp_Ch7; use Exp_Ch7;
32 with Exp_Intr; use Exp_Intr;
33 with Exp_Util; use Exp_Util;
34 with Namet; use Namet;
35 with Nlists; use Nlists;
36 with Nmake; use Nmake;
37 with Opt; use Opt;
38 with Restrict; use Restrict;
39 with Rident; use Rident;
40 with Rtsfind; use Rtsfind;
41 with Sem; use Sem;
42 with Sem_Ch8; use Sem_Ch8;
43 with Sem_Res; use Sem_Res;
44 with Sem_Util; use Sem_Util;
45 with Sinfo; use Sinfo;
46 with Sinput; use Sinput;
47 with Snames; use Snames;
48 with Stand; use Stand;
49 with Stringt; use Stringt;
50 with Targparm; use Targparm;
51 with Tbuild; use Tbuild;
52 with Uintp; use Uintp;
54 package body Exp_Ch11 is
56 -----------------------
57 -- Local Subprograms --
58 -----------------------
60 procedure Warn_No_Exception_Propagation_Active (N : Node_Id);
61 -- Generates warning that pragma Restrictions (No_Exception_Propagation)
62 -- is in effect. Caller then generates appropriate continuation message.
63 -- N is the node on which the warning is placed.
65 procedure Warn_If_No_Propagation (N : Node_Id);
66 -- Called for an exception raise that is not a local raise (and thus can
67 -- not be optimized to a goto. Issues warning if No_Exception_Propagation
68 -- restriction is set. N is the node for the raise or equivalent call.
70 ---------------------------
71 -- Expand_At_End_Handler --
72 ---------------------------
74 -- For a handled statement sequence that has a cleanup (At_End_Proc
75 -- field set), an exception handler of the following form is required:
77 -- exception
78 -- when all others =>
79 -- cleanup call
80 -- raise;
82 -- Note: this exception handler is treated rather specially by
83 -- subsequent expansion in two respects:
85 -- The normal call to Undefer_Abort is omitted
86 -- The raise call does not do Defer_Abort
88 -- This is because the current tasking code seems to assume that
89 -- the call to the cleanup routine that is made from an exception
90 -- handler for the abort signal is called with aborts deferred.
92 -- This expansion is only done if we have front end exception handling.
93 -- If we have back end exception handling, then the AT END handler is
94 -- left alone, and cleanups (including the exceptional case) are handled
95 -- by the back end.
97 -- In the front end case, the exception handler described above handles
98 -- the exceptional case. The AT END handler is left in the generated tree
99 -- and the code generator (e.g. gigi) must still handle proper generation
100 -- of cleanup calls for the non-exceptional case.
102 procedure Expand_At_End_Handler (HSS : Node_Id; Blk_Id : Entity_Id) is
103 Clean : constant Entity_Id := Entity (At_End_Proc (HSS));
104 Ohandle : Node_Id;
105 Stmnts : List_Id;
107 Loc : constant Source_Ptr := No_Location;
108 -- Location used for expansion. We quite deliberately do not set a
109 -- specific source location for the expanded handler. This makes
110 -- sense since really the handler is not associated with specific
111 -- source. We used to set this to Sloc (Clean), but that caused
112 -- useless and annoying bouncing around of line numbers in the
113 -- debugger in some circumstances.
115 begin
116 pragma Assert (Present (Clean));
117 pragma Assert (No (Exception_Handlers (HSS)));
119 -- Back end exception schemes don't need explicit handlers to
120 -- trigger AT-END actions on exceptional paths.
122 if Back_End_Exceptions then
123 return;
124 end if;
126 -- Don't expand an At End handler if we have already had configurable
127 -- run-time violations, since likely this will just be a matter of
128 -- generating useless cascaded messages
130 if Configurable_Run_Time_Violations > 0 then
131 return;
132 end if;
134 -- Don't expand an At End handler if we are not allowing exceptions
135 -- or if exceptions are transformed into local gotos, and never
136 -- propagated (No_Exception_Propagation).
138 if No_Exception_Handlers_Set then
139 return;
140 end if;
142 if Present (Blk_Id) then
143 Push_Scope (Blk_Id);
144 end if;
146 Ohandle :=
147 Make_Others_Choice (Loc);
148 Set_All_Others (Ohandle);
150 Stmnts := New_List (
151 Make_Procedure_Call_Statement (Loc,
152 Name => New_Occurrence_Of (Clean, Loc)));
154 -- Generate reraise statement as last statement of AT-END handler,
155 -- unless we are under control of No_Exception_Propagation, in which
156 -- case no exception propagation is possible anyway, so we do not need
157 -- a reraise (the AT END handler in this case is only for normal exits
158 -- not for exceptional exits). Also, we flag the Reraise statement as
159 -- being part of an AT END handler to prevent signalling this reraise
160 -- as a violation of the restriction when it is not set.
162 if not Restriction_Active (No_Exception_Propagation) then
163 declare
164 Rstm : constant Node_Id := Make_Raise_Statement (Loc);
165 begin
166 Set_From_At_End (Rstm);
167 Append_To (Stmnts, Rstm);
168 end;
169 end if;
171 Set_Exception_Handlers (HSS, New_List (
172 Make_Implicit_Exception_Handler (Loc,
173 Exception_Choices => New_List (Ohandle),
174 Statements => Stmnts)));
176 Analyze_List (Stmnts, Suppress => All_Checks);
177 Expand_Exception_Handlers (HSS);
179 if Present (Blk_Id) then
180 Pop_Scope;
181 end if;
182 end Expand_At_End_Handler;
184 -------------------------------
185 -- Expand_Exception_Handlers --
186 -------------------------------
188 procedure Expand_Exception_Handlers (HSS : Node_Id) is
189 Handlrs : constant List_Id := Exception_Handlers (HSS);
190 Loc : constant Source_Ptr := Sloc (HSS);
191 Handler : Node_Id;
192 Others_Choice : Boolean;
193 Obj_Decl : Node_Id;
194 Next_Handler : Node_Id;
196 procedure Expand_Local_Exception_Handlers;
197 -- This procedure handles the expansion of exception handlers for the
198 -- optimization of local raise statements into goto statements.
200 procedure Prepend_Call_To_Handler
201 (Proc : RE_Id;
202 Args : List_Id := No_List);
203 -- Routine to prepend a call to the procedure referenced by Proc at
204 -- the start of the handler code for the current Handler.
206 procedure Replace_Raise_By_Goto (Raise_S : Node_Id; Goto_L1 : Node_Id);
207 -- Raise_S is a raise statement (possibly expanded, and possibly of the
208 -- form of a Raise_xxx_Error node with a condition. This procedure is
209 -- called to replace the raise action with the (already analyzed) goto
210 -- statement passed as Goto_L1. This procedure also takes care of the
211 -- requirement of inserting a Local_Raise call where possible.
213 -------------------------------------
214 -- Expand_Local_Exception_Handlers --
215 -------------------------------------
217 -- There are two cases for this transformation. First the case of
218 -- explicit raise statements. For this case, the transformation we do
219 -- looks like this. Right now we have for example (where L1, L2 are
220 -- exception labels)
222 -- begin
223 -- ...
224 -- raise_exception (excep1'identity); -- was raise excep1
225 -- ...
226 -- raise_exception (excep2'identity); -- was raise excep2
227 -- ...
228 -- exception
229 -- when excep1 =>
230 -- estmts1
231 -- when excep2 =>
232 -- estmts2
233 -- end;
235 -- This gets transformed into:
237 -- begin
238 -- L1 : label; -- marked Exception_Junk
239 -- L2 : label; -- marked Exception_Junk
240 -- L3 : label; -- marked Exception_Junk
242 -- begin -- marked Exception_Junk
243 -- ...
244 -- local_raise (excep1'address); -- was raise excep1
245 -- goto L1;
246 -- ...
247 -- local_raise (excep2'address); -- was raise excep2
248 -- goto L2;
249 -- ...
250 -- exception
251 -- when excep1 =>
252 -- goto L1;
253 -- when excep2 =>
254 -- goto L2;
255 -- end;
257 -- goto L3; -- skip handler if no raise, marked Exception_Junk
259 -- <<L1>> -- local excep target label, marked Exception_Junk
260 -- begin -- marked Exception_Junk
261 -- estmts1
262 -- end;
263 -- goto L3; -- marked Exception_Junk
265 -- <<L2>> -- marked Exception_Junk
266 -- begin -- marked Exception_Junk
267 -- estmts2
268 -- end;
269 -- goto L3; -- marked Exception_Junk
270 -- <<L3>> -- marked Exception_Junk
271 -- end;
273 -- Note: the reason we wrap the original statement sequence in an
274 -- inner block is that there may be raise statements within the
275 -- sequence of statements in the handlers, and we must ensure that
276 -- these are properly handled, and in particular, such raise statements
277 -- must not reenter the same exception handlers.
279 -- If the restriction No_Exception_Propagation is in effect, then we
280 -- can omit the exception handlers.
282 -- begin
283 -- L1 : label; -- marked Exception_Junk
284 -- L2 : label; -- marked Exception_Junk
285 -- L3 : label; -- marked Exception_Junk
287 -- begin -- marked Exception_Junk
288 -- ...
289 -- local_raise (excep1'address); -- was raise excep1
290 -- goto L1;
291 -- ...
292 -- local_raise (excep2'address); -- was raise excep2
293 -- goto L2;
294 -- ...
295 -- end;
297 -- goto L3; -- skip handler if no raise, marked Exception_Junk
299 -- <<L1>> -- local excep target label, marked Exception_Junk
300 -- begin -- marked Exception_Junk
301 -- estmts1
302 -- end;
303 -- goto L3; -- marked Exception_Junk
305 -- <<L2>> -- marked Exception_Junk
306 -- begin -- marked Exception_Junk
307 -- estmts2
308 -- end;
310 -- <<L3>> -- marked Exception_Junk
311 -- end;
313 -- The second case is for exceptions generated by the back end in one
314 -- of three situations:
316 -- 1. Front end generates N_Raise_xxx_Error node
317 -- 2. Front end sets Do_xxx_Check flag in subexpression node
318 -- 3. Back end detects a situation where an exception is appropriate
320 -- In all these cases, the current processing in gigi is to generate a
321 -- call to the appropriate Rcheck_xx routine (where xx encodes both the
322 -- exception message and the exception to be raised, Constraint_Error,
323 -- Program_Error, or Storage_Error.
325 -- We could handle some subcases of 1 using the same front end expansion
326 -- into gotos, but even for case 1, we can't handle all cases, since
327 -- generating gotos in the middle of expressions is not possible (it's
328 -- possible at the gigi/gcc level, but not at the level of the GNAT
329 -- tree).
331 -- In any case, it seems easier to have a scheme which handles all three
332 -- cases in a uniform manner. So here is how we proceed in this case.
334 -- This procedure detects all handlers for these three exceptions,
335 -- Constraint_Error, Program_Error and Storage_Error (including WHEN
336 -- OTHERS handlers that cover one or more of these cases).
338 -- If the handler meets the requirements for being the target of a local
339 -- raise, then the front end does the expansion described previously,
340 -- creating a label to be used as a goto target to raise the exception.
341 -- However, no attempt is made in the front end to convert any related
342 -- raise statements into gotos, e.g. all N_Raise_xxx_Error nodes are
343 -- left unchanged and passed to the back end.
345 -- Instead, the front end generates three nodes
347 -- N_Push_Constraint_Error_Label
348 -- N_Push_Program_Error_Label
349 -- N_Push_Storage_Error_Label
351 -- The Push node is generated at the start of the statements
352 -- covered by the handler, and has as a parameter the label to be
353 -- used as the raise target.
355 -- N_Pop_Constraint_Error_Label
356 -- N_Pop_Program_Error_Label
357 -- N_Pop_Storage_Error_Label
359 -- The Pop node is generated at the end of the covered statements
360 -- and undoes the effect of the preceding corresponding Push node.
362 -- In the case where the handler does NOT meet the requirements, the
363 -- front end will still generate the Push and Pop nodes, but the label
364 -- field in the Push node will be empty signifying that for this region
365 -- of code, no optimization is possible.
367 -- These Push/Pop nodes are inhibited if No_Exception_Handlers is set
368 -- since they are useless in this case, and in CodePeer mode, where
369 -- they serve no purpose and can intefere with the analysis.
371 -- The back end must maintain three stacks, one for each exception case,
372 -- the Push node pushes an entry onto the corresponding stack, and Pop
373 -- node pops off the entry. Then instead of calling Rcheck_nn, if the
374 -- corresponding top stack entry has an non-empty label, a goto is
375 -- generated. This goto should be preceded by a call to Local_Raise as
376 -- described above.
378 -- An example of this transformation is as follows, given:
380 -- declare
381 -- A : Integer range 1 .. 10;
382 -- begin
383 -- A := B + C;
384 -- exception
385 -- when Constraint_Error =>
386 -- estmts
387 -- end;
389 -- gets transformed to:
391 -- declare
392 -- A : Integer range 1 .. 10;
394 -- begin
395 -- L1 : label;
396 -- L2 : label;
398 -- begin
399 -- %push_constraint_error_label (L1)
400 -- R1b : constant long_long_integer := long_long_integer?(b) +
401 -- long_long_integer?(c);
402 -- [constraint_error when
403 -- not (R1b in -16#8000_0000# .. 16#7FFF_FFFF#)
404 -- "overflow check failed"]
405 -- a := integer?(R1b);
406 -- %pop_constraint_error_Label
408 -- exception
409 -- ...
410 -- when constraint_error =>
411 -- goto L1;
412 -- end;
414 -- goto L2; -- skip handler when exception not raised
415 -- <<L1>> -- target label for local exception
416 -- estmts
417 -- <<L2>>
418 -- end;
420 -- Note: the generated labels and goto statements all have the flag
421 -- Exception_Junk set True, so that Sem_Ch6.Check_Returns will ignore
422 -- this generated exception stuff when checking for missing return
423 -- statements (see circuitry in Check_Statement_Sequence).
425 -- Note: All of the processing described above occurs only if
426 -- restriction No_Exception_Propagation applies or debug flag .g is
427 -- enabled.
429 CE_Locally_Handled : Boolean := False;
430 SE_Locally_Handled : Boolean := False;
431 PE_Locally_Handled : Boolean := False;
432 -- These three flags indicate whether a handler for the corresponding
433 -- exception (CE=Constraint_Error, SE=Storage_Error, PE=Program_Error)
434 -- is present. If so the switch is set to True, the Exception_Label
435 -- field of the corresponding handler is set, and appropriate Push
436 -- and Pop nodes are inserted into the code.
438 Local_Expansion_Required : Boolean := False;
439 -- Set True if we have at least one handler requiring local raise
440 -- expansion as described above.
442 procedure Expand_Local_Exception_Handlers is
443 procedure Add_Exception_Label (H : Node_Id);
444 -- H is an exception handler. First check for an Exception_Label
445 -- already allocated for H. If none, allocate one, set the field in
446 -- the handler node, add the label declaration, and set the flag
447 -- Local_Expansion_Required. Note: if Local_Raise_Not_OK is set
448 -- the call has no effect and Exception_Label is left empty.
450 procedure Add_Label_Declaration (L : Entity_Id);
451 -- Add an implicit declaration of the given label to the declaration
452 -- list in the parent of the current sequence of handled statements.
454 generic
455 Exc_Locally_Handled : in out Boolean;
456 -- Flag indicating whether a local handler for this exception
457 -- has already been generated.
459 with function Make_Push_Label (Loc : Source_Ptr) return Node_Id;
460 -- Function to create a Push_xxx_Label node
462 with function Make_Pop_Label (Loc : Source_Ptr) return Node_Id;
463 -- Function to create a Pop_xxx_Label node
465 procedure Generate_Push_Pop (H : Node_Id);
466 -- Common code for Generate_Push_Pop_xxx below, used to generate an
467 -- exception label and Push/Pop nodes for Constraint_Error,
468 -- Program_Error, or Storage_Error.
470 -------------------------
471 -- Add_Exception_Label --
472 -------------------------
474 procedure Add_Exception_Label (H : Node_Id) is
475 begin
476 if No (Exception_Label (H))
477 and then not Local_Raise_Not_OK (H)
478 and then not Special_Exception_Package_Used
479 then
480 Local_Expansion_Required := True;
482 declare
483 L : constant Entity_Id := Make_Temporary (Sloc (H), 'L');
484 begin
485 Set_Exception_Label (H, L);
486 Add_Label_Declaration (L);
487 end;
488 end if;
489 end Add_Exception_Label;
491 ---------------------------
492 -- Add_Label_Declaration --
493 ---------------------------
495 procedure Add_Label_Declaration (L : Entity_Id) is
496 P : constant Node_Id := Parent (HSS);
498 Decl_L : constant Node_Id :=
499 Make_Implicit_Label_Declaration (Loc,
500 Defining_Identifier => L);
502 begin
503 if Declarations (P) = No_List then
504 Set_Declarations (P, Empty_List);
505 end if;
507 Append (Decl_L, Declarations (P));
508 Analyze (Decl_L);
509 end Add_Label_Declaration;
511 -----------------------
512 -- Generate_Push_Pop --
513 -----------------------
515 procedure Generate_Push_Pop (H : Node_Id) is
516 begin
517 if Restriction_Active (No_Exception_Handlers)
518 or else CodePeer_Mode
519 then
520 return;
521 end if;
523 if Exc_Locally_Handled then
524 return;
525 else
526 Exc_Locally_Handled := True;
527 end if;
529 Add_Exception_Label (H);
531 declare
532 F : constant Node_Id := First (Statements (HSS));
533 L : constant Node_Id := Last (Statements (HSS));
535 Push : constant Node_Id := Make_Push_Label (Sloc (F));
536 Pop : constant Node_Id := Make_Pop_Label (Sloc (L));
538 begin
539 -- We make sure that a call to Get_Local_Raise_Call_Entity is
540 -- made during front end processing, so that when we need it
541 -- in the back end, it will already be available and loaded.
543 Discard_Node (Get_Local_Raise_Call_Entity);
545 -- Prepare and insert Push and Pop nodes
547 Set_Exception_Label (Push, Exception_Label (H));
548 Insert_Before (F, Push);
549 Set_Analyzed (Push);
551 Insert_After (L, Pop);
552 Set_Analyzed (Pop);
553 end;
554 end Generate_Push_Pop;
556 -- Local declarations
558 Loc : constant Source_Ptr := Sloc (HSS);
559 Stmts : List_Id := No_List;
560 Choice : Node_Id;
561 Excep : Entity_Id;
563 procedure Generate_Push_Pop_For_Constraint_Error is
564 new Generate_Push_Pop
565 (Exc_Locally_Handled => CE_Locally_Handled,
566 Make_Push_Label => Make_Push_Constraint_Error_Label,
567 Make_Pop_Label => Make_Pop_Constraint_Error_Label);
568 -- If no Push/Pop has been generated for CE yet, then set the flag
569 -- CE_Locally_Handled, allocate an Exception_Label for handler H (if
570 -- not already done), and generate Push/Pop nodes for the exception
571 -- label at the start and end of the statements of HSS.
573 procedure Generate_Push_Pop_For_Program_Error is
574 new Generate_Push_Pop
575 (Exc_Locally_Handled => PE_Locally_Handled,
576 Make_Push_Label => Make_Push_Program_Error_Label,
577 Make_Pop_Label => Make_Pop_Program_Error_Label);
578 -- If no Push/Pop has been generated for PE yet, then set the flag
579 -- PE_Locally_Handled, allocate an Exception_Label for handler H (if
580 -- not already done), and generate Push/Pop nodes for the exception
581 -- label at the start and end of the statements of HSS.
583 procedure Generate_Push_Pop_For_Storage_Error is
584 new Generate_Push_Pop
585 (Exc_Locally_Handled => SE_Locally_Handled,
586 Make_Push_Label => Make_Push_Storage_Error_Label,
587 Make_Pop_Label => Make_Pop_Storage_Error_Label);
588 -- If no Push/Pop has been generated for SE yet, then set the flag
589 -- SE_Locally_Handled, allocate an Exception_Label for handler H (if
590 -- not already done), and generate Push/Pop nodes for the exception
591 -- label at the start and end of the statements of HSS.
593 -- Start of processing for Expand_Local_Exception_Handlers
595 begin
596 -- No processing if all exception handlers will get removed
598 if Debug_Flag_Dot_X then
599 return;
600 end if;
602 -- See for each handler if we have any local raises to expand
604 Handler := First_Non_Pragma (Handlrs);
605 while Present (Handler) loop
607 -- Note, we do not test Local_Raise_Not_OK here, because in the
608 -- case of Push/Pop generation we want to generate push with a
609 -- null label. The Add_Exception_Label routine has no effect if
610 -- Local_Raise_Not_OK is set, so this works as required.
612 if Present (Local_Raise_Statements (Handler)) then
613 Add_Exception_Label (Handler);
614 end if;
616 -- If we are doing local raise to goto optimization (restriction
617 -- No_Exception_Propagation set or debug flag .g set), then check
618 -- to see if handler handles CE, PE, SE and if so generate the
619 -- appropriate push/pop sequence for the back end.
621 if (Debug_Flag_Dot_G
622 or else Restriction_Active (No_Exception_Propagation))
623 and then Has_Local_Raise (Handler)
624 then
625 Choice := First (Exception_Choices (Handler));
626 while Present (Choice) loop
627 if Nkind (Choice) = N_Others_Choice
628 and then not All_Others (Choice)
629 then
630 Generate_Push_Pop_For_Constraint_Error (Handler);
631 Generate_Push_Pop_For_Program_Error (Handler);
632 Generate_Push_Pop_For_Storage_Error (Handler);
634 elsif Is_Entity_Name (Choice) then
635 Excep := Get_Renamed_Entity (Entity (Choice));
637 if Excep = Standard_Constraint_Error then
638 Generate_Push_Pop_For_Constraint_Error (Handler);
639 elsif Excep = Standard_Program_Error then
640 Generate_Push_Pop_For_Program_Error (Handler);
641 elsif Excep = Standard_Storage_Error then
642 Generate_Push_Pop_For_Storage_Error (Handler);
643 end if;
644 end if;
646 Next (Choice);
647 end loop;
648 end if;
650 Next_Non_Pragma (Handler);
651 end loop;
653 -- Nothing to do if no handlers requiring the goto transformation
655 if not (Local_Expansion_Required) then
656 return;
657 end if;
659 -- Prepare to do the transformation
661 declare
662 -- L3 is the label to exit the HSS
664 L3_Dent : constant Entity_Id := Make_Temporary (Loc, 'L');
666 Labl_L3 : constant Node_Id :=
667 Make_Label (Loc,
668 Identifier => New_Occurrence_Of (L3_Dent, Loc));
670 Blk_Stm : Node_Id;
671 Relmt : Elmt_Id;
673 begin
674 Set_Exception_Junk (Labl_L3);
675 Add_Label_Declaration (L3_Dent);
677 -- Wrap existing statements and handlers in an inner block
679 Blk_Stm :=
680 Make_Block_Statement (Loc,
681 Handled_Statement_Sequence => Relocate_Node (HSS));
682 Set_Exception_Junk (Blk_Stm);
684 Rewrite (HSS,
685 Make_Handled_Sequence_Of_Statements (Loc,
686 Statements => New_List (Blk_Stm),
687 End_Label => Relocate_Node (End_Label (HSS))));
689 -- Set block statement as analyzed, we don't want to actually call
690 -- Analyze on this block, it would cause a recursion in exception
691 -- handler processing which would mess things up.
693 Set_Analyzed (Blk_Stm);
695 -- Now loop through the exception handlers to deal with those that
696 -- are targets of local raise statements.
698 Handler := First_Non_Pragma (Handlrs);
699 while Present (Handler) loop
700 if Present (Exception_Label (Handler)) then
702 -- This handler needs the goto expansion
704 declare
705 Loc : constant Source_Ptr := Sloc (Handler);
707 -- L1 is the start label for this handler
709 L1_Dent : constant Entity_Id := Exception_Label (Handler);
711 Labl_L1 : constant Node_Id :=
712 Make_Label (Loc,
713 Identifier =>
714 New_Occurrence_Of (L1_Dent, Loc));
716 -- Jump to L1 to be used as replacement for the original
717 -- handler (used in the case where exception propagation
718 -- may still occur).
720 Name_L1 : constant Node_Id :=
721 New_Occurrence_Of (L1_Dent, Loc);
723 Goto_L1 : constant Node_Id :=
724 Make_Goto_Statement (Loc,
725 Name => Name_L1);
727 -- Jump to L3 to be used at the end of handler
729 Name_L3 : constant Node_Id :=
730 New_Occurrence_Of (L3_Dent, Loc);
732 Goto_L3 : constant Node_Id :=
733 Make_Goto_Statement (Loc,
734 Name => Name_L3);
736 H_Stmts : constant List_Id := Statements (Handler);
738 begin
739 Set_Exception_Junk (Labl_L1);
740 Set_Exception_Junk (Goto_L3);
742 -- Note: we do NOT set Exception_Junk in Goto_L1, since
743 -- this is a real transfer of control that we want the
744 -- Sem_Ch6.Check_Returns procedure to recognize properly.
746 -- Replace handler by a goto L1. We can mark this as
747 -- analyzed since it is fully formed, and we don't
748 -- want it going through any further checks. We save
749 -- the last statement location in the goto L1 node for
750 -- the benefit of Sem_Ch6.Check_Returns.
752 Set_Statements (Handler, New_List (Goto_L1));
753 Set_Analyzed (Goto_L1);
754 Set_Etype (Name_L1, Standard_Void_Type);
756 -- Now replace all the raise statements by goto L1
758 if Present (Local_Raise_Statements (Handler)) then
759 Relmt := First_Elmt (Local_Raise_Statements (Handler));
760 while Present (Relmt) loop
761 declare
762 Raise_S : constant Node_Id := Node (Relmt);
763 RLoc : constant Source_Ptr := Sloc (Raise_S);
764 Name_L1 : constant Node_Id :=
765 New_Occurrence_Of (L1_Dent, Loc);
766 Goto_L1 : constant Node_Id :=
767 Make_Goto_Statement (RLoc,
768 Name => Name_L1);
770 begin
771 -- Replace raise by goto L1
773 Set_Analyzed (Goto_L1);
774 Set_Etype (Name_L1, Standard_Void_Type);
775 Replace_Raise_By_Goto (Raise_S, Goto_L1);
776 end;
778 Next_Elmt (Relmt);
779 end loop;
780 end if;
782 -- Add a goto L3 at end of statement list in block. The
783 -- first time, this is what skips over the exception
784 -- handlers in the normal case. Subsequent times, it
785 -- terminates the execution of the previous handler code,
786 -- and skips subsequent handlers.
788 Stmts := Statements (HSS);
790 Insert_After (Last (Stmts), Goto_L3);
791 Set_Analyzed (Goto_L3);
792 Set_Etype (Name_L3, Standard_Void_Type);
794 -- Now we drop the label that marks the handler start,
795 -- followed by the statements of the handler.
797 Set_Etype (Identifier (Labl_L1), Standard_Void_Type);
799 Insert_After_And_Analyze (Last (Stmts), Labl_L1);
801 declare
802 Loc : constant Source_Ptr := Sloc (First (H_Stmts));
803 Blk : constant Node_Id :=
804 Make_Block_Statement (Loc,
805 Handled_Statement_Sequence =>
806 Make_Handled_Sequence_Of_Statements (Loc,
807 Statements => H_Stmts));
808 begin
809 Set_Exception_Junk (Blk);
810 Insert_After_And_Analyze (Last (Stmts), Blk);
811 end;
812 end;
814 -- Here if we have local raise statements but the handler is
815 -- not suitable for processing with a local raise. In this
816 -- case we have to generate possible diagnostics.
818 elsif Has_Local_Raise (Handler)
819 and then Local_Raise_Statements (Handler) /= No_Elist
820 then
821 Relmt := First_Elmt (Local_Raise_Statements (Handler));
822 while Present (Relmt) loop
823 Warn_If_No_Propagation (Node (Relmt));
824 Next_Elmt (Relmt);
825 end loop;
826 end if;
828 Next (Handler);
829 end loop;
831 -- Only remaining step is to drop the L3 label and we are done
833 Set_Etype (Identifier (Labl_L3), Standard_Void_Type);
835 -- If we had at least one handler, then we drop the label after
836 -- the last statement of that handler.
838 if Stmts /= No_List then
839 Insert_After_And_Analyze (Last (Stmts), Labl_L3);
841 -- Otherwise we have removed all the handlers (this results from
842 -- use of pragma Restrictions (No_Exception_Propagation), and we
843 -- drop the label at the end of the statements of the HSS.
845 else
846 Insert_After_And_Analyze (Last (Statements (HSS)), Labl_L3);
847 end if;
849 return;
850 end;
851 end Expand_Local_Exception_Handlers;
853 -----------------------------
854 -- Prepend_Call_To_Handler --
855 -----------------------------
857 procedure Prepend_Call_To_Handler
858 (Proc : RE_Id;
859 Args : List_Id := No_List)
861 Ent : constant Entity_Id := RTE (Proc);
863 begin
864 -- If we have no Entity, then we are probably in no run time mode or
865 -- some weird error has occurred. In either case do nothing. Note use
866 -- of No_Location to hide this code from the debugger, so single
867 -- stepping doesn't jump back and forth.
869 if Present (Ent) then
870 declare
871 Call : constant Node_Id :=
872 Make_Procedure_Call_Statement (No_Location,
873 Name => New_Occurrence_Of (RTE (Proc), No_Location),
874 Parameter_Associations => Args);
876 begin
877 Prepend_To (Statements (Handler), Call);
878 Analyze (Call, Suppress => All_Checks);
879 end;
880 end if;
881 end Prepend_Call_To_Handler;
883 ---------------------------
884 -- Replace_Raise_By_Goto --
885 ---------------------------
887 procedure Replace_Raise_By_Goto (Raise_S : Node_Id; Goto_L1 : Node_Id) is
888 Loc : constant Source_Ptr := Sloc (Raise_S);
889 Excep : Entity_Id;
890 LR : Node_Id;
891 Cond : Node_Id;
892 Orig : Node_Id;
894 begin
895 -- If we have a null statement, it means that there is no replacement
896 -- needed (typically this results from a suppressed check).
898 if Nkind (Raise_S) = N_Null_Statement then
899 return;
901 -- Test for Raise_xxx_Error
903 elsif Nkind (Raise_S) = N_Raise_Constraint_Error then
904 Excep := Standard_Constraint_Error;
905 Cond := Condition (Raise_S);
907 elsif Nkind (Raise_S) = N_Raise_Storage_Error then
908 Excep := Standard_Storage_Error;
909 Cond := Condition (Raise_S);
911 elsif Nkind (Raise_S) = N_Raise_Program_Error then
912 Excep := Standard_Program_Error;
913 Cond := Condition (Raise_S);
915 -- The only other possibility is a node that is or used to be a
916 -- simple raise statement.
918 else
919 Orig := Original_Node (Raise_S);
920 pragma Assert (Nkind (Orig) = N_Raise_Statement
921 and then Present (Name (Orig))
922 and then No (Expression (Orig)));
923 Excep := Entity (Name (Orig));
924 Cond := Empty;
925 end if;
927 -- Here Excep is the exception to raise, and Cond is the condition
928 -- First prepare the call to Local_Raise (excep'address).
930 if RTE_Available (RE_Local_Raise) then
931 LR :=
932 Make_Procedure_Call_Statement (Loc,
933 Name => New_Occurrence_Of (RTE (RE_Local_Raise), Loc),
934 Parameter_Associations => New_List (
935 Unchecked_Convert_To (RTE (RE_Address),
936 Make_Attribute_Reference (Loc,
937 Prefix => New_Occurrence_Of (Excep, Loc),
938 Attribute_Name => Name_Identity))));
940 -- Use null statement if Local_Raise not available
942 else
943 LR :=
944 Make_Null_Statement (Loc);
945 end if;
947 -- If there is no condition, we rewrite as
949 -- begin
950 -- Local_Raise (excep'Identity);
951 -- goto L1;
952 -- end;
954 if No (Cond) then
955 Rewrite (Raise_S,
956 Make_Block_Statement (Loc,
957 Handled_Statement_Sequence =>
958 Make_Handled_Sequence_Of_Statements (Loc,
959 Statements => New_List (LR, Goto_L1))));
960 Set_Exception_Junk (Raise_S);
962 -- If there is a condition, we rewrite as
964 -- if condition then
965 -- Local_Raise (excep'Identity);
966 -- goto L1;
967 -- end if;
969 else
970 Rewrite (Raise_S,
971 Make_If_Statement (Loc,
972 Condition => Cond,
973 Then_Statements => New_List (LR, Goto_L1)));
974 end if;
976 Analyze (Raise_S);
977 end Replace_Raise_By_Goto;
979 -- Start of processing for Expand_Exception_Handlers
981 begin
982 Expand_Local_Exception_Handlers;
984 -- Loop through handlers
986 Handler := First_Non_Pragma (Handlrs);
987 Handler_Loop : while Present (Handler) loop
988 Process_Statements_For_Controlled_Objects (Handler);
990 Next_Handler := Next_Non_Pragma (Handler);
992 -- Remove source handler if gnat debug flag .x is set
994 if Debug_Flag_Dot_X and then Comes_From_Source (Handler) then
995 Remove (Handler);
997 -- Remove handler if no exception propagation, generating a warning
998 -- if a source generated handler was not the target of a local raise.
1000 else
1001 if Restriction_Active (No_Exception_Propagation)
1002 and then not Has_Local_Raise (Handler)
1003 and then Comes_From_Source (Handler)
1004 and then Warn_On_Non_Local_Exception
1005 then
1006 Warn_No_Exception_Propagation_Active (Handler);
1007 Error_Msg_N
1008 ("\?X?this handler can never be entered, "
1009 & "and has been removed", Handler);
1010 end if;
1012 if No_Exception_Propagation_Active then
1013 Remove (Handler);
1015 -- Exception handler is active and retained and must be processed
1017 else
1018 -- If an exception occurrence is present, then we must declare
1019 -- it and initialize it from the value stored in the TSD
1021 -- declare
1022 -- name : Exception_Occurrence;
1023 -- begin
1024 -- Save_Occurrence (name, Get_Current_Excep.all)
1025 -- ...
1026 -- end;
1028 -- This expansion is only performed when using front-end
1029 -- exceptions. Gigi will insert a call to initialize the
1030 -- choice parameter.
1032 if Present (Choice_Parameter (Handler))
1033 and then (Front_End_Exceptions
1034 or else CodePeer_Mode)
1035 then
1036 declare
1037 Cparm : constant Entity_Id := Choice_Parameter (Handler);
1038 Cloc : constant Source_Ptr := Sloc (Cparm);
1039 Hloc : constant Source_Ptr := Sloc (Handler);
1040 Save : Node_Id;
1042 begin
1043 -- Note: No_Location used to hide code from the debugger,
1044 -- so single stepping doesn't jump back and forth.
1046 Save :=
1047 Make_Procedure_Call_Statement (No_Location,
1048 Name =>
1049 New_Occurrence_Of
1050 (RTE (RE_Save_Occurrence), No_Location),
1051 Parameter_Associations => New_List (
1052 New_Occurrence_Of (Cparm, No_Location),
1053 Make_Explicit_Dereference (No_Location,
1054 Prefix =>
1055 Make_Function_Call (No_Location,
1056 Name =>
1057 Make_Explicit_Dereference (No_Location,
1058 Prefix =>
1059 New_Occurrence_Of
1060 (RTE (RE_Get_Current_Excep),
1061 No_Location))))));
1063 Mark_Rewrite_Insertion (Save);
1064 Prepend (Save, Statements (Handler));
1066 Obj_Decl :=
1067 Make_Object_Declaration (Cloc,
1068 Defining_Identifier => Cparm,
1069 Object_Definition =>
1070 New_Occurrence_Of
1071 (RTE (RE_Exception_Occurrence), Cloc));
1072 Set_No_Initialization (Obj_Decl, True);
1074 Rewrite (Handler,
1075 Make_Exception_Handler (Hloc,
1076 Choice_Parameter => Empty,
1077 Exception_Choices => Exception_Choices (Handler),
1078 Statements => New_List (
1079 Make_Block_Statement (Hloc,
1080 Declarations => New_List (Obj_Decl),
1081 Handled_Statement_Sequence =>
1082 Make_Handled_Sequence_Of_Statements (Hloc,
1083 Statements => Statements (Handler))))));
1085 -- Local raise statements can't occur, since exception
1086 -- handlers with choice parameters are not allowed when
1087 -- No_Exception_Propagation applies, so set attributes
1088 -- accordingly.
1090 Set_Local_Raise_Statements (Handler, No_Elist);
1091 Set_Local_Raise_Not_OK (Handler);
1093 Analyze_List
1094 (Statements (Handler), Suppress => All_Checks);
1095 end;
1096 end if;
1098 -- For the normal case, we have to worry about the state of
1099 -- abort deferral. Generally, we defer abort during runtime
1100 -- handling of exceptions. When control is passed to the
1101 -- handler, then in the normal case we undefer aborts. In
1102 -- any case this entire handling is relevant only if aborts
1103 -- are allowed.
1105 if Abort_Allowed
1106 and then not ZCX_Exceptions
1107 then
1108 -- There are some special cases in which we do not do the
1109 -- undefer. In particular a finalization (AT END) handler
1110 -- wants to operate with aborts still deferred.
1112 -- We also suppress the call if this is the special handler
1113 -- for Abort_Signal, since if we are aborting, we want to
1114 -- keep aborts deferred (one abort is enough).
1116 -- If abort really needs to be deferred the expander must
1117 -- add this call explicitly, see
1118 -- Expand_N_Asynchronous_Select.
1120 Others_Choice :=
1121 Nkind (First (Exception_Choices (Handler))) =
1122 N_Others_Choice;
1124 if (Others_Choice
1125 or else Entity (First (Exception_Choices (Handler))) /=
1126 Stand.Abort_Signal)
1127 and then not
1128 (Others_Choice
1129 and then
1130 All_Others (First (Exception_Choices (Handler))))
1131 then
1132 Prepend_Call_To_Handler (RE_Abort_Undefer);
1133 end if;
1134 end if;
1135 end if;
1136 end if;
1138 Handler := Next_Handler;
1139 end loop Handler_Loop;
1141 -- If all handlers got removed, then remove the list. Note we cannot
1142 -- reference HSS here, since expanding local handlers may have buried
1143 -- the handlers in an inner block.
1145 if Is_Empty_List (Handlrs) then
1146 Set_Exception_Handlers (Parent (Handlrs), No_List);
1147 end if;
1148 end Expand_Exception_Handlers;
1150 ------------------------------------
1151 -- Expand_N_Exception_Declaration --
1152 ------------------------------------
1154 -- Generates:
1155 -- exceptE : constant String := "A.B.EXCEP"; -- static data
1156 -- except : exception_data :=
1157 -- (Handled_By_Other => False,
1158 -- Lang => 'A',
1159 -- Name_Length => exceptE'Length,
1160 -- Full_Name => exceptE'Address,
1161 -- HTable_Ptr => null,
1162 -- Foreign_Data => null,
1163 -- Raise_Hook => null);
1165 -- (protecting test only needed if not at library level)
1167 -- exceptF : Boolean := True -- static data
1168 -- if exceptF then
1169 -- exceptF := False;
1170 -- Register_Exception (except'Unchecked_Access);
1171 -- end if;
1173 procedure Expand_N_Exception_Declaration (N : Node_Id) is
1174 Id : constant Entity_Id := Defining_Identifier (N);
1175 Loc : constant Source_Ptr := Sloc (N);
1177 procedure Force_Static_Allocation_Of_Referenced_Objects
1178 (Aggregate : Node_Id);
1179 -- A specialized solution to one particular case of an ugly problem
1181 -- The given aggregate includes an Unchecked_Conversion as one of the
1182 -- component values. The call to Analyze_And_Resolve below ends up
1183 -- calling Exp_Ch4.Expand_N_Unchecked_Type_Conversion, which may decide
1184 -- to introduce a (constant) temporary and then obtain the component
1185 -- value by evaluating the temporary.
1187 -- In the case of an exception declared within a subprogram (or any
1188 -- other dynamic scope), this is a bad transformation. The exception
1189 -- object is marked as being Statically_Allocated but the temporary is
1190 -- not. If the initial value of a Statically_Allocated declaration
1191 -- references a dynamically allocated object, this prevents static
1192 -- initialization of the object.
1194 -- We cope with this here by marking the temporary Statically_Allocated.
1195 -- It might seem cleaner to generalize this utility and then use it to
1196 -- enforce a rule that the entities referenced in the declaration of any
1197 -- "hoisted" (i.e., Is_Statically_Allocated and not Is_Library_Level)
1198 -- entity must also be either Library_Level or hoisted. It turns out
1199 -- that this would be incompatible with the current treatment of an
1200 -- object which is local to a subprogram, subject to an Export pragma,
1201 -- not subject to an address clause, and whose declaration contains
1202 -- references to other local (non-hoisted) objects (e.g., in the initial
1203 -- value expression).
1205 function Null_String return String_Id;
1206 -- Build a null-terminated empty string
1208 ---------------------------------------------------
1209 -- Force_Static_Allocation_Of_Referenced_Objects --
1210 ---------------------------------------------------
1212 procedure Force_Static_Allocation_Of_Referenced_Objects
1213 (Aggregate : Node_Id)
1215 function Fixup_Node (N : Node_Id) return Traverse_Result;
1216 -- If the given node references a dynamically allocated object, then
1217 -- correct the declaration of the object.
1219 ----------------
1220 -- Fixup_Node --
1221 ----------------
1223 function Fixup_Node (N : Node_Id) return Traverse_Result is
1224 begin
1225 if Nkind (N) in N_Has_Entity
1226 and then Present (Entity (N))
1227 and then not Is_Library_Level_Entity (Entity (N))
1229 -- Note: the following test is not needed but it seems cleaner
1230 -- to do this test (this would be more important if procedure
1231 -- Force_Static_Allocation_Of_Referenced_Objects recursively
1232 -- traversed the declaration of an entity after marking it as
1233 -- statically allocated).
1235 and then not Is_Statically_Allocated (Entity (N))
1236 then
1237 Set_Is_Statically_Allocated (Entity (N));
1238 end if;
1240 return OK;
1241 end Fixup_Node;
1243 procedure Fixup_Tree is new Traverse_Proc (Fixup_Node);
1245 -- Start of processing for Force_Static_Allocation_Of_Referenced_Objects
1247 begin
1248 Fixup_Tree (Aggregate);
1249 end Force_Static_Allocation_Of_Referenced_Objects;
1251 -----------------
1252 -- Null_String --
1253 -----------------
1255 function Null_String return String_Id is
1256 begin
1257 Start_String;
1258 Store_String_Char (Get_Char_Code (ASCII.NUL));
1259 return End_String;
1260 end Null_String;
1262 -- Local variables
1264 Ex_Id : Entity_Id;
1265 Ex_Val : String_Id;
1266 Flag_Id : Entity_Id;
1267 L : List_Id;
1269 -- Start of processing for Expand_N_Exception_Declaration
1271 begin
1272 -- Nothing to do when generating C code
1274 if Modify_Tree_For_C then
1275 return;
1276 end if;
1278 -- Definition of the external name: nam : constant String := "A.B.NAME";
1280 Ex_Id :=
1281 Make_Defining_Identifier (Loc, New_External_Name (Chars (Id), 'E'));
1283 -- Do not generate an external name if the exception declaration is
1284 -- subject to pragma Discard_Names. Use a null-terminated empty name
1285 -- to ensure that Ada.Exceptions.Exception_Name functions properly.
1287 if Global_Discard_Names or else Discard_Names (Ex_Id) then
1288 Ex_Val := Null_String;
1290 -- Otherwise generate the fully qualified name of the exception
1292 else
1293 Ex_Val := Fully_Qualified_Name_String (Id);
1294 end if;
1296 Insert_Action (N,
1297 Make_Object_Declaration (Loc,
1298 Defining_Identifier => Ex_Id,
1299 Constant_Present => True,
1300 Object_Definition => New_Occurrence_Of (Standard_String, Loc),
1301 Expression => Make_String_Literal (Loc, Ex_Val)));
1303 Set_Is_Statically_Allocated (Ex_Id);
1305 -- Create the aggregate list for type Standard.Exception_Type:
1306 -- Handled_By_Other component: False
1308 L := Empty_List;
1309 Append_To (L, New_Occurrence_Of (Standard_False, Loc));
1311 -- Lang component: 'A'
1313 Append_To (L,
1314 Make_Character_Literal (Loc,
1315 Chars => Name_uA,
1316 Char_Literal_Value => UI_From_Int (Character'Pos ('A'))));
1318 -- Name_Length component: Nam'Length
1320 Append_To (L,
1321 Make_Attribute_Reference (Loc,
1322 Prefix => New_Occurrence_Of (Ex_Id, Loc),
1323 Attribute_Name => Name_Length));
1325 -- Full_Name component: Standard.A_Char!(Nam'Address)
1327 -- The unchecked conversion causes capacity issues for CodePeer in some
1328 -- cases and is never useful, so we set the Full_Name component to null
1329 -- instead for CodePeer.
1331 if CodePeer_Mode then
1332 Append_To (L, Make_Null (Loc));
1333 else
1334 Append_To (L, Unchecked_Convert_To (Standard_A_Char,
1335 Make_Attribute_Reference (Loc,
1336 Prefix => New_Occurrence_Of (Ex_Id, Loc),
1337 Attribute_Name => Name_Address)));
1338 end if;
1340 -- HTable_Ptr component: null
1342 Append_To (L, Make_Null (Loc));
1344 -- Foreign_Data component: null
1346 Append_To (L, Make_Null (Loc));
1348 -- Raise_Hook component: null
1350 Append_To (L, Make_Null (Loc));
1352 Set_Expression (N, Make_Aggregate (Loc, Expressions => L));
1353 Analyze_And_Resolve (Expression (N), Etype (Id));
1355 Force_Static_Allocation_Of_Referenced_Objects (Expression (N));
1357 -- Register_Exception (except'Unchecked_Access);
1359 if not No_Exception_Handlers_Set
1360 and then not Restriction_Active (No_Exception_Registration)
1361 then
1362 L := New_List (
1363 Make_Procedure_Call_Statement (Loc,
1364 Name =>
1365 New_Occurrence_Of (RTE (RE_Register_Exception), Loc),
1366 Parameter_Associations => New_List (
1367 Unchecked_Convert_To (RTE (RE_Exception_Data_Ptr),
1368 Make_Attribute_Reference (Loc,
1369 Prefix => New_Occurrence_Of (Id, Loc),
1370 Attribute_Name => Name_Unrestricted_Access)))));
1372 Set_Register_Exception_Call (Id, First (L));
1374 if not Is_Library_Level_Entity (Id) then
1375 Flag_Id :=
1376 Make_Defining_Identifier (Loc,
1377 Chars => New_External_Name (Chars (Id), 'F'));
1379 Insert_Action (N,
1380 Make_Object_Declaration (Loc,
1381 Defining_Identifier => Flag_Id,
1382 Object_Definition =>
1383 New_Occurrence_Of (Standard_Boolean, Loc),
1384 Expression =>
1385 New_Occurrence_Of (Standard_True, Loc)));
1387 Set_Is_Statically_Allocated (Flag_Id);
1389 Append_To (L,
1390 Make_Assignment_Statement (Loc,
1391 Name => New_Occurrence_Of (Flag_Id, Loc),
1392 Expression => New_Occurrence_Of (Standard_False, Loc)));
1394 Insert_After_And_Analyze (N,
1395 Make_Implicit_If_Statement (N,
1396 Condition => New_Occurrence_Of (Flag_Id, Loc),
1397 Then_Statements => L));
1399 else
1400 Insert_List_After_And_Analyze (N, L);
1401 end if;
1402 end if;
1403 end Expand_N_Exception_Declaration;
1405 ---------------------------------------------
1406 -- Expand_N_Handled_Sequence_Of_Statements --
1407 ---------------------------------------------
1409 procedure Expand_N_Handled_Sequence_Of_Statements (N : Node_Id) is
1410 begin
1411 -- Expand exception handlers
1413 if Present (Exception_Handlers (N))
1414 and then not Restriction_Active (No_Exception_Handlers)
1415 then
1416 Expand_Exception_Handlers (N);
1417 end if;
1419 -- If local exceptions are being expanded, the previous call will
1420 -- have rewritten the construct as a block and reanalyzed it. No
1421 -- further expansion is needed.
1423 if Analyzed (N) then
1424 return;
1425 end if;
1427 -- Add clean up actions if required
1429 if not Nkind_In (Parent (N), N_Package_Body,
1430 N_Accept_Statement,
1431 N_Extended_Return_Statement)
1432 and then not Delay_Cleanups (Current_Scope)
1434 -- No cleanup action needed in thunks associated with interfaces
1435 -- because they only displace the pointer to the object.
1437 and then not Is_Thunk (Current_Scope)
1438 then
1439 Expand_Cleanup_Actions (Parent (N));
1440 else
1441 Set_First_Real_Statement (N, First (Statements (N)));
1442 end if;
1443 end Expand_N_Handled_Sequence_Of_Statements;
1445 -------------------------------------
1446 -- Expand_N_Raise_Constraint_Error --
1447 -------------------------------------
1449 procedure Expand_N_Raise_Constraint_Error (N : Node_Id) is
1450 begin
1451 -- We adjust the condition to deal with the C/Fortran boolean case. This
1452 -- may well not be necessary, as all such conditions are generated by
1453 -- the expander and probably are all standard boolean, but who knows
1454 -- what strange optimization in future may require this adjustment.
1456 Adjust_Condition (Condition (N));
1458 -- Now deal with possible local raise handling
1460 Possible_Local_Raise (N, Standard_Constraint_Error);
1461 end Expand_N_Raise_Constraint_Error;
1463 -------------------------------
1464 -- Expand_N_Raise_Expression --
1465 -------------------------------
1467 procedure Expand_N_Raise_Expression (N : Node_Id) is
1468 Loc : constant Source_Ptr := Sloc (N);
1469 Typ : constant Entity_Id := Etype (N);
1470 RCE : Node_Id;
1472 begin
1473 Possible_Local_Raise (N, Entity (Name (N)));
1475 -- Later we must teach the back end/gigi how to deal with this, but
1476 -- for now we will assume the type is Standard_Boolean and transform
1477 -- the node to:
1479 -- do
1480 -- raise X [with string]
1481 -- in
1482 -- raise Constraint_Error;
1484 -- unless the flag Convert_To_Return_False is set, in which case
1485 -- the transformation is to:
1487 -- do
1488 -- return False;
1489 -- in
1490 -- raise Constraint_Error;
1492 -- The raise constraint error can never be executed. It is just a dummy
1493 -- node that can be labeled with an arbitrary type.
1495 RCE := Make_Raise_Constraint_Error (Loc, Reason => CE_Explicit_Raise);
1496 Set_Etype (RCE, Typ);
1498 if Convert_To_Return_False (N) then
1499 Rewrite (N,
1500 Make_Expression_With_Actions (Loc,
1501 Actions => New_List (
1502 Make_Simple_Return_Statement (Loc,
1503 Expression => New_Occurrence_Of (Standard_False, Loc))),
1504 Expression => RCE));
1506 else
1507 Rewrite (N,
1508 Make_Expression_With_Actions (Loc,
1509 Actions => New_List (
1510 Make_Raise_Statement (Loc,
1511 Name => Name (N),
1512 Expression => Expression (N))),
1513 Expression => RCE));
1514 end if;
1516 Analyze_And_Resolve (N, Typ);
1517 end Expand_N_Raise_Expression;
1519 ----------------------------------
1520 -- Expand_N_Raise_Program_Error --
1521 ----------------------------------
1523 procedure Expand_N_Raise_Program_Error (N : Node_Id) is
1524 begin
1525 -- We adjust the condition to deal with the C/Fortran boolean case. This
1526 -- may well not be necessary, as all such conditions are generated by
1527 -- the expander and probably are all standard boolean, but who knows
1528 -- what strange optimization in future may require this adjustment.
1530 Adjust_Condition (Condition (N));
1532 -- Now deal with possible local raise handling
1534 Possible_Local_Raise (N, Standard_Program_Error);
1535 end Expand_N_Raise_Program_Error;
1537 ------------------------------
1538 -- Expand_N_Raise_Statement --
1539 ------------------------------
1541 procedure Expand_N_Raise_Statement (N : Node_Id) is
1542 Loc : constant Source_Ptr := Sloc (N);
1543 Ehand : Node_Id;
1544 E : Entity_Id;
1545 Str : String_Id;
1546 H : Node_Id;
1547 Src : Boolean;
1549 begin
1550 -- Processing for locally handled exception (exclude reraise case)
1552 if Present (Name (N)) and then Nkind (Name (N)) = N_Identifier then
1553 if Debug_Flag_Dot_G
1554 or else Restriction_Active (No_Exception_Propagation)
1555 then
1556 -- If we have a local handler, then note that this is potentially
1557 -- able to be transformed into a goto statement.
1559 H := Find_Local_Handler (Entity (Name (N)), N);
1561 if Present (H) then
1562 if Local_Raise_Statements (H) = No_Elist then
1563 Set_Local_Raise_Statements (H, New_Elmt_List);
1564 end if;
1566 -- Append the new entry if it is not there already. Sometimes
1567 -- we have situations where due to reexpansion, the same node
1568 -- is analyzed twice and would otherwise be added twice.
1570 Append_Unique_Elmt (N, Local_Raise_Statements (H));
1571 Set_Has_Local_Raise (H);
1573 -- If no local handler, then generate no propagation warning
1575 else
1576 Warn_If_No_Propagation (N);
1577 end if;
1579 end if;
1580 end if;
1582 -- If a string expression is present, then the raise statement is
1583 -- converted to a call:
1584 -- Raise_Exception (exception-name'Identity, string);
1585 -- and there is nothing else to do.
1587 if Present (Expression (N)) then
1589 -- Adjust message to deal with Prefix_Exception_Messages. We only
1590 -- add the prefix to string literals, if the message is being
1591 -- constructed, we assume it already deals with uniqueness.
1593 if Prefix_Exception_Messages
1594 and then Nkind (Expression (N)) = N_String_Literal
1595 then
1596 declare
1597 Buf : Bounded_String;
1598 begin
1599 Add_Source_Info (Buf, Loc, Name_Enclosing_Entity);
1600 Append (Buf, ": ");
1601 Append (Buf, Strval (Expression (N)));
1602 Rewrite (Expression (N), Make_String_Literal (Loc, +Buf));
1603 Analyze_And_Resolve (Expression (N), Standard_String);
1604 end;
1605 end if;
1607 -- Avoid passing exception-name'identity in runtimes in which this
1608 -- argument is not used. This avoids generating undefined references
1609 -- to these exceptions when compiling with no optimization
1611 if Configurable_Run_Time_On_Target
1612 and then (Restriction_Active (No_Exception_Handlers)
1613 or else
1614 Restriction_Active (No_Exception_Propagation))
1615 then
1616 Rewrite (N,
1617 Make_Procedure_Call_Statement (Loc,
1618 Name => New_Occurrence_Of (RTE (RE_Raise_Exception), Loc),
1619 Parameter_Associations => New_List (
1620 New_Occurrence_Of (RTE (RE_Null_Id), Loc),
1621 Expression (N))));
1622 else
1623 Rewrite (N,
1624 Make_Procedure_Call_Statement (Loc,
1625 Name => New_Occurrence_Of (RTE (RE_Raise_Exception), Loc),
1626 Parameter_Associations => New_List (
1627 Make_Attribute_Reference (Loc,
1628 Prefix => Name (N),
1629 Attribute_Name => Name_Identity),
1630 Expression (N))));
1631 end if;
1633 Analyze (N);
1634 return;
1635 end if;
1637 -- Remaining processing is for the case where no string expression is
1638 -- present.
1640 -- Don't expand a raise statement that does not come from source if we
1641 -- have already had configurable run-time violations, since most likely
1642 -- it will be junk cascaded nonsense.
1644 if Configurable_Run_Time_Violations > 0
1645 and then not Comes_From_Source (N)
1646 then
1647 return;
1648 end if;
1650 -- Convert explicit raise of Program_Error, Constraint_Error, and
1651 -- Storage_Error into the corresponding raise (in High_Integrity_Mode
1652 -- all other raises will get normal expansion and be disallowed,
1653 -- but this is also faster in all modes). Propagate Comes_From_Source
1654 -- flag to the new node.
1656 if Present (Name (N)) and then Nkind (Name (N)) = N_Identifier then
1657 Src := Comes_From_Source (N);
1659 if Entity (Name (N)) = Standard_Constraint_Error then
1660 Rewrite (N,
1661 Make_Raise_Constraint_Error (Loc, Reason => CE_Explicit_Raise));
1662 Set_Comes_From_Source (N, Src);
1663 Analyze (N);
1664 return;
1666 elsif Entity (Name (N)) = Standard_Program_Error then
1667 Rewrite (N,
1668 Make_Raise_Program_Error (Loc, Reason => PE_Explicit_Raise));
1669 Set_Comes_From_Source (N, Src);
1670 Analyze (N);
1671 return;
1673 elsif Entity (Name (N)) = Standard_Storage_Error then
1674 Rewrite (N,
1675 Make_Raise_Storage_Error (Loc, Reason => SE_Explicit_Raise));
1676 Set_Comes_From_Source (N, Src);
1677 Analyze (N);
1678 return;
1679 end if;
1680 end if;
1682 -- Case of name present, in this case we expand raise name to
1684 -- Raise_Exception (name'Identity, location_string);
1686 -- where location_string identifies the file/line of the raise
1688 if Present (Name (N)) then
1689 declare
1690 Id : Entity_Id := Entity (Name (N));
1691 Buf : Bounded_String;
1693 begin
1694 Build_Location_String (Buf, Loc);
1696 -- If the exception is a renaming, use the exception that it
1697 -- renames (which might be a predefined exception, e.g.).
1699 if Present (Renamed_Object (Id)) then
1700 Id := Renamed_Object (Id);
1701 end if;
1703 -- Build a C-compatible string in case of no exception handlers,
1704 -- since this is what the last chance handler is expecting.
1706 if No_Exception_Handlers_Set then
1708 -- Generate an empty message if configuration pragma
1709 -- Suppress_Exception_Locations is set for this unit.
1711 if Opt.Exception_Locations_Suppressed then
1712 Buf.Length := 0;
1713 end if;
1715 Append (Buf, ASCII.NUL);
1716 end if;
1718 if Opt.Exception_Locations_Suppressed then
1719 Buf.Length := 0;
1720 end if;
1722 Str := String_From_Name_Buffer (Buf);
1724 -- Convert raise to call to the Raise_Exception routine
1726 Rewrite (N,
1727 Make_Procedure_Call_Statement (Loc,
1728 Name =>
1729 New_Occurrence_Of (RTE (RE_Raise_Exception), Loc),
1730 Parameter_Associations => New_List (
1731 Make_Attribute_Reference (Loc,
1732 Prefix => Name (N),
1733 Attribute_Name => Name_Identity),
1734 Make_String_Literal (Loc, Strval => Str))));
1735 end;
1737 -- Case of no name present (reraise). We rewrite the raise to:
1739 -- Reraise_Occurrence_Always (EO);
1741 -- where EO is the current exception occurrence. If the current handler
1742 -- does not have a choice parameter specification, then we provide one.
1744 else
1745 -- Bypass expansion to a run-time call when back-end exception
1746 -- handling is active, unless the target is CodePeer or GNATprove.
1747 -- In CodePeer, raising an exception is treated as an error, while in
1748 -- GNATprove all code with exceptions falls outside the subset of
1749 -- code which can be formally analyzed.
1751 if not CodePeer_Mode
1752 and then Back_End_Exceptions
1753 then
1754 return;
1755 end if;
1757 -- Find innermost enclosing exception handler (there must be one,
1758 -- since the semantics has already verified that this raise statement
1759 -- is valid, and a raise with no arguments is only permitted in the
1760 -- context of an exception handler.
1762 Ehand := Parent (N);
1763 while Nkind (Ehand) /= N_Exception_Handler loop
1764 Ehand := Parent (Ehand);
1765 end loop;
1767 -- Make exception choice parameter if none present. Note that we do
1768 -- not need to put the entity on the entity chain, since no one will
1769 -- be referencing this entity by normal visibility methods.
1771 if No (Choice_Parameter (Ehand)) then
1772 E := Make_Temporary (Loc, 'E');
1773 Set_Choice_Parameter (Ehand, E);
1774 Set_Ekind (E, E_Variable);
1775 Set_Etype (E, RTE (RE_Exception_Occurrence));
1776 Set_Scope (E, Current_Scope);
1777 end if;
1779 -- Now rewrite the raise as a call to Reraise. A special case arises
1780 -- if this raise statement occurs in the context of a handler for
1781 -- all others (i.e. an at end handler). in this case we avoid
1782 -- the call to defer abort, cleanup routines are expected to be
1783 -- called in this case with aborts deferred.
1785 declare
1786 Ech : constant Node_Id := First (Exception_Choices (Ehand));
1787 Ent : Entity_Id;
1789 begin
1790 if Nkind (Ech) = N_Others_Choice
1791 and then All_Others (Ech)
1792 then
1793 Ent := RTE (RE_Reraise_Occurrence_No_Defer);
1794 else
1795 Ent := RTE (RE_Reraise_Occurrence_Always);
1796 end if;
1798 Rewrite (N,
1799 Make_Procedure_Call_Statement (Loc,
1800 Name => New_Occurrence_Of (Ent, Loc),
1801 Parameter_Associations => New_List (
1802 New_Occurrence_Of (Choice_Parameter (Ehand), Loc))));
1803 end;
1804 end if;
1806 Analyze (N);
1807 end Expand_N_Raise_Statement;
1809 ----------------------------------
1810 -- Expand_N_Raise_Storage_Error --
1811 ----------------------------------
1813 procedure Expand_N_Raise_Storage_Error (N : Node_Id) is
1814 begin
1815 -- We adjust the condition to deal with the C/Fortran boolean case. This
1816 -- may well not be necessary, as all such conditions are generated by
1817 -- the expander and probably are all standard boolean, but who knows
1818 -- what strange optimization in future may require this adjustment.
1820 Adjust_Condition (Condition (N));
1822 -- Now deal with possible local raise handling
1824 Possible_Local_Raise (N, Standard_Storage_Error);
1825 end Expand_N_Raise_Storage_Error;
1827 --------------------------
1828 -- Possible_Local_Raise --
1829 --------------------------
1831 procedure Possible_Local_Raise (N : Node_Id; E : Entity_Id) is
1832 begin
1833 -- Nothing to do if local raise optimization not active
1835 if not Debug_Flag_Dot_G
1836 and then not Restriction_Active (No_Exception_Propagation)
1837 then
1838 return;
1839 end if;
1841 -- Nothing to do if original node was an explicit raise, because in
1842 -- that case, we already generated the required warning for the raise.
1844 if Nkind (Original_Node (N)) = N_Raise_Statement then
1845 return;
1846 end if;
1848 -- Otherwise see if we have a local handler for the exception
1850 declare
1851 H : constant Node_Id := Find_Local_Handler (E, N);
1853 begin
1854 -- If so, mark that it has a local raise
1856 if Present (H) then
1857 Set_Has_Local_Raise (H, True);
1859 -- Otherwise, if the No_Exception_Propagation restriction is active
1860 -- and the warning is enabled, generate the appropriate warnings.
1862 elsif Warn_On_Non_Local_Exception
1863 and then Restriction_Active (No_Exception_Propagation)
1864 then
1865 Warn_No_Exception_Propagation_Active (N);
1867 if Configurable_Run_Time_Mode then
1868 Error_Msg_NE
1869 ("\?X?& may call Last_Chance_Handler", N, E);
1870 else
1871 Error_Msg_NE
1872 ("\?X?& may result in unhandled exception", N, E);
1873 end if;
1874 end if;
1875 end;
1876 end Possible_Local_Raise;
1878 ------------------------
1879 -- Find_Local_Handler --
1880 ------------------------
1882 function Find_Local_Handler
1883 (Ename : Entity_Id;
1884 Nod : Node_Id) return Node_Id
1886 N : Node_Id;
1887 P : Node_Id;
1888 H : Node_Id;
1889 C : Node_Id;
1891 SSE : Scope_Stack_Entry renames Scope_Stack.Table (Scope_Stack.Last);
1892 -- This is used to test for wrapped actions below
1894 ERaise : Entity_Id;
1895 EHandle : Entity_Id;
1896 -- The entity Id's for the exception we are raising and handling, using
1897 -- the renamed exception if a Renamed_Entity is present.
1899 begin
1900 -- Never any local handler if all handlers removed
1902 if Debug_Flag_Dot_X then
1903 return Empty;
1904 end if;
1906 -- Get the exception we are raising, allowing for renaming
1908 ERaise := Get_Renamed_Entity (Ename);
1910 -- We need to check if the node we are looking at is contained in
1913 -- Loop to search up the tree
1915 N := Nod;
1916 loop
1917 P := Parent (N);
1919 -- If we get to the top of the tree, or to a subprogram, task, entry,
1920 -- protected body, or accept statement without having found a
1921 -- matching handler, then there is no local handler.
1923 if No (P)
1924 or else Nkind (P) = N_Subprogram_Body
1925 or else Nkind (P) = N_Task_Body
1926 or else Nkind (P) = N_Protected_Body
1927 or else Nkind (P) = N_Entry_Body
1928 or else Nkind (P) = N_Accept_Statement
1929 then
1930 return Empty;
1932 -- Test for handled sequence of statements with at least one
1933 -- exception handler which might be the one we are looking for.
1935 elsif Nkind (P) = N_Handled_Sequence_Of_Statements
1936 and then Present (Exception_Handlers (P))
1937 then
1938 -- Before we proceed we need to check if the node N is covered
1939 -- by the statement part of P rather than one of its exception
1940 -- handlers (an exception handler obviously does not cover its
1941 -- own statements).
1943 -- This test is more delicate than might be thought. It is not
1944 -- just a matter of checking the Statements (P), because the node
1945 -- might be waiting to be wrapped in a transient scope, in which
1946 -- case it will end up in the block statements, even though it
1947 -- is not there now.
1949 if Is_List_Member (N) then
1950 declare
1951 LCN : constant List_Id := List_Containing (N);
1953 begin
1954 if LCN = Statements (P)
1955 or else
1956 LCN = SSE.Actions_To_Be_Wrapped (Before)
1957 or else
1958 LCN = SSE.Actions_To_Be_Wrapped (After)
1959 or else
1960 LCN = SSE.Actions_To_Be_Wrapped (Cleanup)
1961 then
1962 -- Loop through exception handlers
1964 H := First (Exception_Handlers (P));
1965 while Present (H) loop
1967 -- Guard against other constructs appearing in the
1968 -- list of exception handlers.
1970 if Nkind (H) = N_Exception_Handler then
1972 -- Loop through choices in one handler
1974 C := First (Exception_Choices (H));
1975 while Present (C) loop
1977 -- Deal with others case
1979 if Nkind (C) = N_Others_Choice then
1981 -- Matching others handler, but we need
1982 -- to ensure there is no choice parameter.
1983 -- If there is, then we don't have a local
1984 -- handler after all (since we do not allow
1985 -- choice parameters for local handlers).
1987 if No (Choice_Parameter (H)) then
1988 return H;
1989 else
1990 return Empty;
1991 end if;
1993 -- If not others must be entity name
1995 elsif Nkind (C) /= N_Others_Choice then
1996 pragma Assert (Is_Entity_Name (C));
1997 pragma Assert (Present (Entity (C)));
1999 -- Get exception being handled, dealing with
2000 -- renaming.
2002 EHandle := Get_Renamed_Entity (Entity (C));
2004 -- If match, then check choice parameter
2006 if ERaise = EHandle then
2007 if No (Choice_Parameter (H)) then
2008 return H;
2009 else
2010 return Empty;
2011 end if;
2012 end if;
2013 end if;
2015 Next (C);
2016 end loop;
2017 end if;
2019 Next (H);
2020 end loop;
2021 end if;
2022 end;
2023 end if;
2024 end if;
2026 N := P;
2027 end loop;
2028 end Find_Local_Handler;
2030 ---------------------------------
2031 -- Get_Local_Raise_Call_Entity --
2032 ---------------------------------
2034 -- Note: this is primarily provided for use by the back end in generating
2035 -- calls to Local_Raise. But it would be too late in the back end to call
2036 -- RTE if this actually caused a load/analyze of the unit. So what we do
2037 -- is to ensure there is a dummy call to this function during front end
2038 -- processing so that the unit gets loaded then, and not later.
2040 Local_Raise_Call_Entity : Entity_Id;
2041 Local_Raise_Call_Entity_Set : Boolean := False;
2043 function Get_Local_Raise_Call_Entity return Entity_Id is
2044 begin
2045 if not Local_Raise_Call_Entity_Set then
2046 Local_Raise_Call_Entity_Set := True;
2048 if RTE_Available (RE_Local_Raise) then
2049 Local_Raise_Call_Entity := RTE (RE_Local_Raise);
2050 else
2051 Local_Raise_Call_Entity := Empty;
2052 end if;
2053 end if;
2055 return Local_Raise_Call_Entity;
2056 end Get_Local_Raise_Call_Entity;
2058 -----------------------------
2059 -- Get_RT_Exception_Entity --
2060 -----------------------------
2062 function Get_RT_Exception_Entity (R : RT_Exception_Code) return Entity_Id is
2063 begin
2064 case Rkind (R) is
2065 when CE_Reason => return Standard_Constraint_Error;
2066 when PE_Reason => return Standard_Program_Error;
2067 when SE_Reason => return Standard_Storage_Error;
2068 end case;
2069 end Get_RT_Exception_Entity;
2071 ---------------------------
2072 -- Get_RT_Exception_Name --
2073 ---------------------------
2075 procedure Get_RT_Exception_Name (Code : RT_Exception_Code) is
2076 begin
2077 case Code is
2078 when CE_Access_Check_Failed =>
2079 Add_Str_To_Name_Buffer ("CE_Access_Check");
2080 when CE_Access_Parameter_Is_Null =>
2081 Add_Str_To_Name_Buffer ("CE_Null_Access_Parameter");
2082 when CE_Discriminant_Check_Failed =>
2083 Add_Str_To_Name_Buffer ("CE_Discriminant_Check");
2084 when CE_Divide_By_Zero =>
2085 Add_Str_To_Name_Buffer ("CE_Divide_By_Zero");
2086 when CE_Explicit_Raise =>
2087 Add_Str_To_Name_Buffer ("CE_Explicit_Raise");
2088 when CE_Index_Check_Failed =>
2089 Add_Str_To_Name_Buffer ("CE_Index_Check");
2090 when CE_Invalid_Data =>
2091 Add_Str_To_Name_Buffer ("CE_Invalid_Data");
2092 when CE_Length_Check_Failed =>
2093 Add_Str_To_Name_Buffer ("CE_Length_Check");
2094 when CE_Null_Exception_Id =>
2095 Add_Str_To_Name_Buffer ("CE_Null_Exception_Id");
2096 when CE_Null_Not_Allowed =>
2097 Add_Str_To_Name_Buffer ("CE_Null_Not_Allowed");
2098 when CE_Overflow_Check_Failed =>
2099 Add_Str_To_Name_Buffer ("CE_Overflow_Check");
2100 when CE_Partition_Check_Failed =>
2101 Add_Str_To_Name_Buffer ("CE_Partition_Check");
2102 when CE_Range_Check_Failed =>
2103 Add_Str_To_Name_Buffer ("CE_Range_Check");
2104 when CE_Tag_Check_Failed =>
2105 Add_Str_To_Name_Buffer ("CE_Tag_Check");
2107 when PE_Access_Before_Elaboration =>
2108 Add_Str_To_Name_Buffer ("PE_Access_Before_Elaboration");
2109 when PE_Accessibility_Check_Failed =>
2110 Add_Str_To_Name_Buffer ("PE_Accessibility_Check");
2111 when PE_Address_Of_Intrinsic =>
2112 Add_Str_To_Name_Buffer ("PE_Address_Of_Intrinsic");
2113 when PE_Aliased_Parameters =>
2114 Add_Str_To_Name_Buffer ("PE_Aliased_Parameters");
2115 when PE_All_Guards_Closed =>
2116 Add_Str_To_Name_Buffer ("PE_All_Guards_Closed");
2117 when PE_Bad_Predicated_Generic_Type =>
2118 Add_Str_To_Name_Buffer ("PE_Bad_Predicated_Generic_Type");
2119 when PE_Current_Task_In_Entry_Body =>
2120 Add_Str_To_Name_Buffer ("PE_Current_Task_In_Entry_Body");
2121 when PE_Duplicated_Entry_Address =>
2122 Add_Str_To_Name_Buffer ("PE_Duplicated_Entry_Address");
2123 when PE_Explicit_Raise =>
2124 Add_Str_To_Name_Buffer ("PE_Explicit_Raise");
2125 when PE_Finalize_Raised_Exception =>
2126 Add_Str_To_Name_Buffer ("PE_Finalize_Raised_Exception");
2127 when PE_Implicit_Return =>
2128 Add_Str_To_Name_Buffer ("PE_Implicit_Return");
2129 when PE_Misaligned_Address_Value =>
2130 Add_Str_To_Name_Buffer ("PE_Misaligned_Address_Value");
2131 when PE_Missing_Return =>
2132 Add_Str_To_Name_Buffer ("PE_Missing_Return");
2133 when PE_Non_Transportable_Actual =>
2134 Add_Str_To_Name_Buffer ("PE_Non_Transportable_Actual");
2135 when PE_Overlaid_Controlled_Object =>
2136 Add_Str_To_Name_Buffer ("PE_Overlaid_Controlled_Object");
2137 when PE_Potentially_Blocking_Operation =>
2138 Add_Str_To_Name_Buffer ("PE_Potentially_Blocking_Operation");
2139 when PE_Stream_Operation_Not_Allowed =>
2140 Add_Str_To_Name_Buffer ("PE_Stream_Operation_Not_Allowed");
2141 when PE_Stubbed_Subprogram_Called =>
2142 Add_Str_To_Name_Buffer ("PE_Stubbed_Subprogram_Called");
2143 when PE_Unchecked_Union_Restriction =>
2144 Add_Str_To_Name_Buffer ("PE_Unchecked_Union_Restriction");
2146 when SE_Empty_Storage_Pool =>
2147 Add_Str_To_Name_Buffer ("SE_Empty_Storage_Pool");
2148 when SE_Explicit_Raise =>
2149 Add_Str_To_Name_Buffer ("SE_Explicit_Raise");
2150 when SE_Infinite_Recursion =>
2151 Add_Str_To_Name_Buffer ("SE_Infinite_Recursion");
2152 when SE_Object_Too_Large =>
2153 Add_Str_To_Name_Buffer ("SE_Object_Too_Large");
2154 end case;
2155 end Get_RT_Exception_Name;
2157 ----------------------------
2158 -- Warn_If_No_Propagation --
2159 ----------------------------
2161 procedure Warn_If_No_Propagation (N : Node_Id) is
2162 begin
2163 if Restriction_Check_Required (No_Exception_Propagation)
2164 and then Warn_On_Non_Local_Exception
2165 then
2166 Warn_No_Exception_Propagation_Active (N);
2168 if Configurable_Run_Time_Mode then
2169 Error_Msg_N
2170 ("\?X?Last_Chance_Handler will be called on exception", N);
2171 else
2172 Error_Msg_N
2173 ("\?X?execution may raise unhandled exception", N);
2174 end if;
2175 end if;
2176 end Warn_If_No_Propagation;
2178 ------------------------------------------
2179 -- Warn_No_Exception_Propagation_Active --
2180 ------------------------------------------
2182 procedure Warn_No_Exception_Propagation_Active (N : Node_Id) is
2183 begin
2184 Error_Msg_N
2185 ("?X?pragma Restrictions (No_Exception_Propagation) in effect", N);
2186 end Warn_No_Exception_Propagation_Active;
2188 end Exp_Ch11;