11 Advanced Ada Programming


  <--Last Chapter Table of Contents Next Chapter-->  


11.1 Packages

Ada Description C Equivalent
package Define a package  -
C:In C++ classes serve two purposes. First they hide declarations. Second they implement objects. In Ada declaration hiding is done separately with packages: you do not need to use tagged records to use packages.

Large Ada programs are divided up into packages. These are collections of procedures functions variables and other declarations that serve a similar purpose. You can have packages to draw text on the screen or packages to do accounts payable or package to work with complex numbers.

To make it easier for different people to work on different packages and to make packages self-documenting Ada packages are divided into two parts. The package specification (or package spec) contains everything that other programs need to use your package. It contains all variables they can access all the subprograms they can call etc. For subprograms you only use the subprogram header the procedure or function line to let the programmers know the name of the subprogram and what the parameters are.

C: Subprograms declared in package specs are similar to C (non-static) function prototypes in header files. Unlike prototypes which are optional declarations in the package specs are required for subprograms to be exported outside of the package.
package currency is

-- This package defines US and Canadian dollars and converts money
-- between these two countries.

subtype BaseCurrency is float;

-- All currencies have a common base type of anUnspecificCurrency.
-- Because the base type is separate
we can change the representation
-- of all currencies by changing anUnspecificCurrency.

type USDollars is new BaseCurrency;
type CanadianDollars is new BaseCurrency;

-- US and Canadian dollars are incompatible types.  Using the wrong
-- currency will cause an error.

procedure SetExchangeRates( USToCanadian : USDollars; CanadianToUS : CanadianDollars );
pragma import( stubbed
SetExchangeRates );
-- change the exchange rates

function ToCanada( money : USDOllars ) return CanadianDollars;
pragma import( stubbed
ToCanada );
-- convert US dollars to Canadian dollars

function ToUS( money : CanadianDollars ) return USDollars;
pragma import( stubbed
ToUS );
-- convert US dollars to Canadian dollars
-- convert Canadian dollars to US dollars

end Currency;

In GNAT you must save this package under the filename "currency.ads" (.ads for Ada Spec ). Here we create different money values two functions to convert between the different rates and a procedure to set the exchange rates to use in the functions. Notice there is no main program.

pragma import( stubbed ... ) indicates that the actual subprograms are incomplete. However the package spec can still be compiled to check for errors and other programmers can refer to your spec when compiling their programs or packages. Any attempt to execute a stubbed subprogram will raise a PROGRAM_ERROR exception.

When all the specs for the project are checked remove the pragma import's from the headers when you begin writing the actual subprograms.

package currency is

-- This package defines US and Canadian dollars and converts money
-- between these two countries.

subtype BaseCurrency is float;

-- All currencies have a common base type of BaseCurrency.
-- Because the base type is separate
we can change the representation
-- of all currencies by changing BaseCurrency.

type USDollars is new BaseCurrency;
type CanadianDollars is new BaseCurrency;

-- US and Canadian dollars are incompatible types.  Using the wrong
-- currency will cause an error.

-- Set the exchange rate between US and Canada and two functions to
-- convert between the currencies.

procedure SetExchangeRates( USToCanadian : USDollars; CanadianToUS : CanadianDollars );
-- change the exchange rates

function ToCanada( money : USDOllars ) return CanadianDollars;
-- convert US dollars to Canadian dollars

function ToUS( money : CanadianDollars ) return USDollars;
-- convert Canadian dollars to US dollars

end Currency;

To complete the package we create a package body with the rest of the details including the completed subprograms. With the implementation details hidden in the package body other programmers don't have to worry about how currency is actually handled.

package body currency is

-- This package defines US and Canadian dollars and converts money
-- between these two countries.

USTOCanadaExchangeRate : USDollars;
-- USDollars because it will always be multiplied with a US amount.
-- Multiplying with a different currency will cause an error.

CanadaToUSExchangeRate : CanadianDollars;
-- CanadianDollars because it will always be multiplied with a Canadian amount

procedure SetExchangeRates( USToCanadian : USDollars; CanadianToUS : CanadianDollars ) is
  USToCanadaExchangeRate := USToCanadian;
  CanadaToUSExchangeRate := CanadianToUS;
end SetExchangeRates;

function ToCanada( money : USDOllars ) return CanadianDollars is
  return CanadianDollars( money * USToCanadaExchangeRate );
end ToCanada;

function ToUS( money : CanadianDollars ) return USDollars is
  return USDollars( money * CanadaToUSExchangeRate );
end ToUS;

end Currency;

Notice we have access to everything we defined in the package spec--we don't need to repeat anything in the body.

Because the two exchange rate variables are defined inside the package body they are invisible to other programmers.

