2018-05-28 Hristian Kirtchev <kirtchev@adacore.com>
+ * exp_aggr.adb, gnatlink.adb, sem_ch6.adb, sem_res.adb, sem_util.adb:
+ Minor reformatting.
+
+2018-05-28 Hristian Kirtchev <kirtchev@adacore.com>
+
* sem_prag.adb (Process_Atomic_Independent_Shared_Volatile): Include
the declarations of single concurrent types because they fall in the
category of full type and object declarations.
elsif Nkind (Expression (Expr)) /= N_Aggregate
or else not Compile_Time_Known_Aggregate (Expression (Expr))
or else Expansion_Delayed (Expression (Expr))
- or else Nkind (Expr) = N_Iterated_Component_Association
- or else Nkind (Expr) = N_Quantified_Expression
+ or else Nkind_In (Expr, N_Iterated_Component_Association,
+ N_Quantified_Expression)
then
Static_Components := False;
exit;
-- If we have an others choice, fill in the missing elements
-- subject to the limit established by Max_Others_Replicate.
-- If the expression involves a construct that generates
- -- a loop, we must generate individual assignmentw and
+ -- a loop, we must generate individual assignments and
-- no flattening is possible.
if Nkind (Choice) = N_Others_Choice then
Rep_Count := 0;
- if Nkind_In (Expression (Elmt),
- N_Quantified_Expression,
- N_Iterated_Component_Association)
+ if Nkind_In (Expression (Elmt),
+ N_Iterated_Component_Association,
+ N_Quantified_Expression)
then
return False;
end if;
for J in Vals'Range loop
if No (Vals (J)) then
- Vals (J) := New_Copy_Tree (Expression (Elmt));
+ Vals (J) := New_Copy_Tree (Expression (Elmt));
Rep_Count := Rep_Count + 1;
-- Check for maximum others replication. Note that
("Could not locate linker: " & L_Args.all (1).all);
end if;
- -- The other arguments are passed as-is to the linker
- -- and override those coming from --GCC= if any.
+ -- The other arguments are passed as-is to the linker and
+ -- override those coming from --GCC= if any.
if L_Args.all'Last >= 2 then
Gcc_Linker_Options.Set_Last (0);
Form_New_Spec : Entity_Id;
Form_Old_Def : Entity_Id;
Form_Old_Spec : Entity_Id;
- begin
+ begin
Form_New_Spec := First (Parameter_Specifications (New_Spec));
Form_Old_Spec := First (Parameter_Specifications (Spec));
-- formals we exempt them from unreferenced warnings by marking
-- them as always referenced.
- Set_Referenced
- (Form_Old_Def,
- (Is_Formal (Form_Old_Def)
- and then Is_Controlling_Formal (Form_Old_Def))
- or else Referenced (Form_Old_Def));
- -- or else Is_Dispatching_Operation
- -- (Corresponding_Spec (New_Body)));
+ Set_Referenced (Form_Old_Def,
+ (Is_Formal (Form_Old_Def)
+ and then Is_Controlling_Formal (Form_Old_Def))
+ or else Referenced (Form_Old_Def));
Next (Form_New_Spec);
Next (Form_Old_Spec);
-- If the subprogram has a class-wide clone, build its body as a copy
-- of the original body, and rewrite body of original subprogram as a
- -- wrapper that calls the clone.
- -- If N is a stub, this construction will take place when the proper
- -- body is analyzed.
+ -- wrapper that calls the clone. If N is a stub, this construction will
+ -- take place when the proper body is analyzed.
if Present (Spec_Id)
and then Present (Class_Wide_Clone (Spec_Id))
Resolve (N, Universal_Integer);
- elsif Etype (N) = T
- and then B_Typ /= Universal_Fixed
- then
+ elsif Etype (N) = T and then B_Typ /= Universal_Fixed then
- -- if the operand is part of a fixed multiplication operation,
+ -- If the operand is part of a fixed multiplication operation,
-- a conversion will be applied to each operand, so resolve it
-- with its own type.
- if Nkind_In (Parent (N), N_Op_Multiply, N_Op_Divide) then
+ if Nkind_In (Parent (N), N_Op_Divide, N_Op_Multiply) then
Resolve (N);
else
Result_Seen := True;
return Abandon;
- -- Warn on infinite recursion if call is to current function.
+ -- Warn on infinite recursion if call is to current function
elsif Nkind (N) = N_Function_Call
and then Is_Entity_Name (Name (N))
and then Entity (Name (N)) = Subp_Id
and then not Is_Potentially_Unevaluated (N)
then
- Error_Msg_NE ("call to & within its postcondition "
- & "will lead to infinite recursion?", N, Subp_Id);
+ Error_Msg_NE
+ ("call to & within its postcondition will lead to infinite "
+ & "recursion?", N, Subp_Id);
return OK;
-- Continue the traversal