Implement -mmemcpy-strategy= and -mmemset-strategy= options
[official-gcc.git] / gcc / ada / sem_ch11.adb
blob180ecc6ca0b23a07d44ced0ec257a3df811d4b3f
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- S E M _ C H 1 1 --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 1992-2013, 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 Checks; use Checks;
28 with Einfo; use Einfo;
29 with Errout; use Errout;
30 with Lib; use Lib;
31 with Lib.Xref; use Lib.Xref;
32 with Namet; use Namet;
33 with Nlists; use Nlists;
34 with Nmake; use Nmake;
35 with Opt; use Opt;
36 with Restrict; use Restrict;
37 with Rident; use Rident;
38 with Rtsfind; use Rtsfind;
39 with Sem; use Sem;
40 with Sem_Ch5; use Sem_Ch5;
41 with Sem_Ch8; use Sem_Ch8;
42 with Sem_Ch13; use Sem_Ch13;
43 with Sem_Res; use Sem_Res;
44 with Sem_Util; use Sem_Util;
45 with Sem_Warn; use Sem_Warn;
46 with Sinfo; use Sinfo;
47 with Stand; use Stand;
48 with Uintp; use Uintp;
50 package body Sem_Ch11 is
52 -----------------------------------
53 -- Analyze_Exception_Declaration --
54 -----------------------------------
56 procedure Analyze_Exception_Declaration (N : Node_Id) is
57 Id : constant Entity_Id := Defining_Identifier (N);
58 PF : constant Boolean := Is_Pure (Current_Scope);
59 begin
60 Generate_Definition (Id);
61 Enter_Name (Id);
62 Set_Ekind (Id, E_Exception);
63 Set_Exception_Code (Id, Uint_0);
64 Set_Etype (Id, Standard_Exception_Type);
65 Set_Is_Statically_Allocated (Id);
66 Set_Is_Pure (Id, PF);
68 if Has_Aspects (N) then
69 Analyze_Aspect_Specifications (N, Id);
70 end if;
71 end Analyze_Exception_Declaration;
73 --------------------------------
74 -- Analyze_Exception_Handlers --
75 --------------------------------
77 procedure Analyze_Exception_Handlers (L : List_Id) is
78 Handler : Node_Id;
79 Choice : Entity_Id;
80 Id : Node_Id;
81 H_Scope : Entity_Id := Empty;
83 procedure Check_Duplication (Id : Node_Id);
84 -- Iterate through the identifiers in each handler to find duplicates
86 function Others_Present return Boolean;
87 -- Returns True if others handler is present
89 -----------------------
90 -- Check_Duplication --
91 -----------------------
93 procedure Check_Duplication (Id : Node_Id) is
94 Handler : Node_Id;
95 Id1 : Node_Id;
96 Id_Entity : Entity_Id := Entity (Id);
98 begin
99 if Present (Renamed_Entity (Id_Entity)) then
100 Id_Entity := Renamed_Entity (Id_Entity);
101 end if;
103 Handler := First_Non_Pragma (L);
104 while Present (Handler) loop
105 Id1 := First (Exception_Choices (Handler));
106 while Present (Id1) loop
108 -- Only check against the exception choices which precede
109 -- Id in the handler, since the ones that follow Id have not
110 -- been analyzed yet and will be checked in a subsequent call.
112 if Id = Id1 then
113 return;
115 elsif Nkind (Id1) /= N_Others_Choice
116 and then
117 (Id_Entity = Entity (Id1)
118 or else (Id_Entity = Renamed_Entity (Entity (Id1))))
119 then
120 if Handler /= Parent (Id) then
121 Error_Msg_Sloc := Sloc (Id1);
122 Error_Msg_NE
123 ("exception choice duplicates &#", Id, Id1);
125 else
126 if Ada_Version = Ada_83
127 and then Comes_From_Source (Id)
128 then
129 Error_Msg_N
130 ("(Ada 83): duplicate exception choice&", Id);
131 end if;
132 end if;
133 end if;
135 Next_Non_Pragma (Id1);
136 end loop;
138 Next (Handler);
139 end loop;
140 end Check_Duplication;
142 --------------------
143 -- Others_Present --
144 --------------------
146 function Others_Present return Boolean is
147 H : Node_Id;
149 begin
150 H := First (L);
151 while Present (H) loop
152 if Nkind (H) /= N_Pragma
153 and then Nkind (First (Exception_Choices (H))) = N_Others_Choice
154 then
155 return True;
156 end if;
158 Next (H);
159 end loop;
161 return False;
162 end Others_Present;
164 -- Start of processing for Analyze_Exception_Handlers
166 begin
167 Handler := First (L);
168 Check_Restriction (No_Exceptions, Handler);
169 Check_Restriction (No_Exception_Handlers, Handler);
171 -- Kill current remembered values, since we don't know where we were
172 -- when the exception was raised.
174 Kill_Current_Values;
176 -- Loop through handlers (which can include pragmas)
178 while Present (Handler) loop
180 -- If pragma just analyze it
182 if Nkind (Handler) = N_Pragma then
183 Analyze (Handler);
185 -- Otherwise we have a real exception handler
187 else
188 -- Deal with choice parameter. The exception handler is a
189 -- declarative part for the choice parameter, so it constitutes a
190 -- scope for visibility purposes. We create an entity to denote
191 -- the whole exception part, and use it as the scope of all the
192 -- choices, which may even have the same name without conflict.
193 -- This scope plays no other role in expansion or code generation.
195 Choice := Choice_Parameter (Handler);
197 if Present (Choice) then
198 Set_Local_Raise_Not_OK (Handler);
200 if Comes_From_Source (Choice) then
201 Check_Restriction (No_Exception_Propagation, Choice);
202 end if;
204 if No (H_Scope) then
205 H_Scope :=
206 New_Internal_Entity
207 (E_Block, Current_Scope, Sloc (Choice), 'E');
208 end if;
210 Push_Scope (H_Scope);
211 Set_Etype (H_Scope, Standard_Void_Type);
213 Enter_Name (Choice);
214 Set_Ekind (Choice, E_Variable);
216 if RTE_Available (RE_Exception_Occurrence) then
217 Set_Etype (Choice, RTE (RE_Exception_Occurrence));
218 end if;
220 Generate_Definition (Choice);
222 -- Indicate that choice has an initial value, since in effect
223 -- this field is assigned an initial value by the exception.
224 -- We also consider that it is modified in the source.
226 Set_Has_Initial_Value (Choice, True);
227 Set_Never_Set_In_Source (Choice, False);
228 end if;
230 Id := First (Exception_Choices (Handler));
231 while Present (Id) loop
232 if Nkind (Id) = N_Others_Choice then
233 if Present (Next (Id))
234 or else Present (Next (Handler))
235 or else Present (Prev (Id))
236 then
237 Error_Msg_N ("OTHERS must appear alone and last", Id);
238 end if;
240 else
241 Analyze (Id);
243 -- In most cases the choice has already been analyzed in
244 -- Analyze_Handled_Statement_Sequence, in order to expand
245 -- local handlers. This advance analysis does not take into
246 -- account the case in which a choice has the same name as
247 -- the choice parameter of the handler, which may hide an
248 -- outer exception. This pathological case appears in ACATS
249 -- B80001_3.adb, and requires an explicit check to verify
250 -- that the id is not hidden.
252 if not Is_Entity_Name (Id)
253 or else Ekind (Entity (Id)) /= E_Exception
254 or else
255 (Nkind (Id) = N_Identifier
256 and then Chars (Id) = Chars (Choice))
257 then
258 Error_Msg_N ("exception name expected", Id);
260 else
261 -- Emit a warning at the declaration level when a local
262 -- exception is never raised explicitly.
264 if Warn_On_Redundant_Constructs
265 and then not Is_Raised (Entity (Id))
266 and then Scope (Entity (Id)) = Current_Scope
267 then
268 Error_Msg_NE
269 ("exception & is never raised?r?", Entity (Id), Id);
270 end if;
272 if Present (Renamed_Entity (Entity (Id))) then
273 if Entity (Id) = Standard_Numeric_Error then
274 Check_Restriction (No_Obsolescent_Features, Id);
276 if Warn_On_Obsolescent_Feature then
277 Error_Msg_N
278 ("Numeric_Error is an " &
279 "obsolescent feature (RM J.6(1))?j?", Id);
280 Error_Msg_N
281 ("\use Constraint_Error instead?j?", Id);
282 end if;
283 end if;
284 end if;
286 Check_Duplication (Id);
288 -- Check for exception declared within generic formal
289 -- package (which is illegal, see RM 11.2(8))
291 declare
292 Ent : Entity_Id := Entity (Id);
293 Scop : Entity_Id;
295 begin
296 if Present (Renamed_Entity (Ent)) then
297 Ent := Renamed_Entity (Ent);
298 end if;
300 Scop := Scope (Ent);
301 while Scop /= Standard_Standard
302 and then Ekind (Scop) = E_Package
303 loop
304 if Nkind (Declaration_Node (Scop)) =
305 N_Package_Specification
306 and then
307 Nkind (Original_Node (Parent
308 (Declaration_Node (Scop)))) =
309 N_Formal_Package_Declaration
310 then
311 Error_Msg_NE
312 ("exception& is declared in " &
313 "generic formal package", Id, Ent);
314 Error_Msg_N
315 ("\and therefore cannot appear in " &
316 "handler (RM 11.2(8))", Id);
317 exit;
319 -- If the exception is declared in an inner
320 -- instance, nothing else to check.
322 elsif Is_Generic_Instance (Scop) then
323 exit;
324 end if;
326 Scop := Scope (Scop);
327 end loop;
328 end;
329 end if;
330 end if;
332 Next (Id);
333 end loop;
335 -- Check for redundant handler (has only raise statement) and is
336 -- either an others handler, or is a specific handler when no
337 -- others handler is present.
339 if Warn_On_Redundant_Constructs
340 and then List_Length (Statements (Handler)) = 1
341 and then Nkind (First (Statements (Handler))) = N_Raise_Statement
342 and then No (Name (First (Statements (Handler))))
343 and then (not Others_Present
344 or else Nkind (First (Exception_Choices (Handler))) =
345 N_Others_Choice)
346 then
347 Error_Msg_N
348 ("useless handler contains only a reraise statement?r?",
349 Handler);
350 end if;
352 -- Now analyze the statements of this handler
354 Analyze_Statements (Statements (Handler));
356 -- If a choice was present, we created a special scope for it,
357 -- so this is where we pop that special scope to get rid of it.
359 if Present (Choice) then
360 End_Scope;
361 end if;
362 end if;
364 Next (Handler);
365 end loop;
366 end Analyze_Exception_Handlers;
368 --------------------------------
369 -- Analyze_Handled_Statements --
370 --------------------------------
372 procedure Analyze_Handled_Statements (N : Node_Id) is
373 Handlers : constant List_Id := Exception_Handlers (N);
374 Handler : Node_Id;
375 Choice : Node_Id;
377 begin
378 if Present (Handlers) then
379 Kill_All_Checks;
380 end if;
382 -- We are now going to analyze the statements and then the exception
383 -- handlers. We certainly need to do things in this order to get the
384 -- proper sequential semantics for various warnings.
386 -- However, there is a glitch. When we process raise statements, an
387 -- optimization is to look for local handlers and specialize the code
388 -- in this case.
390 -- In order to detect if a handler is matching, we must have at least
391 -- analyzed the choices in the proper scope so that proper visibility
392 -- analysis is performed. Hence we analyze just the choices first,
393 -- before we analyze the statement sequence.
395 Handler := First_Non_Pragma (Handlers);
396 while Present (Handler) loop
397 Choice := First_Non_Pragma (Exception_Choices (Handler));
398 while Present (Choice) loop
399 Analyze (Choice);
400 Next_Non_Pragma (Choice);
401 end loop;
403 Next_Non_Pragma (Handler);
404 end loop;
406 -- Analyze statements in sequence
408 Analyze_Statements (Statements (N));
410 -- If the current scope is a subprogram, then this is the right place to
411 -- check for hanging useless assignments from the statement sequence of
412 -- the subprogram body.
414 if Is_Subprogram (Current_Scope) then
415 Warn_On_Useless_Assignments (Current_Scope);
416 end if;
418 -- Deal with handlers or AT END proc
420 if Present (Handlers) then
421 Analyze_Exception_Handlers (Handlers);
422 elsif Present (At_End_Proc (N)) then
423 Analyze (At_End_Proc (N));
424 end if;
425 end Analyze_Handled_Statements;
427 ------------------------------
428 -- Analyze_Raise_Expression --
429 ------------------------------
431 procedure Analyze_Raise_Expression (N : Node_Id) is
432 Exception_Id : constant Node_Id := Name (N);
433 Exception_Name : Entity_Id := Empty;
435 begin
436 Check_SPARK_Restriction ("raise expression is not allowed", N);
438 -- Check exception restrictions on the original source
440 if Comes_From_Source (N) then
441 Check_Restriction (No_Exceptions, N);
442 end if;
444 Analyze (Exception_Id);
446 if Is_Entity_Name (Exception_Id) then
447 Exception_Name := Entity (Exception_Id);
448 end if;
450 if No (Exception_Name)
451 or else Ekind (Exception_Name) /= E_Exception
452 then
453 Error_Msg_N
454 ("exception name expected in raise statement", Exception_Id);
455 else
456 Set_Is_Raised (Exception_Name);
457 end if;
459 -- Deal with RAISE WITH case
461 if Present (Expression (N)) then
462 Check_Compiler_Unit (Expression (N));
463 Analyze_And_Resolve (Expression (N), Standard_String);
464 end if;
466 -- Check obsolescent use of Numeric_Error
468 if Exception_Name = Standard_Numeric_Error then
469 Check_Restriction (No_Obsolescent_Features, Exception_Id);
470 end if;
472 -- Kill last assignment indication
474 Kill_Current_Values (Last_Assignment_Only => True);
476 -- Set type as Any_Type since we have no information at all on the type
478 Set_Etype (N, Any_Type);
479 end Analyze_Raise_Expression;
481 -----------------------------
482 -- Analyze_Raise_Statement --
483 -----------------------------
485 procedure Analyze_Raise_Statement (N : Node_Id) is
486 Exception_Id : constant Node_Id := Name (N);
487 Exception_Name : Entity_Id := Empty;
488 P : Node_Id;
489 Par : Node_Id;
491 begin
492 Check_SPARK_Restriction ("raise statement is not allowed", N);
493 Check_Unreachable_Code (N);
495 -- Check exception restrictions on the original source
497 if Comes_From_Source (N) then
498 Check_Restriction (No_Exceptions, N);
499 end if;
501 -- Check for useless assignment to OUT or IN OUT scalar preceding the
502 -- raise. Right now only look at assignment statements, could do more???
504 if Is_List_Member (N) then
505 declare
506 P : Node_Id;
507 L : Node_Id;
509 begin
510 P := Prev (N);
512 -- Skip past null statements and pragmas
514 while Present (P)
515 and then Nkind_In (P, N_Null_Statement, N_Pragma)
516 loop
517 P := Prev (P);
518 end loop;
520 -- See if preceding statement is an assignment
522 if Present (P)
523 and then Nkind (P) = N_Assignment_Statement
524 then
525 L := Name (P);
527 -- Give warning for assignment to scalar formal
529 if Is_Scalar_Type (Etype (L))
530 and then Is_Entity_Name (L)
531 and then Is_Formal (Entity (L))
532 then
533 -- Don't give warning if we are covered by an exception
534 -- handler, since this may result in false positives, since
535 -- the handler may handle the exception and return normally.
537 -- First find the enclosing handled sequence of statements
538 -- (note, we could also look for a handler in an outer block
539 -- but currently we don't, and in that case we'll emit the
540 -- warning).
542 Par := N;
543 loop
544 Par := Parent (Par);
545 exit when Nkind (Par) = N_Handled_Sequence_Of_Statements;
546 end loop;
548 -- See if there is a handler, give message if not
550 if No (Exception_Handlers (Par)) then
551 Error_Msg_N
552 ("assignment to pass-by-copy formal " &
553 "may have no effect??", P);
554 Error_Msg_N
555 ("\RAISE statement may result in abnormal return" &
556 " (RM 6.4.1(17))??", P);
557 end if;
558 end if;
559 end if;
560 end;
561 end if;
563 -- Reraise statement
565 if No (Exception_Id) then
566 P := Parent (N);
567 while not Nkind_In (P, N_Exception_Handler,
568 N_Subprogram_Body,
569 N_Package_Body,
570 N_Task_Body,
571 N_Entry_Body)
572 loop
573 P := Parent (P);
574 end loop;
576 if Nkind (P) /= N_Exception_Handler then
577 Error_Msg_N
578 ("reraise statement must appear directly in a handler", N);
580 -- If a handler has a reraise, it cannot be the target of a local
581 -- raise (goto optimization is impossible), and if the no exception
582 -- propagation restriction is set, this is a violation.
584 else
585 Set_Local_Raise_Not_OK (P);
587 -- Do not check the restriction if the reraise statement is part
588 -- of the code generated for an AT-END handler. That's because
589 -- if the restriction is actually active, we never generate this
590 -- raise anyway, so the apparent violation is bogus.
592 if not From_At_End (N) then
593 Check_Restriction (No_Exception_Propagation, N);
594 end if;
595 end if;
597 -- Normal case with exception id present
599 else
600 Analyze (Exception_Id);
602 if Is_Entity_Name (Exception_Id) then
603 Exception_Name := Entity (Exception_Id);
604 end if;
606 if No (Exception_Name)
607 or else Ekind (Exception_Name) /= E_Exception
608 then
609 Error_Msg_N
610 ("exception name expected in raise statement", Exception_Id);
611 else
612 Set_Is_Raised (Exception_Name);
613 end if;
615 -- Deal with RAISE WITH case
617 if Present (Expression (N)) then
618 Check_Compiler_Unit (Expression (N));
619 Analyze_And_Resolve (Expression (N), Standard_String);
620 end if;
621 end if;
623 -- Check obsolescent use of Numeric_Error
625 if Exception_Name = Standard_Numeric_Error then
626 Check_Restriction (No_Obsolescent_Features, Exception_Id);
627 end if;
629 -- Kill last assignment indication
631 Kill_Current_Values (Last_Assignment_Only => True);
632 end Analyze_Raise_Statement;
634 -----------------------------
635 -- Analyze_Raise_xxx_Error --
636 -----------------------------
638 -- Normally, the Etype is already set (when this node is used within
639 -- an expression, since it is copied from the node which it rewrites).
640 -- If this node is used in a statement context, then we set the type
641 -- Standard_Void_Type. This is used both by Gigi and by the front end
642 -- to distinguish the statement use and the subexpression use.
644 -- The only other required processing is to take care of the Condition
645 -- field if one is present.
647 procedure Analyze_Raise_xxx_Error (N : Node_Id) is
649 function Same_Expression (C1, C2 : Node_Id) return Boolean;
650 -- It often occurs that two identical raise statements are generated in
651 -- succession (for example when dynamic elaboration checks take place on
652 -- separate expressions in a call). If the two statements are identical
653 -- according to the simple criterion that follows, the raise is
654 -- converted into a null statement.
656 ---------------------
657 -- Same_Expression --
658 ---------------------
660 function Same_Expression (C1, C2 : Node_Id) return Boolean is
661 begin
662 if No (C1) and then No (C2) then
663 return True;
665 elsif Is_Entity_Name (C1) and then Is_Entity_Name (C2) then
666 return Entity (C1) = Entity (C2);
668 elsif Nkind (C1) /= Nkind (C2) then
669 return False;
671 elsif Nkind (C1) in N_Unary_Op then
672 return Same_Expression (Right_Opnd (C1), Right_Opnd (C2));
674 elsif Nkind (C1) in N_Binary_Op then
675 return Same_Expression (Left_Opnd (C1), Left_Opnd (C2))
676 and then
677 Same_Expression (Right_Opnd (C1), Right_Opnd (C2));
679 elsif Nkind (C1) = N_Null then
680 return True;
682 else
683 return False;
684 end if;
685 end Same_Expression;
687 -- Start of processing for Analyze_Raise_xxx_Error
689 begin
690 Check_SPARK_Restriction ("raise statement is not allowed", N);
692 if No (Etype (N)) then
693 Set_Etype (N, Standard_Void_Type);
694 end if;
696 if Present (Condition (N)) then
697 Analyze_And_Resolve (Condition (N), Standard_Boolean);
698 end if;
700 -- Deal with static cases in obvious manner
702 if Nkind (Condition (N)) = N_Identifier then
703 if Entity (Condition (N)) = Standard_True then
704 Set_Condition (N, Empty);
706 elsif Entity (Condition (N)) = Standard_False then
707 Rewrite (N, Make_Null_Statement (Sloc (N)));
708 end if;
709 end if;
711 -- Remove duplicate raise statements. Note that the previous one may
712 -- already have been removed as well.
714 if not Comes_From_Source (N)
715 and then Nkind (N) /= N_Null_Statement
716 and then Is_List_Member (N)
717 and then Present (Prev (N))
718 and then Nkind (N) = Nkind (Original_Node (Prev (N)))
719 and then Same_Expression
720 (Condition (N), Condition (Original_Node (Prev (N))))
721 then
722 Rewrite (N, Make_Null_Statement (Sloc (N)));
723 end if;
724 end Analyze_Raise_xxx_Error;
726 -----------------------------
727 -- Analyze_Subprogram_Info --
728 -----------------------------
730 procedure Analyze_Subprogram_Info (N : Node_Id) is
731 begin
732 Set_Etype (N, RTE (RE_Code_Loc));
733 end Analyze_Subprogram_Info;
735 end Sem_Ch11;