Save this package body as "currency.adb" (.adb for AdaBody). Make sure all pragma import( Stubbed 's are removed for the finished subprograms. Compile both and you have a working package.

To use your package in a program use the with statement.

with Ada.Text_IO
procedure currencyTest is
  Currency.SetExchangeRates( 1.5
0.7 );
  Text_IO.Put( "1 Canadian dollar is" );
  Text_IO.Put( currency.ToUS( 1.0 )'img );
  Text_IO.Put_Line( " US DOllars." );
end currencyTest;

Running the program we get the following result.

1 Canadian dollar is 7.00000E-01 US DOllars.

To have Ada check which package a subprogram belongs to and avoid typing the package name constantly use the use statement.

with currency;
use currency;
SetExchangeRates( 1.5
0.7 );

If the use statement creates an ambiguity Ada will warn you that it can't determine which package SetExchangeRates is in.

Package bodies may have main programs a block at the end of all declarations marked with begin. This allows you to setup your package before it's actually used. In this case we don't need one.

Package specs may have private sections at the end of the spec. There will be times when you will have to provide information so that Ada can compile your spec but you don't want the application programmer to be able use this information. For example you might create a package to maintain a customer list but you don't want the programmer to access the internal fields of a customer list since you might change them at some point.

Just about anything in a package spec can be marked private and the compiler expects the details to be specified in the private section. Declarations can also be limited private meaning that besides having the details inaccessible to the programmer the programmer can't assign between variables of the type. For example use limited private if you think you may include pointers in the type at some time in the future.

package CustomerList  is

  type aCustomerNumber is new positive range 1..1000;
  type aCustomerList is limited private;


  type aCustomerArray is array( aCustomerNumber ) of string(1..120);

    type aCustomerList is record
      CurrentCustomer : aCustomerNumber;
      Customers : aCustomerArray;
    end record;

  -- no pointers yet
but we may some day
so it's limited private
  end CustomerList;

In this example a programmer can declare customer lists but he cannot access the fields CurrentCustomer or Customers (because it's private) nor can he copy lists with assignment statements (because it's limited private).

C: In C++ privacy is limited to classes. In Ada virtually anything can be private.

Packages can have children. A child package is a package that extends the capabilities of the parent package. You can use child packages to add features to existing packages such as the standard Ada libraries or to break up large packages into groups of related functions.

Suppose you had a package called accounting that contains tools to handle accounting in general. You can create a child package for accounts payable begins like this:

  package Accouting.Accounts_Payable is

In GNAT save this package spec as "accounting-accounts_payable.ads" with a minus sign instead of a period.

A child package inherits the package spec from it's parent package. You can access anything in the accounting package including anything private to which access is normally denied.

When a program uses the statement

  with Accouting.Accounts_Payable;

the parent package accounting is automatically with'ed as well (although you still have to use separate use's).

11.2 Controlling Elaboration

Ada Pragma Description C Equivalent
pragma Pure; The simplest kind of package. -
pragma Pure_Function( function_name); When an entire package isn't pure... -
pragma Preelaborate; A package with simple elaboration. -
pragma No_Elaboration_Code; Similar to Preelaborate. -
pragma Elaborate( package ); Force "package" to be elaborated first if possible. -
pragma Elaborate_Body( package ); Elaborate the body before the specification. -
pragma Elaborate_All; Short for Elaborate() for each package. -

Elaboration is the initialization of a package that's done before the main program of the package is executed. Assigning values to constants for example is elaboration.

C: Since C is a has no packages the order of elaboration between files is determined strictly by the compilation order.

For most projects gnat will work out a good elaboration order on its own. However large projects with packages referring to each other in complicated ways may require complex elaboration orders. gnat searches every possible elaboration order until it finds one that solves any ambiguities. To speed up projects with slow elaboration times Ada and gnat provide a number of pragmas to give the compiler hints on the best compilation order and to solve any potential ambiguities.


11.2.1 First line of defense: Pure Preelaborate and No_Elaboration_Code

Pragma Pure and Preelaborate are elaboration restrictions. They are hints to the Ada compiler to cut down the compiler's work when trying to solve elaboration order. Pragma Pure tells Ada that the package requires no elaboration and contains no global variables. For example a package of nothing but type declarations (with no default values) is pure.

package money_types is
  pragma pure;

  -- a simple package
nothing to elaborate

  subtype aCurrency is float;
  type aSalary is new aCurrency;

end money_types;

Pragma Preelaborate tells Ada that the package requires minimal elaboration. You should try pragma pure and if it fails try pragma preelaborate.

gnat 3.11 introduced the gnat specific pragma No_Elaboration_Code. Sometimes this will work when Preelaborate will not.

Sometimes you can declare a function as pure using pragma Pure_Funciton. A pure function is one with no side effects and one that's value doesn't change when executed with the same parameters each time. If the only thing standing in your way to using pure or preelaborate are some functions used to assign initial values try declaring them as pure functions.

If your package or program fails to meet the elaboration restriction requirements the compiler will issue an error.


11.2.2 Second line of defense: Elaborate Elaborate_Body Elaborate_All

Sometimes the hints are not enough. For example a package that assigns a value to constant using a function like

  Sin45 : float := Ada.Numerics.Elementary_Functions.Sin( 45
360 );

is neither pure nor preelaborate because a function must be called when the package is initialized. In these cases you can tell Ada specifically which package should be elaborated first.

Pragma Elaborate( package ) tells Ada the specified package should be elaborated first. For example all generics must be elaborated before they are used so it's a good idea to use pragma elaborate on every generic package.

with generic_linked_list;
pragma Elaborate( generic_linked_list );

Pragma Elaborate_All indicates that a particular package and all the packages used by that package must be elaborate before the current package. For example if package userio uses package common

with userio;
pragma Elaborate_All( userio );

will elaborate both userio and common prior to this package

Because Elaborate_All will affect multiple packages it can cause unnecessary binding errors when used indiscriminately. This pragma when used everywhere effectively requires all packages to be arranged in a strict hierarchy. Make sure this is the effect you want.

11.2.3 Other Elaboration Pragmas

Another pragma pragma Elaborate_Body forces the package body to be elaborated before the package specification. This is especially useful in generic packages.

Pragma Elaborate and Elaborate_All can also be used to resolve ambiguous elaborations.


11.3 Objects

Ada Description C Equivalent
type...tagged record Define an object class
type...new parenttype with record Extend an object class ...: parenttype
type...access all sometype Define a pointer to a class sometype *
'class Class-wide type virtual
abstract Abstract types/subprograms function...=0
C: Ada developed its own object oriented terminology because C's terminology can be ambiguous and confusing. Ada differentiates between a class and the structure that defines that class.

An object in Ada is known as a tagged record. That is it is a normal Ada record that has an invisible tag attached to it. The record

type anEmployeeProfile is record
  name : string(1..80);
  age : anAge;
end record;

can be changed to a tagged record by adding the keyword tagged:

type anEmployeeProfile is tagged record
  name : string(1..80);
  age : anAge;
end record;

Although these two records look the same if we use the 'size attribute to see how much memory the records take up we'll see that the tagged record is bigger. The extra space is used to store the invisible tag.

Unlike normal records fields can be added tagged record and a new tagged record can be created. This is called extending the record. To create a related record with additional fields we use the keyword new:

type anHourlyEmployee is new anEmployeeProfile with record
  hourlyRate : float;
end record;

A tagged record extended in this way has all the fields of anEmployeeProfile but has the additional field of hourlyRate. anEmployeeProfile and anHourlyEmployee are said to be in the anEmployeeProfile class: the class is the collection of anEmployeeProfile and all record extended from it.

Now we can create a access type (commonly called a pointer though technically it isn't a pointer) to any record in the class:

type anEmployeeProfilePtr is access all anEmployeeProfile'class;

This pointer can be assigned either anEmployeeProfile record or anHourlyEmployee record. This is the purpose of the tagged record's invisible tag. The tag indicates the type of tagged record a pointer points to since these kinds of pointers can refer to more than one type of tagged record. This is sometimes called late binding.

ptr1 : anEmployeeProfilePtr := new anEmployeeProfile( "Bob Smith"
45 );
ptr2 : anEmployeeProfilePtr := new anHourlyEmployee( "Denise Jones"
17.50 );

Access variables are null until assigned a different value. They are the only variables in Ada to have a default value.

There may be cases where you want to extend a type without adding new fields. Ada provides a shorthand phrase for this. For example if you want to distinguish hourly employees that work at night as being separate from other hourly employees use

type aNightHourlyEmployee is new anHourlyEmployee with null record;

In complex classes there will be times when you'll want to define a record that you never intend to assign variables to. For example anEmployeeProfile doesn't contain enough fields to completely describe any employee: only the tagged records derived from anEmployeeProfile are usable. When particular record exists only to be extended it called an abstract record. You declare abstract records with the keyword abstract:

type anEmployeeProfile is abstract tagged record
  name : string(1..80);
  age : anAge;
end record;

If you try to create anEmployeeProfile record Ada will report an error since you said that this record can only be extended into other records.

Ada requires that subprograms that work with tagged records be declared immediately after the type declaration. Each procedure or function can only take one tagged record as a parameter.

C: Methods are normal subprograms with an object being referred to as a parameter. myobj.method( x ) would be method (myobj x) or method( x myobj) in Ada.
type aSalaryEmployee is new anEmployeeProfile with record
  salaryRate : float;
end record;

procedure SetSalaryRate( s : in out aSalaryEmployee'class; rate : float ) is
  s.salaryRate := rate;
end SetSalaryRate;

function GetSalaryRate( s : aSalaryEmployee'class ) return float is
  return s.salaryRate;
end GetSalaryRate;

We've declared two one line subprograms that will work on any tagged record derived from aSalaryEmployee.

C: Ada does not require constructors or destructors. Creating objects with these are discussed below.

Subprograms can be marked as unusable in the same way as abstract tagged records. An abstract procedure or function is a placeholder. Declaring one requires that all types extended from this type must have this subprogram defined. If any do not have this subprogram Ada will report an error. For example if anEmployeeProfile had a procedure like

procedure WriteEmployeeName( e : anEmployeeProfile ) is abstract;

all employee profile records would be required to have a procedure called WriteEmployeeName. ASalaryEmployee will have a compilation error unless we add such a function:

procedure WriteEmployeeName( e : aSalaryEmployee )is
  Text_IO.Put_Line( "Employee Name: " & e.Name );
end WriteEmployeename;

WriteEmployeeName could also use aSalaryEmployee'class to refer aSalaryEmployee or any records we extend from it.

To avoid ambiguity only one tagged record subprogram can refer to any one type. This is different from some other object oriented languages where you can override a classwide subprogram with one that refers to a specific type. The advantage of no overriding is that someone reading your class knows exactly which subprogram will be used for a particular tagged record type--they don't need to read the entire class to make sure the subprogram isn't overridden later on. The disadvantage is that if you can't use a classwide type you'll have to write subprograms for each and every type in that class. In these cases typecasting is useful.

Tagged record types can be typecast as other tagged record types (in the same class) using typecasting. You need to do this if you want a dispatching call inside of a dispatching call. For example if anEmployeeProfile has a GetSalaryRate function we could call it by:

procedure WriteEmployeeSalary( e : aSalaryEmployee'class ) is
  Text_IO.Put_Line( "The salary is" & GetSalaryRate( anEmployeeProfile( e ) ) );
end WriteEmployeeSalary;

11.4 Objects with Automatic Initialization/Finalizaton

Ada Controlled Object Call Description C Equivalent
Initialize Initialize an object constructor
Adjust Fix object after assignment copy constructor
Finalize Clean up an object destructor

Basic Ada tagged records don't do anything special when they are created or destroyed. If you want special actions to be executed automatically when a tagged record is created or destroyed you can use the Ada.Finalization package. In this package is defined a special tagged record called Controlled. When you extend this tagged record you can overload special procedures that Ada will automatically execute when necessary. This saves you from having to explicitly call such procedures yourself.

  type businessDepartment is new Finalization.Controlled with record
    departmentHead : aEmployeeProfilePtr := new
      aSalaryEmployee ( "Bob Smith"
age => 45
rate => 42_000.0);
  end record;

In this example every time you allocate a businessDepartment variable DepartmentHead is initialized with a dynamic allocation. We could write a procedure to free up this memory but then we would have to remember to call it every time a variable is about to be discarded. A better way to handle this is to let Ada do the discarding for us. Finalize is the name of the procedure Ada calls when cleaning up a controlled tagged record. We create our own Finalize for our businessDepartment tagged record:

procedure Finalize(bd : in out businessDepartment) is
begin -- Finalize
  Free( bd.departmentHead );
end Finalize;

Now Ada will automatically run this procedure before any businessDepartment variable is destroyed and we never have to worry about forgetting to free up the memory used by departmentHead.

C: Finalize is the destructor.

There are two other such automatic procedure we can use with controlled tagged records. Procedure Initialize is used when an object is first created and procedure Adjust is used after an object is assigned in an assignment statement.

NoteAdjust is very smart. Temporary storage is used for self-assignment. If Adjust fails because of an exception Finalize is not executed.
C:Adjust is like a C++ copy constructor except that Ada will copy the object before calling Adjust. With a copy constructor you must copy the object yourself in the body of the constructor. Unlike a copy constructor Adjust only executes during assignment.
with text_io
use text_io

procedure controlledtest is
srp2 : SampleRecPtr;
  sr3 : SampleRec;
  Put_Line( "(This is the first line of the program)");
  Put_Line( "This is an example of controlled tagged records:" );
  Put_Line( "Executing 'srp1 := new SampleRec'");
  srp1 := new SampleRec;
  Put_Line( "Executing 'srp2 := srp1' (copying a pointer)" );
  srp2 := srp1;
  Put_Line( "Executing 'sr3 := srp1.all' (copying a record pointed to)" );
  sr3 := srp1.all;
  Put_Line( "(This is the last line of the program)");
end controlledtest;

with ada.finalization;
use ada.finalization;

package sample is

   type SampleRec is new Controlled with null record;
   type SampleRecPtr is access all SampleRec;
   -- sample controlled tagged record (and a pointer to same)

   procedure Initialize( sr : in out SampleRec );
   procedure Finalize( sr : in out SampleRec );
   procedure Adjust( sr : in out SampleRec );
   -- these are required for controlled tagged records

end sample;

with Ada.text_io;
use Ada.text_io;

package body sample is
  -- just print messages to show that these are working

procedure Initialize( sr : in out SampleRec ) is
  Put_Line( "Initialize: Initialized tagged record" );
end Initialize;

procedure Finalize( sr : in out SampleRec ) is
  Put_Line( "Finalize: Finalized tagged record " );

end Finalize;

procedure Adjust( sr : in out SampleRec ) is
  Put_Line( "Adjust: Adjusted tagged record " );
end Adjust;

end sample;

Here is the output. The records being affected are noted in bold.

Initialize: Initialized tagged record [sr3]
(This is the first line of the program)

This is an example of controlled tagged records:

Executing 'srp1 := new SampleRec'
Initialize: Initialized tagged record [srp1.all]

Executing 'srp2 := srp1' (copying a pointer)

Executing 'sr3 := srp1.all' (copying a record pointed to)
Finalize: Finalized tagged record [sr3 (before record is copied)]
Adjust: Adjusted tagged record [sr3 (after record is copied)]

(This is the last line of the program)
Finalize: Finalized tagged record [srp1.all]
Finalize: Finalized tagged record [sr3]

Ada also provides a second tagged record Limited_Controlled which is a controlled record that can't be assigned. Consequently it has no adjust procedure.


11.5 Multiple Inheritance

Like a tree tagged records can only be extended from a single parent. Extending from multiple parents is called multiple inheritance and Ada doesn't allow multiple inheritance. The Ada designers considered multiple inheritance a feature that adds ambiguity to a language: for example if an employee tagged record has two different parents each with a salary field do you merge the salary fields into one or do you have two copies of the field in your record? Because there is no consistent solution to this kind of problem the Ada designers decided to not to support multiple inheritance.

However you can add tagged records as nested fields just like you would a normal record. This workaround guarantees that each object will only have one parent it can extend from.

type aClass is tagged record
  F1 : integer;
end record;

type anUnrelatedClass is tagged record
  U1 : integer;
  end record;

type anMIExample is new aClass with
  UC : anUnrelatedClass; -- a field
not an extension
end record;

anMIExample is a tagged record belonging to aClass not to anUnrelatedClass. If you extend anMIExample it will inhert F1 from its parent class. Since anUnrelatedClass UC is nested you can still access it as a field using the prefix "UC.".



11.6 Private Objects

Unless a tagged record class is very small it's kept in it's own package. When you put a class in a package you can use the package to hide the details of the class and to make parts of the class inaccessible to the outside world.

package customers is

  type AbstractCustomer is abstract tagged private;

  type BasicCustomer is new AbstractCustomer with private;


  type AbstractCustomer is new abstract tagged record
    name : string( 1..80 );
  end record;

  type BasicCustomer is new AbstractCustomer with
    SalesCategory : integer;
  end record;

end customers;

By declaring a tagged record as private we eliminate all access to the fields in the record. Anybody who wants to change the value of the fields must do it through any subprograms we provide. In object oriented programming it's a good idea to make as many tagged records private as possible the same as other private types. That way if you want to change the contents of the tagged record programs that use your class will not have to be changed.

C: Ada does not have protected objects but protected objects can be simulated using Ada packages.

11.7 Generics

Ada allows you to create source code templates called generics. With generics you can specify a routine with only general information about the kinds of types the routine can work on. Later a programmer instantiates the generic by giving a type. Generics are useful for things like sort routines which work basically the same way on different data types.

C: Generics are similar to C++ templates.

Contrary to what you might think Ada must compile the generic packages before they are used. Although they act as templates Ada needs the information in the .ali files to solve some rare file dependancy issues. A .o object file is also created although it may be empty.

Ada contains several standard generic procedures. The most important one is unchecked_deallocation. This long winded procedure deallocates memory allocated with new. In order to free up memory you must instantiate an unchecked_deallocation for each access type you are going to use new on. You have to specify both the access type and type of data that is being pointed to.

with unchecked_deallocation;

type booleanPtr is access all boolean;

procedure Free is new unchecked_deallocation( boolean
booleanPtr );

Free is a new version of unchecked_deallocation compiled for booleanPtr's to a boolean type.

Ada was designed for the possibility automatic storage recovery that everything that was allocated in a subprogram would be deallocated automatically when the subprogram is left. Unfortunately gnat was implemented without this feature and all memory has to be explicitly deallocated.

Another standard generic you'll run into is unchecked_conversion. This converts a variable of one type to another by physically copying to data from one to the other such as an array of 8 bits to a short_short_integer.

Although you can write generic subprograms most of the time you use generics will be for creating generic packages. Generic packages have a spec and body like normal Ada packages but they begin with a list of parameters to the package that must be filled in when the generic is instantiated.


  -- these are the parameters for the generic

  type ListElement is <>; -- unspecified list element

  procedure ">="( left
right : ListElement); -- a procedure to sort by

package SimpleList is

  type List is array( 1..100) of ListElement;
  procedure Add( l : list; e : ListElement);
  procedure Sort( l : list );
  procedure Display( l : list );

end SimpleList;



In this example SimpleList takes some kind of data type called a ListElement the items that compose the lists. Besides <> Ada offers a number of other non-specific type descriptors to give the compiler an idea of what kind of types are acceptable. Since the ListElement could be an aggregate and we can't assume we can do simple comparisons the programmer must also specify a procedure to sort the elements by.

Once you write the package body (no generic section in the package body just a regular package body) you can instantiate the generic package in a program. After instantiation use the package like any other package.

with SimpleList;

procedure ListTest is

package BooleanList is new SimpleList( boolean

  -- in this case
the normal ">=" will sort booleans


  BooleanList.Add( mylist
true );
  BooleanList.Add( mylist. False );

end ListTest;

Now you'll notice that generics and tagged records share a lot of capabilities. You can use both to write subprograms that work on a variety of types. Tagged records are referred to as dynamic polymorphism because which subprogram to call gets determined while the program is running. Generics are referred to as static polymorphism because the subprograms are generated when the generic is instantiated by the compiler and which subprogram to call is known when the program is compiled. The better approach depends on what you are doing. In general generics run faster but take up more space because the compiler generates separate subprograms for each type. Tagged records take up less space but tend to run slower.

Variant records and tagged records likewise share much in common. Although variant records can be simulated with tagged records you'll need to decide which is the best choice depending on what you are trying to accomplish. Variant records tend to be smaller and faster but are harder to extend than tagged records.

Since tagged records are naturally used to create variables that are similar to one another you might wonder if you'd ever create a single variable of a tagged record type. These are called singletons and are used in frequently in languages like C++. They are popular because they have a specific elaboration order and provide access to features only available in objects (such as private members). Programmers doing this have no need to create a class of several objects. However Ada has an easily controlled elaboration process and features such as privacy are not specific to tagged records. As a result there is rarely a need for singletons in Ada programs.


11.8 Exceptions

Ada Description C Equivalent
e : exception Declare an exception  -
raise e Raise/throw an exception throw type
exception clause Handle/catch an exception try...catch
C:In C++ exceptions are performed by throwing types (typically objects). In Ada an exception is a separate type. Only exceptions can be thrown--you can't throw types. Exceptions aren't related to objects in any way.

When you throw in C++ you do so in a try block. In Ada you can throw an exception in any block. The exception clause (equivalent to catch) at the end of the block is optional.


What do you do when something unexpected error occurs? Unexpected errors are called exceptions in Ada. For example running out of memory is an exception.

Ada has a number of predefined exceptions and examples of when they occur:

You can turn off checking for most of these errors using pragmas but they are usually a sign that something if fundamentally wrong with your program. Gnat provides a compiler option to turn these checks off for the release version of a program.

The standard libraries have additional exceptions defined.

To handle an exception you need an exception part at the end of a subprogram. When the exception is raised (occurs) execution immediately jumps down to the exception part. The exception part contains a list of exceptions to check for plus an others part similar to a case statement.

procedure exceptional( Total : out integer) is
   -- do some stuff
  when constraint_error => Total := 0;
  when storage_error => Total := -1;
  when others => raise;
end exceptional;

Raise causes the exception to be reraised to the calling subprogram.

If one subprogram doesn't handle the exception it's raised in the subprogram that called it. This continues until the exception is handled by an exception part or the main program is it. In the worst case if the main program has no exception part the program terminates and the exception name is printed on the screen.

One use for exception parts to deallocate access types so the memory isn't lost when unexpected errors occur.

You can define and raise your own exceptions.

procedure exceptional2 is
  Accounting_Error : exception;
C: Ada exceptions do not carry any additional information when raised. You can simulate error messages and other information with global variables.

Pragma Assert provides an exception for debugging programs. Assert is described in 8.2.

For more advanced manipulation of exceptions you'll need to use Ada.Exceptions and its related packages. These are described in 12.15.


11.9 Dynamic Allocation

Ada Description C Equivalent
new Allocate new memory malloc/mallopt
unchecked_deallocation Deallocate memory free

Dynamic allocation is reserving memory for variables while the program is running.  The memory is allocated from a region called the default storage pool. GNAT sometimes refers to this as the unbounded no reclaim pool because the only limit on the amount of memory you can allocate is the physical limit of the machine and memory is not reclaimed through garbage collection.

C: The default storage pool is effectively the "heap".

Ada uses access types to create a handle to dynamically declared variables.

type IntegerPtr is access all Integer;
ip : integerPtr := new Integer;

In this example IP access a dynamically declared integer. IP is only large enough to hold the address of where the integer is located. To access the integer we have to add the suffix .all to IP. This is called dereferencing.

ip.all := 5;

If you are dereferencing multiple pointers the all is only required at the end to indicate that the final pointer is to be dereferenced ( for example . ptr1.ptr2.ptr3.all).

The word all in access all is not strictly required. If all is included the IntegerPtr type will be compatible on any other integer pointer. Without all Ada imposes certain restrictions on what the access type can point to but in general always use access all.

Memory allocated with new is freed with unchecked_allocation (see the section on generics).

You can assign initial values when you create a new dynamic variable. In the following example we declare allocate memory and assign an initial value all at once.

ip : integerPtr := new Integer( 5 );

To create a record with a pointer to itself have an empty type statement with the record first:

  type LinkedListRecord;

  type LinkedListPtr is access LinkedListRecord;
  type LinkedListRecord is record
    info : string(1..80);
    next : LinkedListPtr;
  end record;

To point to variables you've declared you must declare those variables as aliased to indicate they can be pointed to. To get the address of something use the 'access attribute.

  type CustomerArray is array(1..100) of CustomerRecord;
  type CustomerArrayPtr is access all CustomerArray;

  ca : aliased CustomerArray;
  cp : CustomerArrayPtr := ca'access;

cp now points to ca. Individual array elements can also be aliased.

  type CustomerArray is array(1..100) of aliased CustomerRecord;

  type CustomerArrayPtr is access all CustomerArray;

   ca : CustomerArray;
   c15p : CustomerArrayPtr := ca(15)'access;

Ada will give you an error when you try to use 'access when the object pointing to may disappear after the pointer does. If you're absolutely certain that this won't happen you can circumvent the error by using 'unchecked_access.

An access type is necessarily just the address of a dynamic object. To get the address of an access type it's best to use gnat's generic package System.Address_To_Access_Conversions.

  type intacc is access all integer;
  package strConvert is new System.Address_To_Access_Conversions(intacc);
  string_address := strConvert.To_Address( SomeIntAccVar );
Ada 83: The original use of .all created too many ambiguities. Ada 95 requires greater use of .all.

11.10 Callbacks

A callback is a pointer to a subprogram. They are called callbacks because you usually give the pointer to another subprogram that calls the procedure pointed to whenever it needs to. You can declare callbacks using type.

  type UpdateWindow is access procedure;
  type DisplayNewValue is access procedure( newval : integer );

One important restriction is that Ada requires that callbacks to refer to global subprograms. This is done to ensure that the access variable always points to an existing subprogram. You cannot create a callback to a local procedure or function even if it's perfectly safe to do so. If you try you'll get an obscure error message about one level being deeper than another.

The gnat equivalent for 'unchecked_access for callbacks is 'unrestricted_access which you can use if you're absolutely sure the subprogram you're using will not save the access when it's finished running.

You can get the address of a procedure using 'access. Suppose MyUpdateProcedure is a procedure fitting the description of UpdateWindow a procedure with no parameters.

  updatePtr : UpdateWindow := MyUpdateProcedure'access;
  procedure DoComplexSlowComputation( updatePtr);

To call a callback use the dereference operator .all.


11.10.1 Storage Pools

Unlike languages like C that have only one storage pool Ada allows you to define your own storage pools. Authors of real-time applications for example can create a pool with a maximum size limit or a fixed access time.

Use a  for clause to make an access type use a pool other than the default storage pool.

  type AccountingRecPtr is access all AccountingRec;
  for AccountingRecPtr'storage_pool use my_pool;

Gnat defines several storage pools besides the default storage pool. Perhaps the most useful is the debug pool. This storage pool available in version of Gnat before 3.12 works the same as the default storage pool except that it performs run-time checks for several different pointer related problems. If a check fails an exception is raised.

The following program illustrates the errors caught by debug pool access types.

  with Ada.Text_IO
  use Ada.Text_IO;

  with unchecked_deallocation;

  -- This is an example of using the GNAT-specific debug_pool
  -- storage pool.

  procedure debpools is

    type sales_record is record

      salesman_code : integer;
      sales_amount : float;

    end record;

     -- just a typical record

    type salesptr_normal is access all sales_record;

    -- This is a normal access type. It is allocated
    -- in the default storage pool (aka "the heap").
    -- The default storage pool is called
    -- Unbounded_No_Reclaimed_Pool. That is
    -- no size limit
and memory is not reclaimed by
    -- garbage collection.
    -- A debug pool

  sales_debug_pool : System.Debug_Pools.Debug_Pool;

  -- declare a new debug pool
  -- Debug_Pool is a GNAT-specific pool.

  type salesptr_debug is access all Sales_Record;

  for salesptr_debug'storage_pool

    use Sales_Debug_Pool;

  -- This access type has no garbage collection
  -- but raises exceptions on allocation or
  -- deallocation errors
useful for tracking down
  -- storage leaks. All 4 possible exceptions are
  -- shown in this program.

  procedure Free is new Unchecked_Deallocation( sales_record

    salesptr_debug );
  -- procedure to deallocate salesptr_debug access types

    sr : aliased Sales_Record;
spd3 : salesptr_debug;


    Put_Line( "Fun with debug storage pools!");

    -- Debug Pool Exception #1


       Put_Line( "Accessing a non-allocated access type is an exception:" );
       Put_Line( "spd.salesman_code := 1");

       spd.salesman_code := 1; -- error: not allocated
    exception when System.Debug_Pools.Accessing_Not_Allocated_Storage =>
       Put_Line( "***Accessing_Not_Allocated_Storage raised" );
    when others =>
       Put_Line( "***Unexpected exception" ); raise;

    -- Debug Pool Exception #2

      Put_Line( "Freeing a non-allocated access type is an exception:" );
      Put_Line( "spd2 := sr'access --not allocated in pool" );
      Put_Line( "Free( spd2 )" );
      spd2 := sr'access;
      Free( spd2 );
    exception when
      System.Debug_Pools.Freeing_Not_Allocated_Storage =>
      Put_Line( "***Freeing_Not_Allocated_Storage raised" );
    when others =>
      Put_Line( "***Unexpected exception" ); raise;

    spd := new Sales_Record'( salesman_code => 1
sales_amount => 55.50 );
    -- Debug Pool Exception #3

      Put_Line( "Accessing deallocated access type is an exception:" );
      Put_Line( "spd := new Sales_Record...");
      Put_Line( "Free( spd )" );
      Put_Line( "spd.salesman_code := 1");
      Free( spd );
      spd.salesman_code := 1; -- error: not allocated
    exception when System.Debug_Pools.Accessing_Not_Allocated_Storage =>
      Put_Line( "***Accessing_Deallocated_Storage raised" );
    when others =>
      Put_Line( "***Unexpected exception" ); raise;

    spd := new Sales_Record'( salesman_code => 1
sales_amount => 55.50 );
    -- Debug Pool Exception #4

     Put_Line( "Freeing deallocated access type is an exception:" );
     Put_Line( "spd := new Sales_Record...");
     Put_Line( "spd2 := spd" );
     Put_Line( "Free( spd )" );
     Put_Line( "Free( spd2 )" );
     spd2 := spd;
     Free( spd );
     Free( spd2 );
  exception when System.Debug_Pools.Freeing_Deallocated_Storage =>

    Put_Line( "***Freeing_Deallocated_Storage raised" );
  when others =>
    Put_Line( "***Unexpected exception" ); raise;

end debpools;

Program Result:
Fun with debug storage pools!

Accessing a non-allocated access type is an exception:
spd.salesman_code := 1
***Accessing_Not_Allocated_Storage raised

Freeing a non-allocated access type is an exception:
spd2 := sr'access --not allocated in pool
Free( spd2 )
***Freeing_Not_Allocated_Storage raised

Accessing deallocated access type is an exception:
spd := new Sales_Record...
Free( spd )
spd.salesman_code := 1
***Accessing_Deallocated_Storage raised

Freeing deallocated access type is an exception:
spd := new Sales_Record...
spd2 := spd
Free( spd )
Free( spd2 )
***Freeing_Deallocated_Storage raised

To create your own storage pools you need to extend the Root_Storage_Pool tagged record found in the System.Storage_Pools package.

[give example--KB]

11.10.2 Access Parameters

Because pointers are offen passed as parameters Ada provides a special parameter type just for access types. access parameters are access types behave the same as an in parameter: you cannot assign a new value to the parameter. However because it is an access type you can change what the access parameter points to.

Access parameters offer some advantages over in parameters with an access type:

Access parameters can't be compared or assigned but you can typecast an access parameter into a normal access type and then compare values or assign it.

with Ada.Text_IO;
use Ada.Text_IO;

procedure accparm is
  -- An example of access parameters

  -- Create a customer account record

  type money is new float;
  type aPercent is new float;

  type aCustomerAccount is record
       moneyOwing : money := 0.0;      -- money on the account
       interest   : aPercent := 0.15;  -- 15% interest
  end record;
  type aCustomerPtr is access all aCustomerAccount;

  procedure chargeInterest( cp : access aCustomerAccount ) is
    -- update the customer record by charging the interest
    cp.moneyOwing := cp.moneyOwing * money(1.0 + cp.interest );
  end chargeInterest;

  procedure chargeInterest2( c : in out aCustomerAccount ) is
    -- update the customer record by charging the interest
    c.moneyOwing := c.moneyOwing * money(1.0 + c.interest );
  end chargeInterest2;

  function chargeInterest3( cp : access aCustomerAccount ) return boolean is
    -- update the customer record by charging the interest
    -- if under 1000
don't charge interest and return false
    if cp.moneyOwing < 1000.0 then
       return false;
    end if;
    cp.moneyOwing := cp.moneyOwing * money(1.0 + cp.interest );
    return true;
  end chargeInterest3;

   cp : aCustomerPtr;


   Put_Line( "An Example of Access Parameters" );

   cp := new aCustomerAccount;

   Put_Line( "chargeInterest uses an access parameter" );
   cp.moneyOwing := 1500.0;
   Put_Line( "Charging interest on" & cp.moneyOwing'img );
   chargeInterest( cp );
   Put_Line( "After interest
money owing is" & cp.moneyOwing'img );

   Put_Line( "chargeInterest2 uses an in out parameter" );
   cp.moneyOwing := 1700.0;
   Put_Line( "Charging interest on" & cp.moneyOwing'img );
   chargeInterest2( cp.all );
   Put_Line( "After interest
money owing is" & cp.moneyOwing'img );

   Put_Line( "chargeInterest3 is a function with an access parameter" );
   cp.moneyOwing := 1900.0;
   Put_Line( "Charging interest on" & cp.moneyOwing'img );
   if chargeInterest3( cp ) then
      Put_Line( "After interest
money owing is" & cp.moneyOwing'img );
      Put_Line( "No interest was charged" );
   end if;

   Put_Line( "A null pointer for an access parameter causes an exception" );
   cp := null;
   Put_Line( "Charging interest on a null pointer" );
   if chargeInterest3( cp ) then
      Put_Line( "After interest
money owing is" & cp.moneyOwing'img );
      Put_Line( "No interest was charged" );
   end if;

   when constraint_error =>
        Put_Line( Standard_Error
Constraint error exception raised
   when others =>
        Put_Line( Standard_Error
Unexpected exception raised

end accparm;

An Example of Access Parameters

chargeInterest uses an access parameter
Charging interest on 1.50000E+03
After interest
money owing is 1.72500E+03

chargeInterest2 uses an in out parameter
Charging interest on 1.70000E+03
After interest
money owing is 1.95500E+03

chargeInterest3 is a function with an access parameter
Charging interest on 1.90000E+03
After interest
money owing is 2.18500E+03

A null pointer for an access parameter causes an exception
Charging interest on a null pointer
Constraint error exception raised

11.11 Multithreading

Versions of Gnat prior to GCC 3.x come with two alternative libraries for multithreading support. It can either use the native Linux (for example pthreads for libc6) or it can use FSU (Florida State University) threads that are included with Gnat. By default the Linux version of gnat is compiled for Linux native threads.

GCC 3.x supports native threads only.

NoteThe number of threads you can create depends on the operating system and the size of the stack. For example on Windows XP there is a limit of 252 threads. Increase the stack size if you need more threads.

11.11.1 FSU verses Native Threads

The FSU threads provide better concurrency at very small time slices but are incompatible with Linux's pthreads library. This means you can't use the FSU version of gnat with the standard Linux libraries unless you recompile the libraries for FSU threads as well. FSU threads also force blocking on system calls and can cause blocking problems multiprocessors and as a result most people don't use them. One exception is Florist a POSIX (that is Linux O/S calls) binding using FSU threads. The main benefit of FSU threads is that they are Ada Annex C & D compliant.

Linux kernel 2.6 introduced better threads so it may be that FSU threads are no longer necessary. I haven't investigated this.

To use FSU threads you need to compile gnat 3.x from its sources.


11.11.2 Tasks

In Ada a thread is referred to ask a task. It has nothing to do with multitasking as its name might imply. A task runs independently of the main program either by true parallelism on a multiprocessor computer or as a separate job on a single processor computer. There is no way to specify which processor will receive a task: Linux takes care of this automatically.

Note: Multithreaded programs have limits on the stack size for each thread--this is true for all Linux computer languages. Gnat 3.13 has an 8 Meg stack size limit per thread. Older versions had limits as low as 1 Meg per thread because of limits imposed by the Linuxthreads library.

A task can take on several forms. In its simplest form a task is structured like a package with a specification and a body. The following is an example of a simple thread that waits 5 seconds after a program is started and displays a message.

  task SimpleTask;
  task body SimpleTask is
    delay 5.0;
    Put_Line( "The simple task is finished");
  end SimpleTask;

The specification like a package indicates what identifiers are available to the outside world. The SimpleTask thread doesn't communicate with the main program: it's specification is only one line long.

Communicating with the rest of the program can be difficult. For example with the tasks and main program running in parallel sharing variables can be difficult. How does one task know when another task or the main program is finished changing the value of a variable? If a task works with a variable that's only partially been udpated the data will be corrupt.

Ada provides two ways for a thread to communicate with the rest of the program.

The first communication method is called a rendezvous. One task communicates with another by sending a request. A task may send a request to another task to update a certain variable or to perform a certain action that would otherwise risk data corruption.

Because this communication happens "on the fly" it's declared in two parts. First in the task specification a list of all requests the task is prepared to accept. These are called entry statements and look much like procedure declarations.

Suppose we write a task to keep a running total to be shared between several other tasks. We use a separate task to keep the total from being corrupted.

  task CountingTask is
    entry add( amount : integer );
  end CountingTask;

In the task body a task indicates when it's ready to accept messages using the accept statement. This statement checks for outstanding requests from the rest of the program.

  task body CountingTask is
    runningTotal : integer := 0;
      accept add( amount : integer ) do
      runningTotal := runningTotal + amount;
      end add;
    end loop;
  end CountingTask;

When this thread runs accept statement will check for an add request. If there are no outstanding add requests the thread suspends itself until a request is sent waiting indefinitely for a new request. Suspending for a request is known as blocking.

An accept statement with do part will cause your task to wait for that request and then do nothing. You can do this to synchronize two tasks.

  accept WaitUntilITellYouToGo;

Suppose we add another entry statement to read the current value of the running total.

  task CountingTask is
    entry add( amount : integer );
    entry currentTotal( total : out integer);
  end CountingTask;

In this case we want the task to check for two different requests. The Ada select statement keeps a task from blocking and instead checks for multiple messages.

  task body CountingTask is
    runningTotal : integer := 0;
        accept add( amount : integer ) do
          runningTotal := runningTotal + amount;
        end add;
        accept currentTotal( total : out integer ) do
          total := runningTotal;
        end currentTotal;
      end select;
    end loop;
  end CountingTask;

In this example the task will repeatedly check for an add request or a currentTotal request.

To communicate with the task we make calls to the task as if it were a package. For example to send a message to add 5 to the running total we'd use

  CountingTask.Add( 5);

Because accept is a statement that executes at run-time you can create any kind of message policy you want. Some messages can block. Some messages can be checked. You can force certain message to be handled before others.

The final "or" part of a select can contain instructions to execute when none of the accepts statements are executed. For example a task can end itself with the terminate command. If you want a task to terminate when there are no more requests add a


at the end of your select statement.

If select statement doesn't give you enough control over blocking select can include when clauses. The clauses work like an if statement executing the accept statement only if a condition is true. If time2accept is a boolean variable you could write

    when time2accept =>
      accept add( amount : integer ) do

A when clause is referred to as a "guard" because like a crossing guard the accept will not execute unless the guard gives permission.

Ada also has a delay statement. Delay forces a task (or a program) to suspend itself for a number of seconds. To wait for three-and-a-half seconds use

  delay 3.5;
Note: If you change the operating system clock backwards while an Ada application is running delay will wait until the point of time originally calcuated when delay was executed. That is it waits until the system clock returns to where it was before and then waits 3.5 seconds.

You can place a delay statement in the last "or" part of a select statement to force the task to suspend itself for a few seconds if no requests were found.

Delay can also wait for a particular time. The time is expressed using the Ada.Calendar time format. If Tomorrow is a variable with the time of midnight tomorrow in the Ada.Calendar time format you can delay the start of a task with

  delay until Tomorrow;

In an emergency one task can terminate another with the abort statement.

  abort CounterTask;

Ada provides a variation of the select statement for tasks that timeout when they cannot complete their work in time. This version has two parts: the first part consists of what to do if the task isn't completed in time and the second consists of the task to complete. For example if BigCalculation is a slow process that we wish to timeout after 30 seconds

  select delay 30.0;
    Put_Line( "Timeout!" );
  then abort
  end select;

In this example BigCalculation will continue for up to 30 seconds. If it doesn't finish Timeout! is displayed and BigCalculation is aborted.


11.11.3 Task Types

Often multithreaded programs will need a set of identical tasks. For example you many want to sort a customer's records for several different customers using different threads. You can't do this with the simple tasking examples shown so far.

To create a set of identical tasks you must create a template of the tasks to run. Ada calls these templates a task type: they look just like a regular task except the specification begins with "task type" instead of "task" by itself. The following is a task template using the CountingTask example.

  task type CountingTask is
    entry add( amount : integer );
    entry currentTotal( total : out integer );
  end CountingTask;

This template will not run by itself. If we want to create a CountingTask task we create one by declaring it.

Task2 : CountingTask;

Task1 and Task2 are two copies of CountingTask. This is equivalent to creating two separate tasks:

  task Task1 is
    entry add( amount : integer );
    entry currentTotal( total : out integer);
  end Task2;

  task Task2 is
    entry add( amount : integer );
    entry currentTotal( total : out integer);
  end Task2;

Because task types can be declared we can create 20 tasks at once by declaring an array of 20 CountingTask's.

  CountingTasks : array(1..20) of CountingTask;

Tasks can also be declared in records as well or allocated dynamically using the new operator.

  type aTaskPtr is access CountingTask;
  tp : aTaskPtr;
  tp := new CountingTask;

Using new you can create as many copies of a particular task as you need.


11.11.4 Protected Items/Types

Ada tasks are useful for many kinds of multithreading. However Ada provides a second method of multithreading called protected objects. These are similar to the "monitors" used by Java.

In an Ada task you specify when and how different tasks communicate. When items are declared protected Ada controls the interaction for you.

Protected objects are declared the same was as a package using a specification and a body. They act like a package that allows only one task access to its contents at a time. While one task is using the contents any other task wanting access is blocked until the first task is finished.

Here is our CountingTask rewritten as a protected item.

  protected CountingType is
    procedure add( amount : integer);
    procedure currentTotal( total : out integer );
    runningTotal : integer := 0;
  end CountingType;

  protected body CountingType is
    procedure add( amount : integer ) is
      runningTotal := runningTotal + amount;
    end add;

    procedure currentTotal( total : out integer ) is
       total := runningTotal;
    end currentTotal;

  end CountingType;

In this case any task may execute the add or currentTotal procedures but only one task may execute them at a time. This ensures that runningTotal will not be corrupted.

Unlike a package you can't declare variables in the spec or body unless you put them in a "private" part in the spec.

Protected items can include entry declarations. Since there is no "main program" to the protected body the protected body contains no accept statements. Instead the entry declarations are filled in as if they were a subprogram. Any guarding conditions are attached to the end of the entry header.

For example to create an a version of our add procedure that blocks if the total is higher than 100 we could write

  protected CountingType is
    entry add( amount : integer );
  protected body CountingType is
    entry add( amount : integer ) when runningTotal<100 is
    runningTotal := runningTotal + amount;
  end add;

Like tasks you can create protected types by declaring the specification with "protected type" instead of "protected". You can then create arrays of protected items or declare protected items dynamically.

This covers the basics of Ada's multithreading capabilities. There's much more that Ada can do. If you are writing complicated multithreading programs you're encouraged to investigate the Ada Reference Manual for more information.

11.12 Ada Text Streams

A stream is a sequential transmission of different types of data. When data is written to a stream the stream converts the data to a form suitable for transmission. When the data is read it's converted from the stream's format back to its original form.

A practical example is saving tagged records belonging to the same class to a file.

Ada's syntax for using streams is a bit cumbersome. Like tagged records some of the features are implemented using attributes and others are found in standard packages.

The Ada.Streams.Stream_IO can write heterogeneous data to a text file and then read it back again. This package contains a number of subprograms similar to Ada.Text_IO including Open Close Reset Delete Is_Open and End_Of_File.

However there are no Get or Put procedures. Instead there are stream subprograms for working with the data in the file.

Read and Write are not used directly. Instead the attributes 'read and 'write will read and write an item to the stream. That is Gnat does the necessary conversion to stream data for you.

For classes of tagged records 'input and 'output read and write any child of the class. These attributes are implicitly defined for all class-wide types (that are not also limited). As a result you usually combine 'class with the stream attributes for 'class'input and 'class'output. If you don't supply 'class nothing will be written and no exception will be raised.

with ada.text_io
use  ada.text_io
with ada.unchecked_deallocation;

procedure class_stream is

  -- Contact_Info: A simple class
  -- the base class must not be abstract when using 'input and 'output

  type contact_info is tagged null record;
  type contact_ptr is access all contact_info'class;

  type phone_number is new contact_info with record
       phone : string(1..14);
  end record;

  type office_number is new contact_info with record
       office : integer;
  end record;

  procedure free is new ada.unchecked_deallocation(

  -- A Stream File and Its Stream

  stream_file : Ada.Streams.Stream_IO.File_Type;
  the_stream  : Ada.Streams.Stream_IO.Stream_Access;

  contact : contact_ptr;


  Put_Line( "An example of Ada.Streams.Stream_IO and a Class" );
  Put_Line( "-----------------------------------------------" );

  Create( stream_file
  Put_Line( "Created a stream file" );
  -- open the stream file

  the_stream := stream( stream_file );
  -- get a stream representing the file's contents

  contact := new phone_number'( phone => "1-905-555-1023" );
  contact_info'class'output( the_stream
contact.all );
  free( contact );
  Put_Line( "Wrote a phone number" );
  -- write a record

  contact := new office_number'( office => 8023 );
  contact_info'class'output( the_stream
contact.all );
  free( contact );
  Put_Line( "Wrote an office number" );
  -- write a record

  Close( stream_file );
  -- close the stream file

  -- Read Them

  Open( stream_file
  Put_Line( "Opened a stream file" );
  -- open the stream file

  the_stream := stream( stream_file );
  -- get a stream representing the file's contents

  while not End_of_File( stream_file ) loop
       contact : contact_info'class := contact_info'class'input( the_stream );
       -- if this were more sophisticated
we could write a Put procedure
       -- for each tagged record and use dynamic dispatching
       if contact in phone_number then
          Put_Line( "read a phone number" );
       elsif contact in office_number then
          Put_Line( "read an office number" );
          Put_Line( "read something else" );
       end if;
  end loop;

  Close( stream_file );
  -- close the stream file

end class_stream;

An example of Ada.Streams.Stream_IO and a Class

Created a stream file
Wrote a phone number
Wrote an office number

Opened a stream file
read a phone number
read an office number

Files of items of the same time are more easily created with Ada.Sequential_IO or Ada.Direct_IO.

Custom streams can be created to save or trasmit data in other ways such as in memory or through a network connection. Custom streams are created as tagged records extended from a root class Ada.Streams.Root_Stream_Type'class.

    type My_Stream is new Root_Stream_Type with record

Your stream type must override the abstract Red and Write subprograms to add and remove data from the stream.

The following is an in-memory stream creating by Warren Gay. This stream can share data between programs buffering the data as text in memory. If a buffer overflow occurs an END_ERROR is raised.

-- $Id: memory_stream.ads
v 1.1 2000/11/26 05:00:18 wwg Exp $
-- (c) Warren W. Gay VE3WWG ve3wwg@home.com
-- Protected under the GNU GPL License

with Ada.Finalization
use  Ada.Finalization

package Memory_Stream is

    type Stream_Access is access all Ada.Streams.Root_Stream_Type'Class;
    type Memory_Buffer(Max_Elem: Stream_Element_Offset) is new Controlled with private;

    -- The new Stream Type
which must be derived from
    -- Root_Stream_Type. Note that Root_Stream_Type is
    -- NOT derived from Controlled
so if
    -- controlled attributes are necessary
they must
    -- be defined separately
and embedded into this
    -- object
as is done with Memory_Buffer here.
    type Memory_Buffer_Stream(Max_Elem: Stream_Element_Offset) is new Root_Stream_Type with record
            Mem_Buf:        Memory_Buffer(Max_Elem);   -- Object with Finalization
    end record;

    type Memory_Buffer_Stream_Ptr is access all Memory_Buffer_Stream;

    -- The overloaded abstract for Read
    procedure Read(Stream: in out Memory_Buffer_Stream;
        Item: out Stream_Element_Array; Last: out Stream_Element_Offset);

    -- The overloaded abstract for Write
    procedure Write(Stream: in out Memory_Buffer_Stream;
        Item: in Stream_Element_Array);

    -- Rewind the Read Memory Buffer Index
    procedure Rewind_Read(Stream: Stream_Access);

    -- Rewind the Write Memory Buffer Index
    procedure Rewind_Write(Stream: Stream_Access);

    -- To permit easy destruction of this stream
    procedure Free(Stream: Stream_Access);


    -- To create a Memory_Buffer stream with an
    -- Initialize procedure
it must be derived from
    -- a Controlled type. Unfortunately
the type
    -- Root_Stream_Type is not derived from the
    -- Controlled type
so it is done privately here.
    type Memory_Buffer(Max_Elem: Stream_Element_Offset) is new Controlled with record
            Read_Offset:    Stream_Element_Offset;
            Write_Offset:   Stream_Element_Offset;
            Buffer:         Stream_Element_Array(1..Max_Elem);
    end record;

    procedure Initialize(Buf: in out Memory_Buffer);
    procedure Write(Buf: in out Memory_Buffer; Item: in Stream_Element_Array);
    procedure Read(Buf: in out Memory_Buffer;
        Item: out Stream_Element_Array;
        Last: out Stream_Element_Offset);
    procedure Rewind_Read(Buf: in out Memory_Buffer);
    procedure Rewind_Write(Buf: in out Memory_Buffer);

end Memory_Stream;

-- $Id: memory_stream.adb
v 1.1 2000/11/26 05:00:18 wwg Exp $
-- (c) Warren W. Gay VE3WWG ve3wwg@home.com
-- Protected under the GNU GPL License

with Ada.Text_IO; use Ada.Text_IO;

with Ada.Finalization; use Ada.Finalization;
with Ada.IO_Exceptions; use Ada.IO_Exceptions;
with Ada.Unchecked_Deallocation;

package body Memory_Stream is

    -- Read from a Memory Buffer Stream :
    procedure Read(Stream: in out Memory_Buffer_Stream; Item: out Stream_Element_Array; Last: out Stream_Element_Offset) is
    end Read;

    -- Write to a Memory Buffer Stream :
    procedure Write(Stream: in out Memory_Buffer_Stream; Item: in Stream_Element_Array) is
    end Write;

    -- Rewind the Read Memory Buffer Index
    procedure Rewind_Read(Stream: Stream_Access) is
        Mem_Str:    Memory_Buffer_Stream_Ptr := Memory_Buffer_Stream_Ptr(Stream);
    end Rewind_Read;

    -- Rewind the Write Memory Buffer Index
    procedure Rewind_Write(Stream: Stream_Access) is
        Mem_Str:    Memory_Buffer_Stream_Ptr := Memory_Buffer_Stream_Ptr(Stream);
    end Rewind_Write;

    -- Free a Memory Buffer Stream :
    procedure Free(Stream: Stream_Access) is
        type Memory_Buffer_Stream_Ptr is access all Memory_Buffer_Stream;
        procedure Free_Stream is new Ada.Unchecked_Deallocation(Memory_Buffer_Stream
        Str_Ptr:    Memory_Buffer_Stream_Ptr := Memory_Buffer_Stream_Ptr(Stream);
    end Free;

    -- Private Implementation :

    -- Initialize a Memory_Buffer Object :
    procedure Initialize(Buf: in out Memory_Buffer) is
        Buf.Read_Offset := Buf.Buffer'First;
        Buf.Write_Offset := Buf.Buffer'First;
    end Initialize;

    -- Write to a Memory Buffer Object :
    procedure Write(Buf: in out Memory_Buffer; Item: Stream_Element_Array) is
        Count:      Stream_Element_Offset := Item'Last + 1 - Item'First;
        Last:       Stream_Element_Offset := Buf.Write_Offset + Count - 1;

        if Last > Buf.Buffer'Last then
            raise Ada.IO_Exceptions.End_Error;
        end if;

        Buf.Buffer(Buf.Write_Offset..Last) := Item;
        Buf.Write_Offset := Buf.Write_Offset + Count;
    end Write;

    -- Read from a Memory Buffer Object :
    procedure Read(Buf: in out Memory_Buffer; Item: out Stream_Element_Array; Last: out Stream_Element_Offset) is
        Xfer_Count: Stream_Element_Offset := Item'Last + 1 - Item'First;
        Data_Count: Stream_Element_Offset := Buf.Write_Offset - Buf.Read_Offset;

        if Xfer_Count > Data_Count then
            Xfer_Count := Data_Count;
        end if;

        Item(1..Xfer_Count) := Buf.Buffer(Buf.Read_Offset..Buf.Read_Offset+Xfer_Count-1);
        Buf.Read_Offset := Buf.Read_Offset + Xfer_Count;
        Last := Item'First + Xfer_Count - 1;
    end Read;

    -- Rewind the Read offset in the Memory Buffer
    procedure Rewind_Read(Buf: in out Memory_Buffer) is
        Buf.Read_Offset := Buf.Buffer'First;
    end Rewind_Read;

    -- Rewind the Write offset in the Memory Buffer
    procedure Rewind_Write(Buf: in out Memory_Buffer) is
        Buf.Read_Offset := Buf.Buffer'First;    -- Implies a Read offset rewind
        Buf.Write_Offset := Buf.Buffer'First;   -- Rewind the write offset
    end Rewind_Write;
end Memory_Stream;

-- $Id: main.adb
v 1.1 2000/11/26 05:00:18 wwg Exp $
-- (c) Warren W. Gay VE3WWG ve3wwg@home.com
-- Protected under the GNU GPL License

with Ada.Text_IO;
use Ada.Text_IO;

with Memory_Stream;
use Memory_Stream;

-- This is a demo main program
that makes use of
-- our home-brewed Memory_Buffer_Stream.
-- To demonstrate
a record of type my_rec is
-- written to the stream with known values
-- then is read back twice
into records T and U.
-- Then the write offset is rewound
and a new
-- float variable F is written
and then read
-- back into float variable G.
procedure Main is
    type my_rec is record          -- A demonstration record
            A:      natural;
            B:      integer;
            S:      string(1..8);
            Z:      float;
    end record;

    Str:    Stream_Access := null;               -- A Stream
    R:      my_rec := ( 23
1.414 );   -- An initialized record

    T:      my_rec := ( 0

0.0 );        -- For 1st read
    U:      my_rec := T;                                -- For 2nd read

    F:      float := 29.99;                             -- An initialized float
    G:      float := 0.0;                               -- For 3rd read


    put_line("Demonstration has begun:");

    Str := new Memory_Buffer_Stream(4096); -- Create in-memory buffer stream (4096 bytes)

R);                        -- Write record R to stream

T);                         -- Read stream back to record T

    put_line("T.A :=" & natural'image(T.A));    -- Dump out T
    put_line("T.B :=" & integer'image(T.B));
    put_line("T.S := '" & T.S & "'");
    put_line("T.Z := " & float'image(T.Z));

    Rewind_Read(Str);                           -- Rewind the read pointer

U);                         -- Now read into record U

    put_line("U.A :=" & natural'image(U.A));    -- Dump out U
    put_line("U.B :=" & integer'image(U.B));
    put_line("U.S := '" & U.S & "'");
    put_line("U.Z := " & float'image(U.Z));

    Rewind_Write(Str);                          -- Implies a read rewind also

F);                         -- Write F to stream

G);                          -- Read stream into G

    put_line("G :=" & float'image(G));          -- Report G for verification

    Free(Str);                                  -- Delete stream

    put_line("Demonstration complete.");
end Main;

Demonstration has begun:
T.A := 23
T.B :=-95
T.S := 'oink    '
T.Z :=  1.41400E+00
U.A := 23
U.B :=-95
U.S := 'oink    '
U.Z :=  1.41400E+00
G := 2.99900E+01
Demonstration complete.
Notehttp://www.ibpaus.de/downloads/index.html has an example of streams that always use network byte order.

11.13 Pragmas

Pragmas sometimes called compiler directives are statements that provide additional information to the compiler build a better executable. Pragmas never change the meaning of a program.

The following are the predefined Ada 95 pragmas:

Abort_Defer defer abouts over a block of statements*
Ada_83 enforce Ada 83 conventions even if compiler switches say otherwise*
Ada_95 enforce Ada 95 conventions even if compiler switches say otherwise*
All_Calls_Remote All subprograms in a RPC package spec are RPC callable
Annotate add information for external tools*
Assert create an assertion*
Asynchronous call to remote subprogram can complete before subprogram is done
Atomic identifier must be read/written without interruption
Attach_Handler install a signal handler procedure
C_Pass_By_Copy when calling C functions use pass by copy (not by reference) when able*
Comment same as Ident *
Common_Object for Fortran create variables that share storage space*
Complex_Representation use gcc's complex number format (for speed)*
Component_Alignment indicate how record components should be stored*
Controlled turn off garbage collection for a type (no effect in gnat)
Convention apply a convention to an identifier
CPP_Class treat a record or tagged record as a C++ class*
CPP_Constructor treat imported function as a C++ class constructor*
CPP_Destructor treat imported function as a C++ class destructor*
CPP_Virtual import a C++ virtual function*
CPP_Vtable specify a virtual function table*
Debug specify a debugging procedure call*
Discard_Names discard ASCII representation of identifiers as used by 'img
Elaborate elaborate a certain package before this one
Elaborate_All elaborate all with'ed packages before this one
Elaborate_Body elaborate a package's body immediate after it's spec
Elaboration_Checks select dynamic (Ada Reference Manual) or static (Gnat default) elaboration checks
Eliminate indicate an identifier that is not used in a program created by gnatelim *
Error_Monitoring treat errors as warnings during a compile*
Export export an identifier from your program so it can be used by other languages
Export_Function export an Ada function with additional information over pragma Export*
Export_Object export an Ada tagged record with additional information over pragma Export*
Export_Procedure export an Ada procedure with additional information over pragma Export*
Export_Valued_Procedure export an Ada side effect function with additional information over pragma Export*
Extend_System obsolete*
External_Name_Casing Set the default capitalization for a case-sensitive langauge imports. May be set to Uppercase Lowercase or As_Is (Gnat default)*.
Finalize_Storage_Only no finalize on library-level objects primarily for gnat's internal use *
Ident object file identification string (no effect with Linux) *
Import import an identifer from another language so it can be used in your program
Import_Function import a non-Ada function with additional information over pragma Import*
Import_Object import a non-Ada object with additional information over pragma Import*
Import_Procedure import a non-Ada procedure with additional information over pragma Import*
Import_Valued_Procedure import a non-Ada side effect function with additional information over pragma Import*
Initialize_Scalars set scalars variables to illegal values whenever possible
Inline the indicated subprogram may be inlined.
Inline_Always forces inter-unit inlining regardless of compiler switches*
Inline_Generic for compatibility with other Ada compilers*
Inspection_Point specify that an identifier's value must readable at the given point in the program (for code validation)
Interface_Name for compatibility with other Ada compilers*
Interrupt_Handler declare a signal handler procedure
Interrupt_Priority Specify the task/protected object's priority where blocking occurs
Linker_Alias select an alternative linker[?] for a package (or other llinkable unit)*
Linker_Options pass a string of options to the linker
Linker_Section the gcc linker section to use *
List list source code while being compiled
Locking_Policy Spcify how protected objects are locked and when blocking occurs
Machine_Attribute specify GCC machine attributes*
No_Return specify a procedure that is deliberately never returned from to avoid compiler warnings*
No_Run_Time ensures no gnat run-time routines are use (e.g. for creating device drivers)*
Normalize_Scalars set scalars variables to illegal values whenever possible (Usually initialize_scalars should be used instead)
Optimize indicates how statements should be optimzed
Pack indicates that the type should be compressed as much as possible
Page start a new page in a program listing
Passive for compatibility with other Ada compilers*
Polling if on enables exception polling*
Priority Specify the priority of a task
Preelaborate preelaborate the specified package
Propagate_Exceptions specify imported subprogram that can handle Ada exceptions; used with zero cost handling *
Psect_Object Same as common_object*
Pure specifies the package is pure
Pure_Function specify a function without side-effects*
Queuing_Policy How task/protected objects are sorted when queued
Ravenscar enforce the Ravenscar real-time policies*
Remote_Call_Interface Ensure a package can be callable by remote procedure calls
Remote_Types used for communication between RPC partitions
Restricted_Run_Time like Ravenscar turns on a number of  restrictions for real-time programming *
Restrictions Disable certain language features
Reviewable Provide a run-time profiling (like gprof)
Share_Generic for compatibility with other Ada compilers*
Shared_Passive used for sharing global data with separate RPC partitions
Source_File_Name overrides normal Gnat file naming conventions*
Source_Reference for use with gnatchop*
Storage_Size amount of storage space for a task
Stream_Convert simplified way of creating streams I/O subprograms for a given type*
Style_Checks Select which Gnat style source code style checks to enforce (if enabled when compiled)*
Subtitle for compatibility with other Ada compilers*
Suppress turn off specific checks for common exceptions
Suppress_All for compatibility with other Ada compilers*
Suppress_Initialization disable initialization of variables of a given type*
Task_Dispatching specify how tasks sort dispatches (e.g. FIFO_Within_Priorities)
Task_Info specify information about a task*
Task_Storage specify the guard area for a task*
Time_Slice specify tasking time slice for main program [in Linux?]*
Title for compatibility with other Ada compilers*
Unchecked_Union treat a record as a C union type*
Unimplemented_Unit for unfinished units produces a compiler error if they are compiled*
Unreserve_All_Interrupts allow reassigning of signals normally handled by gnat eg. SIGINT*
Unsuppress opposite of suppress*
Use_VADS_Size for older Ada code 'size is equivalent to 'vads_size *
Validity_Checks activites the equivalent gnatmake switch
Volatile value of variable may change unexpectedly
Volatile_Components array components may change unexpectedly
Warnings turn compiler warnings on or off*
Weak_External specify an identifier that doesn't have to be resolved by the linker *

* - GNAT specific

The use of these pragmas are covered in detail in the GNAT and Ada 95 reference manuals.


11.14 Low-Level Ada

AdaDescriptionC Equivalent
pragma volatile Variable is influnced outside of program volatile declaration
for x'address use a Specify an absolute address for a pointer p = (typecast) integer;
for x'alignment use b Position the identifier x on b byte boundaries ?
for x'bit_order use o; Store record using bit order o ?
8#value# Specify a octal numeric literal 0Value
16#value# Specify a hexadecimal numeric literal 0xValue
asm( inst in out) Assemble an instruction asm( inst : in : out )

Ada contains a number of low-level features and libraries such as the ability to add machine code to a program or to access a hardware register in memory. I'll mention a few of these features here.

If you need to specify a specific number of bits say to access a hardware register use the for statement.

  type Reg is new integer;
  for Reg'size use 4; -- register is 4 bits
  type RegPtr is access all Reg;

You can refer an access type to a particular address using  for var'address clause. Together with  'size you can theoretically refer to an bit in the computer's memory. However on Linux the address refers to a location in your address space and doesn't refer to a real physical location.

var'alignment will align storage to a particular byte boundary. var'bit_order can specify a different bit order for a record than the default for your machine. The bit orders are defined in the System package. (Gnat 3.12 doesn't fully support bit orders.)

  for Reg'address use 16#2EF#; -- hex address 2EF in your memory space
  for Reg'alignment use 2; -- align to 16-bit boundaries
  for myRecord'bit_order use system.low_order_first; -- low bits to high machine

If the register value can change independently of the Ada program (usually true) we need to mark the pointer with pragma volatile to make sure the compiler will make no assumptions while optimizing.

  pragma volatile( RegPtr);

Ada will do bit-wise logic operations but it will only do them on packed arrays of booleans or modular types. You can't do bit-wise operations on integers for example. The bit-wise operators are and or xor and not.

  type byte is array(1..8) of boolean;
  pragma pack( byte );

b3 : byte;
   b3 := b1 and b2;

If you need octal or hexadecimal numbers Ada denotes these by using a leading base designation between 2 and 16 with the value delimited by number signs.

  Hex := 16#0FE9#;
  Bin := 2#01101010#;

The System.Machine_Code package can embed assembly language instructions in an Ada program. Since Gnat is based on Gcc it uses Gcc's inlining features. If you've inlined assembly code in a C program you'll find Gnat's capabilities virtually identical.

Assembly code is embedded using the Asm.

  Asm( "nop" ); -- do nothing

A tutorial by Jerry van Dijk is available from AdaPower.com.

Large sections of assembly code should be linked in separately.


  <--Last Chapter Table of Contents Next Chapter-->