1 ------------------------------------------------------------------------------
3 -- GNU ADA RUNTIME LIBRARY (GNARL) COMPONENTS --
5 -- S Y S T E M . B I T _ O P S --
10 -- Copyright (C) 1992-1999, Free Software Foundation, Inc. --
12 -- GNAT is free software; you can redistribute it and/or modify it under --
13 -- terms of the GNU General Public License as published by the Free Soft- --
14 -- ware Foundation; either version 2, or (at your option) any later ver- --
15 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
16 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
17 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
18 -- for more details. You should have received a copy of the GNU General --
19 -- Public License distributed with GNAT; see file COPYING. If not, write --
20 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
21 -- MA 02111-1307, USA. --
23 -- As a special exception, if other files instantiate generics from this --
24 -- unit, or you link this unit with other files to produce an executable, --
25 -- this unit does not by itself cause the resulting executable to be --
26 -- covered by the GNU General Public License. This exception does not --
27 -- however invalidate any other reasons why the executable file might be --
28 -- covered by the GNU Public License. --
30 -- GNAT was originally developed by the GNAT team at New York University. --
31 -- Extensive contributions were provided by Ada Core Technologies Inc. --
33 ------------------------------------------------------------------------------
35 -- Operations on packed bit strings
39 package System
.Bit_Ops
is
41 -- Note: in all the following routines, the System.Address parameters
42 -- represent the address of the first byte of an array used to represent
43 -- a packed array (of type System.Unsigned_Types.Packed_Bytes{1,2,4})
44 -- The length in bits is passed as a separate parameter.
47 (Left
: System
.Address
;
51 Result
: System
.Address
);
52 -- Bitwise "and" of given bit string with result being placed in Result.
53 -- The or operation is allowed to destroy unused bits in the last byte,
54 -- i.e. to leave them set in an undefined manner. Note that Left, Right
55 -- and Result always have the same length in bits (Len).
58 (Left
: System
.Address
;
60 Right
: System
.Address
;
63 -- Left and Right are the addresses of two bit packed arrays with Llen
64 -- and Rlen being the respective length in bits. The routine compares the
65 -- two bit strings for equality, being careful not to include the unused
66 -- bits in the final byte. Note that the result is always False if Rlen
67 -- is not equal to Llen.
70 (Opnd
: System
.Address
;
72 Result
: System
.Address
);
73 -- Bitwise "not" of given bit string with result being placed in Result.
74 -- The not operation is allowed to destroy unused bits in the last byte,
75 -- i.e. to leave them set in an undefined manner. Note that Result and
76 -- Opnd always have the same length in bits (Len).
79 (Left
: System
.Address
;
83 Result
: System
.Address
);
84 -- Bitwise "or" of given bit string with result being placed in Result.
85 -- The or operation is allowed to destroy unused bits in the last byte,
86 -- i.e. to leave them set in an undefined manner. Note that Left, Right
87 -- and Result always have the same length in bits (Len).
90 (Left
: System
.Address
;
94 Result
: System
.Address
);
95 -- Bitwise "xor" of given bit string with result being placed in Result.
96 -- The or operation is allowed to destroy unused bits in the last byte,
97 -- i.e. to leave them set in an undefined manner. Note that Left, Right
98 -- and Result always have the same length in bits (Len).