Indx := First_Index (Atyp);
for J in 2 .. Inum loop
- Indx := Next_Index (Indx);
+ Next_Index (Indx);
end loop;
-- If the index type is a formal type or derived from
Reason => CE_Index_Check_Failed));
end if;
- A_Idx := Next_Index (A_Idx);
+ Next_Index (A_Idx);
Ind := Ind + 1;
Next (Sub);
end loop;
Comp_Id := First_Entity (Id);
while Present (Comp_Id) loop
exit when Ekind (Comp_Id) = E_Component;
- Comp_Id := Next_Entity (Comp_Id);
+ Next_Entity (Comp_Id);
end loop;
return Comp_Id;
Comp_Id := First_Entity (Id);
while Present (Comp_Id) loop
exit when Ekind_In (Comp_Id, E_Component, E_Discriminant);
- Comp_Id := Next_Entity (Comp_Id);
+ Next_Entity (Comp_Id);
end loop;
return Comp_Id;
return True;
end if;
- Ent := Next_Entity (Ent);
+ Next_Entity (Ent);
end loop;
return False;
Comp_Id := Next_Entity (Id);
while Present (Comp_Id) loop
exit when Ekind (Comp_Id) = E_Component;
- Comp_Id := Next_Entity (Comp_Id);
+ Next_Entity (Comp_Id);
end loop;
return Comp_Id;
Comp_Id := Next_Entity (Id);
while Present (Comp_Id) loop
exit when Ekind_In (Comp_Id, E_Component, E_Discriminant);
- Comp_Id := Next_Entity (Comp_Id);
+ Next_Entity (Comp_Id);
end loop;
return Comp_Id;
pragma Assert (Ekind (Id) = E_Discriminant);
loop
- D := Next_Entity (D);
+ Next_Entity (D);
if No (D)
or else (Ekind (D) /= E_Discriminant
and then not Is_Itype (D))
N := N + 1;
end if;
- Ent := Next_Entity (Ent);
+ Next_Entity (Ent);
end loop;
return N;
Formal := First_Formal (Id);
while Present (Formal) loop
N := N + 1;
- Formal := Next_Formal (Formal);
+ Next_Formal (Formal);
end loop;
return N;
Comp := First_Component (Typ);
while Chars (Comp) /= Name_uParent loop
- Comp := Next_Component (Comp);
+ Next_Component (Comp);
end loop;
Parent_Name := New_Occurrence_Of (Comp, Loc);
return False;
end if;
- Indx := Next_Index (Indx);
+ Next_Index (Indx);
end loop;
end if;
end;
Comp_Val := Comp_Val mod Uint_2 ** Comp_Size;
Val := UI_To_Int (Val + Comp_Val * Uint_2 ** Shift);
Shift := Shift + Incr;
- One_Comp := Next (One_Comp);
+ Next (One_Comp);
Packed_Num := Packed_Num + 1;
end if;
end loop;
- One_Dim := Next (One_Dim);
+ Next (One_Dim);
end loop;
if Packed_Num > 0 then
if Is_Equality (E, Typ) then
return E;
end if;
- E := Next_Entity (E);
+ Next_Entity (E);
end loop;
end loop;
Last_Formal := First_Formal (Proc_Id);
while Present (Next_Formal (Last_Formal)) loop
- Last_Formal := Next_Formal (Last_Formal);
+ Next_Formal (Last_Formal);
end loop;
Actuals := Parameter_Associations (N);
Comp := First_Component (STJ.ARECnT);
while Chars (Comp) /= Chars (Ent) loop
- Comp := Next_Component (Comp);
+ Next_Component (Comp);
end loop;
Rhs :=
(Next (First (Pragma_Argument_Associations (Item))));
end if;
- Item := Next_Rep_Item (Item);
+ Next_Rep_Item (Item);
end loop;
return Empty;
Low_Bound => New_Occurrence_Of (Low_Bound, Loc),
High_Bound => New_Occurrence_Of (High_Bound, Loc)));
- Index_Typ := Next_Index (Index_Typ);
+ Next_Index (Index_Typ);
end loop;
elsif Is_Class_Wide_Type (Unc_Typ) then
while Present (Rep)
and then Next_Rep_Item (Rep) /= Addr
loop
- Rep := Next_Rep_Item (Rep);
+ Next_Rep_Item (Rep);
end loop;
end if;
Check_Aspect_At_End_Of_Declarations (Ritem);
end if;
- Ritem := Next_Rep_Item (Ritem);
+ Next_Rep_Item (Ritem);
end loop;
end;
end if;
return;
end if;
- Elmt := Next_Elmt (Elmt);
+ Next_Elmt (Elmt);
end loop;
Append_Elmt (Scop, To_Clean);
Expand_Cleanup_Actions (Decl);
End_Scope;
- Elmt := Next_Elmt (Elmt);
+ Next_Elmt (Elmt);
end loop;
end Cleanup_Scopes;
end if;
end if;
- E := Next_Entity (E);
+ Next_Entity (E);
end loop;
-- For a package body, the entities of the visible subprograms are
return Etype (Comp);
end if;
- Comp := Next_Entity (Comp);
+ Next_Entity (Comp);
end loop;
Error_Msg_NE ("type& has no component with this name", Nam, Typ);
end if;
end if;
- Rep := Next_Rep_Item (Rep);
+ Next_Rep_Item (Rep);
end loop;
end if;
end Compute_Type_Key;
exit;
end if;
- Comp_Or_Discr := Next_Entity (Comp_Or_Discr);
+ Next_Entity (Comp_Or_Discr);
end loop;
-- Diagnose an illegal reference
-- either because the tag must be ahead of them.
if Chars (Ent) = Name_uTag then
- Ent := Next_Entity (Ent);
+ Next_Entity (Ent);
end if;
-- Skip all hidden stored discriminants if any
exit when Ekind (Ent) = E_Discriminant
and then not Is_Completely_Hidden (Ent);
- Ent := Next_Entity (Ent);
+ Next_Entity (Ent);
end loop;
-- Call may be on a private type with unknown discriminants, in which
return True;
end if;
- Ent := Next_Entity (Ent);
+ Next_Entity (Ent);
end loop;
return False;
Ent := First_Entity (Typ);
if Chars (Ent) = Name_uTag then
- Ent := Next_Entity (Ent);
+ Next_Entity (Ent);
end if;
if Has_Completely_Hidden_Discriminant (Ent) then
while Present (Ent) loop
exit when Ekind (Ent) = E_Discriminant
and then Is_Completely_Hidden (Ent);
- Ent := Next_Entity (Ent);
+ Next_Entity (Ent);
end loop;
end if;
return Comp;
end if;
- Comp := Next_Entity (Comp);
+ Next_Entity (Comp);
end loop;
-- No tag component found
return True;
end if;
- Item := Next_Rep_Item (Item);
+ Next_Rep_Item (Item);
end loop;
return False;
return True;
end if;
- C := Next_Component (C);
+ Next_Component (C);
end loop;
end;
return True;
end if;
- C := Next_Component (C);
+ Next_Component (C);
end loop;
end;
return True;
end if;
- C := Next_Component (C);
+ Next_Component (C);
end loop;
end;
return Comp;
end if;
- Comp := Next_Entity (Comp);
+ Next_Entity (Comp);
end loop;
-- No tag component found
while Present (Comp) loop
N := N + 1;
- Comp := Next_Component_Or_Discriminant (Comp);
+ Next_Component_Or_Discriminant (Comp);
end loop;
return N;
begin
while Present (Discr) loop
N := N + 1;
- Discr := Next_Discriminant (Discr);
+ Next_Discriminant (Discr);
end loop;
return N;
end if;
end if;
- N := Next_Rep_Item (N);
+ Next_Rep_Item (N);
end loop;
end Inherit_Delayed_Rep_Aspects;
-- False if any subsequent formal has no default expression
- Formal := Next_Formal (Formal);
+ Next_Formal (Formal);
while Present (Formal) loop
if No (Expression (Parent (Formal))) then
return False;
end if;
Prev_Bit_Offset := Component_Bit_Offset (Comp);
- Comp := Next_Component (Comp);
+ Next_Component (Comp);
end if;
Next (Clause);
end;
end if;
- ASN := Next_Rep_Item (ASN);
+ Next_Rep_Item (ASN);
end loop;
end Resolve_Aspect_Expressions;
end if;
exit when Last_Entity (Current_Scope) = Curr;
- Curr := Next_Entity (Curr);
+ Next_Entity (Curr);
end loop;
end if;
and then Present (First_Entity (Current_Scope))
then
while Is_Generic_Formal (Freeze_From) loop
- Freeze_From := Next_Entity (Freeze_From);
+ Next_Entity (Freeze_From);
end loop;
Freeze_All (Freeze_From, Decl);
while Present (Comp) loop
Check_Component (Etype (Comp), Parent (Comp));
- Comp := Next_Component (Comp);
+ Next_Component (Comp);
end loop;
end if;
end Check_Component;
return True;
end if;
- E := Next_Entity (E);
+ Next_Entity (E);
end loop;
List := Collect_Primitive_Operations (Derived_Type);
return;
end if;
- Comp := First_Entity (Prefix);
+ Comp := First_Entity (Prefix);
while Nr_Of_Suggestions <= Max_Suggestions and then Present (Comp) loop
if Is_Visible_Component (Comp, Sel) then
if Is_Bad_Spelling_Of (Chars (Comp), Chars (Sel)) then
end if;
end if;
- Comp := Next_Entity (Comp);
+ Next_Entity (Comp);
end loop;
-- Report at most two suggestions
Formal := First_Entity (It.Nam);
if Op = Second_Op then
- Formal := Next_Entity (Formal);
+ Next_Entity (Formal);
end if;
if Is_Descendant_Of_Address (Etype (Formal)) then
exit;
end if;
- F := Next_Formal (F);
+ Next_Formal (F);
end loop;
if Ekind (Formal_Spec) = E_Function
end if;
end if;
- F := Next_Formal (F);
+ Next_Formal (F);
end loop;
end if;
end if;
return;
end if;
- Lit := Next_Literal (Lit);
+ Next_Literal (Lit);
end if;
end;
end if;
while Present (Curr) loop
Mark_Use_Type (Curr);
- Curr := Next_Formal (Curr);
+ Next_Formal (Curr);
end loop;
-- Handle the return type
Set_Current_Use_Clause (Entity (N), Prev_Use_Clause (Curr));
end if;
- Curr := Next_Use_Clause (Curr);
+ Next_Use_Clause (Curr);
end loop;
end Update_Chain_In_Scope;
Comp := First_Component (Typ);
while Present (Comp) loop
Add_Task_Proc (Etype (Comp));
- Comp := Next_Component (Comp);
+ Next_Component (Comp);
end loop;
end if;
Subs := UI_To_Int (Expr_Value (First (Expressions (N))));
for J in 2 .. Subs loop
- Indx := Next_Index (Indx);
+ Next_Index (Indx);
end loop;
end if;
exit;
else
- Ent := Next_Literal (Ent);
+ Next_Literal (Ent);
end if;
end loop;
end if;
while Present (Comp1)
and then Chars (Comp1) /= Chars (S)
loop
- Comp1 := Next_Entity (Comp1);
+ Next_Entity (Comp1);
end loop;
end if;
end if;
end if;
- Comp := Next_Entity (Comp);
+ Next_Entity (Comp);
end loop;
end if;
if Is_Access_Type (Etype (C)) then
return True;
else
- C := Next_Discriminant (C);
+ Next_Discriminant (C);
end if;
end loop;
end if;
then
return True;
else
- C := Next_Component (C);
+ Next_Component (C);
end if;
end loop;
return;
else
- Actual := Next_Actual (Actual);
- Formal := Next_Formal (Formal);
+ Next_Actual (Actual);
+ Next_Formal (Formal);
end if;
end loop;
end if;
return True;
end if;
- Comp := Next_Component (Comp);
+ Next_Component (Comp);
end loop;
end if;
return Ent;
end if;
- Ent := Next_Entity (Ent);
+ Next_Entity (Ent);
end loop;
end;
end if;
end if;
end if;
- Idx := Next_Index (Idx);
+ Next_Index (Idx);
end loop;
return False;
begin
while Present (Indx) loop
Set_Debug_Info_Needed_If_Not_Set (Etype (Indx));
- Indx := Next_Index (Indx);
+ Next_Index (Indx);
end loop;
end;
Nod := N;
while Present (Nod) loop
Visit_Descendant (Union_Id (Next_Entity (Nod)));
- Nod := Next_Entity (Nod);
+ Next_Entity (Nod);
end loop;
end;
end if;