Parameter_Associations => Params));
end if;
- Loop_Stat := Make_Implicit_Loop_Statement
- (Node => N,
- Identifier => Empty,
- Iteration_Scheme => L_Iteration_Scheme,
- Statements => Stats);
+ Loop_Stat := Make_Implicit_Loop_Statement
+ (Node => N,
+ Identifier => Empty,
+ Iteration_Scheme => L_Iteration_Scheme,
+ Statements => Stats);
Append (Loop_Stat, Aggr_Code);
end Expand_Iterated_Component;
-- required size for the aggregwte : call the provided
-- constructor rather than the Empty aggregate.
- Index := Make_Op_Add (Loc,
+ Index := Make_Op_Add (Loc,
Left_Opnd => New_Copy_Tree (Type_Low_Bound (Index_Type)),
Right_Opnd => Make_Integer_Literal (Loc, Siz - 1));
-- If function is inherited, a conversion may be necessary.
if Nkind (Par) = N_Assignment_Statement then
- Last_Actual := Name (Par);
+ Last_Actual := Name (Par);
if not Comes_From_Source (Orig_Func)
and then Etype (Orig_Func) /= Etype (Func_Id)
procedure One_Comp (F : Field_Enum);
+ --------------
+ -- One_Comp --
+ --------------
+
procedure One_Comp (F : Field_Enum) is
pragma Annotate (Codepeer, Modified, Field_Table);
- Offset : constant Field_Offset := Field_Table (F).Offset;
+ Offset : constant Field_Offset := Field_Table (F).Offset;
begin
if First_Time then
First_Time := False;
New_Node (N_Loop_Parameter_Specification, Prev_Token_Ptr);
Set_Defining_Identifier (Loop_Spec, Id);
- Choice := First (Discrete_Choices (Assoc_Node));
+ Choice := First (Discrete_Choices (Assoc_Node));
Assoc_Node :=
New_Node (N_Iterated_Element_Association, Prev_Token_Ptr);
Set_Loop_Parameter_Specification (Assoc_Node, Loop_Spec);
Add_Unnamed_Subp := Subp;
elsif Op_Name = Name_New_Indexed then
- New_Indexed_Subp := Subp;
+ New_Indexed_Subp := Subp;
elsif Op_Name = Name_Assign_Indexed then
Assign_Indexed_Subp := Subp;