if Is_Access_Type (Etype (Expression (N))) then
Apply_Accessibility_Check
- (N => Expression (N),
- Typ => Etype (N),
+ (N => Expression (N),
+ Typ => Etype (N),
Insert_Node => N);
-- Generate: Func (Address!(Expression))
Rewrite (N,
Make_Function_Call (Loc,
- Name => New_Occurrence_Of (Fent, Loc),
+ Name => New_Occurrence_Of (Fent, Loc),
Parameter_Associations => New_List (
Unchecked_Convert_To (RTE (RE_Address),
Relocate_Node (Expression (N))))));
Rewrite (N,
Make_Function_Call (Loc,
- Name => New_Occurrence_Of (Fent, Loc),
+ Name => New_Occurrence_Of (Fent, Loc),
Parameter_Associations => New_List (
Make_Attribute_Reference (Loc,
Prefix => Unchecked_Convert_To (Operand_Typ,
if (SSO_Set_Low_By_Default (T) or else SSO_Set_High_By_Default (T))
- -- For a record type, if bit order is specified explicitly, then
- -- do not set SSO from default if not consistent. Note that we
- -- do not want to look at a Bit_Order attribute definition for
- -- a parent: if we were to inherit Bit_Order, then both
+ -- For a record type, if bit order is specified explicitly,
+ -- then do not set SSO from default if not consistent. Note that
+ -- we do not want to look at a Bit_Order attribute definition
+ -- for a parent: if we were to inherit Bit_Order, then both
-- SSO_Set_*_By_Default flags would have been cleared already
-- (by Inherit_Aspects_At_Freeze_Point).
and then not
(Is_Record_Type (T)
- and then Has_Rep_Item (T,
- Name_Bit_Order, Check_Parents => False)
+ and then
+ Has_Rep_Item (T, Name_Bit_Order, Check_Parents => False)
and then Reverse_Bit_Order (T) /= Reversed)
then
-- If flags cause reverse storage order, then set the result. Note
-- --
-- B o d y --
-- --
--- Copyright (C) 1997-2011, Free Software Foundation, Inc. --
+-- Copyright (C) 1997-2014, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
Low_Priority : constant := 255;
-- VxWorks native (default) lowest scheduling priority
- -------------
- -- sigwait --
- -------------
-
- function sigwait
- (set : access sigset_t;
- sig : access Signal) return int
- is
- Result : int;
-
- function sigwaitinfo
- (set : access sigset_t; sigvalue : System.Address) return int;
- pragma Import (C, sigwaitinfo, "sigwaitinfo");
-
- begin
- Result := sigwaitinfo (set, System.Null_Address);
-
- if Result /= -1 then
- sig.all := Signal (Result);
- return OK;
- else
- sig.all := 0;
- return errno;
- end if;
- end sigwait;
-
-----------------
-- To_Duration --
-----------------
Taggd := Is_Tagged_Type (Parent_Type);
- -- Set the parent type to the class-wide type's specific type
- -- in this case to prevent cascading errors
+ -- Set the parent type to the class-wide type's specific type in this
+ -- case to prevent cascading errors
if Present (Extension) and then Is_Class_Wide_Type (Parent_Type) then
Error_Msg_N ("parent type must not be a class-wide type", Indic);
begin
if Nkind (Decl) = N_Formal_Type_Declaration
and then Nkind (Formal_Type_Definition (Decl)) =
- N_Formal_Derived_Type_Definition
+ N_Formal_Derived_Type_Definition
and then Synchronized_Present (Formal_Type_Definition (Decl))
and then No (Extension)
procedure Diagnose_Interface (N : Node_Id; E : Entity_Id) is
begin
- if not Is_Interface (E)
- and then E /= Any_Type
- then
+ if not Is_Interface (E) and then E /= Any_Type then
Error_Msg_NE ("(Ada 2005) & must be an interface", N, E);
end if;
end Diagnose_Interface;
while Present (F_Spec) loop
P_Spec := First (Prev_Aspects);
while Present (P_Spec) loop
- if
- Chars (Identifier (P_Spec)) = Chars (Identifier (F_Spec))
+ if Chars (Identifier (P_Spec)) = Chars (Identifier (F_Spec))
then
Error_Msg_N
("aspect already specified in private declaration",
elsif Nkind_In (N, N_Task_Type_Declaration,
N_Protected_Type_Declaration)
then
- if No (Interface_List (N))
- and then not Error_Posted (N)
- then
+ if No (Interface_List (N)) and then not Error_Posted (N) then
Tag_Mismatch;
end if;
-- Check that requested number of digits is not too high.
if Digs_Val > Max_Digs_Val then
+
-- The check for Max_Base_Digits may be somewhat expensive, as it
-- requires reading System, so only do it when necessary.
Result_Entity := Entity (Result);
end if;
- -- See if this level of derivation actually has discriminants
- -- because tagged derivations can add them, hence the lower
- -- levels need not have any.
+ -- See if this level of derivation actually has discriminants because
+ -- tagged derivations can add them, hence the lower levels need not
+ -- have any.
if not Has_Discriminants (Ti) then
return Result;
end if;
- -- Scan Ti's discriminants for Result_Entity,
- -- and return its corresponding value, if any.
+ -- Scan Ti's discriminants for Result_Entity, and return its
+ -- corresponding value, if any.
Result_Entity := Original_Record_Component (Result_Entity);
end loop;
-- Could not find it
- --
+
return Result;
end Search_Derivation_Levels;
and then not Is_Tagged
and then
(not Inherit_Discr
- or else First_Discriminant (Parent_Base) /=
- First_Stored_Discriminant (Parent_Base))
+ or else First_Discriminant (Parent_Base) /=
+ First_Stored_Discriminant (Parent_Base))
then
Stored_Discrim := First_Stored_Discriminant (Parent_Base);
while Present (Stored_Discrim) loop
end loop;
return True;
+
else
return True;
end if;
Init_Esize (T, System_Max_Binary_Modulus_Power);
end if;
- if not Non_Binary_Modulus (T)
- and then Esize (T) = RM_Size (T)
- then
+ if not Non_Binary_Modulus (T) and then Esize (T) = RM_Size (T) then
Set_Is_Known_Valid (T);
end if;
end Set_Modular_Size;
null;
else
- Error_Msg_N ("access discriminants of nonlimited types",
- Expression (Discr));
- Error_Msg_N ("\cannot have defaults", Expression (Discr));
+ Error_Msg_N
+ ("access discriminants of nonlimited types cannot "
+ & "have defaults", Expression (Discr));
end if;
elsif Present (Expression (Discr)) then