and then RTE_Available (RE_Raise_Exception_Always)
then
declare
- FA : constant Node_Id := Original_Node
- (First_Actual (Call_Node));
+ FA : constant Node_Id :=
+ Original_Node (First_Actual (Call_Node));
+
begin
-- The case we catch is where the first argument is obtained
-- using the Identity attribute (which must always be
and then Nkind (Call_Node) = N_Procedure_Call_Statement
and then
((Nkind (Parent (Call_Node)) = N_Triggering_Alternative
- and then Triggering_Statement (Parent (Call_Node)) = Call_Node)
+ and then Triggering_Statement (Parent (Call_Node)) = Call_Node)
or else
(Nkind (Parent (Call_Node)) = N_Entry_Call_Alternative
- and then Entry_Call_Statement (Parent (Call_Node)) = Call_Node))
+ and then Entry_Call_Statement (Parent (Call_Node)) = Call_Node))
then
declare
Ren_Decl : Node_Id;
Ass := Parent (Call_Node);
elsif Nkind (Parent (Call_Node)) = N_Qualified_Expression
- and then Nkind (Parent (Parent (Call_Node)))
- = N_Assignment_Statement
+ and then Nkind (Parent (Parent (Call_Node))) =
+ N_Assignment_Statement
then
Ass := Parent (Parent (Call_Node));
elsif Nkind (Parent (Call_Node)) = N_Explicit_Dereference
- and then Nkind (Parent (Parent (Call_Node)))
- = N_Assignment_Statement
+ and then Nkind (Parent (Parent (Call_Node))) =
+ N_Assignment_Statement
then
Ass := Parent (Parent (Call_Node));
end if;
Error_Msg_NE
("tag-indeterminate expression "
& " must have designated type& (RM 5.2 (6))",
- Call_Node, Root_Type (Etype (Name (Ass))));
+ Call_Node, Root_Type (Etype (Name (Ass))));
else
Propagate_Tag (Name (Ass), Call_Node);
end if;
end if;
Comp := First_Component (E);
-
while Present (Comp) loop
if not Is_Type (Comp)
and then (Strict_Alignment (Etype (Comp))
if Is_First_Subtype (Rec) then
Comp := First_Component (Rec);
-
while Present (Comp) loop
if Present (Component_Clause (Comp))
and then (Is_Fixed_Point_Type (Etype (Comp))
and then Ekind (Test_E) /= E_Constant
then
declare
- S : Entity_Id := Current_Scope;
+ S : Entity_Id;
begin
-
+ S := Current_Scope;
while Present (S) loop
if Is_Overloadable (S) then
if Comes_From_Source (S)
and then Present (Scope (Test_E))
then
declare
- S : Entity_Id := Scope (Test_E);
+ S : Entity_Id;
begin
+ S := Scope (Test_E);
while Present (S) loop
if Is_Generic_Instance (S) then
exit;
elsif Ekind (E) = E_Subprogram_Type then
Formal := First_Formal (E);
-
while Present (Formal) loop
if Ekind (Etype (Formal)) = E_Incomplete_Type
and then No (Full_View (Etype (Formal)))
if Is_Tagged_Type (Etype (Formal)) then
null;
- -- AI05-151 : incomplete types are allowed in access to
+ -- AI05-151: Incomplete types are allowed in access to
-- subprogram specifications.
elsif Ada_Version < Ada_2012 then
declare
Prim_List : constant Elist_Id := Primitive_Operations (E);
Prim : Elmt_Id;
+
begin
Prim := First_Elmt (Prim_List);
while Present (Prim) loop
begin
Comp := First_Component (E);
-
while Present (Comp) loop
Typ := Etype (Comp);
end if;
F := First_Formal (Designated_Type (Typ));
-
while Present (F) loop
Ensure_Type_Is_SA (Etype (F));
Next_Formal (F);
begin
Comp := First_Component (T);
-
while Present (Comp) loop
if not Is_Fully_Defined (Etype (Comp)) then
return False;
begin
Comp := First_Component (Typ);
-
while Present (Comp) loop
if Nkind (Parent (Comp)) = N_Component_Declaration
and then Present (Expression (Parent (Comp)))