Dump_Original_Only := False;
Dump_Freeze_Null := True;
Current_Source_File := No_Source_File;
+ Push_Output;
+ Set_Standard_Output;
if Arg in List_Range then
Sprint_Node_List (List_Id (Arg), New_Lines => True);
end if;
Write_Eol;
+ Pop_Output;
end pg;
--------
Dump_Original_Only := True;
Dump_Freeze_Null := False;
Current_Source_File := No_Source_File;
+ Push_Output;
+ Set_Standard_Output;
if Arg in List_Range then
Sprint_Node_List (List_Id (Arg), New_Lines => True);
end if;
Write_Eol;
+ Pop_Output;
end po;
----------------------
Dump_Original_Only := False;
Dump_Freeze_Null := False;
Current_Source_File := No_Source_File;
+ Push_Output;
+ Set_Standard_Output;
if Arg in List_Range then
Sprint_Node_List (List_Id (Arg), New_Lines => True);
end if;
Write_Eol;
+ Pop_Output;
end ps;
--------------------
Lid : Int;
begin
+ Push_Output;
+ Set_Standard_Output;
+
if L < 0 then
Lid := L;
-- Now output the list
Print_Tree_List (List_Id (Lid));
+ Pop_Output;
end pl;
--------
procedure pn (N : Union_Id) is
begin
+ Push_Output;
+ Set_Standard_Output;
+
case N is
when List_Low_Bound .. List_High_Bound - 1 =>
pl (Int (N));
Write_Int (Int (N));
Write_Eol;
end case;
+
+ Pop_Output;
end pn;
--------