Object Pascal Language Guide
Object Pascal Language Guide
Language Guide
Borland®
™
Delphi 5
for Windows 98, Windows 95, & Windows NT
Inprise Corporation
100 Enterprise Way, Scotts Valley, CA 95066-3249
Refer to the file DEPLOY.TXT located in the root directory of your Delphi 5 product for a complete list of files that you
can distribute in accordance with the Delphi 5 License Statement and Limited Warranty.
Inprise may have patents and/or pending patent applications covering subject matter in this document. The
furnishing of this document does not give you any license to these patents.
COPYRIGHT © 1983, 1999 Inprise Corporation. All rights reserved. All Inprise and Borland brand and product names
are trademarks or registered trademarks of Inprise Corporation. Other brand and product names are trademarks or
registered trademarks of their respective holders.
Printed in the U.S.A.
HDE1350WW21002 3E2R899
9900010203-9 8 7 6 5 4 3 2 1
PDF
Contents
Chapter 1 Reserved words . . . . . . . . . . . . . . . . . 4-3
Introduction 1-1 Directives. . . . . . . . . . . . . . . . . . . . . 4-3
What’s in this manual? . . . . . . . . . . . . . . 1-1 Numerals . . . . . . . . . . . . . . . . . . . . . 4-4
Delphi and Object Pascal . . . . . . . . . . . 1-1 Labels . . . . . . . . . . . . . . . . . . . . . . . 4-4
Typographical conventions . . . . . . . . . . 1-2 Character strings . . . . . . . . . . . . . . . . 4-4
Other sources of information . . . . . . . . . . . 1-2 Comments and compiler directives . . . . . . . . 4-5
Software registration and technical support . . 1-2 Expressions . . . . . . . . . . . . . . . . . . . . . 4-5
Operators. . . . . . . . . . . . . . . . . . . . . 4-6
Part I Arithmetic operators . . . . . . . . . . . . 4-6
Basic language description Boolean operators . . . . . . . . . . . . . . 4-7
Logical (bitwise) operators . . . . . . . . . 4-8
Chapter 2 String operators . . . . . . . . . . . . . . . 4-9
Overview 2-1 Pointer operators. . . . . . . . . . . . . . . 4-9
Program organization . . . . . . . . . . . . . . . 2-1 Set operators . . . . . . . . . . . . . . . . 4-10
Pascal source files . . . . . . . . . . . . . . . 2-1 Relational operators . . . . . . . . . . . . 4-10
Other files used to build applications . . . . 2-2 Class operators . . . . . . . . . . . . . . . 4-11
Compiler-generated files . . . . . . . . . . . 2-3 The @ operator . . . . . . . . . . . . . . . 4-11
Example programs. . . . . . . . . . . . . . . . . 2-3 Operator precedence rules . . . . . . . . 4-12
A simple console application . . . . . . . . . 2-3 Function calls . . . . . . . . . . . . . . . . . 4-13
A more complicated example . . . . . . . . . 2-4 Set constructors . . . . . . . . . . . . . . . . 4-13
A Windows application . . . . . . . . . . . . 2-5 Indexes . . . . . . . . . . . . . . . . . . . . . 4-13
Typecasts . . . . . . . . . . . . . . . . . . . . 4-14
Chapter 3 Value typecasts . . . . . . . . . . . . . . . 4-14
Programs and units 3-1 Variable typecasts . . . . . . . . . . . . . 4-14
Program structure and syntax . . . . . . . . . . 3-1 Declarations and statements . . . . . . . . . . . 4-16
The program heading . . . . . . . . . . . . . 3-2 Declarations . . . . . . . . . . . . . . . . . . 4-16
The program uses clause . . . . . . . . . . . 3-2 Statements . . . . . . . . . . . . . . . . . . . 4-16
The block . . . . . . . . . . . . . . . . . . . . 3-2 Simple statements . . . . . . . . . . . . . . . 4-16
Unit structure and syntax . . . . . . . . . . . . . 3-3 Assignment statements . . . . . . . . . . 4-17
The unit heading . . . . . . . . . . . . . . . . 3-3
Procedure and function calls . . . . . . . 4-17
The interface section . . . . . . . . . . . . . . 3-4
Goto statements . . . . . . . . . . . . . . 4-18
The implementation section. . . . . . . . . . 3-4
Structured statements. . . . . . . . . . . . . 4-19
The initialization section. . . . . . . . . . . . 3-4
Compound statements . . . . . . . . . . 4-19
The finalization section . . . . . . . . . . . . 3-5
Unit references and the uses clause . . . . . . . 3-5 With statements . . . . . . . . . . . . . . 4-20
The syntax of a uses clause . . . . . . . . . . 3-5 If statements . . . . . . . . . . . . . . . . 4-21
Multiple and indirect unit references . . . . 3-6 Case statements . . . . . . . . . . . . . . 4-23
Circular unit references . . . . . . . . . . . . 3-7 Control loops . . . . . . . . . . . . . . . . 4-24
Repeat statements . . . . . . . . . . . . . 4-24
Chapter 4 While statements. . . . . . . . . . . . . . 4-25
Syntactic elements 4-1 For statements . . . . . . . . . . . . . . . 4-25
Fundamental syntactic elements . . . . . . . . . 4-1 Blocks and scope . . . . . . . . . . . . . . . . . 4-27
Special symbols . . . . . . . . . . . . . . . . . 4-2 Blocks . . . . . . . . . . . . . . . . . . . . . . 4-27
Identifiers . . . . . . . . . . . . . . . . . . . . 4-2 Scope . . . . . . . . . . . . . . . . . . . . . . 4-27
Qualified identifiers . . . . . . . . . . . . 4-2 Naming conflicts . . . . . . . . . . . . . . 4-28
i
Chapter 5 Declaring types . . . . . . . . . . . . . . . . . . 5-35
Variables . . . . . . . . . . . . . . . . . . . . . . 5-36
Data types, variables, and constants 5-1 Declaring variables . . . . . . . . . . . . . . 5-36
About types. . . . . . . . . . . . . . . . . . . . . 5-1
Absolute addresses . . . . . . . . . . . . 5-37
Simple types . . . . . . . . . . . . . . . . . . . . 5-2
Dynamic variables . . . . . . . . . . . . . 5-37
Ordinal types . . . . . . . . . . . . . . . . . . 5-2
Thread-local variables . . . . . . . . . . . 5-38
Integer types. . . . . . . . . . . . . . . . . 5-3
Declared constants . . . . . . . . . . . . . . . . 5-38
Character types . . . . . . . . . . . . . . . 5-4
True constants . . . . . . . . . . . . . . . . . 5-38
Boolean types . . . . . . . . . . . . . . . . 5-5
Constant expressions . . . . . . . . . . . 5-39
Enumerated types . . . . . . . . . . . . . 5-6
Resource strings . . . . . . . . . . . . . . 5-40
Subrange types . . . . . . . . . . . . . . . 5-7
Typed constants . . . . . . . . . . . . . . . . 5-40
Real types . . . . . . . . . . . . . . . . . . . . 5-8
Array constants . . . . . . . . . . . . . . 5-41
String types . . . . . . . . . . . . . . . . . . . . . 5-9
Record constants . . . . . . . . . . . . . . 5-41
Short strings. . . . . . . . . . . . . . . . . . . 5-11
Procedural constants . . . . . . . . . . . 5-42
Long strings . . . . . . . . . . . . . . . . . . . 5-11
Pointer constants. . . . . . . . . . . . . . 5-42
WideString . . . . . . . . . . . . . . . . . . . 5-12
About extended character sets . . . . . . 5-12
Working with null-terminated strings . . . . 5-12
Chapter 6
Using pointers, arrays, and string Procedures and functions 6-1
constants . . . . . . . . . . . . . . . . . . 5-13 Declaring procedures and functions . . . . . . . 6-1
Mixing Pascal strings and Procedure declarations . . . . . . . . . . . . . 6-2
null-terminated strings . . . . . . . . . . 5-14 Function declarations . . . . . . . . . . . . . . 6-3
Structured types . . . . . . . . . . . . . . . . . . 5-15 Calling conventions . . . . . . . . . . . . . . . 6-4
Sets . . . . . . . . . . . . . . . . . . . . . . . . 5-16 Forward and interface declarations . . . . . . 6-5
Arrays . . . . . . . . . . . . . . . . . . . . . . 5-16 External declarations . . . . . . . . . . . . . . 6-6
Static arrays . . . . . . . . . . . . . . . . . 5-17 Linking to .OBJ files . . . . . . . . . . . . . 6-6
Dynamic arrays . . . . . . . . . . . . . . . 5-17 Importing functions from DLLs . . . . . . 6-7
Array types and assignments . . . . . . . 5-20 Overloading procedures and functions . . . . 6-7
Records . . . . . . . . . . . . . . . . . . . . . 5-20 Local declarations . . . . . . . . . . . . . . . . 6-8
Variant parts in records . . . . . . . . . . 5-21 Nested routines . . . . . . . . . . . . . . . 6-9
File types . . . . . . . . . . . . . . . . . . . . 5-23 Parameters . . . . . . . . . . . . . . . . . . . . . . 6-9
Pointers and pointer types . . . . . . . . . . . . 5-24 Parameter semantics . . . . . . . . . . . . . 6-10
Overview of pointers . . . . . . . . . . . . . 5-24 Value and variable parameters . . . . . . 6-10
Pointer types . . . . . . . . . . . . . . . . . . 5-26 Constant parameters . . . . . . . . . . . 6-11
Character pointers . . . . . . . . . . . . . 5-26 Out parameters. . . . . . . . . . . . . . . 6-11
Other standard pointer types . . . . . . . 5-26 Untyped parameters. . . . . . . . . . . . 6-12
Procedural types . . . . . . . . . . . . . . . . . . 5-27 String parameters . . . . . . . . . . . . . . . 6-13
Procedural types in statements and Array parameters . . . . . . . . . . . . . . . 6-13
expressions . . . . . . . . . . . . . . . . . . 5-28 Open array parameters . . . . . . . . . . 6-13
Variant types . . . . . . . . . . . . . . . . . . . . 5-29 Variant open array parameters . . . . . . 6-15
Variant type conversions . . . . . . . . . . . 5-30 Default parameters . . . . . . . . . . . . . . 6-16
Variants in expressions . . . . . . . . . . . . 5-32 Default parameters and overloaded
Variant arrays . . . . . . . . . . . . . . . . . . 5-32 routines . . . . . . . . . . . . . . . . . . 6-17
OleVariant . . . . . . . . . . . . . . . . . . . . 5-33 Default parameters in forward and
Type compatibility and identity . . . . . . . . . 5-33 interface declarations . . . . . . . . . . 6-17
Type identity . . . . . . . . . . . . . . . . . . 5-33 Calling procedures and functions . . . . . . . . 6-17
Type compatibility . . . . . . . . . . . . . . . 5-34 Open array constructors . . . . . . . . . . . 6-18
Assignment-compatibility . . . . . . . . . . . 5-34
ii
Chapter 7 Re-raising exceptions . . . . . . . . . . . 7-28
Nested exceptions . . . . . . . . . . . . . 7-29
Classes and objects 7-1 Try...finally statements . . . . . . . . . . 7-30
Class types . . . . . . . . . . . . . . . . . . . . . 7-1
Standard exception classes and routines . . 7-30
Inheritance and scope . . . . . . . . . . . . . 7-2
TObject and TClass . . . . . . . . . . . . . 7-3
Compatibility of class types . . . . . . . . 7-3
Chapter 8
Object types . . . . . . . . . . . . . . . . . 7-3 Standard routines and I/O 8-1
Visibility of class members . . . . . . . . . . 7-4 File input and output . . . . . . . . . . . . . . . . 8-1
Private, protected, and public Text files . . . . . . . . . . . . . . . . . . . . . 8-3
members . . . . . . . . . . . . . . . . . . 7-5 Untyped files. . . . . . . . . . . . . . . . . . . 8-4
Published members. . . . . . . . . . . . . 7-5 Text-file device drivers . . . . . . . . . . . . . . . 8-4
Automated members . . . . . . . . . . . . 7-5 Device functions . . . . . . . . . . . . . . . . . 8-5
Forward declarations and mutually The Open function . . . . . . . . . . . . . . 8-5
dependent classes. . . . . . . . . . . . . . . 7-6 The InOut function . . . . . . . . . . . . . 8-5
Fields . . . . . . . . . . . . . . . . . . . . . . . . 7-7 The Flush function . . . . . . . . . . . . . . 8-6
Methods. . . . . . . . . . . . . . . . . . . . . . . 7-8 The Close function . . . . . . . . . . . . . . 8-6
Method implementations . . . . . . . . . . . 7-8 Handling null-terminated strings . . . . . . . . . 8-6
Inherited . . . . . . . . . . . . . . . . . . . 7-8 Wide-character strings . . . . . . . . . . . . . 8-7
Self . . . . . . . . . . . . . . . . . . . . . . 7-9 Other standard routines . . . . . . . . . . . . . . 8-7
Method binding . . . . . . . . . . . . . . . . 7-9
Static methods. . . . . . . . . . . . . . . . 7-9 Part II
Virtual and dynamic methods. . . . . . . 7-10 Special topics
Abstract methods . . . . . . . . . . . . . . 7-11
Overloading methods . . . . . . . . . . . . . 7-12 Chapter 9
Constructors . . . . . . . . . . . . . . . . . . 7-12 Dynamic-link libraries and packages 9-1
Destructors . . . . . . . . . . . . . . . . . . . 7-14 Calling DLLs . . . . . . . . . . . . . . . . . . . . 9-1
Message handlers . . . . . . . . . . . . . . . 7-15 Static loading . . . . . . . . . . . . . . . . . 9-1
Implementing message handlers . . . . . 7-15 Dynamic loading. . . . . . . . . . . . . . . 9-2
Message dispatching . . . . . . . . . . . . 7-15 Writing DLLs . . . . . . . . . . . . . . . . . . . . 9-3
Properties . . . . . . . . . . . . . . . . . . . . . . 7-16 The exports clause. . . . . . . . . . . . . . . . 9-4
Property access . . . . . . . . . . . . . . . . . 7-16 Library initialization code . . . . . . . . . . . 9-4
Array properties . . . . . . . . . . . . . . . . 7-18 Global variables in a DLL . . . . . . . . . . . 9-5
Index specifiers . . . . . . . . . . . . . . . . . 7-19 DLLs and System variables . . . . . . . . . . 9-5
Storage specifiers . . . . . . . . . . . . . . . . 7-20 Exceptions and runtime errors in DLLs. . . . 9-6
Property overrides and redeclarations . . . . 7-20 The shared-memory manager . . . . . . . . . 9-6
Class references . . . . . . . . . . . . . . . . . . 7-22 Packages . . . . . . . . . . . . . . . . . . . . . . . 9-7
Class-reference types. . . . . . . . . . . . . . 7-22 Package declarations and source files . . . . . 9-7
Constructors and class references . . . . . 7-22 Naming packages . . . . . . . . . . . . . . 9-8
Class operators . . . . . . . . . . . . . . . . . 7-23 The requires clause . . . . . . . . . . . . . 9-8
The is operator . . . . . . . . . . . . . . . 7-23 The contains clause . . . . . . . . . . . . . 9-8
The as operator . . . . . . . . . . . . . . . 7-24 Compiling packages . . . . . . . . . . . . . . 9-9
Class methods . . . . . . . . . . . . . . . . . 7-24 Generated files . . . . . . . . . . . . . . . . 9-9
Exceptions . . . . . . . . . . . . . . . . . . . . . 7-25 Package-specific compiler directives . . . 9-9
Declaring exception types . . . . . . . . . . . 7-25 Package-specific command-line
Raising and handling exceptions . . . . . . . 7-25 compiler switches . . . . . . . . . . . . 9-10
Try...except statements . . . . . . . . . . . 7-26
iii
Chapter 10 Set types . . . . . . . . . . . . . . . . . . . . 11-6
Static array types . . . . . . . . . . . . . . . 11-7
Object interfaces 10-1 Dynamic array types . . . . . . . . . . . . . 11-7
Interface types . . . . . . . . . . . . . . . . . . . 10-1
Record types . . . . . . . . . . . . . . . . . . 11-7
IUnknown and inheritance . . . . . . . . . . 10-2
File types . . . . . . . . . . . . . . . . . . . . 11-8
Interface identification . . . . . . . . . . . . . 10-2
Procedural types. . . . . . . . . . . . . . . . 11-9
Calling conventions . . . . . . . . . . . . . . 10-3
Class types . . . . . . . . . . . . . . . . . . . 11-9
Interface properties. . . . . . . . . . . . . . . 10-3
Class reference types . . . . . . . . . . . . .11-10
Forward declarations . . . . . . . . . . . . . 10-3
Variant types . . . . . . . . . . . . . . . . . .11-10
Implementing interfaces . . . . . . . . . . . . . 10-4
Method resolution clauses. . . . . . . . . . . 10-5
Changing inherited implementations . . . . 10-5
Chapter 12
Implementing interfaces by delegation . . . 10-6 Program control 12-1
Delegating to an interface-type Parameters and function results. . . . . . . . . 12-1
property . . . . . . . . . . . . . . . . . . 10-6 Parameter passing. . . . . . . . . . . . . . . 12-1
Delegating to a class-type property . . . . 10-7 Register saving conventions . . . . . . . 12-3
Interface references . . . . . . . . . . . . . . . . 10-8 Function results . . . . . . . . . . . . . . . . 12-3
Interface assignment-compatibility. . . . . . 10-9 Method calls . . . . . . . . . . . . . . . . . . 12-3
Interface typecasts . . . . . . . . . . . . . . . 10-9 Constructors and destructors. . . . . . . 12-4
Interface querying . . . . . . . . . . . . . 10-9 Exit procedures . . . . . . . . . . . . . . . . . . 12-4
Automation objects . . . . . . . . . . . . . . . 10-10
Dispatch interface types . . . . . . . . . . . 10-10 Chapter 13
Dispatch interface methods . . . . . . . 10-11 Inline assembler code 13-1
Dispatch interface properties . . . . . . 10-11 The asm statement . . . . . . . . . . . . . . . . 13-1
Accessing Automation objects . . . . . . . 10-11 Register use . . . . . . . . . . . . . . . . . . 13-2
Automation object method-call Assembler statement syntax . . . . . . . . . . . 13-2
syntax. . . . . . . . . . . . . . . . . . . 10-12 Labels . . . . . . . . . . . . . . . . . . . . . . 13-2
Dual interfaces . . . . . . . . . . . . . . . . 10-12 Instruction opcodes . . . . . . . . . . . . . . 13-3
RET instruction sizing. . . . . . . . . . . 13-4
Chapter 11 Automatic jump sizing . . . . . . . . . . 13-4
Memory management 11-1 Assembler directives . . . . . . . . . . . . . 13-5
Delphi’s memory manager . . . . . . . . . . . . 11-1 Operands . . . . . . . . . . . . . . . . . . . . 13-6
Variables. . . . . . . . . . . . . . . . . . . . . 11-2 Expressions . . . . . . . . . . . . . . . . . . . . 13-7
Internal data formats . . . . . . . . . . . . . . . 11-2 Differences between Object Pascal and
Integer types . . . . . . . . . . . . . . . . . . 11-2 assembler expressions. . . . . . . . . . . . 13-7
Character types . . . . . . . . . . . . . . . . . 11-3 Expression elements . . . . . . . . . . . . . 13-8
Boolean types . . . . . . . . . . . . . . . . . . 11-3 Constants . . . . . . . . . . . . . . . . . . 13-8
Enumerated types . . . . . . . . . . . . . . . 11-3 Registers . . . . . . . . . . . . . . . . . 13-10
Real types . . . . . . . . . . . . . . . . . . . . 11-3 Symbols . . . . . . . . . . . . . . . . . . 13-10
The Real48 type . . . . . . . . . . . . . . . 11-4 Expression classes . . . . . . . . . . . . . . 13-12
The Single type . . . . . . . . . . . . . . . 11-4 Expression types. . . . . . . . . . . . . . . 13-13
The Double type . . . . . . . . . . . . . . 11-4 Expression operators . . . . . . . . . . . . 13-14
The Extended type . . . . . . . . . . . . . 11-5 Assembler procedures and functions . . . . . 13-16
The Comp type . . . . . . . . . . . . . . . 11-5
The Currency type . . . . . . . . . . . . . 11-5 Appendix A
Pointer types . . . . . . . . . . . . . . . . . . 11-5 Object Pascal grammar A-1
Short string types. . . . . . . . . . . . . . . . 11-5
Long string types . . . . . . . . . . . . . . . . 11-5 Index I-1
Wide string types . . . . . . . . . . . . . . . . 11-6
iv
Tables
4.1 Reserved words . . . . . . . . . . . . . . . 4-3 8.1 Input and output procedures and
4.2 Directives . . . . . . . . . . . . . . . . . . . 4-3 functions . . . . . . . . . . . . . . . . . . . . 8-1
4.3 Binary arithmetic operators . . . . . . . . 4-6 8.2 Null-terminated string functions . . . . . . 8-6
4.4 Unary arithmetic operators . . . . . . . . . 4-6 8.3 Other standard routines . . . . . . . . . . . 8-7
4.5 Boolean operators . . . . . . . . . . . . . . 4-7 9.1 Compiled package files . . . . . . . . . . . 9-9
4.6 Logical (bitwise) operators . . . . . . . . . 4-8 9.2 Package-specific compiler directives . . . . 9-9
4.7 String operators . . . . . . . . . . . . . . . 4-9 9.3 Package-specific command-line
4.8 Character-pointer operators . . . . . . . . 4-9 compiler switches. . . . . . . . . . . . . . 9-10
4.9 Set operators . . . . . . . . . . . . . . . . . 4-10 11.1 Long string dynamic memory layout . . 11-5
4.10 Relational operators . . . . . . . . . . . . . 4-10 11.2 Wide string dynamic memory layout . . 11-6
4.11 Precedence of operators. . . . . . . . . . . 4-12 11.3 Dynamic array memory layout . . . . . . 11-7
5.1 Generic integer types for 32-bit 11.4 Type alignment masks . . . . . . . . . . . 11-7
implementations of Object Pascal . . . . . 5-3 11.5 Virtual method table layout . . . . . . . .11-10
5.2 Fundamental integer types . . . . . . . . . 5-3 13.1 Built-in assembler reserved words . . . . 13-7
5.3 Fundamental real types . . . . . . . . . . . 5-8 13.2 String examples and their values . . . . . 13-9
5.4 Generic real types . . . . . . . . . . . . . . 5-9 13.3 CPU registers . . . . . . . . . . . . . . . 13-10
5.5 String types. . . . . . . . . . . . . . . . . . 5-9 13.4 Symbols recognized by the built-in
5.6 Selected pointer types declared in assembler . . . . . . . . . . . . . . . . . .13-11
System and SysUtils . . . . . . . . . . . . . 5-26 13.5 Predefined type symbols. . . . . . . . . 13-14
5.7 Variant type conversion rules . . . . . . . 5-31 13.6 Precedence of built-in assembler
5.8 Types for integer constants . . . . . . . . . 5-39 expression operators . . . . . . . . . . . 13-14
6.1 Calling conventions . . . . . . . . . . . . . 6-5 13.7 Definitions of built-in assembler
expression operators . . . . . . . . . . . 13-15
v
vi
Chapter
1
Introduction
Chapter1
This manual is about the Object Pascal programming language as it is used in Delphi.
Introduction 1-1
Other sources of information
Typographical conventions
Identifiers—that is, names of constants, variables, types, fields, properties,
procedures, functions, programs, units, libraries, and packages—appear in italics in
the text. Object Pascal operators, reserved words, and directives are in boldface type.
Example code and text that you would type literally (into a file or at the command
prompt) are in monospaced type.
In displayed program listings, reserved words and directives appear in boldface, just
as they do in the text:
function Calculate(X, Y: Integer): Integer;
begin
ƒ
end;
This is how Delphi’s Code editor displays reserved words and directives, if you have
the Syntax Highlight option turned on.
Some program listings, like the example above, contain ellipsis marks (... or ƒ). The
ellipses represent additional code that would be included in an actual file. They are
not meant to be copied literally.
In syntax descriptions, italics indicate placeholders for which, in real code, you would
substitute syntactically valid constructions. For example, the heading of the function
declaration above could be represented as
function functionName(argumentList): returnType;
Syntax descriptions can also contain ellipsis marks (...) and subscripts:
function functionName(arg1, ..., argn): ReturnType;
I
Basic language description
Part I
The chapters in Part I present the essential language elements required for most
programming tasks. These chapters include:
• Chapter 2, “Overview”
• Chapter 3, “Programs and units”
• Chapter 4, “Syntactic elements”
• Chapter 5, “Data types, variables, and constants”
• Chapter 6, “Procedures and functions”
• Chapter 7, “Classes and objects”
• Chapter 8, “Standard routines and I/O”
2
Overview
Chapter2
Program organization
Programs are usually divided into source-code modules called units. Each program
begins with a heading, which specifies a name for the program. The heading is
followed by an optional uses clause, then a block of declarations and statements. The
uses clause lists units that are linked into the program; these units, which can be
shared by different programs, often have uses clauses of their own.
The uses clause provides the compiler with information about dependencies among
modules. Because this information is stored in the modules themselves, Object Pascal
programs do not require makefiles, header files, or preprocessor “include” directives.
(Delphi’s Project Manager generates a makefile each time a project is loaded in the
IDE, but saves these files only for project groups that include more than one project.)
For further discussion of program structure and dependencies, see Chapter 3,
“Programs and units.”
Overview 2-1
Program organization
Unit source files contain most of the code in an application. Each Delphi application
has a single project file and several unit files; the project file—which corresponds to
the “main” program file in traditional Pascal—organizes the unit files into an
application. Delphi automatically maintains a project file for each application.
If you are compiling a program from the command line, you can put all your source
code into unit (.PAS) files. But if you use the Delphi IDE to build your application,
you must have a project (.DPR) file.
Package source files are similar to project files, but they are used to construct special
dynamic-link libraries called packages. For more information about packages, see
Chapter 9, “Dynamic-link libraries and packages.”
Compiler-generated files
The first time you build an application or a standard dynamic-link library, the
compiler produces a .DCU (Delphi compiled unit) file for each new unit used in your
project; all the .DCU files in your project are then linked to create a single .EXE
(executable) or .DLL file. The first time you build a package, the compiler produces a
.DCU file for each new unit contained in the package, and then creates both a .DCP
and a .BPL file. (For more information about dynamic-link libraries and packages, see
Chapter 9, “Dynamic-link libraries and packages.”) If you use the –GD switch, the
linker generates a map file and a .DRC file; the .DRC file, which contains string
resources, can be compiled into a resource file.
When you rebuild a project, individual units are not recompiled unless their source
(.PAS) files have changed since the last compilation, or their .DCU files cannot be
found, or you explicitly tell the compiler to reprocess them. In fact, it is not necessary
for a unit’s source file to be present at all, as long as the compiler can find the .DCU
file.
Example programs
The examples that follow illustrate basic features of Object Pascal and Delphi
programming. The first two examples are not Delphi applications, but you can
compile them from the command line.
{$APPTYPE CONSOLE}
begin
MyMessage := 'Hello world!';
Writeln(MyMessage);
end.
The first line declares a program called Greeting. The {$APPTYPE CONSOLE} directive tells
the compiler that this is a console application, to be run from the command line. The
next line declares a variable called MyMessage, which holds a string. (Object Pascal
has genuine string data types.) The program then assigns the string “Hello world!” to
the variable MyMessage, and sends the contents of MyMessage to the standard output
using the Writeln procedure. (Writeln is defined implicitly in the System unit, which
the compiler automatically includes in every application.)
Overview 2-3
Example programs
If you have Delphi installed and your Path includes the Delphi\Bin directory (where
DCC32.EXE and DCC32.CFG reside), you can type this program into a file called
GREETING.PAS or GREETING.DPR and compile it by entering
DCC32 GREETING
on the command line. The resulting executable (GREETING.EXE) prints the message
“Hello world!”
Aside from its simplicity, this example differs in several important ways from
programs that you are likely to write with Delphi. First, it is a console application.
Delphi is typically used to write Windows applications with graphical interfaces;
hence, in a Delphi application you would not ordinarily call Writeln. Moreover, the
entire example program (save for Writeln) is in a single file. In a Delphi application,
the program heading—the first line of the example—would be placed in a separate
project file that would not contain any of the actual application logic, other than a
few calls to methods defined in unit files.
{$APPTYPE CONSOLE}
uses Unit1;
begin
PrintMessage('Hello World!');
end.
The first line declares a program called Greeting, which, once again, is a console
application. The uses Unit1; clause tells the compiler that Greeting includes a unit
called Unit1. Finally, the program calls the PrintMessage procedure, passing to it the
string “Hello World!” Where does the PrintMessage procedure come from? It’s
defined in Unit1. Here’s the source code for Unit1, which you can save in a file called
UNIT1.PAS:
unit Unit1;
interface
implementation
end.
A Windows application
Our next example is a Windows application built with Delphi’s Visual Component
Library (VCL). This program uses Delphi-generated form and resource files, so you
won’t be able to compile it from the source code alone. But it illustrates important
features of Object Pascal. In addition to multiple units, the program uses classes and
objects, which are discussed in Chapter 7, “Classes and objects.”
The program includes a project file and two new unit files. First, the project file:
program Greeting; { comments are enclosed in braces }
uses
Forms,
Unit1 { the unit for Form1 },
Unit2 { the unit for Form2 };
begin
{ calls to Application }
Application.Initialize;
Application.CreateForm(TForm1, Form1);
Application.CreateForm(TForm2, Form2);
Application.Run;
end.
Once again, our program is called Greeting. It uses three units: Forms, which is part of
the VCL; Unit1, which is associated with the application’s main form (Form1); and
Unit2, which is associated with another form (Form2).
The program makes a series of calls to an object named Application, which is an
instance of the TApplication class defined in the Forms unit. (Every Delphi project has
an automatically generated Application object.) Two of these calls invoke a
TApplication method named CreateForm. The first call to CreateForm creates Form1, an
Overview 2-5
Example programs
instance of the TForm1 class defined in Unit1. The second call to CreateForm creates
Form2, an instance of the TForm2 class defined in Unit2.
Unit1 looks like this:
unit Unit1;
interface
uses { these units are part of Delphi's Visual Component Library (VCL) }
Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs, StdCtrls;
type
TForm1 = class(TForm)
Button1: TButton;
procedure Button1Click(Sender: TObject);
end;
var
Form1: TForm1;
implementation
end.
Unit1 creates a class named TForm1 (derived from the VCL’s TForm) and an instance
of this class, Form1. TForm1 includes a button—Button1, an instance of TButton—and
a procedure named TForm1.Button1Click that is called at runtime whenever the user
presses Button1. TForm1.Button1Click does two things: it hides Form1 (the call to
Form1.Hide) and it displays Form2 (the call to Form2.Show). Form2 is defined in Unit2:
unit Unit2;
interface
uses
Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs,
StdCtrls;
type
TForm2 = class(TForm)
Label1: TLabel;
CancelButton: TButton;
var
Form2: TForm2;
implementation
uses Unit1;
{$R *.DFM}
end.
Unit2 creates a class named TForm2 and an instance of this class, Form2. TForm2
includes a button (CancelButton, an instance of TButton) and a label (Label1, an
instance of TLabel). You can’t see this from the source code, but Label1 displays a
caption that reads “Hello world!” The caption is defined in Form2’s form file,
UNIT2.DFM.
Unit2 defines two procedures. TForm2.CancelButtonClick is called at runtime
whenever the user presses CancelButton; it closes Form2. TForm2.FormClose is called at
runtime whenever Form2 closes; it reopens Form1. These procedures (along with
Unit1’s TForm1.Button1Click) are known as event handlers because they respond to
events that occur while the program is running. Event handlers are assigned to
specific events by the form (.DFM) files for Form1 and Form2.
When the Greeting program starts, Form1 is displayed and Form2 is invisible. (By
default, only the first form created in the project file is visible at runtime. This is
called the project’s main form.) When the user presses the button on Form1, Form1
disappears and is replaced by Form2, which displays the “Hello world!” greeting.
When the user closes Form2 (by pressing CancelButton or the Close button on the title
bar), Form1 reappears.
Overview 2-7
2-8 Object Pascal Language Guide
Chapter
The example below shows the project file for a program called Editor.
1 program Editor;
2
3 uses
4 Forms,
5 REAbout in 'REABOUT.PAS' {AboutBox},
6 REMain in 'REMain.pas' {MainForm};
7
8 {$R *.RES}
9
10 begin
11 Application.Title := 'Text Editor';
12 Application.CreateForm(TMainForm, MainForm);
13 Application.Run;
14 end.
Line 1 contains the program heading. The uses clause is on lines 3 through 6. Line 8 is
a compiler directive that links the project’s resource file into the program. Lines 10
through 14 contain the block of statements that are executed when the program runs.
Finally, the project file, like all source files, ends with a period.
This is in fact a fairly typical project file. Project files are usually short, since most of a
program’s logic resides in its unit files. Project files are generated and maintained by
Delphi, and it is seldom necessary to edit them manually.
The block
The block contains a simple or structured statement that is executed when the
program runs. In most Delphi programs, the block consists of a compound
statement—bracketed between the reserved words begin and end—whose
component statements are simply method calls to the project’s Application object.
(Every Delphi project has an Application variable that holds an instance of
TApplication, TWebApplication, or TServiceApplication.) The block can also contain
declarations of constants, types, variables, procedures, and functions; these
declarations must precede the statement part of the block.
interface
implementation
initialization
{ Initialization section goes here }
finalization
{ Finalization section goes here }
end.
The unit must conclude with the word end followed by a period.
In the uses clause of a program or library, any unit name may be followed by the
reserved word in and the name of a source file, with or without a directory path, in
single quotation marks; directory paths can be absolute or relative. Examples:
uses Windows, Messages, SysUtils, Strings in 'C:\Classes\Strings.pas', Classes;
uses
Forms,
Main,
Extra in '..\EXTRA\EXTRA.PAS';
Include in ... after a unit name when you need to specify the unit’s source file. Since
the Delphi IDE expects unit names to match the names of the source files in which
they reside, there is usually no reason to do this. Using in is necessary only when the
location of the source file is unclear, for example when
• You have used a source file that is in a different directory from the project file, and
that directory is not in the compiler’s search path or Delphi’s Library search path.
• Different directories in the compiler’s search path have identically named units.
• You are compiling a console application from the command line, and you have
named a unit with an identifier that doesn’t match the name of its source file.
Delphi also relies on the in ... construction to determine which units are part of a
project. Only units that appear in a project (.DPR) file’s uses clause followed by in
and a file name are considered to be part of the project; other units in the uses clause
are used by the project without belonging to it. This distinction has no effect on
compilation, but it affects IDE tools like the Project Manager and Project Browser.
In the uses clause of a unit, you cannot use in to tell the compiler where to find a
source file. Every unit must be in the compiler’s search path, Delphi’s Library search
path, or the same directory as the unit that uses it. Moreover, unit names must match
the names of their source files.
However, the two units can legally reference each other if one of the references is
moved to the implementation section:
unit Unit1;
interface
uses Unit2;
ƒ
unit Unit2;
interface
ƒ
implementation
uses Unit1;
ƒ
To reduce the chance of circular references, it’s a good idea to list units in the
implementation uses clause whenever possible. Only when identifiers from another
unit are used in the interface section is it necessary to list that unit in the interface
uses clause.
Syntactic elements
Chapter4
4
Object Pascal uses the ASCII character set, including the letters A through Z and a
through z, the digits 0 through 9, and other standard characters. It is not
case-sensitive. The space character (ASCII 32) and the control characters (ASCII 0
through 31—including ASCII 13, the return or end-of-line character) are called blanks.
Fundamental syntactic elements, called tokens, combine to form expressions,
declarations, and statements. A statement describes an algorithmic action that can be
executed within a program. An expression is a syntactic unit that occurs within a
statement and denotes a value. A declaration defines an identifier (such as the name of
a function or variable) that can be used in expressions and statements, and, where
appropriate, allocates memory for the identifier.
Special symbols
Special symbols are non-alphanumeric characters, or pairs of such characters, that
have fixed meanings. The following single characters are special symbols.
# $ & ' ( ) * + , – . / : ; < = > @ [ ] ^ { }
The following character pairs are also special symbols.
(* (. *) .) .. // := <= >= <>
The left bracket—[—is equivalent to the character pair of left parenthesis and
period—(.; the right bracket—]—is equivalent to the character pair of period and
right parenthesis—.) . The left-parenthesis–plus–asterisk and asterisk-plus-
right-parenthesis—(* *)—are equivalent to the left and right brace—{ }.
Notice that !, " (double quotation marks), %, ?, \, _ (underscore), |(pipe), and ~ (tilde)
are not special characters.
Identifiers
Identifiers denote constants, variables, fields, types, properties, procedures,
functions, programs, units, libraries, and packages. An identifier can be of any
length, but only the first 255 characters are significant. An identifier must begin with
a letter or an underscore (_) and cannot contain spaces; letters, digits, and
underscores are allowed after the first character. Reserved words cannot be used as
identifiers.
Since Object Pascal is case-insensitive, an identifier like CalculateValue could be
written in any of these ways:
CalculateValue
calculateValue
calculatevalue
CALCULATEVALUE
Qualified identifiers
When you use an identifier that has been declared in more than one place, it is
sometimes necessary to qualify the identifier. The syntax for a qualified identifier is
identifier1.identifier2
where identifier1 qualifies identifier2. For example, if two units each declare a variable
called CurrentValue, you can specify that you want to access the CurrentValue in Unit2
by writing
Unit2.CurrentValue
Qualifiers can be iterated. For example,
Form1.Button1.Click
calls the Click method in Button1 of Form1.
If you don’t qualify an identifier, its interpretation is determined by the rules of scope
described in “Blocks and scope” on page 4-27.
Reserved words
The following reserved words cannot be redefined or used as identifiers.
In addition to the words in Table 4.1, private, protected, public, published, and
automated act as reserved words within object type declarations, but are otherwise
treated as directives. The words at and on also have special meanings.
Directives
Directives have special meanings in Object Pascal, but, unlike reserved words,
appear only in contexts where user-defined identifiers cannot occur. Hence—
although it is inadvisable to do so—you can define an identifier that looks exactly
like a directive.
Numerals
Integer and real constants can be represented in decimal notation as sequences of
digits without commas or spaces, and prefixed with the + or – operator to indicate
sign. Values default to positive (so that, for example, 67258 is equivalent to +67258) and
must be within the range of the largest predefined real or integer type.
Numerals with decimal points or exponents denote reals, while other numerals denote
integers. When the character E or e occurs within a real, it means “times ten to the power
of”. For example, 7E–2 means 7 × 10–2, and 12.25e+6 and 12.25e6 both mean 12.25 × 106.
The dollar-sign prefix indicates a hexadecimal numeral—for example, $8F.
Hexadecimals must be within the range $00000000 to $FFFFFFFF. The sign of a
hexadecimal is determined by the leftmost (most significant) bit of its binary
representation.
For more information about real and integer types, see Chapter 5, “Data types,
variables, and constants.” For information about the data types of numerals, see
“True constants” on page 5-38.
Labels
A label is a sequence of no more than four digits—that is, a numeral between 0 and
9999. Leading zeros are not significant. Identifiers can also function as labels.
Labels are used in goto statements. For more information about goto statements and
labels, see “Goto statements” on page 4-18.
Character strings
A character string, also called a string literal or string constant, consists of a quoted
string, a control string, or a combination of quoted and control strings. Separators can
occur only within quoted strings.
A quoted string is a sequence of up to 255 characters from the extended ASCII
character set, written on one line and enclosed by apostrophes. A quoted string with
nothing between the apostrophes is a null string. Two sequential apostrophes in a
quoted string denote a single character, namely an apostrophe. For example,
'BORLAND' { BORLAND }
'You''ll see' { You'll see }
'''' { ' }
'' { null string }
' ' { a space }
A control string is a sequence of one or more control characters, each of which consists
of the # symbol followed by an unsigned integer constant from 0 to 255 (decimal or
hexadecimal) and denotes the corresponding ASCII character. The control string
#89#111#117
is equivalent to the quoted string
'You'
You can combine quoted strings with control strings to form larger character strings.
For example, you could use
'Line 1'#13#10'Line 2'
to put a carriage-return–line-feed between “Line 1” and “Line 2”. However, you
cannot concatenate two quoted strings in this way, since a pair of sequential
apostrophes is interpreted as a single character. (To concatenate quoted strings, use
the + operator described in “String operators” on page 4-9, or simply combine them
into a single quoted string.)
A character string’s length is the number of characters in the string. A character string
of any length is compatible with any string type, and with the PChar type when
extended syntax is enabled ({$X+}). A character string of length 1 is compatible with
any character type, and a character string of length n ≥ 1 is compatible with packed
arrays of n characters. For more information about string types, see Chapter 5, “Data
types, variables, and constants.”
Expressions
An expression is a construction that returns a value. For example,
X { variable }
@X { address of a variable }
15 { integer constant }
InterestRate { variable }
Calc(X,Y) { function call }
X * Y { product of X and Y }
Z / (1 - Z) { quotient of Z and (1 - Z) }
X = 1.5 { Boolean }
C in Range1 { Boolean }
not Done { negation of a Boolean }
['a','b','c'] { set }
Char(48) { value typecast }
The simplest expressions are variables and constants (described in Chapter 5, “Data
types, variables, and constants”). More complex expressions are built from simpler
ones using operators, function calls, set constructors, indexes, and typecasts.
Operators
Operators behave like predefined functions that are part of the Object Pascal
language. For example, the expression (X + Y) is built from the variables X and Y—
called operands—with the + operator; when X and Y represent integers or reals, (X + Y)
returns their sum. Operators include @, not, ^, *, /, div, mod, and, shl, shr, as, +, –, or,
xor, =, >, <, <>, <=, >=, in, and is.
The operators @, not, and ^ are unary (taking one operand). All other operators are
binary (taking two operands), except that + and – can function as either unary or
binary. A unary operator always precedes its operand (for example, -B), except for ^,
which follows its operand (for example, P^). A binary operator is placed between its
operands (for example, A = 7).
Some operators behave differently depending on the type of data passed to them. For
example, not performs bitwise negation on an integer operand and logical negation
on a Boolean operand. Such operators appear below under multiple categories.
Except for ^, is, and in, all operators can take operands of type Variant. For details,
see “Variant types” on page 5-29.
The sections that follow assume some familiarity with Object Pascal data types. For
information about data types, see Chapter 5, “Data types, variables, and constants.”
For information about operator precedence in complex expressions, see “Operator
precedence rules” on page 4-12.
Arithmetic operators
Arithmetic operators, which take real or integer operands, include +, –, *, /, div, and
mod.
Boolean operators
The Boolean operators not, and, or, and xor take operands of any Boolean type and
return a value of type Boolean.
These operations are governed by standard rules of Boolean logic. For example, an
expression of the form x and y is True if and only if both x and y are True.
Short-circuit evaluation also allows the use of constructions that might otherwise
result in illegal runtime operations. For example, the following code iterates through
the string S, up to the first comma.
while (I <= Length(S)) and (S[I] <> ',') do
begin
ƒ
Inc(I);
end;
In a case where S has no commas, the last iteration increments I to a value which is
greater than the length of S. When the while condition is next tested, complete
evaluation results in an attempt to read S[I], which could cause a runtime error.
Under short-circuit evaluation, in contrast, the second part of the while condition—
(S[I] <> ',')—is not evaluated after the first part fails.
Use the $B compiler directive to control evaluation mode. The default state is {$B–},
which enables short-circuit evaluation. To enable complete evaluation locally, add
the {$B+} directive to your code. You can also switch to complete evaluation on a
project-wide basis by selecting Complete Boolean Evaluation in the Compiler
Options dialog.
String operators
The relational operators =, <>, <, >, <=, and >= all take string operands (see
“Relational operators” on page 4-10). The + operator concatenates two strings.
Pointer operators
The relational operators <, >, <=, and >= can take operands of type PChar (see
“Relational operators” on page 4-10). The following operators also take pointers as
operands. For more information about pointers, see “Pointers and pointer types” on
page 5-24.
The ^ operator dereferences a pointer. Its operand can be a pointer of any type except
the generic Pointer, which must be typecast before dereferencing.
P = Q is True just in case P and Q point to the same address; otherwise, P <> Q is True.
You can use the + and – operators to increment and decrement the offset of a
character pointer. You can also use – to calculate the difference between the offsets of
two character pointers. The following rules apply.
• If I is an integer and P is a character pointer, then P + I adds I to the address given
by P; that is, it returns a pointer to the address I characters after P. (The expression
I + P is equivalent to P + I.) P – I subtracts I from the address given by P; that is, it
returns a pointer to the address I characters before P.
• If P and Q are both character pointers, then P – Q computes the difference between
the address given by P (the higher address) and the address given by Q (the lower
address); that is, it returns an integer denoting the number of characters between P
and Q. P + Q is not defined.
Set operators
The following operators take sets as operands.
Relational operators
Relational operators are used to compare two operands. The operators =, <>, <=, and
>= also apply to sets (see “Set operators” on page 4-10); = and <> also apply to
pointers (see “Pointer operators” on page 4-9).
For most simple types, comparison is straightforward. For example, I = J is True just
in case I and J have the same value, and I <> J is True otherwise. The following rules
apply to relational operators.
• Operands must be of compatible types, except that a real and an integer can be
compared.
• Strings are compared according to the ordering of the extended ASCII character
set. Character types are treated as strings of length 1.
• Two packed strings must have the same number of components to be compared.
When a packed string with n components is compared to a string, the packed
string is treated as a string of length n.
• The operators <, >, <=, and >= apply to PChar operands only if the two pointers
point within the same character array.
• The operators = and <> can take operands of class and class-reference types. With
operands of a class type, = and <> are evaluated according the rules that apply to
pointers: C = D is True just in case C and D point to the same instance object, and C
<> D is True otherwise. With operands of a class-reference type, C = D is True just
in case C and D denote the same class, and C <> D is True otherwise. For more
information about classes, see Chapter 7, “Classes and objects.”
Class operators
The operators as and is take classes and instance objects as operands; as operates on
interfaces as well. For more information, see Chapter 7, “Classes and objects” and
Chapter 10, “Object interfaces.”
The relational operators = and <> also operate on classes. See “Relational operators”
on page 4-10.
The @ operator
The @ operator returns the address of a variable, or of a function, procedure, or
method; that is, @ constructs a pointer to its operand. For more information about
pointers, see “Pointers and pointer types” on page 5-24. The following rules apply to @.
• If X is a variable, @X returns the address of X. (Special rules apply when X is a
procedural variable; see “Procedural types in statements and expressions” on
page 5-28.) The type of @X is Pointer if the default {$T–} compiler directive is in
effect. In the {$T+} state, @X is of type ^T, where T is the type of X.
• If F is a routine (a function or procedure), @F returns F’s entry point. The type of
@F is always Pointer.
• When @ is applied to a method defined in a class, the method identifier must be
qualified with the class name. For example,
@TMyClass.DoSomething
points to the DoSomething method of TMyClass. For more information about
classes and methods, see Chapter 7, “Classes and objects.”
Function calls
Because functions return a value, function calls are expressions. For example, if you’ve
defined a function called Calc that takes two integer arguments and returns an integer,
then the function call Calc(24, 47) is an integer expression. If I and J are integer variables,
then I + Calc(J, 8) is also an integer expression. Examples of function calls include
Sum(A, 63)
Maximum(147, J)
Sin(X + Y)
Eof(F)
Volume(Radius, Height)
GetValue
TSomeObject.SomeMethod(I,J);
For more information about functions, see Chapter 6, “Procedures and functions.”
Set constructors
A set constructor denotes a set-type value. For example,
[5, 6, 7, 8]
denotes the set whose members are 5, 6, 7, and 8. The set constructor
[ 5..8 ]
could also denote the same set.
The syntax for a set constructor is
[ item1, ..., itemn ]
where each item is either an expression denoting an ordinal of the set’s base type or a
pair of such expressions with two dots (..) in between. When an item has the form x..y,
it is shorthand for all the ordinals in the range from x to y, inclusive; but if x is greater
than y, then x..y denotes nothing and [x..y] is the empty set. The set constructor [ ]
denotes the empty set, while [x] denotes the set whose only member is the value of x.
Examples of set constructors:
[red, green, MyColor]
[1, 5, 10..K mod 12, 23]
['A'..'Z', 'a'..'z', Chr(Digit + 48)]
For more information about sets, see “Sets” on page 5-16.
Indexes
Strings, arrays, array properties, and pointers to strings or arrays can be indexed. For
example, if FileName is a string variable, the expression FileName[3] returns the third
character in the string denoted by FileName, while FileName[I + 1] returns the
character immediately after the one indexed by I. For information about strings, see
“String types” on page 5-9. For information about arrays and array properties, see
“Arrays” on page 5-16 and “Array properties” on page 7-18.
Typecasts
It is sometimes useful to treat an expression as if it belonged to different type. A
typecast allows you to do this by, in effect, temporarily changing an expression’s
type. For example, Integer('A') casts the character A as an integer.
The syntax for a typecast is
typeIdentifier(expression)
If the expression is a variable, the result is called a variable typecast; otherwise, the
result is a value typecast. While their syntax is the same, different rules apply to the
two kinds of typecast.
Value typecasts
In a value typecast, the type identifier and the cast expression must both be ordinal
types or both be pointer types. Examples of value typecasts include
Integer('A')
Char(48)
Boolean(0)
Color(2)
Longint(@Buffer)
The resulting value is obtained by converting the expression in parentheses. This
may involve truncation or extension if the size of the specified type differs from that
of the expression. The expression’s sign is always preserved.
The statement
I := Integer('A');
assigns the value of Integer('A')—that is, 65—to the variable I.
A value typecast cannot be followed by qualifiers and cannot appear on the left side
of an assignment statement.
Variable typecasts
You can cast any variable to any type, provided their sizes are the same and you do
not mix integers with reals. (To convert numeric types, rely on standard functions
like Int and Trunc.) Examples of variable typecasts include
Char(I)
Boolean(Count)
TSomeDefinedType(MyVariable)
Variable typecasts can appear on either side of an assignment statement. Thus
var MyChar: char;
ƒ
Shortint(MyChar) := 122;
assigns the character z (ASCII 122) to MyChar.
You can cast variables to a procedural type. For example, given the declarations
type Func = function(X: Integer): Integer;
var
F: Func;
P: Pointer;
N: Integer;
you can make the following assignments.
F := Func(P); { Assign procedural value in P to F }
Func(P) := F; { Assign procedural value in F to P }
@F := P; { Assign pointer value in P to F }
P := @F; { Assign pointer value in F to P }
N := F(N); { Call function via F }
N := Func(P)(N); { Call function via P }
Variable typecasts can also be followed by qualifiers, as illustrated in the following
example.
type
TByteRec = record
Lo, Hi: Byte;
end;
TWordRec = record
Low, High: Word;
end;
PByte = ^Byte;
var
B: Byte;
W: Word;
L: Longint;
P: Pointer;
begin
W := $1234;
B := TByteRec(W).Lo;
TByteRec(W).Hi := 0;
L := $01234567;
W := TWordRec(L).Low;
B := TByteRec(TWordRec(L).Low).Hi;
B := PByte(L)^;
end;
In this example, TByteRec is used to access the low- and high-order bytes of a word,
and TWordRec to access the low- and high-order words of a long integer. You could
call the predefined functions Lo and Hi for the same purpose, but a variable typecast
has the advantage that it can be used on the left side of an assignment statement.
For information about typecasting pointers, see “Pointers and pointer types” on
page 5-24. For information about casting class and interface types, see “The as
operator” on page 7-24 and “Interface typecasts” on page 9.
Declarations
The names of variables, constants, types, fields, properties, procedures, functions,
programs, units, libraries, and packages are called identifiers. (Numeric constants like
26057 are not identifiers.) Identifiers must be declared before you can use them; the
only exceptions are a few predefined types, routines, and constants that the compiler
understands automatically, the variable Result when it occurs inside a function block,
and the variable Self when it occurs inside a method implementation.
A declaration defines an identifier and, where appropriate, allocates memory for it.
For example,
var Size: Extended;
declares a variable called Size that holds an Extended (real) value, while
function DoThis(X, Y: string): Integer;
declares a function called DoThis that takes two strings as arguments and returns an
integer. Each declaration ends with a semicolon. When you declare several variables,
constants, types, or labels at the same time, you need only write the appropriate
reserved word once:
var
Size: Extended;
Quantity: Integer;
Description: string;
The syntax and placement of a declaration depend on the kind of identifier you are
defining. In general, declarations can occur only at the beginning of a block or at the
beginning of the interface or implementation section of a unit (after the uses clause).
Specific conventions for declaring variables, constants, types, functions, and so forth
are explained in the chapters on those topics.
Statements
Statements define algorithmic actions within a program. Simple statements—like
assignments and procedure calls—can combine to form loops, conditional
statements, and other structured statements.
Multiple statements within a block, and in the initialization or finalization section of
a unit, are separated by semicolons.
Simple statements
A simple statement doesn’t contain any other statements. Simple statements include
assignments, calls to procedures and functions, and goto jumps.
Assignment statements
An assignment statement has the form
variable := expression
where variable is any variable reference—including a variable, variable typecast,
dereferenced pointer, or component of a structured variable—and expression is any
assignment-compatible expression. (Within a function block, variable can be replaced
with the name of the function being defined. See Chapter 6, “Procedures and
functions.”) The := symbol is sometimes called the assignment operator.
An assignment statement replaces the current value of variable with the value of
expression. For example,
I := 3;
assigns the value 3 to the variable I. The variable reference on the left side of the
assignment can appear in the expression on the right. For example,
I := I + 1;
increments the value of I. Other assignment statements include
X := Y + Z;
Done := (I >= 1) and (I < 100);
Hue1 := [Blue, Succ(C)];
I := Sqr(J) - I * K;
Shortint(MyChar) := 122;
TByteRec(W).Hi := 0;
MyString[I] := 'A';
SomeArray[I + 1] := P^;
TMyObject.SomeProperty := True;
Goto statements
A goto statement, which has the form
goto label
transfers program execution to the statement marked by the specified label. To mark
a statement, you must first declare the label. Then precede the statement you want to
mark with the label and a colon:
label: statement
Declare labels like this:
label label;
You can declare several labels at once:
label label1, ..., labeln;
A label can be any valid identifier or any numeral between 0 and 9999.
The label declaration, marked statement, and goto statement must belong to the same
block. (See “Blocks and scope” on page 4-27.) Hence it is not possible to jump into or
out of a procedure or function. Do not mark more than one statement in a block with
the same label.
For example,
label StartHere;
ƒ
StartHere: Beep;
goto StartHere;
creates an infinite loop that calls the Beep procedure repeatedly.
The goto statement is generally discouraged in structured programming. It is,
however, sometimes used as a way of exiting from nested loops, as in the following
example.
procedure FindFirstAnswer;
var X, Y, Z, Count: Integer;
label FoundAnAnswer;
begin
Count := SomeConstant;
for X := 1 to Count do
for Y := 1 to Count do
for Z := 1 to Count do
if ... { some condition holds on X, Y, and Z } then
goto FoundAnAnswer;
FoundAnAnswer:
ƒ { code to execute when an answer is found }
end;
Notice that we are using goto to jump out of a nested loop. Never jump into a loop or
other structured statement, since this can have unpredictable effects.
Structured statements
Structured statements are built from other statements. Use a structured statement
when you want to execute other statements sequentially, conditionally, or
repeatedly.
• A compound or with statement simply executes a sequence of constituent
statements.
• A conditional statement—that is, an if or case statement—executes at most one of
its constituents, depending on specified criteria.
• Loop statements—including repeat, while, and for loops—execute a sequence of
constituent statements repeatedly.
• A special group of statements—including raise, try...except, and try...finally
constructions—create and handle exceptions. For information about exception
generation and handling, see “Exceptions” on page 7-25.
Compound statements
A compound statement is a sequence of other (simple or structured) statements to be
executed in the order in which they are written. The compound statement is
bracketed by the reserved words begin and end, and its constituent statements are
separated by semicolons. For example:
begin
Z := X;
X := Y;
Y := Z;
end;
The last semicolon before end is optional. So we could have written this as
begin
Z := X;
X := Y;
Y := Z
end;
Compound statements are essential in contexts where Object Pascal syntax requires a
single statement. In addition to program, function, and procedure blocks, they occur
within other structured statements, such as conditionals or loops. For example:
begin
I := SomeConstant;
while I > 0 do
begin
ƒ
I := I - 1;
end;
end;
You can write a compound statement that contains only a single constituent
statement; like parentheses in a complex term, begin and end sometimes serve to
disambiguate and to improve readability. You can also use an empty compound
statement to create a block that does nothing:
begin
end;
With statements
A with statement is a shorthand for referencing the fields of a record or the fields,
properties, and methods of an object. The syntax of a with statement is
with obj do statement
or
with obj1, ..., objn do statement
where obj is a variable reference denoting an object or record, and statement is any
simple or structured statement. Within statement, you can refer to fields, properties,
and methods of obj using their identifiers alone—without qualifiers.
For example, given the declarations
type TDate = record
Day: Integer;
Month: Integer;
Year: Integer;
end;
var OrderDate: TDate;
you could write the following with statement.
with OrderDate do
if Month = 12 then
begin
Month := 1;
Year := Year + 1;
end
else
Month := Month + 1;
This is equivalent to
if OrderDate.Month = 12 then
begin
OrderDate.Month := 1;
OrderDate.Year := OrderDate.Year + 1;
end
else
OrderDate.Month := OrderDate.Month + 1;
If the interpretation of obj involves indexing arrays or dereferencing pointers, these
actions are performed once, before statement is executed. This makes with statements
efficient as well as concise. It also means that assignments to a variable within
statement cannot affect the interpretation of obj during the current execution of the
with statement.
Each variable reference or method name in a with statement is interpreted, if
possible, as a member of the specified object or record. If there is another variable or
method of the same name that you want to access from the with statement, you need
to prepend it with a qualifier, as in the following example.
with OrderDate do
begin
Year := Unit1.Year
ƒ
end;
When multiple objects or records appear after with, the entire statement is treated
like a series of nested with statements. Thus
with obj1, obj2, ..., objn do statement
is equivalent to
with obj1 do
with obj2 do
ƒ
with objn do
statement
In this case, each variable reference or method name in statement is interpreted, if
possible, as a member of objn; otherwise it is interpreted, if possible, as a member of
objn–1; and so forth. The same rule applies to interpreting the objs themselves, so that,
for instance, if objn is a member of both obj1 and obj2, it is interpreted as obj2.objn.
If statements
There are two forms of if statement: if...then and the if...then...else. The syntax of an
if...then statement is
if expression then statement
where expression returns a Boolean value. If expression is True, then statement is
executed; otherwise it is not. For example,
if J <> 0 then Result := I/J;
The syntax of an if...then...else statement is
if expression then statement1 else statement2
where expression returns a Boolean value. If expression is True, then statement1 is
executed; otherwise statement2 is executed. For example,
if J = 0 then
Exit
else
Result := I/J;
The then and else clauses contain one statement each, but it can be a structured
statement. For example,
if J <> 0 then
begin
Result := I/J;
Count := Count + 1;
end
else if Count = Last then
Done := True
else
Exit;
Notice that there is never a semicolon between the then clause and the word else.
You can place a semicolon after an entire if statement to separate it from the next
statement in its block, but the then and else clauses require nothing more than a
space or carriage return between them. Placing a semicolon immediately before else
(in an if statement) is a common programming error.
A special difficulty arises in connection with nested if statements. The problem arises
because some if statements have else clauses while others do not, but the syntax for
the two kinds of statement is otherwise the same. In a series of nested conditionals
where there are fewer else clauses than if statements, it may not seem clear which
else clauses are bound to which ifs. Consider a statement of the form
if expression1 then if expression2 then statement1 else statement2;
There would appear to be two ways to parse this:
if expression1 then [ if expression2 then statement1 else statement2 ];
if expression1 then [ if expression2 then statement1 ] else statement2;
The compiler always parses in the first way. That is, in real code, the statement
if ... { expression1 } then
if ... { expression2 } then
... { statement1 }
else
... { statement2 } ;
is equivalent to
if ... { expression1 } then
begin
if ... { expression2 } then
... { statement1 }
else
... { statement2 }
end;
The rule is that nested conditionals are parsed starting from the innermost
conditional, with each else bound to the nearest available if on its left. To force the
compiler to read our example in the second way, you would have to write it
explicitly as
if ... { expression1 } then
begin
if ... { expression2 } then
... { statement1 }
end
else
... { statement2 } ;
Case statements
The case statement provides a readable alternative to complex nested if conditionals.
A case statement has the form
case selectorExpression of
caseList1: statement1;
ƒ
caseListn: statementn;
end
where selectorExpression is any expression of an ordinal type (string types are invalid)
and each caseList is one of the following:
• A numeral, declared constant, or other expression that the compiler can evaluate
without executing your program. It must be of an ordinal type compatible with
selectorExpression. Thus 7, True, 4 + 5 * 3, 'A', and Integer('A') can all be used as
caseLists, but variables and most function calls cannot. (A few built-in functions
like Hi and Lo can occur in a caseList. See “Constant expressions” on page 5-39.)
• A subrange having the form First..Last, where First and Last both satisfy the
criterion above and First is less than or equal to Last.
• A list having the form item1, ..., itemn, where each item satisfies one of the criteria
above.
Each value represented by a caseList must be unique in the case statement; subranges
and lists cannot overlap. A case statement can have a final else clause:
case selectorExpression of
caseList1: statement1;
ƒ
caseListn: statementn;
else
statement;
end
When a case statement is executed, at most one of its constituent statements is
executed. Whichever caseList has a value equal to that of selectorExpression determines
the statement to be used. If none of the caseLists has the same value as
selectorExpression, then the statement in the else clause (if there is one) is executed.
Control loops
Loops allow you to execute a sequence of statements repeatedly, using a control
condition or variable to determine when the execution stops. Object Pascal has three
kinds of control loop: repeat statements, while statements, and for statements.
You can use the standard Break and Continue procedures to control the flow of a
repeat, while, or for statement. Break terminates the statement in which it occurs,
while Continue begins executing the next iteration of the sequence. For more
information about these procedures, see the online Help.
Repeat statements
The syntax of a repeat statement is
repeat statement1; ...; statementn; until expression
where expression returns a Boolean value. (The last semicolon before until is
optional.) The repeat statement executes its sequence of constituent statements
continually, testing expression after each iteration. When expression returns True, the
repeat statement terminates. The sequence is always executed at least once because
expression is not evaluated until after the first iteration.
Examples of repeat statements include
repeat
K := I mod J;
I := J;
J := K;
until J = 0;
repeat
Write('Enter a value (0..9): ');
Readln(I);
until (I >= 0) and (I <= 9);
While statements
A while statement is similar to a repeat statement, except that the control condition is
evaluated before the first execution of the statement sequence. Hence, if the condition
is false, the statement sequence is never executed.
The syntax of a while statement is
while expression do statement
where expression returns a Boolean value and statement can be a compound statement.
The while statement executes its constituent statement repeatedly, testing expression
before each iteration. As long as expression returns True, execution continues.
Examples of while statements include
while Data[I] <> X do I := I + 1;
while I > 0 do
begin
if Odd(I) then Z := Z * X;
I := I div 2;
X := Sqr(X);
end;
while not Eof(InputFile) do
begin
Readln(InputFile, Line);
Process(Line);
end;
For statements
A for statement, unlike a repeat or while statement, requires you to specify explicitly
the number of iterations you want the loop to go through. The syntax of a for
statement is
for counter := initialValue to finalValue do statement
or
for counter := initialValue downto finalValue do statement
where
• counter is a local variable (declared in the block containing the for statement) of
ordinal type, without any qualifiers.
• initialValue and finalValue are expressions that are assignment-compatible with
counter.
• statement is a simple or structured statement that does not change the value of counter.
The for statement assigns the value of initialValue to counter, then executes statement
repeatedly, incrementing or decrementing counter after each iteration. (The for...to
syntax increments counter, while the for...downto syntax decrements it.) When
counter returns the same value as finalValue, statement is executed once more and the
for statement terminates. In other words, statement is executed once for every value
in the range from initialValue to finalValue. If initialValue is equal to finalValue,
statement is executed exactly once. If initialValue is greater than finalValue in a for...to
statement, or less than finalValue in a for...downto statement, then statement is never
executed. After the for statement terminates, the value of counter is undefined.
For purposes of controlling execution of the loop, the expressions initialValue and
finalValue are evaluated only once, before the loop begins. Hence the for...to
statement is almost, but not quite, equivalent to this while construction:
begin
counter := initialValue;
while counter <= finalValue do
begin
statement;
counter := Succ(counter);
end;
end
The difference between this construction and the for...to statement is that the while
loop re-evaluates finalValue before each iteration. This can result in noticeably slower
performance if finalValue is a complex expression, and it also means that changes to
the value of finalValue within statement can affect execution of the loop.
Examples of for statements:
for I := 2 to 63 do
if Data[I] > Max then
Max := Data[I];
for I := ListBox1.Items.Count - 1 downto 0 do
ListBox1.Items[I] := UpperCase(ListBox1.Items[I]);
for I := 1 to 10 do
for J := 1 to 10 do
begin
X := 0;
for K := 1 to 10 do
X := X + Mat1[I, K] * Mat2[K, J];
Mat[I, J] := X;
end;
for C := Red to Blue do Check(C);
Blocks
A block consists of a series of declarations followed by a compound statement. All
declarations must occur together at the beginning of the block. So the form of a block is
declarations
begin
statements
end
The declarations section can include, in any order, declarations for variables, constants
(including resource strings), types, procedures, functions, and labels. In a program
block, the declarations section can also include one or more exports clauses (see
Chapter 9, “Dynamic-link libraries and packages”).
For example, in a function declaration like
function UpperCase(const S: string): string;
var
Ch: Char;
L: Integer;
Source, Dest: PChar;
begin
ƒ
end;
the first line of the declaration is the function heading and all of the succeeding lines
make up the block. Ch, L, Source, and Dest are local variables; their declarations apply
only to the UpperCase function block and override—in this block only—any
declarations of the same identifiers that may occur in the program block or in the
interface or implementation section of a unit.
Scope
An identifier, such as a variable or function name, can be used only within the scope
of its declaration. The location of a declaration determines its scope. An identifier
declared within the declaration of a program, function, or procedure has a scope
limited to the block in which it is declared. An identifier declared in the interface
section of a unit has a scope that includes any other units or programs that use the
unit where the declaration occurs. Identifiers with narrower scope—especially
identifiers declared in functions and procedures—are sometimes called local, while
identifiers with wider scope are called global.
Naming conflicts
When one block encloses another, the former is called the outer block and the latter the
inner block. If an identifier declared in an outer block is redeclared in an inner block,
the inner declaration overrides the outer one and determines the meaning of the
identifier for the duration of the inner block. For example, if you declare a variable
called MaxValue in the interface section of a unit, and then declare another variable
with the same name in a function declaration within that unit, any unqualified
occurrences of MaxValue in the function block are governed by the second, local
declaration. Similarly, a function declared within another function creates a new,
inner scope in which identifiers used by the outer function can be redeclared locally.
The use of multiple units further complicates the definition of scope. Each unit listed
in a uses clause imposes a new scope that encloses the remaining units used and the
program or unit containing the uses clause. The first unit in a uses clause represents
the outermost scope and each succeeding unit represents a new scope inside the
previous one. If two or more units declare the same identifier in their interface
sections, an unqualified reference to the identifier selects the declaration in the
innermost scope—that is, in the unit where the reference itself occurs, or, if that unit
doesn’t declare the identifier, in the last unit in the uses clause that does declare the
identifier.
The System unit is used automatically by every program or unit. The declarations in
System, along with the predefined types, routines, and constants that the compiler
understands automatically, always have the outermost scope.
You can override these rules of scope and by-pass an inner declaration by using a
qualified identifier (see “Qualified identifiers” on page 4-2) or a with statement (see
“With statements” on page 4-20).
About types
There are several ways to categorize Object Pascal data types:
• Some types are predefined (or built-in); the compiler recognizes these automatically,
without the need for a declaration. Almost all of the types documented in this
language reference are predefined. Other types are created by declaration; these
include user-defined types and the types defined in Delphi’s libraries.
• Types can be classified as either fundamental or generic. The range and format of a
fundamental type is the same in all implementations of Object Pascal, regardless
of the underlying CPU and operating system. The range and format of a generic
type is platform-specific and could vary across different implementations. Most
predefined types are fundamental, but a handful of integer, character, string, and
pointer types are generic. It’s a good idea to use generic types when possible, since
they provide optimal performance and portability. However, changes in storage
format from one implementation of a generic type to the next could cause
compatibility problems—for example, if you are streaming data to a file.
• Types can be classified as simple, string, structured, pointer, procedural, or variant. In
addition, type identifiers themselves can be regarded as belonging to a special
“type” because they can be passed as parameters to certain functions (such as
High, Low, and SizeOf).
The outline below shows the taxonomy of Object Pascal data types.
simple
ordinal
integer
character
Boolean
enumerated
subrange
real
string
structured
set
array
record
file
class
class reference
interface
pointer
procedural
variant
type identifier
The standard function SizeOf operates on all variables and type identifiers. It returns
an integer representing the amount of memory (in bytes) used to store data of the
specified type. For example, SizeOf(Longint) returns 4, since a Longint variable uses
four bytes of memory.
Type declarations are illustrated in the sections that follow. For general information
about type declarations, see “Declaring types” on page 5-35.
Simple types
Simple types, which include ordinal types and real types, define ordered sets of values.
Ordinal types
Ordinal types include integer, character, Boolean, enumerated, and subrange types. An
ordinal type defines an ordered set of values in which each value except the first has
a unique predecessor and each value except the last has a unique successor. Further,
each value has an ordinality, which determines the ordering of the type. For integer
types, the ordinality of a value is the value itself; for all other ordinal types except
subranges, the first value has ordinality 0, the next value has ordinality 1, and so
forth. If a value has ordinality n, its predecessor has ordinality n–1 and its successor
has ordinality n+1.
Several predefined functions operate on ordinal values and type identifiers. The most
important of them are summarized below.
For example, High(Byte) returns 255 because the highest value of type Byte is 255, and
Succ(2) returns 3 because 3 is the successor of 2.
The standard procedures Inc and Dec increment and decrement the value of an
ordinal variable. For example, Inc(I) is equivalent to I := Succ(I) and, if I is an
integer variable, to I := I + 1.
Integer types
An integer type represents a subset of the whole numbers. The generic integer types
are Integer and Cardinal; use these whenever possible, since they result in the best
performance for the underlying CPU and operating system. The table below gives
their ranges and storage formats for the current 32-bit Object Pascal compiler.
Table 5.1 Generic integer types for 32-bit implementations of Object Pascal
Type Range Format
Integer –2147483648..2147483647 signed 32-bit
Cardinal 0..4294967295 unsigned 32-bit
Fundamental integer types include Shortint, Smallint, Longint, Int64, Byte, Word, and
Longword.
Character types
The fundamental character types are AnsiChar and WideChar. AnsiChar values are
byte-sized (8-bit) characters ordered according to the extended ANSI character set.
WideChar values are word-sized (16-bit) characters ordered according to the Unicode
character set. The first 256 Unicode characters correspond to the ANSI characters.
The generic character type is Char, which is equivalent to AnsiChar. Because the
implementation of Char is subject to change, it’s a good idea to use the standard
function SizeOf rather than a hard-coded constant when writing programs that may
need to handle characters of different sizes.
A string constant of length 1, such as 'A', can denote a character value. The
predefined function Chr returns the character value for any integer in the range of
AnsiChar or WideChar; for example, Chr(65) returns the letter A.
Character values, like integers, wrap around when decremented or incremented past
the beginning or end of their range (unless range-checking is enabled). For example,
after execution of the code
var
Letter: Char;
I: Integer;
begin
Letter := High(Letter);
for I := 1 to 66 do
Inc(Letter);
end;
Letter has the value A (ASCII 65).
For more information about Unicode characters, see “About extended character sets”
on page 5-12 and “Working with null-terminated strings” on page 5-12.
Boolean types
The four predefined Boolean types are Boolean, ByteBool, WordBool, and LongBool.
Boolean is the preferred type. The others exist to provide compatibility with different
languages and the Windows environment.
A Boolean variable occupies one byte of memory, a ByteBool variable also occupies
one byte, a WordBool variable occupies two bytes (one word), and a LongBool variable
occupies four bytes (two words).
Boolean values are denoted by the predefined constants True and False. The
following relationships hold.
A value of type ByteBool, LongBool, or WordBool is considered True when its ordinality
is nonzero. If such a value appears in a context where a Boolean is expected, the
compiler automatically converts any value of nonzero ordinality to True.
The remarks above refer to the ordinality of Boolean values—not to the values
themselves. In Object Pascal, Boolean expressions cannot be equated with integers or
reals. Hence, if X is an integer variable, the statement
if X then ...;
generates a compilation error. Casting the variable to a Boolean type is unreliable,
but each of the following alternatives will work.
if X <> 0 then ...; { use longer expression that returns Boolean value }
var OK: Boolean { use Boolean variable }
ƒ
if X <> 0 then OK := True;
if OK then ...;
Enumerated types
An enumerated type defines an ordered set of values by simply listing identifiers that
denote these values. The values have no inherent meaning, and their ordinality
follows the sequence in which the identifiers are listed.
To declare an enumerated type, use the syntax
type typeName = (val1, ..., valn)
where typeName and each val are valid identifiers. For example, the declaration
type Suit = (Club, Diamond, Heart, Spade);
defines an enumerated type called Suit whose possible values are Club, Diamond,
Heart, and Spade.
When you declare an enumerated type, you are declaring each val to be a constant of
type typeName. If the val identifiers are used for another purpose within the same
scope, naming conflicts occur. For example, suppose you declare the type
type TSound = (Click, Clack, Clock);
Unfortunately, Click is also the name of a method defined for TControl and all of the
objects in Delphi’s VCL that descend from it. So if you’re writing a Delphi application
and you create an event handler like
procedure TForm1.DBGrid1Enter(Sender: TObject);
var Thing: TSound;
begin
ƒ
Thing := Click;
ƒ
end;
you’ll get a compilation error; the compiler interprets Click within the scope of the
procedure as a reference to TForm’s Click method. You can work around this by
qualifying the identifier; thus, if TSound is declared in MyUnit, you would use
Thing := MyUnit.Click;
A better solution, however, is to choose constant names that are not likely to conflict
with other identifiers. Examples:
type
TSound = (tsClick, tsClack, tsClock);
TMyColor = (mcRed, mcBlue, mcGreen, mcYellow, mcOrange);
Answer = (ansYes, ansNo, ansMaybe);
You can use the (val1, ..., valn) construction directly in variable declarations, as if it
were a type name:
var MyCard: (Club, Diamond, Heart, Spade);
But if you declare MyCard this way, you can’t declare another variable within the
same scope using these constant identifiers. Thus
var Card1: (Club, Diamond, Heart, Spade);
var Card2: (Club, Diamond, Heart, Spade);
generates a compilation error. But
var Card1, Card2: (Club, Diamond, Heart, Spade);
compiles cleanly, as does
type Suit = (Club, Diamond, Heart, Spade);
var
Card1: Suit;
Card2: Suit;
Subrange types
A subrange type represents a subset of the values in another ordinal type (called the
base type). Any construction of the form Low..High, where Low and High are constant
expressions of the same ordinal type and Low is less than High, identifies a subrange
type that includes all values between Low and High. For example, if you declare the
enumerated type
type TColors = (Red, Blue, Green, Yellow, Orange, Purple, White, Black);
you can then define a subrange type like
type TMyColors = Green..White;
Here TMyColors includes the values Green, Yellow, Orange, Purple, and White.
You can use numeric constants and characters (string constants of length 1) to define
subrange types:
type
SomeNumbers = -128..127;
Caps = 'A'..'Z';
When you use numeric or character constants to define a subrange, the base type is
the smallest integer or character type that contains the specified range.
The Low..High construction itself functions as a type name, so you can use it directly
in variable declarations. For example,
var SomeNum: 1..500;
declares an integer variable whose value can be anywhere in the range from 1 to 500.
The ordinality of each value in a subrange is preserved from the base type. (In the
first example above, if Color is a variable that holds the value Green, Ord(Color) returns
2 regardless of whether Color is of type TColors or TMyColors.) Values do not wrap
around the beginning or end of a subrange, even if the base is an integer or character
type; incrementing or decrementing past the boundary of a subrange simply converts
the value to the base type. Hence, while
type Percentile = 0..99;
var I: Percentile;
ƒ
I := 100;
produces an error,
ƒ
I := 99;
Inc(I);
assigns the value 100 to I (unless compiler range-checking is enabled).
The use of constant expressions in subrange definitions introduces a syntactic
difficulty. In any type declaration, when the first meaningful character after = is a left
parenthesis, the compiler assumes that an enumerated type is being defined. Hence
the code
const
X = 50;
Y = 10;
type
Scale = (X - Y) * 2..(X + Y) * 2;
produces an error. Work around this problem by rewriting the type declaration to
avoid the leading parenthesis:
type
Scale = 2 * (X - Y)..(X + Y) * 2;
Real types
A real type defines a set of numbers that can be represented with floating-point
notation. The table below gives the ranges and storage formats for the fundamental
real types.
Note The six-byte Real48 type was called Real in earlier versions of Object Pascal. If you are
recompiling code that uses the older, six-byte Real type, you may want to change it to
Real48. You can also use the {$REALCOMPATIBILITY ON} compiler directive to
turn Real back into the six-byte type.
The following remarks apply to fundamental real types.
• Real48 is maintained for backward compatibility. Since its storage format is not
native to the Intel CPU family, it results in slower performance than other
floating-point types.
• Extended offers greater precision than other real types but is less portable. Be
careful using Extended if you are creating data files to share across platforms.
• The Comp (computational) type is native to the Intel CPU and represents a 64-bit
integer. It is classified as a real, however, because it does not behave like an
ordinal type. (For example, you cannot increment or decrement a Comp value.)
Comp is maintained for backward compatibility only. Use the Int64 type for better
performance.
• Currency is a fixed-point data type that minimizes rounding errors in monetary
calculations. It is stored as a scaled 64-bit integer with the four least-significant
digits implicitly representing decimal places. When mixed with other real types in
assignments and expressions, Currency values are automatically divided or
multiplied by 10000.
String types
A string represents a sequence of characters. Object Pascal supports the following
predefined string types.
AnsiString, sometimes called the long string, is the preferred type for most purposes.
String types can be mixed in assignments and expressions; the compiler
automatically performs required conversions. But strings passed by reference to a
function or procedure (as var and out parameters) must be of the appropriate type.
Strings can be explicitly cast to a different string type (see “Typecasts” on page 4-14).
The reserved word string functions like a generic type identifier. For example,
var S: string;
creates a variable S that holds a string. In the default {$H+} state, the compiler
interprets string (when it appears without a bracketed number after it) as AnsiString.
Use the {$H–} directive to turn string into ShortString.
The standard function Length returns the number of characters in a string. The
SetLength procedure adjusts the length of a string. See the online Help for details.
Comparison of strings is defined by the ordering of the characters in corresponding
positions. Between strings of unequal length, each character in the longer string
without a corresponding character in the shorter string takes on a greater-than value.
For example, “AB” is greater than “A”; that is, 'AB' > 'A' returns True. Zero-length
strings hold the lowest values.
You can index a string variable just as you would an array. If S is a string variable
and i an integer expression, S[i] represents the ith character—or, strictly speaking,
the ith byte—in S. For a ShortString or AnsiString, S[i] is of type AnsiChar; for a
WideString, S[i] is of type WideChar. The statement MyString[2] := 'A'; assigns the
value A to the second character of MyString. The following code uses the standard
UpCase function to convert MyString to uppercase.
var I: Integer;
begin
I := Length(MyString);
while I > 0 do
begin
MyString[I] := UpCase(MyString[I]);
I := I - 1;
end;
end;
Be careful indexing strings in this way, since overwriting the end of a string can cause
access violations. Also, avoid passing long-string indexes as var parameters, because
this results in inefficient code.
You can assign the value of a string constant—or any other expression that returns a
string—to a variable. The length of the string changes dynamically when the
assignment is made. Examples:
MyString := 'Hello world!';
MyString := 'Hello ' + 'world';
MyString := MyString + '!';
MyString := ' '; { space }
MyString := ''; { empty string }
For more information, see “Character strings” on page 4-4 and “String operators” on
page 4-9.
Short strings
A ShortString is 0 to 255 characters long. While the length of a ShortString can change
dynamically, its memory is a statically allocated 256 bytes; the first byte stores the
length of the string, and the remaining 255 bytes are available for characters. If S is a
ShortString variable, Ord(S[0]), like Length(S), returns the length of S; assigning a
value to S[0], like calling SetLength, changes the length of S. ShortString uses 8-bit
ANSI characters and is maintained for backward compatibility only.
Object Pascal supports short-string types—in effect, subtypes of ShortString—whose
maximum length is anywhere from 0 to 255 characters. These are denoted by a
bracketed numeral appended to the reserved word string. For example,
var MyString: string[100];
creates a variable called MyString whose maximum length is 100 characters. This is
equivalent to the declarations
type CString = string[100];
var MyString: CString;
Variables declared in this way allocate only as much memory as the type requires—
that is, the specified maximum length plus one byte. In our example, MyString uses
101 bytes, as compared to 256 bytes for a variable of the predefined ShortString type.
When you assign a value to a short-string variable, the string is truncated if it exceeds
the maximum length for the type.
The standard functions High and Low operate on short-string type identifiers and
variables. High returns the maximum length of the short-string type, while Low
returns zero.
Long strings
AnsiString, also called a long string, represents a dynamically allocated string whose
maximum length is limited only by available memory. It uses 8-bit ANSI characters.
A long-string variable is a pointer occupying four bytes of memory. When the
variable is empty—that is, when it contains a zero-length string—the pointer is nil
and the string uses no additional storage. When the variable is nonempty, it points to
a dynamically allocated block of memory that contains the string value, a 32-bit
length indicator, and a 32-bit reference count. This memory is allocated on the heap,
but its management is entirely automatic and requires no user code.
Because long-string variables are pointers, two or more of them can reference the same
value without consuming additional memory. The compiler exploits this to conserve
resources and execute assignments faster. Whenever a long-string variable is destroyed
or assigned a new value, the reference count of the old string (the variable’s previous
value) is decremented and the reference count of the new value (if there is one) is
incremented; if the reference count of a string reaches zero, its memory is deallocated.
This process is called reference-counting. When indexing is used to change the value of a
single character in a string, a copy of the string is made if—but only if—its reference
count is greater than one. This is called copy-on-write semantics.
WideString
The WideString type represents a dynamically allocated string of 16-bit Unicode
characters. In most respects it is similar to AnsiString, but it is less efficient because it
does not implement reference-counting and copy-on-write semantics.
WideString is compatible with the COM BSTR type. Delphi has COM support
features that convert AnsiString values to WideString, but if you make calls to the
COM API, you may need to explicitly cast or convert your strings to WideString.
SysUtils unit (see Chapter 8, “Standard routines and I/O”) to handle null-terminated
strings when you need to share data with systems that use them.
For example, the following type declarations could be used to store null-terminated
strings.
type
TIdentifier = array[0..15] of Char;
TFileName = array[0..259] of Char;
TMemoText = array[0..1023] of WideChar;
You can assign a string constant to a statically allocated zero-based character array.
(Dynamic arrays won’t work for this purpose.) If you initialize an array constant with
a string that is shorter than the declared length of the array, the remaining characters
are set to #0. For more information about arrays, see “Arrays” on page 5-16.
var
MyArray: array[0..32] of Char;
MyPointer: PChar;
begin
MyArray := 'Hello';
MyPointer := MyArray;
SomeProcedure(MyArray);
SomeProcedure(MyPointer);
end;
This code calls SomeProcedure twice with the same value.
A character pointer can be indexed as if it were an array. In the example above,
MyPointer[0] returns H. The index specifies an offset added to the pointer before it is
dereferenced. (For PWideChar variables, the index is automatically multiplied by
two.) Thus, if P is a character pointer, P[0] is equivalent to P^ and specifies the first
character in the array, P[1] specifies the second character in the array, and so forth;
P[-1] specifies the “character” immediately to the left of P[0]. The compiler performs no
range checking on these indexes.
The StrUpper function illustrates the use of pointer indexing to iterate through a
null-terminated string:
function StrUpper(Dest, Source: PChar; MaxLen: Integer): PChar;
var
I: Integer;
begin
I := 0;
while (I < MaxLen) and (Source[I] <> #0) do
begin
Dest[I] := UpCase(Source[I]);
Inc(I);
end;
Dest[I] := #0;
Result := Dest;
end;
You can also cast a long string as a null-terminated string. The following rules apply.
• If S is a long-string expression, PChar(S) casts S as a null-terminated string; it
returns a pointer to the first character in S. For example, if Str1 and Str2 are long
strings, you could call the Win32 API MessageBox function like this:
MessageBox(0, PChar(Str1), PChar(Str2), MB_OK);
(MessageBox is declared in the Windows interface unit.)
• You can also use Pointer(S) to cast a long string to an untyped pointer. But if S is
empty, the typecast returns nil.
• When you cast a long-string variable to a pointer, the pointer remains valid until
the variable is assigned a new value or goes out of scope. If you cast any other
long-string expression to a pointer, the pointer is valid only within the statement
where the typecast is performed.
• When you cast a long-string expression to a pointer, the pointer should usually be
considered read-only. You can safely use the pointer to modify the long string
only when all of the following conditions are satisfied.
• The expression cast is a long-string variable.
• The string is not empty.
• The string is unique—that is, has a reference count of one. To guarantee that the
string is unique, call the SetLength, SetString, or UniqueString procedure.
• The string has not been modified since the typecast was made.
• The characters modified are all within the string. Be careful not to use an
out-of-range index on the pointer.
The same rules apply when mixing WideString values with PWideChar values.
Structured types
Instances of a structured type hold more than one value. Structured types include
sets, arrays, records, and files as well as class, class-reference, and interface types. (For
information about class and class-reference types, see Chapter 7, “Classes and
objects.” For information about interfaces, see Chapter 10, “Object interfaces.”)
Except for sets, which hold ordinal values only, structured types can contain other
structured types; a type can have unlimited levels of structuring.
By default, the values in a structured type are aligned on word or double-word
boundaries for faster access. When you declare a structured type, you can include the
reserved word packed to implement compressed data storage. For example,
type TNumbers = packed array[1..100] of Real;
Using packed slows data access and, in the case of a character array, affects type
compatibility. For more information, see Chapter 11, “Memory management.”
Sets
A set is a collection of values of the same ordinal type. The values have no inherent
order, nor is it meaningful for a value to be included twice in a set.
The range of a set type is the power set of a specific ordinal type, called the base type;
that is, the possible values of the set type are all the subsets of the base type,
including the empty set. The base type can have no more than 256 possible values,
and their ordinalities must fall between 0 and 255. Any construction of the form
set of baseType
where baseType is an appropriate ordinal type, identifies a set type.
Because of the size limitations for base types, set types are usually defined with
subranges. For example, the declarations
type
TSomeInts = 1..250;
TIntSet = set of TSomeInts;
create a set type called TIntSet whose values are collections of integers in the range
from 1 to 250. You could accomplish the same thing with
type TIntSet = set of 1..250;
Given this declaration, you can create a sets like this:
var Set1, Set2: TIntSet;
ƒ
Set1 := [1, 3, 5, 7, 9];
Set2 := [2, 4, 6, 8, 10]
You can also use the set of ... construction directly in variable declarations:
var MySet: set of 'a'..'z';
ƒ
MySet := ['a','b','c'];
Other examples of set types include
set of Byte
set of (Club, Diamond, Heart, Spade)
set of Char;
The in operator tests set membership:
if 'a' in MySet then ... { do something } ;
Every set type can hold the empty set, denoted by []. For more information about
sets, see “Set constructors” on page 4-13 and “Set operators” on page 4-10.
Arrays
An array represents an indexed collection of elements of the same type (called the base
type). Because each element has a unique index, arrays, unlike sets, can meaningfully
contain the same value more than once. Arrays can be allocated statically or dynamically.
Static arrays
Static array types are denoted by constructions of the form
array[indexType1, ..., indexTypen] of baseType
where each indexType is an ordinal type whose range does not exceed 2GB. Since the
indexTypes index the array, the number of elements an array can hold is limited by
the product of the sizes of the indexTypes. In practice, indexTypes are usually integer
subranges.
In the simplest case of a one-dimensional array, there is only a single indexType. For
example,
var MyArray: array[1..100] of Char;
declares a variable called MyArray that holds an array of 100 character values. Given
this declaration, MyArray[3] denotes the third character in MyArray. If you create a
static array but don’t assign values to all its elements, the unused elements are still
allocated and contain random data; they are like uninitialized variables.
A multidimensional array is an array of arrays. For example,
type TMatrix = array[1..10] of array[1..50] of Real;
is equivalent to
type TMatrix = array[1..10, 1..50] of Real;
Whichever way TMatrix is declared, it represents an array of 500 real values. A
variable MyMatrix of type TMatrix can be indexed like this: MyMatrix[2,45]; or like
this: MyMatrix[2][45]. Similarly,
packed array[Boolean,1..10,TShoeSize] of Integer;
is equivalent to
packed array[Boolean] of packed array[1..10] of packed array[TShoeSize] of Integer;
The standard functions Low and High operate on array type identifiers and variables.
They return the low and high bounds of the array’s first index type. The standard
function Length returns the number of elements in the array’s first dimension.
A one-dimensional, packed, static array of Char values is called a packed string. Packed-
string types are compatible with string types and with other packed-string types that
have the same number of elements. See “Type compatibility and identity” on page 5-33.
An array type of the form array[0..x] of Char is called a zero-based character array. Zero-
based character arrays are used to store null-terminated strings and are compatible with
PChar values. See “Working with null-terminated strings” on page 5-12.
Dynamic arrays
Dynamic arrays do not have a fixed size or length. Instead, memory for a dynamic
array is reallocated when you assign a value to the array or pass it to the SetLength
procedure. Dynamic-array types are denoted by constructions of the form
array of baseType
For example,
var MyFlexibleArray: array of Real;
declares a one-dimensional dynamic array of reals. The declaration does not allocate
memory for MyFlexibleArray. To create the array in memory, call SetLength. For
example, given the declaration above,
SetLength(MyFlexibleArray, 20);
allocates an array of 20 reals, indexed 0 to 19. Dynamic arrays are always
integer-indexed, always starting from 0.
Dynamic-array variables are implicitly pointers and are managed by the same
reference-counting technique used for long strings. To deallocate a dynamic array,
assign nil to a variable that references the array or pass the variable to Finalize; either
of these methods disposes of the array, provided there are no other references to it.
Dynamic arrays of length 0 have the value nil. Do not apply the dereference operator
(^) to a dynamic-array variable or pass it to the New or Dispose procedure.
If X and Y are variables of the same dynamic-array type, X := Y points X to the same
array as Y. (There is no need to allocate memory for X before performing this
operation.) Unlike strings and static arrays, dynamic arrays are not automatically
copied before they are written to. For example, after this code executes—
var
A, B: array of Integer;
begin
SetLength(A, 1);
A[0] := 1;
B := A;
B[0] := 2;
end;
—the value of A[0] is 2. (If A and B were static arrays, A[0] would still be 1.)
Assigning to a dynamic-array index (for example, MyFlexibleArray[2] := 7) does not
reallocate the array. Out-of-range indexes are not reported at compile time.
When dynamic-array variables are compared, their references are compared, not
their array values. Thus, after execution of the code
var
A, B: array of Integer;
begin
SetLength(A, 1);
SetLength(B, 1);
A[0] := 2;
B[0] := 2;
end;
A = B returns False but A[0] = B[0] returns True.
To truncate a dynamic array, pass it to the Copy function and assign the result back to
the array variable. For example, if A is a dynamic array, A := Copy(A, 0, 20) truncates
all but the first 20 elements of A.
Once a dynamic array has been allocated, you can pass it to the standard functions
Length, High, and Low. Length returns the number of elements in the array, High
returns the array’s highest index (that is, Length–1), and Low returns 0. In the case of a
zero-length array, High returns –1 (with the anomalous consequence that High < Low).
Note In some function and procedure declarations, array parameters are represented as
array of baseType, without any index types specified. For example,
function CheckStrings(A: array of string): Boolean;
This indicates that the function operates on all arrays of the specified base type,
regardless of their size, how they are indexed, or whether they are allocated statically
or dynamically. See “Open array parameters” on page 6-13.
Records
A record (analogous to a structure in some languages) represents a heterogeneous set
of elements. Each element is called a field; the declaration of a record type specifies a
name and type for each field. The syntax of a record type declaration is
type recordTypeName = record
fieldList1: type1;
ƒ
fieldListn: typen;
end
Where recordTypeName is a valid identifier, each type denotes a type, and each fieldList
is a valid identifier or a comma-delimited list of identifiers. The final semicolon is
optional.
For example, the following declaration creates a record type called TDateRec.
type
TDateRec = record
Year: Integer;
Month: (Jan, Feb, Mar, Apr, May, Jun,
Jul, Aug, Sep, Oct, Nov, Dec);
Day: 1..31;
end;
Each TDateRec contains three fields: an integer value called Year, a value of an
enumerated type called Month, and another integer between 1 and 31 called Day. The
identifiers Year, Month, and Day are the field designators for TDateRec, and they behave
like variables. The TDateRec type declaration, however, does not allocate any
memory for the Year, Month, and Day fields; memory is allocated when you
instantiate the record, like this:
var Record1, Record2: TDateRec;
This variable declaration creates two instances of TDateRec, called Record1 and
Record2.
You can access the fields of a record by qualifying the field designators with the
record’s name:
Record1.Year := 1904;
Record1.Month := Jun;
Record1.Day := 16;
Or use a with statement:
with Record1 do
begin
Year := 1904;
Month := Jun;
Day := 16;
end;
You can now copy the values of Record1’s fields to Record2:
Record2 := Record1;
Because the scope of a field designator is limited to the record in which it occurs, you
don’t have to worry about naming conflicts between field designators and other
variables.
Instead of defining record types, you can use the record ... construction directly in
variable declarations:
var S: record
Name: string;
Age: Integer;
end;
However, a declaration like this largely defeats the purpose of records, which is to
avoid repetitive coding of similar groups of variables. Moreover, separately declared
records of this kind will not be assignment-compatible, even if their structures are
identical.
The first part of the declaration—up to the reserved word case—is the same as that of
a standard record type. The remainder of the declaration—from case to the optional
final semicolon—is called the variant part. In the variant part,
• tag is optional and can be any valid identifier. If you omit tag, omit the colon (:)
after it as well.
• ordinalType denotes an ordinal type.
• Each constantList is a constant denoting a value of type ordinalType, or a
comma-delimited list of such constants. No value can be represented more than
once in the combined constantLists.
• Each variant is a comma-delimited list of declarations resembling the fieldList: type
constructions in the main part of the record type. That is, a variant has the form
fieldList1: type1;
ƒ
fieldListn: typen;
where each fieldList is a valid identifier or comma-delimited list of identifiers, each
type denotes a type, and the final semicolon is optional. The types must not be long
strings, dynamic arrays, variants (that is, Variant types), or interfaces, nor can they
be structured types that contain long strings, dynamic arrays, variants, or
interfaces; but they can be pointers to these types.
Records with variant parts are complicated syntactically but deceptively simple
semantically. The variant part of a record contains several variants which share the
same space in memory. You can read or write to any field of any variant at any time;
but if you write to a field in one variant and then to a field in another variant, you may
be overwriting your own data. The tag, if there is one, functions as an extra field (of
type ordinalType) in the non-variant part of the record.
Variant parts have two purposes. First, suppose you want to create a record type that
has fields for different kinds of data, but you know that you will never need to use all
of the fields in a single record instance. For example,
type
TEmployee = record
FirstName, LastName: string[40];
BirthDate: TDate;
case Salaried: Boolean of
True: (AnnualSalary: Currency);
False: (HourlyWage: Currency);
end;
The idea here is that every employee has either a salary or an hourly wage, but not
both. So when you create an instance of TEmployee, there is no reason to allocate
enough memory for both fields. In this case, the only difference between the variants
is in the field names, but the fields could just as easily have been of different types.
Consider some more complicated examples:
type
TPerson = record
FirstName, LastName: string[40];
BirthDate: TDate;
case Citizen: Boolean of
True: (Birthplace: string[40]);
False: (Country: string[20];
EntryPort: string[20];
EntryDate, ExitDate: TDate);
end;
type
TShapeList = (Rectangle, Triangle, Circle, Ellipse, Other);
TFigure = record
case TShapeList of
Rectangle: (Height, Width: Real);
Triangle: (Side1, Side2, Angle: Real);
Circle: (Radius: Real);
Ellipse, Other: ();
end;
For each record instance, the compiler allocates enough memory to hold all the fields
in the largest variant. The optional tag and the constantLists (like Rectangle, Triangle,
and so forth in the last example above) play no role in the way the compiler manages
the fields; they are there only for the convenience of the programmer.
The second reason for variant parts is that they let you treat the same data as
belonging to different types, even in cases where the compiler would not allow a
typecast. For example, if you have a 64-bit Real as the first field in one variant and a
32-bit Integer as the first field in another, you can assign a value to the Real field and
then read back the first 32 bits of it as the value of the Integer field (passing it, say, to a
function that requires integer parameters).
File types
A file is an ordered set of elements of the same type. Standard I/O routines use the
predefined TextFile or Text type, which represents a file containing characters
organized into lines. For more information about file input and output, see
Chapter 8, “Standard routines and I/O.”
To declare a file type, use the syntax
type fileTypeName = file of type
where fileTypeName is any valid identifier and type is a fixed-size type. Pointer
types—whether implicit or explicit—are not allowed, so a file cannot contain
dynamic arrays, long strings, classes, objects, pointers, variants, other files, or
structured types that contain any of these.
For example,
type
PhoneEntry = record
FirstName, LastName: string[20];
PhoneNumber: string[15];
Listed: Boolean;
end;
PhoneList = file of PhoneEntry;
declares a file type for recording names and telephone numbers.
You can also use the file of ... construction directly in a variable declaration. For
example,
var List1: file of PhoneEntry;
The word file by itself indicates an untyped file:
var DataFile: file;
For more information, see “Untyped files” on page 8-4.
Files are not allowed in arrays or records.
Overview of pointers
To see how pointers work, look at the following example.
1 var
2 X, Y: Integer; // X and Y are Integer variables
3 P: ^Integer; // P points to an Integer
4 begin
5 X := 17; // assign a value to X
6 P := @X; // assign the address of X to P
7 Y := P^; // dereference P; assign the result to Y
8 end;
Line 2 declares X and Y as variables of type Integer. Line 3 declares P as a pointer to
an Integer value; this means that P can point to the location of X or Y. Line 5 assigns a
value to X, and line 6 assigns the address of X (denoted by @X) to P. Finally, line 7
retrieves the value at the location pointed to by P (denoted by ^P) and assigns it to Y.
After this code executes, X and Y have the same value, namely 17.
The @ operator, which we have used here to take the address of a variable, also
operates on functions and procedures. For more information, see “The @ operator”
on page 4-11 and “Procedural types in statements and expressions” on page 5-28.
The symbol ^ has two purposes, both of which are illustrated in our example. When
it appears before a type identifier—
^typeName
—it denotes a type that represents pointers to variables of type typeName. When it
appears after a pointer variable—
pointer^
—it dereferences the pointer; that is, it returns the value stored at the memory address
held by the pointer.
Our example may seem like a roundabout way of copying the value of one variable
to another—something that we could have accomplished with a simple assignment
statement. But pointers are useful for several reasons. First, understanding pointers
will help you to understand Object Pascal, since pointers often operate behind the
scenes in code where they don’t appear explicitly. Any data type that requires large,
dynamically allocated blocks of memory uses pointers. Long-string variables, for
instance, are implicitly pointers, as are class variables. Moreover, some advanced
programming techniques require the use of pointers.
Finally, pointers are sometimes the only way to circumvent Object Pascal’s strict data
typing. By referencing a variable with an all-purpose Pointer, casting the Pointer to a
more specific type, and then dereferencing it, you can treat the data stored by any
variable as if it belonged to any type. For example, the following code assigns data
stored in a real variable to an integer variable.
type
PInteger = ^Integer;
var
R: Single;
I: Integer;
P: Pointer;
PI: PInteger;
begin
ƒ
P := @R;
PI := PInteger(P);
I := PI^;
end;
Of course, reals and integers are stored in different formats. This assignment simply
copies raw binary data from R to I, without converting it.
In addition to assigning the result of an @ operation, you can use several standard
routines to give a value to a pointer. The New and GetMem procedures assign a
memory address to an existing pointer, while the Addr and Ptr functions return a
pointer to a specified address or variable.
Dereferenced pointers can be qualified and can function as qualifiers, as in the
expression P1^.Data^.
The reserved word nil is a special constant that can be assigned to any pointer. When
nil is assigned to a pointer, the pointer doesn’t reference anything.
Pointer types
You can declare a pointer to any type, using the syntax
type pointerTypeName = ^type
When you define a record or other data type, it’s a common practice also to define a
pointer to that type. This makes it easy to manipulate instances of the type without
copying large blocks of memory.
Standard pointer types exist for many purposes. The most versatile is Pointer, which
can point to data of any kind. But a Pointer variable cannot be dereferenced; placing
the ^ symbol after a Pointer variable causes a compilation error. To access the data
referenced by a Pointer variable, first cast it to another pointer type and then
dereference it.
Character pointers
The fundamental types PAnsiChar and PWideChar represent pointers to AnsiChar and
WideChar values, respectively. The generic PChar represents a pointer to a Char (that
is, in its current implementation, to an AnsiChar). These character pointers are used to
manipulate null-terminated strings. (See “Working with null-terminated strings” on
page 5-12.)
Procedural types
Procedural types allow you to treat procedures and functions as values that can be
assigned to variables or passed to other procedures and functions. For example,
suppose you define a function called Calc that takes two integer parameters and
returns an integer:
function Calc(X,Y: Integer): Integer;
You can assign the Calc function to the variable F:
var F: function(X,Y: Integer): Integer;
F := Calc;
If you take any procedure or function heading and remove the identifier after the
word procedure or function, what’s left is the name of a procedural type. You can
use such type names directly in variable declarations (as in the example above) or to
declare new types:
type
TIntegerFunction = function: Integer;
TProcedure = procedure;
TStrProc = procedure(const S: string);
TMathFunc = function(X: Double): Double;
var
F: TIntegerFunction; { F is a parameterless function that returns an integer }
Proc: TProcedure; { Proc is a parameterless procedure }
SP: TStrProc; { SP is a procedure that takes a string parameter }
M: TMathFunc; { M is a function that takes a Double (real) parameter
and returns a Double }
procedure FuncProc(P: TIntegerFunction); { FuncProc is a procedure whose only parameter
is a parameterless integer-valued function }
The variables above are all procedure pointers—that is, pointers to the address of a
procedure or function. If you want to reference a method of an instance object (see
Chapter 7, “Classes and objects”), you need to add the words of object to the
procedural type name. For example
type
TMethod = procedure of object;
TNotifyEvent = procedure(Sender: TObject) of object;
These types represent method pointers. A method pointer is really a pair of pointers;
the first stores the address of a method, and the second stores a reference to the object
the method belongs to. Given the declarations
type
TNotifyEvent = procedure(Sender: TObject) of object;
TMainForm = class(TForm)
procedure ButtonClick(Sender: TObject);
ƒ
end;
var
MainForm: TMainForm;
OnClick: TNotifyEvent
and assigns the result to I. Because I is an integer variable, not a procedural one, the
last assignment actually calls the function (which returns an integer).
In some situations it is less clear how a procedural variable should be interpreted.
Consider the statement
if F = MyFunction then ...;
In this case, the occurrence of F results in a function call; the compiler calls the
function pointed to by F, then calls the function MyFunction, then compares the
results. The rule is that whenever a procedural variable occurs within an expression,
it represents a call to the referenced procedure or function. In a case where F
references a procedure (which doesn’t return a value), or where F references a
function that requires parameters, the statement above causes a compilation error. To
compare the procedural value of F with MyFunction, use
if @F = @MyFunction then ...;
@F converts F into an untyped pointer variable that contains an address, and
@MyFunction returns the address of MyFunction.
To get the memory address of a procedural variable (rather than the address stored
in it), use @@. For example, @@F returns the address of F.
The @ operator can also be used to assign an untyped pointer value to a procedural
variable. For example,
var StrComp: function(Str1, Str2: PChar): Integer;
ƒ
@StrComp := GetProcAddress(KernelHandle, 'lstrcmpi');
calls the Windows GetProcAddress function and points StrComp to the result.
Any procedural variable can hold the value nil, which means that it points to
nothing. But attempting to call a nil-valued procedural variable is an error. To test
whether a procedural variable is assigned, use the standard function Assigned:
if Assigned(OnClick) then OnClick(X);
Variant types
Sometimes it is necessary to manipulate data whose type varies or cannot be
determined at compile time. In these cases, one option is to use variables and
parameters of type Variant, which represent values that can change type at runtime.
Variants, as they are called, offer greater flexibility but consume more memory than
regular variables, and operations on them are slower than on statically bound types.
Moreover, illicit operations on variants often result in runtime errors, where similar
mistakes with regular variables would have been caught at compile time.
Variants can hold values of any type except records, sets, static arrays, files, classes,
class references, pointers, and Int64. In other words, with the exception of Int64,
variants can hold anything but structured types and pointers. They can hold COM
and CORBA objects, whose methods and properties can be accessed through them.
(See Chapter 10, “Object interfaces”.) They can hold dynamic arrays, and they can
hold a special kind of static array called a variant array. (See “Variant arrays” on
page 5-32.) Variants can mix with other variants and with integer, real, string, and
Boolean values in expressions and assignments; the compiler automatically performs
type conversions.
Variants that contain strings cannot be indexed. That is, if V is a variant that holds a
string value, the construction V[1] is illegitimate.
A variant occupies 16 bytes of memory and consists of a type code and a value, or
pointer to a value, of the type specified by the code. All variants are initialized on
creation to the special value Unassigned. The special value Null indicates unknown or
missing data.
The standard function VarType returns a variant’s type code. The varTypeMask
constant is a bit mask used to extract the code from VarType’s return value, so that,
for example,
VarType(V) and varTypeMask = varDouble
returns True if V contains a Double or an array of Double. (The mask simply hides the
first bit, which indicates whether the variant holds an array.) The TVarData record
type defined in the System unit can be used to typecast variants and gain access to
their internal representation. See the online Help on VarType for a list if codes, and
note that new type codes may be added in future implementations of Object Pascal.
character same as string same as string same as string same as same as string
(above) (above) (above) string-to- (above)
string
Out-of-range assignments often result in the target variable getting the highest value
in its range. Invalid assignments or casts raise the EVariantError exception.
Special conversion rules apply to the TDateTime real type declared in the System unit.
When a TDateTime is converted to any other type, it treated as a normal Double. When
an integer, real, or Boolean is converted to a TDateTime, it is first converted to a
Double, then read as a date-time value. When a string is converted to a TDateTime, it is
interpreted as a date-time value using the Windows regional settings. When an
Unassigned value is converted to TDateTime, it is treated like the real or integer
value 0. Converting a Null value to TDateTime raises an exception.
If a variant references a COM object, any attempt to convert it reads the object’s
default property and converts that value to the requested type. If the object has no
default property, an exception is raised.
Variants in expressions
All operators except ^, is, and in take variant operands. Operations on variants
return Variant values; they return Null if one or both operands is Null, and raise an
exception if one or both operands is Unassigned. In a binary operation, if only one
operand is a variant, the other is converted to a variant.
The return type of an operation is determined by its operands. In general, the same
rules that apply to operands of statically bound types apply to variants. For example,
if V1 and V2 are variants that hold an integer and a real value, then V1 + V2 returns a
real-valued variant. (See “Operators” on page 4-6.) With variants, however, you can
perform binary operations on combinations of values that would not be allowed
using statically typed expressions. When possible, the compiler converts mismatched
variants using the rules summarized in Table 5.7. For example, if V3 and V4 are
variants that hold a numeric string and an integer, the expression V3 + V4 returns an
integer-valued variant; the numeric string is converted to an integer before the
operation is performed.
Variant arrays
You cannot assign an ordinary static array to a variant. Instead, create a variant array
by calling either of the standard functions VarArrayCreate or VarArrayOf. For
example,
V: Variant;
ƒ
V := VarArrayCreate([0,9], varInteger);
creates a variant array of integers (of length 10) and assigns it to the variant V. The
array can be indexed using V[0], V[1], and so forth, but it is not possible to pass a
variant array element as a var parameter. Variant arrays are always indexed with
integers.
The second parameter in the call to VarArrayCreate is the type code for the array’s
base type. For a list of these codes, see the online Help on VarType. Never pass the
code varString to VarArrayCreate; to create a variant array of strings, use varOleStr.
Variants can hold variant arrays of different sizes, dimensions, and base types. The
elements of a variant array can be of any type allowed in variants except ShortString
and AnsiString, and if the base type of the array is Variant, its elements can even be
heterogeneous. Use the VarArrayRedim function to resize a variant array. Other
standard routines that operate on variant arrays include VarArrayDimCount,
VarArrayLowBound, VarArrayHighBound, VarArrayRef, VarArrayLock, and
VarArrayUnlock.
OleVariant
The OleVariant type represents variants that contain only COM-compatible types.
When a Variant is assigned to an OleVariant, incompatible types are converted to
their compatible counterparts. For example, if a variant containing an AnsiString is
assigned to an OleVariant, the AnsiString becomes a WideString.
Type identity
Type identity is almost straightforward. When one type identifier is declared using
another type identifier, without qualification, they denote the same type. Thus, given
the declarations
type
T1 = Integer;
T2 = T1;
T3 = Integer;
T4 = T2;
T1, T2, T3, T4, and Integer all denote the same type. To create distinct types, repeat the
word type in the declaration. For example,
type TMyInteger = type Integer;
creates a new type called TMyInteger which is not identical to Integer.
Language constructions that function as type names denote a different type each time
they occur. Thus the declarations
type
TS1 = set of Char;
TS2 = set of Char;
create two distinct types, TS1 and TS2. Similarly, the variable declarations
var
S1: string[10];
S2: string[10];
create two variables of distinct types. To create variables of the same type, use
var S1, S2: string[10];
or
type MyString = string[10];
var
S1: MyString;
S2: MyString;
Type compatibility
Every type is compatible with itself. Two distinct types are compatible if they satisfy
at least one of the following conditions.
• They are both real types.
• They are both integer types.
• One type is a subrange of the other.
• Both types are subranges of the same type.
• Both are set types with compatible base types.
• Both are packed-string types with the same number of components.
• One is a string type and the other is a string, packed-string, or Char type.
• One type is Variant and the other is an integer, real, string, character, or Boolean
type.
• Both are class, class-reference, or interface types, and one type is derived from the
other.
• One type is PChar or PWideChar and the other is a zero-based character array of the
form array[0..n] of Char.
• One type is Pointer (an untyped pointer) and the other is any pointer type.
• Both types are (typed) pointers to the same type and the {$T+} compiler directive
is in effect.
• Both are procedural types with the same result type, the same number of
parameters, and type-identity between parameters in corresponding positions.
Assignment-compatibility
Assignment-compatibility is not a symmetric relation. An expression of type T2 can
be assigned to a variable of type T1 if the value of the expression falls in the range of
T1 and at least one of the following conditions is satisfied.
• T1 and T2 are of the same type, and it is not a file type or structured type that
contains a file type at any level.
• T1 and T2 are compatible ordinal types.
• T1 and T2 are both real types.
• T1 is a real type and T2 is an integer type.
Declaring types
A type declaration specifies an identifier that denotes a type. The syntax for a type
declaration is
type newTypeName = type
where newTypeName is a valid identifier. For example, given the type declaration
type TMyString = string;
you can make the variable declaration
var S: TMyString;
A type identifier’s scope doesn’t include the type declaration itself (except for pointer
types). So you cannot, for example, define a record type that uses itself recursively.
When you declare a type that is identical to an existing type, the compiler treats the
new type identifier as an alias for the old one. Thus, given the declarations
type TValue = Real;
var
X: Real;
Y: TValue;
X and Y are of the same type; at runtime, there is no way to distinguish TValue from
Real. This is usually of little consequence, but if your purpose in defining a new type
is to utilize runtime type information—for example, to associate a Delphi property
editor with properties of a particular type—the distinction between “different name”
and “different type” becomes important. In this case, use the syntax
type newTypeName = type type
For example,
type TValue = type Real;
forces the compiler to create a new, distinct type called TValue.
Variables
A variable is an identifier whose value can change at runtime. Put differently, a
variable is a name for a location in memory; you can use the name to read or write to
the memory location. Variables are like containers for data, and, because they are
typed, they tell the compiler how to interpret the data they hold.
Declaring variables
The basic syntax for a variable declaration is
var identifierList: type;
where identifierList is a comma-delimited list of valid identifiers and type is any valid
type. For example,
var I: Integer;
declares a variable I of type Integer, while
var X, Y: Real;
declares two variables—X and Y—of type Real.
Consecutive variable declarations do not have to repeat the reserved word var:
var
X, Y, Z: Double;
I, J, K: Integer;
Digit: 0..9;
Okay: Boolean;
Variables declared within a procedure or function are sometimes called local, while
other variables are called global. Global variables can be initialized at the same time
they are declared, using the syntax
var identifier: type = constantExpression;
where constantExpression is any constant expression representing a value of type type.
(For more information about constant expressions, see “Constant expressions” on
page 5-39.) Thus the declaration
var I: Integer = 7;
is equivalent to the declaration and statement
var I: Integer;
ƒ
I := 7;
Multiple variable declarations (such as var X, Y, Z: Real;) cannot include
initializations, nor can declarations of variant and file-type variables.
If you don’t explicitly initialize a global variable, the compiler initializes it to 0. Local
variables, in contrast, cannot be initialized in their declarations and contain random
data until a value is assigned to them.
When you declare a variable, you are allocating memory which is freed
automatically when the variable is no longer used. In particular, local variables exist
only until the program exits from the function or procedure in which they are
declared. For more information about variables and memory management, see
Chapter 11, “Memory management.”
Absolute addresses
To declare a variable that resides at a specified memory address, put the word
absolute after the type name, followed by an address. Example:
var CrtMode: Byte absolute $0040;
This technique is useful only in low-level programming, for example when writing
device drivers.
To create a new variable that resides at the same address as an existing variable, use
the name of the existing variable (instead of an address) after the word absolute. For
example,
var
Str: string[32];
StrLen: Byte absolute Str;
specifies that the variable StrLen should start at the same address as Str. Since the first
byte of a short string contains the string’s length, the value of StrLen is the length of
Str.
You cannot initialize a variable in an absolute declaration.
Dynamic variables
You can create dynamic variables by calling the GetMem or New procedure. Such
variables are allocated on the heap and are not managed automatically. Once you
create one, it is your responsibility ultimately to free the variable’s memory; use
FreeMem to destroy variables created by GetMem and Dispose to destroy variables
created by New. Other standard routines that operate on dynamic variables include
ReallocMem, Initialize, StrAlloc, and StrDispose.
Long strings and dynamic arrays are also heap-allocated dynamic variables, but their
memory is managed automatically.
Thread-local variables
Thread-local (or thread) variables are used in multithreaded applications. A thread-local
variable is like a global variable, except that each thread of execution gets its own
private copy of the variable, which cannot be accessed from other threads. Thread-local
variables are declared with threadvar instead of var. For example,
threadvar X: Integer;
Thread-variable declarations
• cannot occur within a procedure or function.
• cannot include initializations.
• cannot specify the absolute directive.
Reference-counted variables (such as long strings, dynamic arrays, or interfaces) are
not thread-safe, even if they are declared with threadvar. Do not use dynamic thread
variables, since there is in general no way to free the heap-allocated memory created
by each thread of execution. Finally, do not create pointer- or procedural-type thread
variables.
Declared constants
Several different language constructions are referred to as “constants”. There are
numeric constants (also called numerals) like 17, and string constants (also called
character strings or string literals) like 'Hello world!'; for information about numeric
and string constants, see Chapter 4, “Syntactic elements.” Every enumerated type
defines constants that represent the values of that type. There are predefined
constants like True, False, and nil. Finally, there are constants that, like variables, are
created individually by declaration.
Declared constants are either true constants or typed constants. These two kinds of
constant are superficially similar, but they are governed by different rules and used
for different purposes.
True constants
A true constant is a declared identifier whose value cannot change. For example,
const MaxValue = 237;
declares a constant called MaxValue that returns the integer 237. The syntax for
declaring a true constant is
const identifier = constantExpression
where identifier is any valid identifier and constantExpression is an expression that the
compiler can evaluate without executing your program. (See “Constant expressions”
on page 5-39 for more information.)
If constantExpression returns an ordinal value, you can specify the type of the declared
constant using a value typecast. For example
const MyNumber = Int64(17);
declares a constant called MyNumber, of type Int64, that returns the integer 17.
Otherwise, the type of the declared constant is the type of the constantExpression.
• If constantExpression is a character string, the declared constant is compatible with
any string type. If the character string is of length 1, it is also compatible with any
character type.
• If constantExpression is a real, its type is Extended. If it is an integer, its type is given
by the table below.
Constant expressions
A constant expression is an expression that the compiler can evaluate without
executing the program in which it occurs. Constant expressions include numerals;
character strings; true constants; values of enumerated types; the special constants
True, False, and nil; and expressions built exclusively from these elements with
operators, typecasts, and set constructors. Constant expressions cannot include
variables, pointers, or function calls, except calls to the following predefined
functions:
Resource strings
Resource strings are stored as resources and linked into the executable or library so
that they can be modified without recompiling the program. For more information,
see the online Help topics on localizing applications.
Resource strings are declared like other true constants, except that the word const is
replaced by resourcestring. The expression to the right of the = symbol must be a
constant expression and must return a string value. For example,
resourcestring
CreateError = 'Cannot create file %s'; { for explanations of format specifiers, }
OpenError = 'Cannot open file %s'; { see 'Format strings' in the online Help }
LineTooLong = 'Line too long';
ProductName = 'Borland Delphi\000\000';
SomeResourceString = SomeTrueConstant;
The compiler automatically resolves naming conflicts among resource strings in
different libraries.
Typed constants
Typed constants, unlike true constants, can hold values of array, record, procedural,
and pointer types. Typed constants cannot occur in constant expressions.
In the default {$J+} compiler state, typed constants can have new values assigned to
them; they behave essentially like initialized variables. But if the {$J–} compiler
directive is in effect, typed constants cannot change value at runtime; they are, in
effect, read-only variables.
Declare a typed constant like this:
const identifier: type = value
where identifier is any valid identifier, type is any type except files and variants, and
value is an expression of type type. For example,
const Max: Integer = 100;
In most cases, value must be a constant expression; but if type is an array, record,
procedural, or pointer type, special rules apply.
Array constants
To declare an array constant, enclose the values of the array’s elements, separated by
commas, in parentheses at the end of the declaration. These values must be
represented by constant expressions. For example,
const Digits: array[0..9] of Char = ('0', '1', '2', '3', '4', '5', '6', '7', '8', '9');
declares a typed constant called Digits that holds an array of characters.
Zero-based character arrays often represent null-terminated strings, and for this
reason string constants can be used to initialize character arrays. So the declaration
above can be more conveniently represented as
const Digits: array[0..9] of Char = '0123456789';
To define a multidimensional array constant, enclose the values of each dimension in
a separate set of parentheses, separated by commas. For example,
type TCube = array[0..1, 0..1, 0..1] of Integer;
const Maze: TCube = (((0, 1), (2, 3)), ((4, 5), (6,7)));
creates an array called Maze where
Maze[0,0,0] = 0
Maze[0,0,1] = 1
Maze[0,1,0] = 2
Maze[0,1,1] = 3
Maze[1,0,0] = 4
Maze[1,0,1] = 5
Maze[1,1,0] = 6
Maze[1,1,1] = 7
Array constants cannot contain file-type values at any level.
Record constants
To declare a record constant, specify the value of each field—as fieldName: value,
with the field assignments separated by semicolons—in parentheses at the end of the
declaration. The values must be represented by constant expressions. The fields must
be listed in the order in which they appear in the record type declaration, and the tag
field, if there is one, must have a value specified; if the record has a variant part, only
the variant selected by the tag field can be assigned values.
Examples:
type
TPoint = record
X, Y: Single;
end;
TVector = array[0..1] of TPoint;
TMonth = (Jan, Feb, Mar, Apr, May, Jun, Jul, Aug, Sep, Oct, Nov, Dec);
TDate = record
D: 1..31;
M: TMonth;
Y: 1900..1999;
end;
const
Origin: TPoint = (X: 0.0; Y: 0.0);
Line: TVector = ((X: -3.1; Y: 1.5), (X: 5.8; Y: 3.0));
SomeDay: TDate = (D: 2; M: Dec; Y: 1960);
Record constants cannot contain file-type values at any level.
Procedural constants
To declare a procedural constant, specify the name of a function or procedure that is
compatible with the declared type of the constant. For example,
function Calc(X, Y: Integer): Integer;
begin
ƒ
end;
type TFunction = function(X, Y: Integer): Integer;
const MyFunction: TFunction = Calc;
Given these declarations, you can use the procedural constant MyFunction in a
function call:
I := MyFunction(5, 7)
You can also assign the value nil to a procedural constant.
Pointer constants
When you declare a pointer constant, you must initialize it to a value that can be
resolved—at least as a relative address—at compile time. There are three ways to do
this: with the @ operator, with nil, and (if the constant is of type PChar) with a string
literal. For example, if I is a global variable of type Integer, you can declare a constant like
const PI: ^Integer = @I;
The compiler can resolve this because global variables are part of the code segment.
So are functions and global constants:
const PF: Pointer = @MyFunction;
Because string literals are allocated as global constants, you can initialize a PChar
constant with a string literal:
const WarningStr: PChar = 'Warning!';
Addresses of local (stack-allocated) and dynamic (heap-allocated) variables cannot
be assigned to pointer constants.
Procedure declarations
A procedure declaration has the form
procedure procedureName(parameterList); directives;
localDeclarations;
begin
statements
end;
where procedureName is any valid identifier, statements is a sequence of statements
that execute when the procedure is called, and (parameterList), directives;, and
localDeclarations; are optional.
• For information about the parameterList, see “Parameters” on page 6-9.
• For information about directives, see “Calling conventions” on page 6-4, “Forward
and interface declarations” on page 6-5, “External declarations” on page 6-6, and
“Overloading procedures and functions” on page 6-7. If you include more than
one directive, separate them with semicolons.
• For information about localDeclarations, which declares local identifiers, see “Local
declarations” on page 6-8.
Here is an example of a procedure declaration:
procedure NumString(N: Integer; var S: string);
var
V: Integer;
begin
V := Abs(N);
S := '';
repeat
S := Chr(V mod 10 + Ord('0')) + S;
V := V div 10;
until V = 0;
if N < 0 then S := '-' + S;
end;
Given this declaration, you can call the NumString procedure like this:
NumString(17, MyString);
This procedure call assigns the value “17” to MyString (which must be a string
variable).
Within a procedure’s statement block, you can use variables and other identifiers
declared in the localDeclarations part of the procedure. You can also use the parameter
names from the parameter list (like N and S in the example above); the parameter list
defines a set of local variables, so don’t try to redeclare the parameter names in the
localDeclarations section. Finally, you can use any identifiers within whose scope the
procedure declaration falls.
Function declarations
A function declaration is like a procedure declaration except that it specifies a return
type and a return value. Function declarations have the form
function functionName(parameterList): returnType; directives;
localDeclarations;
begin
statements
end;
where functionName is any valid identifier, returnType is any type, statements is a
sequence of statements that execute when the function is called, and (parameterList),
directives;, and localDeclarations; are optional.
• For information about the parameterList, see “Parameters” on page 6-9.
• For information about directives, see “Calling conventions” on page 6-4, “Forward
and interface declarations” on page 6-5, “External declarations” on page 6-6, and
“Overloading procedures and functions” on page 6-7. If you include more than
one directive, separate them with semicolons.
• For information about localDeclarations, which declares local identifiers, see “Local
declarations” on page 6-8.
The function’s statement block is governed by the same rules that apply to
procedures. Within the statement block, you can use variables and other identifiers
declared in the localDeclarations part of the function, parameter names from the
parameter list, and any identifiers within whose scope the function declaration falls.
In addition, the function name itself acts as a special variable that holds the function’s
return value, as does the predefined variable Result.
For example,
function WF: Integer;
begin
WF := 17;
end;
defines a constant function called WF that takes no parameters and always returns
the integer value 17. This declaration is equivalent to
function WF: Integer;
begin
Result := 17;
end;
Here is a more complicated function declaration:
function Max(A: array of Real; N: Integer): Real;
var
X: Real;
I: Integer;
begin
X := A[0];
for I := 1 to N - 1 do
if X < A[I] then X := A[I];
Max := X;
end;
You can assign a value to Result or to the function name repeatedly within a
statement block, as long as you assign only values that match the declared return
type. When execution of the function terminates, whatever value was last assigned to
Result or to the function name becomes the function’s return value. For example,
function Power(X: Real; Y: Integer): Real;
var
I: Integer;
begin
Result := 1.0;
I := Y;
while I > 0 do
begin
if Odd(I) then Result := Result * X;
I := I div 2;
X := Sqr(X);
end;
end;
Result and the function name always represent the same value. Hence
function MyFunction: Integer;
begin
MyFunction := 5;
Result := Result * 2;
MyFunction := Result + 1;
end;
returns the value 11. But Result is not completely interchangeable with the function
name. When the function name appears on the left side of an assignment statement,
the compiler assumes that it is being used (like Result) to track the return value; when
the function name appears anywhere else in the statement block, the compiler
interprets it as a recursive call to the function itself. Result, on the other hand, can be
used as a variable in operations, typecasts, set constructors, indexes, and calls to
other routines.
Result is implicitly declared in every function, so do not try to redeclare it.
If execution terminates without an assignment being made to Result or the function
name, then the function’s return value is undefined.
Calling conventions
When you declare a procedure or function, you can specify a calling convention using
one of the directives register, pascal, cdecl, stdcall, and safecall. For example,
function MyFunction(X, Y: Real): Real; cdecl;
ƒ
Calling conventions determine the order in which parameters are passed to the
routine. They also affect the removal of parameters from the stack, the use of registers
for passing parameters, and error and exception handling. The default calling
convention is register.
• The register and pascal conventions pass parameters from left to right; that is, the
leftmost parameter is evaluated and passed first and the rightmost parameter is
evaluated and passed last. The cdecl, stdcall, and safecall conventions pass
parameters from right to left.
• For all conventions except cdecl, the procedure or function removes parameters
from the stack upon returning. With the cdecl convention, the caller removes
parameters from the stack when the call returns.
• The register convention uses up to three CPU registers to pass parameters, while
the other conventions pass all parameters on the stack.
• The safecall convention implements COM error and exception handling.
The table below summarizes calling conventions.
The default register convention is the most efficient, since it usually avoids creation
of a stack frame. (Access methods for published properties must use register.) The
cdecl convention is useful when you call functions from DLLs written in C or C++,
while stdcall and safecall are used for Windows API calls. The safecall convention
must be used for declaring dual-interface methods (see Chapter 10, “Object
interfaces”). The pascal convention is maintained for backward compatibility. For
more information on calling conventions, see Chapter 12, “Program control.”
The directives near, far, and export refer to calling conventions in 16-bit Windows
programming. They have no effect in 32-bit applications and are maintained for
backward compatibility only.
Ordinarily, a defining declaration does not have to repeat the routine’s parameter list
or return type, but if it does repeat them, they must match those in the forward
declaration exactly (except that default parameters can be omitted). If the forward
declaration specifies an overloaded procedure or function (see “Overloading
procedures and functions” on page 6-7), then the defining declaration must repeat
the parameter list.
Between a forward declaration and its defining declaration, you can place nothing
except other declarations. The defining declaration can be an external or assembler
declaration, but it cannot be another forward declaration.
The purpose of a forward declaration is to extend the scope of a procedure or
function identifier to an earlier point in the source code. This allows other procedures
and functions to call the forward-declared routine before it is actually defined.
Besides letting you organize your code more flexibly, forward declarations are
sometimes necessary for mutual recursions.
The forward directive is not allowed in the interface section of a unit. Procedure and
function headers in the interface section, however, behave like forward declarations
and must have defining declarations in the implementation section. A routine
declared in the interface section is available from anywhere else in the unit and from
any other unit or program that uses the unit where it is declared.
External declarations
The external directive, which replaces the block in a procedure or function
declaration, allows you to call procedures and functions that are compiled separately
from your program.
invoke by looking at the actual parameters passed in the call. For example,
Divide(6.0, 3.0) calls the first Divide function, because its arguments are real-valued.
You can pass to an overloaded routine parameters that are not identical in type with
those in any of the routine’s declarations, but that are assignment-compatible with the
parameters in more than one declaration. This happens most frequently when a routine
is overloaded with different integer types or different real types—for example,
procedure Store(X: Longint); overload;
procedure Store(X: Shortint); overload;
In these cases, when it is possible to do so without ambiguity, the compiler invokes
the routine whose parameters are of the type with the smallest range that
accommodates the actual parameters in the call. (Remember that real-valued
constant expressions are always of type Extended.)
Overloaded routines must be distinguished by the number of parameters they take
or the types of their parameters. Hence the following pair of declarations causes a
compilation error.
function Cap(S: string): string; overload;
ƒ
procedure Cap(var Str: string); overload;
ƒ
But the declarations
function Func(X: Real; Y: Integer): Real; overload;
ƒ
function Func(X: Integer; Y: Real): Real; overload;
ƒ
are legal.
When an overloaded routine is declared in a forward or interface declaration, the
defining declaration must repeat the routine’s parameter list.
If you use default parameters in overloaded routines, be careful of ambiguous
parameter signatures. For more information, see “Default parameters and
overloaded routines” on page 6-17.
You can limit the potential effects of overloading by qualifying a routine’s name when
you call it. For example, Unit1.MyProcedure(X, Y) can call only routines declared in Unit1;
if no routine in Unit1 matches the name and parameter list in the call, an error results.
For information about distributing overloaded methods in a class hierarchy, see
“Overloading methods” on page 7-12. For information about exporting overloaded
routines from a DLL, see “The exports clause” on page 9-4.
Local declarations
The body of a function or procedure often begins with declarations of local variables
used in the routine’s statement block. These declarations can also include constants,
types, and other routines. The scope of a local identifier is limited to the routine
where it is declared.
Nested routines
Functions and procedures sometimes contain other functions and procedures within
the local-declarations section of their blocks. For example, the following declaration
of a procedure called DoSomething contains a nested procedure.
procedure DoSomething(S: string);
var
X, Y: Integer;
procedure NestedProc(S: string);
begin
ƒ
end;
begin
ƒ
NestedProc(S);
ƒ
end;
The scope of a nested routine is limited to the procedure or function in which it is
declared. In our example, NestedProc can be called only within DoSomething.
For real examples of nested routines, look at the DateTimeToString procedure, the
ScanDate function, and other routines in the SysUtils unit.
Parameters
Most procedure and function headers include a parameter list. For example, in the
header
function Power(X: Real; Y: Integer): Real;
the parameter list is (X: Real; Y: Integer).
A parameter list is a sequence of parameter declarations separated by semicolons and
enclosed in parentheses. Each declaration is a comma-delimited series of parameter
names, followed in most cases by a colon and a type identifier, and in some cases by
the = symbol and a default value. Parameter names must be valid identifiers. Any
declaration can be preceded by one of the reserved words var, const, and out.
Examples:
(X, Y: Real)
(var S: string; X: Integer)
(HWnd: Integer; Text, Caption: PChar; Flags: Integer)
(const P; I: Integer)
The parameter list specifies the number, order, and type of parameters that must be
passed to the routine when it is called. If a routine does not take any parameters, omit
the identifier list and the parentheses in its declaration:
procedure UpdateRecords;
begin
ƒ
end;
Within the procedure or function body, the parameter names (X and Y in the first
example above) can be used as local variables. Do not redeclare the parameter names
in the local declarations section of the procedure or function body.
Parameter semantics
Parameters are categorized in several ways:
• Every parameter is classified as value, variable, constant, or out. Value parameters
are the default; the reserved words var, const, and out indicate variable, constant,
and out parameters, respectively.
• Value parameters are always typed, while constant, variable, and out parameters
can be either typed or untyped.
• Special rules apply to array parameters. See “Array parameters” on page 6-13.
Files and instances of structured types that contain files can be passed only as
variable (var) parameters.
procedure or function creates a copy of it; changes made to the copy have no effect on
the original variable and are lost when program execution returns to the caller.
A variable parameter, on the other hand, acts like a pointer rather than a copy.
Changes made to the parameter within the body of a function or procedure persist
after program execution returns to the caller and the parameter name itself has gone
out of scope.
Even if the same variable is passed in two or more var parameters, no copies are
made. This is illustrated in the following example.
procedure AddOne(var X, Y: Integer);
begin
X := X + 1;
Y := Y + 1;
end;
var I: Integer;
begin
I := 1;
AddOne(I, I);
end;
After this code executes, the value of I is 3.
If a routine’s declaration specifies a var parameter, you must pass an assignable
expression—that is, a variable, typed constant (in the {$J+} state), dereferenced
pointer, field, or indexed variable—to the routine when you call it. To use our
previous examples, DoubleByRef(7) produces an error, although DoubleByValue(7) is
legal.
Indexes and pointer dereferences passed in var parameters—for example,
DoubleByRef(MyArray[I])—are evaluated once, before execution of the routine.
Constant parameters
A constant (const) parameter is like a local constant or read-only variable. Constant
parameters are similar to value parameters, except that you can’t assign a value to a
constant parameter within the body of a procedure or function, nor can you pass one
as a var parameter to another routine. (But when you pass an object reference as a
constant parameter, you can still modify the object’s properties.)
Using const allows the compiler to optimize code for structured- and string-type
parameters. It also provides a safeguard against unintentionally passing a parameter
by reference to another routine.
Here, for example, is the header for the CompareStr function in the SysUtils unit:
function CompareStr(const S1, S2: string): Integer;
Because S1 and S2 are not modified in the body of CompareStr, they can be declared
as constant parameters.
Out parameters
An out parameter, like a variable parameter, is passed by reference. With an out
parameter, however, the initial value of the referenced variable is discarded by the
routine it is passed to. The out parameter is for output only; that is, it tells the
function or procedure where to store output, but doesn’t provide any input.
For example, consider the procedure heading
procedure GetInfo(out Info: SomeRecordType);
When you call GetInfo, you must pass it a variable of type SomeRecordType:
var MyRecord: SomeRecordType;
ƒ
GetInfo(MyRecord);
But you’re not using MyRecord to pass any data to the GetInfo procedure; MyRecord is
just a container where you want GetInfo to store the information it generates. The call
to GetInfo immediately frees the memory used by MyRecord, before program control
passes to the procedure.
Out parameters are frequently used with distributed-object models like COM and
CORBA. In addition, you should use out parameters when you pass an uninitialized
variable to a function or procedure.
Untyped parameters
You can omit type specifications when declaring var, const, and out parameters.
(Value parameters must be typed.) For example,
procedure TakeAnything(const C);
declares a procedure called TakeAnything that accepts a parameter of any type. When
you call such a routine, you cannot pass it a numeral or untyped numeric constant.
Within a procedure or function body, untyped parameters are incompatible with
every type. To operate on an untyped parameter, you must cast it. In general, the
compiler cannot verify that operations on untyped parameters are valid.
The following example uses untyped parameters in a function called Equal that
compares a specified number of bytes of any two variables.
function Equal(var Source, Dest; Size: Integer): Boolean;
type
TBytes = array[0..MaxInt - 1] of Byte;
var
N: Integer;
begin
N := 0;
while (N < Size) and (TBytes(Dest)[N] = TBytes(Source)[N]) do
Inc(N);
Equal := N = Size;
end;
Given the declarations
type
TVector = array[1..10] of Integer;
TPoint = record
X, Y: Integer;
end;
var
Vec1, Vec2: TVector;
N: Integer;
P: TPoint;
you could make the following calls to Equal:
Equal(Vec1, Vec2, SizeOf(TVector)) // compare Vec1 to Vec2
Equal(Vec1, Vec2, SizeOf(Integer) * N) // compare first N elements of Vec1 and Vec2
Equal(Vec1[1], Vec1[6], SizeOf(Integer) * 5) // compare first 5 to last 5 elements of Vec1
Equal(Vec1[1], P, 4) // compare Vec1[1] to P.X and Vec1[2] to P.Y
String parameters
When you declare routines that take short-string parameters, you cannot include
length specifiers in the parameter declarations. That is, the declaration
procedure Check(S: string[20]); // syntax error
causes a compilation error. But
type TString20 = string[20];
procedure Check(S: TString20);
is valid. The special identifier OpenString can be used to declare routines that take
short-string parameters of varying length:
procedure Check(S: OpenString);
When the {$H–} and {$P+} compiler directives are both in effect, the reserved word
string is equivalent to OpenString in parameter declarations.
Short strings, OpenString, $H, and $P are supported for backward compatibility only.
In new code, you can avoid these considerations by using long strings.
Array parameters
When you declare routines that take array parameters, you cannot include index type
specifiers in the parameter declarations. That is, the declaration
procedure Sort(A: array[1..10] of Integer); // syntax error
causes a compilation error. But
type TDigits = array[1..10] of Integer;
procedure Sort(A: TDigits);
is valid. For most purposes, however, open array parameters are a better solution.
For example,
function Find(A: array of Char): Integer;
declares a function called Find that takes a character array of any size and returns an
integer.
Note The syntax of open array parameters resembles that of dynamic array types, but they
do not mean the same thing. The example above creates a function that takes any
array of Char elements, including (but not limited to) dynamic arrays. To declare
parameters that must be dynamic arrays, you need to specify a type identifier:
type TDynamicCharArray = array of Char;
function Find(A: TDynamicCharArray): Integer;
For information about dynamic arrays, see “Dynamic arrays” on page 5-17.
Within the body of a routine, open array parameters are governed by the following rules.
• They are always zero-based. The first element is 0, the second element is 1, and so
forth. The standard Low and High functions return 0 and Length–1, respectively.
The SizeOf function returns the size of the actual array passed to the routine.
• They can be accessed by element only. Assignments to an entire open array
parameter are not allowed.
• They can be passed to other procedures and functions only as open array
parameters or untyped var parameters. They cannot be passed to SetLength.
• Instead of an array, you can pass a variable of the open array parameter’s base
type. It will be treated as an array of length 1.
When you pass an array as an open array value parameter, the compiler creates a
local copy of the array within the routine’s stack frame. Be careful not to overflow the
stack by passing large arrays.
The following examples use open array parameters to define a Clear procedure that
assigns zero to each element in an array of reals and a Sum function that computes
the sum of the elements in an array of reals.
procedure Clear(var A: array of Real);
var
I: Integer;
begin
for I := 0 to High(A) do A[I] := 0;
end;
function Sum(const A: array of Real): Real;
var
I: Integer;
S: Real;
begin
S := 0;
for I := 0 to High(A) do S := S + A[I];
Sum := S;
end;
When you call routines that use open array parameters, you can pass open array
constructors to them. See “Open array constructors” on page 6-18.
Default parameters
You can specify default parameter values in a procedure or function heading. Default
values are allowed only for typed const and value parameters. To provide a default
value, end the parameter declaration with the = symbol followed by a constant
expression that is assignment-compatible with the parameter’s type.
For example, given the declaration
procedure FillArray(A: array of Integer; Value: Integer = 0);
the following procedure calls are equivalent.
FillArray(MyArray);
FillArray(MyArray, 0);
A multiple-parameter declaration cannot specify a default value. Thus, while
function MyFunction(X: Real = 3.5; Y: Real = 3.5): Real;
is legal,
function MyFunction(X, Y: Real = 3.5): Real; // syntax error
is not.
Parameters with default values must occur at the end of the parameter list. That is, all
parameters following the first declared default value must also have default values.
So the following declaration is illegal.
procedure MyProcedure(I: Integer = 1; S: string); // syntax error
Default values specified in a procedural type override those specified in an actual
routine. Thus, given the declarations
type TResizer = function(X: Real; Y: Real = 1.0): Real;
function Resizer(X: Real; Y: Real = 2.0): Real;
var
F: TResizer;
N: Real;
the statements
F := Resizer;
F(N);
result in the values (N, 1.0) being passed to Resizer.
Default parameters are limited to values that can be specified by a constant
expression. (See “Constant expressions” on page 5-39.) Hence parameters of a
dynamic-array, procedural, class, class-reference, or interface type can have no value
other than nil as their default. Parameters of a record, variant, file, static-array, or
object type cannot have default values at all.
For information about calling routines with default parameter values, see “Calling
procedures and functions” on page 6-17.
Class types
A class type must be declared and given a name before it can be instantiated. (You
cannot define a class type within a variable declaration.) Declare classes only in the
outermost scope of a program or unit, not in a procedure or function declaration.
declare new members and can redefine inherited ones, but a class cannot remove
members defined in an ancestor. Hence TSomeControl contains all of the members
defined in TWinControl and in each of TWinControl‘s ancestors.
The scope of a member’s identifier starts at the point where the member is declared,
continues to the end of the class declaration, and extends over all descendants of the
class and the blocks of all methods defined in the class and its descendants.
Object types
As an alternative to class types, you can declare object types using the syntax
type objectTypeName = object (ancestorObjectType)
memberList
end;
where objectTypeName is any valid identifier, (ancestorObjectType) is optional, and
memberList declares fields, methods, and properties. If (ancestorObjectType) is
omitted, then the new type has no ancestor. Object types cannot have published
members.
Since object types do not descend from TObject, they provide no built-in constructors,
destructors, or other methods. You can create instances of an object type using the
New procedure and destroy them with the Dispose procedure, or you can simply
declare variables of an object type, just as you would with records.
Object types are supported for backward compatibility only. Their use is not
recommended.
Published members
Published members have the same visibility as public members. The difference is that
runtime type information (RTTI) is generated for published members. RTTI allows an
application to query the fields and properties of an object dynamically and to locate
its methods. Delphi uses RTTI to access the values of properties when saving and
loading form (.DFM) files, to display properties in the Object Inspector, and to
associate specific methods (called event handlers) with specific properties (called
events).
Published properties are restricted to certain data types. Ordinal, string, class,
interface, and method-pointer types can be published. So can set types, provided the
upper and lower bounds of the base type have ordinal values between 0 and 31. (In
other words, the set must fit in a byte, word, or double word.) Any real type except
Real48 can be published. Array properties cannot be published.
All methods are publishable, but a class cannot publish two or more overloaded
methods with the same name. Fields can be published only if they are of a class or
interface type.
A class cannot have published members unless it is compiled in the {$M+} state or
descends from a class compiled in the {$M+} state. Most classes with published
members derive from TPersistent, which is compiled in the {$M+} state, so it is
seldom necessary to use the $M directive.
Automated members
Automated members have the same visibility as public members. The difference is
that Automation type information (required for Automation servers) is generated for
automated members. Automated members typically appear only in classes derived
from the TAutoObject class in the OleAuto unit. This unit, and the automated reserved
word itself, are maintained for backward compatibility. The TAutoObject class in the
ComObj unit does not use automated.
Do not confuse forward declarations with complete declarations of types that derive
from TObject without declaring any class members.
type
TFirstClass = class; // this is a forward declaration
TSecondClass = class // this is a complete class declaration
end; //
TThirdClass = class(TObject); // this is a complete class declaration
Fields
A field is like a variable that belongs to an object. Fields can be of any type, including
class types. (That is, fields can hold object references.) Fields are usually private.
To define a field member of a class, simply declare the field as you would a variable.
All field declarations must occur before any property or method declarations. For
example, the following declaration creates a class called TNumber whose only
member, other than the methods is inherits from TObject, is an integer field called Int.
type TNumber = class
Int: Integer;
end;
Fields are statically bound; that is, references to them are fixed at compile time. To
see what this means, consider the following code.
type
TAncestor = class
Value: Integer;
end;
TDescendant = class(TAncestor)
Value: string; // hides the inherited Value field
end;
var
MyObject: TAncestor;
begin
MyObject := TDescendant.Create;
MyObject.Value := 'Hello!'; // error
TDescendant(MyObject).Value := 'Hello!'; // works!
end;
Although MyObject holds an instance of TDescendant, it is declared as TAncestor. The
compiler therefore interprets MyObject.Value as referring to the (integer) field
declared in TAncestor. Both fields, however, exist in the TDescendant object; the
inherited Value is hidden by the new one, and can be accessed through a typecast.
Methods
A method is a procedure or function associated with a class. A call to a method
specifies the object (or, if it is a class method, the class) that the method should
operate on. For example,
SomeObject.Free
calls the Free method in SomeObject.
Method implementations
Within a class declaration, methods appear as procedure and function headings,
which work like forward declarations. Somewhere after the class declaration, but
within the same module, each method must be implemented by a defining
declaration. For example, suppose the declaration of TMyClass includes a method
called DoSomething:
type
TMyClass = class(TObject)
ƒ
procedure DoSomething;
ƒ
end;
A defining declaration for DoSomething must occur later in the module:
procedure TMyClass.DoSomething;
begin
ƒ
end;
While a class can be declared in either the interface or the implementation section of a
unit, defining declarations for a class’s methods must be in the implementation section.
In the heading of a defining declaration, the method name is always qualified with
the name of the class to which it belongs. The heading can repeat the parameter list
from the class declaration; if it does so, the order, type, and names of the parameters
must match exactly, and, if the method is a function, so must the return value.
Inherited
The reserved word inherited plays a special role in implementing polymorphic
behavior. It can occur in method definitions, with or without an identifier after it.
If inherited is followed by a method identifier, it represents a normal method call,
except that the search for the method begins with the immediate ancestor of the
enclosing method’s class. For example, when
inherited Create(...);
occurs in the definition of a method, it calls the inherited Create.
When inherited has no identifier after it, it refers to the inherited method with the
same name as the enclosing method. In this case, inherited can appear with or
Self
Within the implementation of a method, the identifier Self references the object in
which the method is called. For example, here is the implementation of TCollection’s
Add method in the Classes unit of the VCL.
function TCollection.Add: TCollectionItem;
begin
Result := FItemClass.Create(Self);
end;
The Add method calls the Create method in the class referenced by the FItemClass
field, which is always a TCollectionItem descendant. TCollectionItem.Create takes a
single parameter of type TCollection, so Add passes it the TCollection instance object
where Add is called. This is illustrated in the following code.
var MyCollection: TCollection;
ƒ
MyCollection.Add // MyCollection is passed to the TCollectionItem.Create method
Self is useful for a variety of reasons. For example, a member identifier declared in a
class type might be redeclared in the block of one of the class’s methods. In this case,
you can access the original member identifier as Self.Identifier.
For information about Self in class methods, see “Class methods” on page 7-24.
Method binding
Methods can be static (the default), virtual, or dynamic. Virtual and dynamic methods
can be overridden, and they can be abstract. These designations come into play when a
variable of one class type holds a value of a descendant class type. They determine
which implementation is activated when a method is called.
Static methods
Methods are by default static. When a static method is called, the declared (compile-time)
type of the class or object variable used in the method call determines which
implementation to activate. In the following example, the Draw methods are static.
type
TFigure = class
procedure Draw;
end;
TRectangle = class(TFigure)
procedure Draw;
end;
Given these declarations, the following code illustrates the effect of calling a static
method. In the second call to Figure.Draw, the Figure variable references an object of
class TRectangle, but the call invokes the implementation of Draw in TFigure, because
the declared type of the Figure variable is TFigure.
var
Figure: TFigure;
Rectangle: TRectangle;
begin
Figure := TFigure.Create;
Figure.Draw; // calls TFigure.Draw
Figure.Destroy;
Figure := TRectangle.Create;
Figure.Draw; // calls TFigure.Draw
TRectangle(Figure).Draw; // calls TRectangle.Draw
Figure.Destroy;
Rectangle := TRectangle.Create;
Rectangle.Draw; // calls TRectangle.Draw
Rectangle.Destroy;
end;
Figure := TEllipse.Create;
Figure.Draw; // calls TEllipse.Draw
Figure.Destroy;
end;
Only virtual and dynamic methods can be overridden. All methods, however, can be
overloaded; see “Overloading methods” on page 7-12.
Reintroduce
The reintroduce directive suppresses compiler warnings about hiding previously
declared virtual methods. For example,
procedure DoSomething; reintroduce; // the ancestor class also has a DoSomething method
Use reintroduce when you want to hide an inherited virtual method with a new one.
Abstract methods
An abstract method is a virtual or dynamic method that has no implementation in the
class where it is declared. Its implementation is deferred to a descendant class.
Abstract methods must be declared with the directive abstract after virtual or
dynamic. For example,
procedure DoSomething; virtual; abstract;
You can call an abstract method only in a class or instance of a class in which the
method has been overridden.
Overloading methods
A method can be redeclared using the overload directive. In this case, if the
redeclared method has a different parameter signature from its ancestor, it overloads
the inherited method without hiding it. Calling the method in a descendant class
activates whichever implementation matches the parameters in the call.
If you overload a virtual method, use the reintroduce directive when you redeclare it
in descendant classes. For example,
type
T1 = class(TObject)
procedure Test(I: Integer); overload; virtual;
end;
T2 = class(T1)
procedure Test(S: string); reintroduce; overload;
end;
ƒ
SomeObject := T2.Create;
SomeObject.Test('Hello!'); // calls T2.Test
SomeObject.Test(7); // calls T1.Test
Within a class, you cannot publish multiple overloaded methods with the same
name. Maintenance of runtime type information requires a unique name for each
published member.
type
TSomeClass = class
published
function Func(P: Integer): Integer;
function Func(P: Boolean): Integer // error
ƒ
Methods that serve as property read or write specifiers cannot be overloaded.
The implementation of an overloaded method must repeat the parameter list from
the class declaration. For more information about overloading, see “Overloading
procedures and functions” on page 6-7.
Constructors
A constructor is a special method that creates and initializes instance objects. The
declaration of a constructor looks like a procedure declaration, but it begins with the
word constructor. Examples:
constructor Create;
constructor Create(AOwner: TComponent);
Constructors must use the default register calling convention. Although the
declaration specifies no return value, when a constructor is called using a class
reference, it returns a reference to the object it creates.
A class can have more than one constructor, but most have only one. It is
conventional to call the constructor Create.
To create an object, call the constructor method in a class type. For example,
MyObject := TMyClass.Create;
This allocates storage for the new object on the heap, sets the values of all ordinal
fields to zero, assigns nil to all pointer and class-type fields, and makes all string
fields empty. Other actions specified in the constructor implementation are
performed next; typically, objects are initialized based on values passed as
parameters to the constructor. Finally, the constructor returns a reference to the
newly allocated and initialized object. The type of the returned value is the same as
the class type specified in the constructor call.
If an exception is raised during execution of a constructor that was invoked on a class
reference, the Destroy destructor is automatically called to destroy the unfinished object.
When a constructor is called using an object reference (rather than a class reference),
it does not create an object or return a value. Instead, the constructor operates on the
specified object, executing only the statements in the constructor’s implementation. A
constructor is typically invoked on an object reference in conjunction with the
reserved word inherited to execute an inherited constructor.
Here is an example of a class type and its constructor.
type
TShape = class(TGraphicControl)
private
FPen: TPen;
FBrush: TBrush;
procedure PenChanged(Sender: TObject);
procedure BrushChanged(Sender: TObject);
public
constructor Create(Owner: TComponent); override;
destructor Destroy; override;
ƒ
end;
constructor TShape.Create(Owner: TComponent);
begin
inherited Create(Owner); // Initialize inherited parts
Width := 65; // Change inherited properties
Height := 65;
FPen := TPen.Create; // Initialize new fields
FPen.OnChange := PenChanged;
FBrush := TBrush.Create;
FBrush.OnChange := BrushChanged;
end;
The first action of a constructor is usually to call an inherited constructor to initialize
the object’s inherited fields. The constructor then initializes the fields introduced in the
descendant class. Because a constructor always clears the storage it allocates for a new
object, all fields start with a value of zero (ordinal types), nil (pointer and class types),
empty (string types), or Unassigned (variants). Hence there is no need to initialize fields
in a constructor’s implementation except to nonzero or nonempty values.
When invoked through a class-type identifier, a constructor declared as virtual is
equivalent to a static constructor. When combined with class-reference types,
however, virtual constructors allow polymorphic construction of objects—that is,
construction of objects whose types aren’t known at compile time. (See “Class
references” on page 7-22.)
Destructors
A destructor is a special method that destroys the object where it is called and
deallocates its memory. The declaration of a destructor looks like a procedure
declaration, but it begins with the word destructor. Examples:
destructor Destroy;
destructor Destroy; override;
Destructors must use the default register calling convention. Although a class can
have more than one destructor, it is recommended that each class override the
inherited Destroy method and declare no other destructors.
To call a destructor, you must reference an instance object. For example,
MyObject.Destroy;
When a destructor is called, actions specified in the destructor implementation are
performed first. Typically, these consist of destroying any embedded objects and
freeing resources that were allocated by the object. Then the storage that was
allocated for the object is disposed of.
Here is an example of a destructor implementation.
destructor TShape.Destroy;
begin
FBrush.Free;
FPen.Free;
inherited Destroy;
end;
The last action in a destructor’s implementation is typically to call the inherited
destructor to destroy the object’s inherited fields.
When an exception is raised during creation of an object, Destroy is automatically
called to dispose of the unfinished object. This means that Destroy must be prepared
to dispose of partially constructed objects. Because a constructor sets the fields of a
new object to zero or empty values before performing other actions, class-type and
pointer-type fields in a partially constructed object are always nil. A destructor
should therefore check for nil values before operating on class-type or pointer-type
fields. Calling the Free method (defined in TObject), rather than Destroy, offers a
convenient way of checking for nil values before destroying an object.
Message handlers
Message handlers are methods that implement responses to dynamically dispatched
messages. Delphi’s VCL uses message handlers to respond to Windows messages.
A message handler is created by including the message directive in a method
declaration, followed by an integer constant between 1 and 49151 which specifies the
message ID. For message handlers in VCL controls, the integer constant must be one
of the Windows message IDs defined, along with corresponding record types, in the
Messages unit. For example,
type
TTextBox = class(TCustomControl)
private
procedure WMChar(var Message: TWMChar); message WM_CHAR;
ƒ
end;
A message handler must be a procedure that takes a single var parameter.
A message handler does not have to include the override directive to override an
inherited message handler. In fact, it doesn’t have to specify the same method name
or parameter type as the method it overrides. The message ID alone determines
which message the method responds to and whether it is an override.
Message dispatching
Message handlers are seldom called directly. Instead, messages are dispatched to an
object using the Dispatch method inherited from TObject:
procedure Dispatch(var Message);
The Message parameter passed to Dispatch must be a record whose first entry is a field
of type Cardinal containing a message ID. See the Messages unit for examples.
Dispatch searches backward through the class hierarchy (starting from the class of the
object where it is called) and invokes the first message handler for the ID passed to it.
If no message handler is found for the given ID, Dispatch calls DefaultHandler.
Properties
A property, like a field, defines an attribute of an object. But while a field is merely a
storage location whose contents can be examined and changed, a property associates
specific actions with reading or modifying its data. Properties provide control over
access to an object’s attributes, and they allow attributes to be computed.
The declaration of a property specifies a name and a type, and includes at least one
access specifier. The syntax of a property declaration is
property propertyName[indexes]: type index integerConstant specifiers;
where
• propertyName is any valid identifier.
• [indexes] is optional and is a sequence of parameter declarations separated by
semicolons. Each parameter declaration has the form identifier1, ..., identifiern:
type. For more information, see “Array properties” on page 7-18.
• the index integerConstant clause is optional. For more information, see “Index
specifiers” on page 7-19.
• specifiers is a sequence of read, write, stored, default (or nodefault), and
implements specifiers. Every property declaration must have at least one read or
write specifier. (For information about implements, see “Implementing interfaces
by delegation” on page 10-6.)
Properties are defined by their access specifiers. Unlike fields, properties cannot be
passed as var parameters, nor can the @ operator be applied to a property. The reason
is that a property doesn’t necessarily exist in memory. It could, for instance, have a
read method that retrieves a value from a database or generates a random value.
Property access
Every property has a read specifier, a write specifier, or both. These are called access
specifiers and they have the form
read fieldOrMethod
write fieldOrMethod
where fieldOrMethod is the name of a field or method declared in the same class as the
property or in an ancestor class.
• If fieldOrMethod is declared in the same class, it must occur before the property
declaration. If it is declared in an ancestor class, it must be visible from the
SetHeading method, which, presumably, stores the new value in the FHeading field as
well as performing other actions. For example, SetHeading might be implemented like
this:
procedure TCompass.SetHeading(Value: THeading);
begin
if FHeading <> Value then
begin
FHeading := Value;
Repaint; // update user interface to reflect new value
end;
end;
A property whose declaration includes only a read specifier is a read-only property,
and one whose declaration includes only a write specifier is a write-only property. It
is an error to assign a value to a read-only property or use a write-only property in an
expression.
Array properties
Array properties are indexed properties. They can represent things like items in a list,
child controls of a control, and pixels of a bitmap.
The declaration of an array property includes a parameter list that specifies the
names and types of the indexes. For example,
property Objects[Index: Integer]: TObject read GetObject write SetObject;
property Pixels[X, Y: Integer]: TColor read GetPixel write SetPixel;
property Values[const Name: string]: string read GetValue write SetValue;
The format of an index parameter list is the same as that of a procedure’s or
function’s parameter list, except that the parameter declarations are enclosed in
brackets instead of parentheses. Unlike arrays, which can use only ordinal-type
indexes, array properties allow indexes of any type.
For array properties, access specifiers must list methods rather than fields. The
method in a read specifier must be a function that takes the number and type of
parameters listed in the property’s index parameter list, in the same order, and
whose result type is identical to the property’s type. The method in a write specifier
must be a procedure that takes the number and type of parameters listed in the
property’s index parameter list, in the same order, plus an additional value or const
parameter of the same type as the property.
For example, the access methods for the array properties above might be declared as
function GetObject(Index: Integer): TObject;
function GetPixel(X, Y: Integer): TColor;
function GetValue(const Name: string): string;
procedure SetObject(Index: Integer; Value: TObject);
procedure SetPixel(X, Y: Integer; Value: TColor);
procedure SetValue(const Name, Value: string);
An array property is accessed by indexing the property identifier. For example, the
statements
if Collection.Objects[0] = nil then Exit;
Canvas.Pixels[10, 20] := clRed;
Params.Values['PATH'] := 'C:\DELPHI\BIN';
correspond to
if Collection.GetObject(0) = nil then Exit;
Canvas.SetPixel(10, 20, clRed);
Params.SetValue('PATH', 'C:\DELPHI\BIN');
The definition of an array property can be followed by the default directive, in which
case the array property becomes the default property of the class. For example,
type
TStringArray = class
public
property Strings[Index: Integer]: string ...; default;
ƒ
end;
If a class has a default property, you can access that property with the abbreviation
object[index], which is equivalent to object.property[index]. For example, given the
declaration above, StringArray.Strings[7] can be abbreviated to StringArray[7]. A class
can have only one default property. Changing or hiding the default property in
descendant classes may lead to unexpected behavior, since the compiler always
determines an object’s default property statically.
Index specifiers
Index specifiers allow several properties to share the same access method while
representing different values. An index specifier consists of the directive index
followed by an integer constant between –2147483647 and 2147483647. If a property
has an index specifier, its read and write specifiers must list methods rather than
fields. For example,
type
TRectangle = class
private
FCoordinates: array[0..3] of Longint;
function GetCoordinate(Index: Integer): Longint;
procedure SetCoordinate(Index: Integer; Value: Longint);
public
property Left: Longint index 0 read GetCoordinate write SetCoordinate;
property Top: Longint index 1 read GetCoordinate write SetCoordinate;
property Right: Longint index 2 read GetCoordinate write SetCoordinate;
property Bottom: Longint index 3 read GetCoordinate write SetCoordinate;
property Coordinates[Index: Integer]: Longint read GetCoordinate write SetCoordinate;
ƒ
end;
An access method for a property with an index specifier must take an extra value
parameter of type Integer. For a read function, it must be the last parameter; for a
Storage specifiers
The optional stored, default, and nodefault directives are called storage specifiers.
They have no effect on program behavior, but control the way Delphi maintains
runtime type information (RTTI). Specifically, storage specifiers determine whether
Delphi saves the values of published properties in form (.DFM) files.
The stored directive must be followed by True, False, the name of a Boolean field, or
the name of a parameterless method that returns a Boolean value. For example,
property Name: TComponentName read FName write SetName stored False;
If a property has no stored directive, it is treated as if stored True were specified.
The default directive must be followed by a constant of the same type as the
property. For example,
property Tag: Longint read FTag write FTag default 0;
To override an inherited default value without specifying a new one, use the
nodefault directive. The default and nodefault directives are supported only for
ordinal types and for set types, provided the upper and lower bounds of the set’s
base type have ordinal values between 0 and 31; if such a property is declared
without default or nodefault, it is treated as if nodefault were specified. For reals,
pointers, and strings, there is an implicit default value of 0, nil, and '' (the empty
string), respectively.
When Delphi saves a component’s state, it checks the storage specifiers of the
component’s published properties. If a property’s current value is different from its
default value (or if there is no default value) and the stored specifier is True, then the
property’s value is saved. Otherwise, the property’s value is not saved.
Note Storage specifiers are not supported for array properties. The default directive has a
different meaning when used in an array property declaration. See “Array
properties” on page 7-18.
TDescendant = class(TAncestor)
ƒ
property Value: Integer read Method3 write Method4;
end;
var MyObject: TAncestor;
ƒ
MyObject := TDescendant.Create;
Class references
Sometimes operations are performed on a class itself, rather than on instances of a
class (that is, objects). This happens, for example, when you call a constructor method
using a class reference. You can always refer to a specific class using its name, but at
times it is necessary to declare variables or parameters that take classes as values, and
in these situations you need class-reference types.
Class-reference types
A class-reference type, sometimes called a metaclass, is denoted by a construction of
the form
class of type
where type is any class type. The identifier type itself denotes a value whose type is
class of type. If type1 is an ancestor of type2, then class of type2 is assignment-
compatible with class of type1. Thus
type TClass = class of TObject;
var AnyObj: TClass;
declares a variable called AnyObj that can hold a reference to any class. (The
definition of a class-reference type cannot occur directly in a variable declaration or
parameter list.) You can assign the value nil to a variable of any class-reference type.
To see how class-reference types are used, look at the declaration of the constructor
for TCollection (in the VCL’s Classes unit):
type TCollectionItemClass = class of TCollectionItem;
ƒ
constructor Create(ItemClass: TCollectionItemClass);
This declaration says that to create a TCollection instance object, you must pass to the
constructor the name of a class descending from TCollectionItem.
Class-reference types are useful when you want to invoke a class method or virtual
constructor on a class or object whose actual type is unknown at compile time.
For example,
type TControlClass = class of TControl;
function CreateControl(ControlClass: TControlClass;
const ControlName: string; X, Y, W, H: Integer): TControl;
begin
Result := ControlClass.Create(MainForm);
with Result do
begin
Parent := MainForm;
Name := ControlName;
SetBounds(X, Y, W, H);
Visible := True;
end;
end;
The CreateControl function requires a class-reference parameter to tell it what kind of
control to create. It uses this parameter to call the class’s constructor. Because
class-type identifiers denote class-reference values, a call to CreateControl can specify
the identifier of the class to create an instance of. For example,
CreateControl(TEdit, 'Edit1', 10, 10, 100, 20);
Constructors called using class references are usually virtual. The constructor
implementation activated by the call depends on the runtime type of the class
reference.
Class operators
Every class inherits from TObject methods called ClassType and ClassParent that
return, respectively, a reference to the class of an object and of an object’s immediate
ancestor. Both methods return a value of type TClass (where TClass = class of
TObject), which can be cast to a more specific type. Every class also inherits a method
called InheritsFrom that tests whether the object where it is called descends from a
specified class. These methods are used by the is and as operators, and it is seldom
necessary to call them directly.
The is operator
The is operator, which performs dynamic type checking, is used to verify the actual
runtime class of an object. The expression
object is class
returns True if object is an instance of the class denoted by class or one of its
descendants, and False otherwise. (If object is nil, the result is False.) If the declared
type of object is unrelated to class—that is, if the types are distinct and one is not an
ancestor of the other—a compilation error results. For example,
if ActiveControl is TEdit then TEdit(ActiveControl).SelectAll;
This statement casts a variable to TEdit after first verifying that the object it references
is an instance of TEdit or one of its descendants.
The as operator
The as operator performs checked typecasts. The expression
object as class
returns a reference to the same object as object, but with the type given by class. At
runtime, object must be an instance of the class denoted by class or one of its
descendants, or be nil; otherwise an exception is raised. If the declared type of object
is unrelated to class—that is, if the types are distinct and one is not an ancestor of the
other—a compilation error results. For example,
with Sender as TButton do
begin
Caption := '&Ok';
OnClick := OkClick;
end;
The rules of operator precedence often require as typecasts to be enclosed in
parentheses. For example,
(Sender as TButton).Caption := '&Ok';
Class methods
A class method is a method (other than a constructor) that operates on classes instead
of objects. The definition of a class method must begin with the reserved word class.
For example,
type
TFigure = class
public
class function Supports(Operation: string): Boolean; virtual;
class procedure GetInfo(var Info: TFigureInfo); virtual;
ƒ
end;
The defining declaration of a class method must also begin with class. For example,
class procedure TFigure.GetInfo(var Info: TFigureInfo);
begin
ƒ
end;
In the defining declaration of a class method, the identifier Self represents the class
where the method is called (which could be a descendant of the class in which it is
defined). If the method is called in the class C, then Self is of the type class of C. Thus
you cannot use Self to access fields, properties, and normal (object) methods, but you
can use it to call constructors and other class methods.
A class method can be called through a class reference or an object reference. When it
is called through an object reference, the class of the object becomes the value of Self.
Exceptions
An exception is raised when an error or other event interrupts normal execution of a
program. The exception transfers control to an exception handler, which allows you to
separate normal program logic from error-handling. Because exceptions are objects,
they can be grouped into hierarchies using inheritance, and new exceptions can be
introduced without affecting existing code. An exception can carry information, such
as an error message, from the point where it is raised to the point where it is handled.
When an application uses the SysUtils unit, all runtime errors are automatically
converted into exceptions. Errors that would otherwise terminate an application—
such as insufficient memory, division by zero, and general protection faults—can be
caught and handled.
Try...except statements
Exceptions are handled within try...except statements. For example,
try
X := Y/Z;
except
on EZeroDivide do HandleZeroDivide;
end;
This statement attempts to divide Y by Z, but calls a routine named HandleZeroDivide
if an EZeroDivide exception is raised.
the ancestor of the other two exception classes; if it appeared first, the other two
handlers would never be invoked.
try
ƒ
except
on EZeroDivide do HandleZeroDivide;
on EOverflow do HandleOverflow;
on EMathError do HandleMathError;
end;
An exception handler can specify an identifier before the name of the exception class.
This declares the identifier to represent the exception object during execution of the
statement that follows on...do. The scope of the identifier is limited to that statement.
For example,
try
ƒ
except
on E: Exception do ErrorDialog(E.Message, E.HelpContext);
end;
If the exception block specifies an else clause, the else clause handles any exceptions
that aren’t handled by the block’s exception handlers. For example,
try
ƒ
except
on EZeroDivide do HandleZeroDivide;
on EOverflow do HandleOverflow;
on EMathError do HandleMathError;
else
HandleAllOthers;
end;
Here, the else clause handles any exception that isn’t an EMathError.
An exception block that contains no exception handlers, but instead consists only of a
list of statements, handles all exceptions. For example,
try
ƒ
except
HandleException;
end;
Here, the HandleException routine handles any exception that occurs as a result of
executing the statements between try and except.
Re-raising exceptions
When the reserved word raise occurs in an exception block without an object
reference following it, it raises whatever exception is handled by the block. This
allows an exception handler to respond to an error in a limited way and then re-raise
the exception. Re-raising is useful when a procedure or function has to clean up after
an exception occurs but cannot fully handle the exception.
For example, the GetFileList function allocates a TStringList object and fills it with file
names matching a specified search path:
function GetFileList(const Path: string): TStringList;
var
I: Integer;
SearchRec: TSearchRec;
begin
Result := TStringList.Create;
try
I := FindFirst(Path, 0, SearchRec);
while I = 0 do
begin
Result.Add(SearchRec.Name);
I := FindNext(SearchRec);
end;
except
Result.Free;
raise;
end;
end;
GetFileList creates a TStringList object, then uses the FindFirst and FindNext functions
(defined in SysUtils) to initialize it. If the initialization fails—for example because the
search path is invalid, or because there is not enough memory to fill in the string
list—GetFileList needs to dispose of the new string list, since the caller does not yet
know of its existence. For this reason, initialization of the string list is performed in a
try...except statement. If an exception occurs, the statement’s exception block
disposes of the string list, then re-raises the exception.
Nested exceptions
Code executed in an exception handler can itself raise and handle exceptions. As long
as these exceptions are also handled within the exception handler, they do not affect
the original exception. However, once an exception raised in an exception handler
propagates beyond that handler, the original exception is lost. This is illustrated by
the Tan function below.
type
ETrigError = class(EMathError);
function Tan(X: Extended): Extended;
begin
try
Result := Sin(X) / Cos(X);
except
on EMathError do
raise ETrigError.Create('Invalid argument to Tan');
end;
end;
If an EMathError exception occurs during execution of Tan, the exception handler
raises an ETrigError. Since Tan does not provide a handler for ETrigError, the
exception propagates beyond the original exception handler, causing the EMathError
exception to be destroyed. To the caller, it appears as if the Tan function has raised an
ETrigError exception.
Try...finally statements
Sometimes you want to ensure that specific parts of an operation are completed,
whether or not the operation is interrupted by an exception. For example, when a
routine acquires control of a resource, it is often important that the resource be
released, regardless of whether the routine terminates normally. In these situations,
you can use a try...finally statement.
The following example shows how code that opens and processes a file can ensure
that the file is ultimately closed, even if an error occurs during execution.
Reset(F);
try
ƒ // process file F
finally
CloseFile(F);
end;
The syntax of a try...finally statement is
try statementList1 finally statementList2 end
where each statementList is a sequence of statements delimited by semicolons. The
try...finally statement executes the statements in statementList1 (the try clause). If
statementList1 finishes without raising exceptions, statementList2 (the finally clause) is
executed. If an exception is raised during execution of statementList1, control is
transferred to statementList2; once statementList2 finishes executing, the exception is
re-raised. If a call to the Exit, Break, or Continue procedure causes control to leave
statementList1, statementList2 is automatically executed. Thus the finally clause is
always executed, regardless of how the try clause terminates.
If an exception is raised but not handled in the finally clause, that exception is
propagated out of the try...finally statement, and any exception already raised in the
try clause is lost. The finally clause should therefore handle all locally raised
exceptions, so as not to disturb propagation of other exceptions.
A file variable is any variable whose type is a file type. There are three classes of file:
typed, text, and untyped. The syntax for declaring file types is given in “File types” on
page 5-23.
Before a file variable can be used, it must be associated with an external file through a
call to the AssignFile procedure. An external file is typically a named disk file, but it
can also be a device, such as the keyboard or the display. The external file stores the
information written to the file or supplies the information read from the file.
Once the association with an external file is established, the file variable must be
“opened” to prepare it for input or output. An existing file can be opened via the
Reset procedure, and a new file can be created and opened via the Rewrite procedure.
Text files opened with Reset are read-only and text files opened with Rewrite and
Append are write-only. Typed files and untyped files always allow both reading and
writing regardless of whether they were opened with Reset or Rewrite.
Every file is a linear sequence of components, each of which has the component type
(or record type) of the file. The components are numbered starting with zero.
Files are normally accessed sequentially. That is, when a component is read using the
standard procedure Read or written using the standard procedure Write, the current
file position moves to the next numerically ordered file component. Typed files and
untyped files can also be accessed randomly through the standard procedure Seek,
which moves the current file position to a specified component. The standard
functions FilePos and FileSize can be used to determine the current file position and
the current file size.
When a program completes processing a file, the file must be closed using the
standard procedure CloseFile. After a file is closed, its associated external file is
updated. The file variable can then be associated with another external file.
By default, all calls to standard I/O procedures and functions are automatically
checked for errors, and if an error occurs an exception is raised (or the program is
terminated if exception handling is not enabled). This automatic checking can be
turned on and off using the {$I+} and {$I–} compiler directives. When I/O checking is
off—that is, when a procedure or function call is compiled in the {$I–} state—an I/O
error doesn’t cause an exception to be raised; to check the result of an I/O operation,
you must call the standard function IOResult instead.
You must call the IOResult function to clear an error, even if you aren’t interested in
the error. If you don’t clear an error and {$I+} is the current state, the next I/O
function call will fail with the lingering IOResult error.
Text files
This section summarizes I/O using file variables of the standard type Text.
When a text file is opened, the external file is interpreted in a special way: It is
considered to represent a sequence of characters formatted into lines, where each line
is terminated by an end-of-line marker (a carriage-return character, possibly
followed by a linefeed character). The type Text is distinct from the type file of Char.
For text files, there are special forms of Read and Write that let you read and write
values that are not of type Char. Such values are automatically translated to and from
their character representation. For example, Read(F, I), where I is a type Integer
variable, reads a sequence of digits, interprets that sequence as a decimal integer, and
stores it in I.
There are two standard text-file variables, Input and Output. The standard file
variable Input is a read-only file associated with the operating system’s standard
input (typically the keyboard). The standard file variable Output is a write-only file
associated with the operating system’s standard output (typically the display). Before
an application begins executing, Input and Output are automatically opened, as if the
following statements were executed:
AssignFile(Input, '');
Reset(Input);
AssignFile(Output, '');
Rewrite(Output);
Note Text-oriented I/O is available only in console applications—that is, applications
compiled with the “Generate console application” option checked on the Linker page
of the Project Options dialog box or with the -cc command-line compiler option. In a
GUI (non-console) application, any attempt to read or write using Input or Output
will produce an I/O error.
Some of the standard I/O routines that work on text files don’t need to have a file
variable explicitly given as a parameter. If the file parameter is omitted, Input or
Output is assumed by default, depending on whether the procedure or function is
Untyped files
Untyped files are low-level I/O channels used primarily for direct access to disk files
regardless of type and structuring. An untyped file is declared with the word file
and nothing more. For example,
var DataFile: file;
For untyped files, the Reset and Rewrite procedures allow an extra parameter to
specify the record size used in data transfers. For historical reasons, the default
record size is 128 bytes. A record size of 1 is the only value that correctly reflects the
exact size of any file. (No partial records are possible when the record size is 1.)
Except for Read and Write, all typed-file standard procedures and functions are also
allowed on untyped files. Instead of Read and Write, two procedures called BlockRead
and BlockWrite are used for high-speed data transfers.
Assuming, for example, that the four device-interface functions are called DevOpen,
DevInOut, DevFlush, and DevClose, the Assign procedure might look like this:
procedure AssignDev(var F: Text);
begin
with TextRec(F) do
begin
Mode := fmClosed;
BufSize := SizeOf(Buffer);
BufPtr := @Buffer;
OpenFunc := @DevOpen;
InOutFunc := @DevInOut;
FlushFunc := @DevFlush;
CloseFunc := @DevClose;
Name[0] := #0;
end;
end;
The device-interface functions can use the UserData field in the file record to store
private information. This field isn’t modified by the Delphi file system at any time.
Device functions
The functions that make up a text-file device driver are described below.
When Mode is fmOutput, the InOut function writes BufPos characters from BufPtr^,
and returns zero in BufPos.
Wide-character strings
The System unit provides three functions, WideCharToString, WideCharLenToString,
and StringToWideChar, that can be used to convert null-terminated wide character
strings to single- or double-byte long strings.
For more information about wide-character strings, see “About extended character
sets” on page 5-12.
For information on format strings, see “Format strings” in the online Help.
II
Special topics
Part II
The chapters in Part II cover specialized language features and advanced topics.
These chapters include:
• Chapter 9, “Dynamic-link libraries and packages”
• Chapter 10, “Object interfaces”
• Chapter 11, “Memory management”
• Chapter 12, “Program control”
• Chapter 13, “Inline assembler code”
Special topics
Chapter
Calling DLLs
Before you can call routines defined in a DLL, you must import them. This can be
done in two ways: by declaring an external procedure or function, or by calling the
Windows API directly. Whichever method you use, the routines are not linked to
your application until runtime. This means that the DLL need not be present when
you compile your program. It also means that there is no compile-time validation of
attempts to import a routine.
Object Pascal does not support importing of variables from DLLs.
Static loading
The simplest way to import a procedure or function is to declare it using the external
directive. For example,
procedure DoSomething; external 'MYLIB.DLL';
If you include this declaration in a program, MYLIB.DLL is loaded once, when the
program starts. Throughout execution of the program, the identifier DoSomething
always refers to the same entry point in the same DLL.
Dynamic loading
You can access routines in a DLL through direct calls to Windows library functions,
including LoadLibrary, FreeLibrary, and GetProcAddress (all declared in Delphi’s
Windows unit). In this case, use procedural-type variables to reference the imported
routines. For example,
uses Windows, ...;
type
TTimeRec = record
Second: Integer;
Minute: Integer;
Hour: Integer;
end;
TGetTime = procedure(var Time: TTimeRec);
THandle = Integer;
var
Time: TTimeRec;
Handle: THandle;
GetTime: TGetTime;
ƒ
begin
Handle := LoadLibrary('DATETIME.DLL');
if Handle <> 0 then
begin
@GetTime := GetProcAddress(Handle, 'GetTime');
if @GetTime <> nil then
begin
GetTime(Time);
with Time do
WriteLn('The time is ', Hour, ':', Minute, ':', Second);
end;
FreeLibrary(Handle);
end;
end;
When you import routines this way, the DLL is not loaded until the code containing
the call to LoadLibrary executes. The DLL is later unloaded by the call to FreeLibrary.
This allows you to conserve memory, and to run your program even when some of
the DLLs it uses are not present.
Writing DLLs
The structure of a DLL is identical to that of a program, except that a DLL begins with
the reserved word library (instead of program).
The following example shows a DLL with two exported functions, Min and Max.
library MinMax;
function Min(X, Y: Integer): Integer; stdcall;
begin
if X < Y then Min := X else Min := Y;
end;
function Max(X, Y: Integer): Integer; stdcall;
begin
if X > Y then Max := X else Max := Y;
end;
exports
Min,
Max;
begin
end.
If you want your DLL to be available to applications written in other languages, it’s
safest to specify stdcall in the declarations of exported functions. Other languages
may not support Object Pascal’s default register calling convention.
DLLs can be built from multiple units. In this case, the library source file is frequently
reduced to a uses clause, an exports clause, and the DLL’s initialization code. For
example,
library Editors;
uses EdInit, EdInOut, EdFormat, EdPrint;
exports
InitEditors,
DoneEditors index 17 name Done,
InsertText name Insert,
DeleteSelection name Delete,
FormatSelection,
PrintSelection name Print,
ƒ
SetErrorHandler;
begin
InitLibrary;
end.
You can put exports clauses in the interface or implementation section of a unit. Any
library that includes such a unit in its uses clause automatically exports the routines
listed the unit’s exports clauses—without the need for an exports clause of its own.
Only routines that a library explicitly exports are available for importing by other
libraries or programs.
—and assign the address of the procedure to the DLLProc variable. When Windows
calls the procedure, it passes to it one of the following values (defined in the Windows
unit).
In the body of the procedure, you can specify actions to take depending on which
parameter is passed to the procedure.
Packages
A package is a specially compiled dynamic-link library used by Delphi applications,
the Delphi IDE, or both. Runtime packages provide functionality when a user runs an
application. Design-time packages are used to install components in Delphi’s IDE and
to create special property editors for custom components. A single package can
function at both design time and runtime, and design-time packages frequently work
by referencing runtime packages in their requires clauses.
To distinguish them from other DLLs, package libraries are stored in files that end
with the .BPL (Borland package library) extension.
Ordinarily, packages are loaded statically when an applications starts. But you can
use the LoadPackage and UnloadPackage routines (in the SysUtils unit) to load packages
dynamically.
Note When an application utilizes packages, the name of each packaged unit still must
appear in the uses clause of any source file that references it. For more information
about packages, see the online Help.
The contains clause identifies the unit files to be compiled and bound into the
package. It consists of the directive contains, followed by a comma-delimited list of
unit names, followed by a semicolon. Any unit name may be followed by the
reserved word in and the name of a source file, with or without a directory path, in
single quotation marks; directory paths can be absolute or relative. For example,
contains MyUnit in 'C:\MyProject\MyUnit.pas';
Note Thread-local variables (declared with threadvar) in a packaged unit cannot be
accessed from clients that use the package.
Naming packages
A compiled package involves several generated files. For example, the source file for
the package called VCL50 is VCL50.DPK, from which the compiler generates an
executable and a binary image called VCL50.BPL and VCL50.DCP, respectively. VCL50
is used to refer to the package in the requires clauses of other packages, or when using
the package in an application. Package names must be unique within a project.
All units included directly in a package’s contains clause, or indirectly in the uses
clauses of those units, are bound into the package at compile time. The units
contained (directly or indirectly) in a package cannot be contained in any other
packages referenced in requires clause of that package.
A unit cannot be contained (directly or indirectly) in more than one package used by
the same application.
Compiling packages
Packages are ordinarily compiled from the Delphi IDE using .DPK files generated by
the Package editor. You can also compile .DPK files directly from the command line.
When you build a project that contains a package, the package is implicitly
recompiled if necessary.
Generated files
The following table lists the files produced by the successful compilation of a
package.
Including {$DENYPACKAGEUNIT ON} in source code prevents the unit file from
being packaged. Including {$G–} or {IMPORTEDDATA OFF} may prevent a
package from being used in the same application with other packages.
Other compiler directives may be included, if appropriate, in package source code.
Using the –$G– switch may prevent a package from being used in the same
application with other packages.
Other command-line options may be used, if appropriate, when compiling packages.
10
Object interfaces
Chapter10
Interface types
Interfaces, like classes, can be declared only in the outermost scope of a program or
unit, not in a procedure or function declaration. An interface type declaration has the
form
type interfaceName = interface (ancestorInterface)
['{GUID}']
memberList
end;
where (ancestorInterface) and ['{GUID}'] are optional. In most respects, interface
declarations resemble class declarations, but the following restrictions apply.
• The memberList can include only methods and properties. Fields are not allowed in
interfaces.
• Since an interface has no fields, property read and write specifiers must be
methods.
• All members of an interface are public. Visibility specifiers and storage specifiers
are not allowed. (But an array property can be declared as default.)
• Interfaces have no constructors or destructors. They cannot be instantiated, except
through classes that implement their methods.
• Methods cannot be declared as virtual, dynamic, abstract, or override. Since
interfaces do not implement their own methods, these designations have no
meaning.
Here is an example of an interface declaration:
type
IMalloc = interface(IUnknown)
['{00000002-0000-0000-C000-000000000046}']
function Alloc(Size: Integer): Pointer; stdcall;
function Realloc(P: Pointer; Size: Integer): Pointer; stdcall;
procedure Free(P: Pointer); stdcall;
function GetSize(P: Pointer): Integer; stdcall;
function DidAlloc(P: Pointer): Integer; stdcall;
procedure HeapMinimize; stdcall;
end;
Interface identification
An interface declaration can specify a globally unique identifier (GUID), represented
by a string literal enclosed in brackets immediately preceding the member list. The
GUID part of the declaration must have the form
['{xxxxxxxx–xxxx–xxxx–xxxx–xxxxxxxxxxxx}']
where each x is a hexadecimal digit (0 through 9 or A through F).
A GUID is a 16-byte binary value that uniquely identifies an interface. If an interface
has a GUID, you can use interface querying to get references to its implementations.
(See “Interface querying” on page 10-9.)
The TGUID and PGUID types, declared in the System unit, are used to manipulate
GUIDs.
type
PGUID = ^TGUID;
TGUID = packed record
D1: Longword;
D2: Word;
D3: Word;
D4: array[0..7] of Byte;
end;
When you declare a typed constant of type TGUID, you can use a string literal to
specify its value. For example,
const IID_IMalloc: TGUID = '{00000002-0000-0000-C000-000000000046}';
In procedure and function calls, either a GUID or an interface identifier can serve as a
value or constant parameter of type TGUID. For example, given the declaration
function Supports(Unknown: IUnknown; const IID: TGUID): Boolean;
Supports can be called in either of two ways:
if Supports(Allocator, IMalloc) then ...
if Supports(Allocator, IID_IMalloc) then ...
Calling conventions
The default calling convention is register, but interfaces shared among modules
(especially if they are written in different languages) should declare all methods with
stdcall. Use safecall to implement methods of dual interfaces (as described in “Dual
interfaces” on page 10-12) and CORBA interfaces.
For more information about calling conventions, see “Calling conventions” on
page 6-4.
Interface properties
Properties declared in an interface are accessible only through expressions of the
interface type; they cannot be accessed through class-type variables. Moreover,
interface properties are visible only within programs where the interface is compiled.
COM objects do not have properties.
In an interface, property read and write specifiers must be methods, since fields are
not available.
Forward declarations
An interface declaration that ends with the reserved word interface and a semicolon,
without specifying an ancestor, GUID, or member list, is a forward declaration. A
forward declaration must be resolved by a defining declaration of the same interface
within the same type declaration section. In other words, between a forward
declaration and its defining declaration, nothing can occur except other type
declarations.
Forward declarations allow mutually dependent interfaces. For example,
type
IControl = interface;
IWindow = interface
['{00000115-0000-0000-C000-000000000044}']
function GetControl(Index: Integer): IControl;
ƒ
end;
IControl = interface
['{00000115-0000-0000-C000-000000000049}']
function GetWindow: IWindow;
ƒ
end;
Mutually derived interfaces are not allowed. For example, it is not legal to derive
IWindow from IControl and also derive IControl from IWindow.
Implementing interfaces
Once an interface has been declared, it must be implemented in a class before it can
be used. The interfaces implemented by a class are specified in the class’s declaration,
after the name of the class’s ancestor. Such declarations have the form
type className = class (ancestorClass, interface1, ..., interfacen)
memberList
end;
For example,
type
TMemoryManager = class(TInterfacedObject, IMalloc, IErrorInfo)
ƒ
end;
declares a class called TMemoryManager that implements the IMalloc and IErrorInfo
interfaces. When a class implements an interface, it must implement (or inherit an
implementation of) each method declared in the interface.
Here is the declaration of TInterfacedObject in the System unit.
type
TInterfacedObject = class(TObject, IUnknown)
protected
FRefCount: Integer;
function QueryInterface(const IID: TGUID; out Obj): Integer; stdcall;
function _AddRef: Integer; stdcall;
function _Release: Integer; stdcall;
public
property RefCount: Integer read FRefCount;
end;
A class can also reimplement an entire interface that it inherits from an ancestor class.
This involves relisting the interface in the descendant class’s declaration. For
example,
type
IWindow = interface
['{00000115-0000-0000-C000-000000000146}']
procedure Draw;
ƒ
end;
TWindow = class(TInterfacedObject, IWindow) // TWindow implements IWindow
procedure Draw;
ƒ
end;
TFrameWindow = class(TWindow, IWindow) // TFrameWindow reimplements IWindow
procedure Draw;
ƒ
end;
Reimplementing an interface hides the inherited implementation of the same
interface. Hence method resolution clauses in an ancestor class have no effect on the
reimplemented interface.
type
IMyInterface = interface
procedure P1;
procedure P2;
end;
TMyClass = class(TObject, IMyInterface)
FMyInterface: IMyInterface;
property MyInterface: IMyInterface read FMyInterface implements IMyInterface;
end;
var
MyClass: TMyClass;
MyInterface: IMyInterface;
begin
MyClass := TMyClass.Create;
MyClass.FMyInterface := ... // some object whose class implements IMyInterface
MyInterface := MyClass;
MyInterface.P1;
end;
begin
MyClass := TMyClass.Create;
MyClass.FMyImplClass := TMyImplClass.Create;
MyInterface := MyClass;
MyInterface.P1; // calls TMyClass.MyP1;
MyInterface.P2; // calls TImplClass.P2;
end;
Interface references
If you declare a variable of an interface type, the variable can reference instances of
any class that implements the interface. Such variables allow you to call interface
methods without knowing at compile time where the interface is implemented. But
they are subject to the following limitations.
• An interface-type expression gives you access only to methods and properties
declared in the interface, not to other members of the implementing class.
• An interface-type expression cannot reference an object whose class implements a
descendant interface, unless the class (or one that it inherits from) explicitly
implements the ancestor interface as well.
For example,
type
IAncestor = interface
end;
IDescendant = interface(IAncestor)
procedure P1;
end;
TSomething = class(TInterfacedObject, IDescendant)
procedure P1;
procedure P2;
end;
ƒ
var
D: IDescendant;
A: IAncestor;
begin
D := TSomething.Create; // works!
A := TSomething.Create; // error
D.P1; // works!
D.P2; // error
end;
In this example,
• A is declared as a variable of type IAncestor. Because TSomething does not list
IAncestor among the interfaces it implements, a TSomething instance cannot be
assigned to A. But if we changed TSomething’s declaration to
TSomething = class(TInterfacedObject, IAncestor, IDescendant)
ƒ
the first error would become a valid assignment.
Interface assignment-compatibility
A class type is assignment-compatible with any interface type implemented by the
class. An interface type is assignment-compatible with any ancestor interface type.
The value nil can be assigned to any interface-type variable.
An interface-type expression can be assigned to a variant. If the interface is of type
IDispatch or a descendant, the variant receives the type code varDispatch. Otherwise,
the variant receives the type code varUnknown.
A variant whose type code is varEmpty, varUnknown, or varDispatch can be assigned
to an IUnknown variable. A variant whose type code is varEmpty or varDispatch can be
assigned to an IDispatch variable.
Interface typecasts
Interface types follow the same rules as class types in variable and value typecasts.
Class-type expressions can be cast to interface types—for example,
IMyInterface(SomeObject)—provided the class implements the interface.
An interface-type expression can be cast to Variant. If the interface is of type IDispatch
or a descendant, the resulting variant has the type code varDispatch. Otherwise, the
resulting variant has the type code varUnknown.
A variant whose type code is varEmpty, varUnknown, or varDispatch can be cast to
IUnknown. A variant whose type code is varEmpty or varDispatch can be cast to
IDispatch.
Interface querying
You can use the as operator to perform checked interface typecasts. This is known as
interface querying, and it yields an interface-type expression from an object reference
or from another interface reference, based on the actual (runtime) type of the object.
An interface query has the form
object as interface
where object is an expression of an interface or variant type or denotes an instance of
a class that implements an interface, and interface is any interface declared with a
GUID.
An interface query returns nil if object is nil. Otherwise, it passes the GUID of interface
to the QueryInterface method in object, raising an exception unless QueryInterface
returns zero. If QueryInterface returns zero (indicating that object’s class implements
interface), the interface query returns an interface reference to object.
Automation objects
An object whose class implements the IDispatch interface (declared in the System unit)
is an Automation object.
Dual interfaces
A dual interface is an interface that supports both compile-time binding and runtime
binding through Automation. Dual interfaces must descend from IDispatch.
All methods of a dual interface (except from those inherited from IUnknown and
IDispatch) must use the safecall convention, and all method parameter and result
types must be automatable. (The automatable types are Byte, Currency, Real, Double,
Real48, Integer, Single, Smallint, AnsiString, ShortString, TDateTime, Variant,
OleVariant, and WordBool.)
Memory management
Chapter11
11
This chapter explains how programs use memory and describes the internal formats
of Object Pascal data types.
the combined size of all currently allocated memory blocks. Applications can use
these variables to display status information for debugging.
The System unit provides two procedures, GetMemoryManager and
SetMemoryManager, that allow applications to intercept low-level memory manager
calls. The System unit also provides a function called GetHeapStatus that returns a
record containing detailed memory-manager status information. For further
information about these routines, see the online Help.
Variables
Global variables are allocated on the application data segment and persist for the
duration of the program. Local variables (declared within procedures and functions)
reside in an application’s stack. Each time a procedure or function is called, it
allocates a set of local variables; on exit, the local variables are disposed of. Compiler
optimization may eliminate variables earlier.
An application’s stack is defined by two values: the minimum stack size and the
maximum stack size. The values are controlled through the $MINSTACKSIZE and
$MAXSTACKSIZE compiler directives, and default to 16,384 (16K) and 1,048,576
(1M) respectively. An application is guaranteed to have the minimum stack size
available, and an application’s stack is never allowed to grow larger than the
maximum stack size. If there is not enough memory available to satisfy an
application’s minimum stack requirement, Windows will report an error upon
attempting to start the application.
If an application requires more stack space than specified by the minimum stack size,
additional memory is automatically allocated in 4K increments. If allocation of
additional stack space fails, either because more memory is not available or because
the total size of the stack would exceed the maximum stack size, an EStackOverflow
exception is raised. (Stack overflow checking is completely automatic. The $S
compiler directive, which originally controlled overflow checking, is maintained for
backward compatibility.)
Dynamic variables created with the GetMem or New procedure are heap-allocated
and persist until they are deallocated with FreeMem or Dispose.
Long strings, wide strings, dynamic arrays, variants, and interfaces are heap-
allocated, but their memory is managed automatically.
Integer types
The format of an integer-type variable depends on its minimum and maximum
bounds.
• If both bounds are within the range –128..127 (Shortint), the variable is stored as a
signed byte.
• If both bounds are within the range 0..255 (Byte), the variable is stored as an
unsigned byte.
• If both bounds are within the range –32768..32767 (Smallint), the variable is stored
as a signed word.
• If both bounds are within the range 0..65535 (Word), the variable is stored as an
unsigned word.
• If both bounds are within the range –2147483648..2147483647 (Longint), the
variable is stored as a signed double word.
• If both bounds are within the range 0..4294967295 (Longword), the variable is
stored as an unsigned double word.
• Otherwise, the variable is stored as a signed quadruple word (Int64).
Character types
A Char, an AnsiChar, or a subrange of a Char type is stored as an unsigned byte. A
WideChar is stored as an unsigned word.
Boolean types
A Boolean type is stored as a Byte, a ByteBool is stored as a Byte, a WordBool type is
stored as a Word, and a LongBool is stored as a Longint.
A Boolean can assume the values 0 (False) and 1 (True). ByteBool, WordBool, and
LongBool types can assume the values 0 (False) or nonzero (True).
Enumerated types
An enumerated type is stored as an unsigned byte if the enumeration has no more
than 256 values and the type was declared in the {$Z1} state (the default). If an
enumerated type has more than 256 values, or if the type was declared in the {$Z2}
state, it is stored as an unsigned word. If an enumerated type is declared in the {$Z4}
state, it is stored as an unsigned double-word.
Real types
The real types store the binary representation of a sign (+ or –), an exponent, and a
significand. A real value has the form
+/– significand * 2exponent
where the significand has a single bit to the left of the binary decimal point. (That is,
0 <= significand < 2.)
In the figures that follow, the most significant bit is always on the left and the least
significant bit on the right. The numbers at the top indicate the width (in bits) of each
field, with the leftmost items stored at the highest addresses. For example, for a
Real48 value, e is stored in the first byte, f in the following five bytes, and s in the most
significant bit of the last byte.
1 39 8
s f e
1 8 23
s e f
1 11 52
s e f
1 15 1 63
s e i f
Pointer types
A Pointer type is stored in 4 bytes as a 32-bit address. The pointer value nil is stored
as zero.
The NULL character at the end of a long string memory block is automatically
maintained by the compiler and the built-in string handling routines. This makes it
possible to typecast a long string directly to a null-terminated string.
For string constants and literals, the compiler generates a memory block with the same
layout as a dynamically allocated string, but with a reference count of –1. When a long
string variable is assigned a string constant, the string pointer is assigned the address of
the memory block generated for the string constant. The built-in string handling
routines know not to attempt to modify blocks that have a reference count of –1.
The string length is the number of bytes, so it is twice the number of wide characters
contained in the string.
The NULL character at the end of a wide string memory block is automatically
maintained by the compiler and the built-in string handling routines. This makes it
possible to typecast a wide string directly to a null-terminated string.
Set types
A set is a bit array where each bit indicates whether an element is in the set or not.
The maximum number of elements in a set is 256, so a set never occupies more than
32 bytes. The number of bytes occupied by a particular set is equal to
(Max div 8) – (Min div 8) + 1
where Max and Min are the upper and lower bounds of the base type of the set. The
byte number of a specific element E is
(E div 8) – (Min div 8)
Record types
When a record type is declared in the {$A+} state (the default), and when the
declaration does not include a packed modifier, the type is an unpacked record type, and
the fields of the record are aligned for efficient access by the CPU. The alignment is
controlled by the type of each field. Every data type has an inherent alignment, which
is automatically computed by the compiler. The alignment can be 1, 2, 4, or 8, and
represents the byte boundary that a value of the type must be stored on to provide the
most efficient access. The table below lists the alignments for all data types.
To ensure proper alignment of the fields in an unpacked record type, the compiler
inserts an unused byte before fields with an alignment of 2, and up to three unused
bytes before fields with an alignment of 4, if required. Finally, the compiler rounds
the total size of the record upward to the byte boundary specified by the largest
alignment of any of the fields.
When a record type is declared in the {$A–} state, or when the declaration includes
the packed modifier, the fields of the record are not aligned, but are instead assigned
consecutive offsets. The total size of such a packed record is simply the size of all the
fields.
File types
File types are represented as records. Typed files and untyped files occupy 332 bytes,
which are laid out as follows:
type
TFileRec = record
Handle: Integer;
Mode: Integer;
RecSize: Cardinal;
Private: array[1..28] of Byte;
UserData: array[1..32] of Byte;
Name: array[0..259] of Char;
end;
Text files occupy 460 bytes, which are laid out as follows:
type
TTextBuf = array[0..127] of Char;
TTextRec = record
Handle: Integer;
Mode: Integer;
BufSize: Cardinal;
BufPos: Cardinal;
BufEnd: Cardinal;
BufPtr: PChar;
OpenFunc: Pointer;
InOutFunc: Pointer;
FlushFunc: Pointer;
CloseFunc: Pointer;
UserData: array[1..32] of Byte;
Name: array[0..259] of Char;
Buffer: TTextBuf;
end;
Handle contains the file’s handle (when the file is open).
Procedural types
A procedure pointer is stored as a 32-bit pointer to the entry point of a procedure or
function. A method pointer is stored as a 32-bit pointer to the entry point of a
method, followed by a 32-bit pointer to an object.
Class types
A class-type value is stored as a 32-bit pointer to an instance of the class, which is
called an object. The internal data format of an object resembles that of a record. The
object’s fields are stored in order of declaration as a sequence of contiguous variables.
Fields are always aligned, corresponding to an unpacked record type. Any fields
inherited from an ancestor class are stored before the new fields defined in the
descendant class.
The first 4-byte field of every object is a pointer to the virtual method table (VMT) of the
class. There is exactly one VMT per class (not one per object); distinct class types, no
matter how similar, never share a VMT. VMTs are built automatically by the
compiler, and are never directly manipulated by a program. Pointers to VMTs, which
are automatically stored by constructor methods in the objects they create, are also
never directly manipulated by a program.
The layout of a VMT is shown in the following table. At positive offsets, a VMT
consists of a list of 32-bit method pointers—one per user-defined virtual method in
the class type—in order of declaration. Each slot contains the address of the
corresponding virtual method’s entry point. This layout is compatible with a C++ v-
table and with COM. At negative offsets, a VMT contains a number of fields that are
internal to Object Pascal’s implementation. Applications should use the methods
defined in TObject to query this information, since the layout is likely to change in
future implementations of Object Pascal.
Variant types
A variant is stored as a 16-byte record that contains a type code and a value (or a
reference to a value) of the type given by the code. The System unit defines constants
and types for variants.
The TVarData type represents the internal structure of a Variant variable, which is
identical to the Variant type used by COM and the Win32 API. The TVarData type can
be used in typecasts of Variant variables to access the internal structure of a variable.
The VType field of a TVarData record contains the type code of the variant in the
lower twelve bits (the bits defined by the varTypeMask constant). In addition, the
varArray bit may be set to indicate that the variant is an array, and the varByRef bit
may be set to indicate that the variant contains a reference as opposed to a value.
The Reserved1, Reserved2, and Reserved3 fields of a TVarData record are unused.
The contents of the remaining eight bytes of a TVarData record depend on the VType
field. If neither the varArray nor the varByRef bits are set, the variant contains a value
of the given type.
If the varArray bit is set, the variant contains a pointer to a TVarArray structure that
defines an array. The type of each array element is given by the varTypeMask bits in
the VType field.
If the varByRef bit is set, the variant contains a reference to a value of the type given
by the varTypeMask and varArray bits in the VType field.
The varString type code is private to Delphi. Variants containing a varString value
should never be passed to a non-Delphi function. Delphi’s Automation support
automatically converts varString variants to varOleStr variants before passing them as
parameters to external functions.
12
Program control
Chapter12
This chapter explains how parameters and function results are stored and
transferred. The final section discusses exit procedures.
Parameter passing
Parameters are transferred to procedures and functions via CPU registers or the
stack, depending on the routine’s calling convention. For information about calling
conventions, see “Calling conventions” on page 6-4.
Variable (var) parameters are always passed by reference, as 32-bit pointers that
point to the actual storage location.
Value and constant (const) parameters are passed by value or by reference,
depending on the type and size of the parameter:
• An ordinal parameter is passed as an 8-bit, 16-bit, 32-bit, or 64-bit value, using the
same format as a variable of the corresponding type.
• A real parameter is always passed on the stack. A Single parameter occupies 4
bytes, and a Double, Comp, or Currency parameter occupies 8 bytes. A Real48
occupies 8 bytes, with the Real48 value stored in the lower 6 bytes. An Extended
occupies 12 bytes, with the Extended value stored in the lower 10 bytes.
• A short-string parameter is passed as a 32-bit pointer to a short string.
Function results
The following conventions are used for returning function result values.
• Ordinal results are returned in a CPU register. Bytes are returned in AL, words are
returned in AX, and double-words are returned in EAX.
• Real results are returned in the floating-point coprocessor’s top-of-stack register
(ST(0)). For function results of type Currency, the value in ST(0) is scaled by 10000.
For example, the Currency value 1.234 is returned in ST(0) as 12340.
• For a string, dynamic array, method pointer, or Variant result, the effects are the
same as if the function result were declared as an additional var parameter
following the declared parameters. In other words, the caller passes an additional
32-bit pointer that points to a variable in which to return the function result.
• Pointer, class, class-reference, and procedure-pointer results are returned in EAX.
• For static-array, record, and set results, if the value occupies one byte it is returned
in AL; if the value occupies two bytes it is returned in AX; and if the value
occupies four bytes it is returned in EAX. Otherwise, the result is returned in an
additional var parameter that is passed to the function after the declared
parameters.
Method calls
Methods use the same calling conventions as ordinary procedures and functions,
except that every method has an additional implicit parameter Self, which is a
reference to the instance or class in which the method is called. The Self parameter is
passed as a 32-bit pointer.
• Under the register convention, Self behaves as if it were declared before all other
parameters. It is therefore always passed in the EAX register.
• Under the pascal convention, Self behaves as if it were declared after all other
parameters (including the additional var parameter sometimes passed for a
function result). It is therefore pushed last, ending up at a lower address than all
other parameters.
• Under the cdecl, stdcall, and safecall conventions, Self behaves as if it were
declared before all other parameters, but after the additional var parameter (if any)
passed for a function result. It is therefore the last to be pushed, except for the
additional var parameter.
Exit procedures
Exit procedures ensure that specific actions—such as updating and closing files—are
carried out before a program terminates. The ExitProc pointer variable allows you to
“install” an exit procedure, so that it is always called as part of the program’s
termination—whether the termination is normal, forced by a call to Halt, or the result
of a runtime error. An exit procedure takes no parameters.
Note It is recommended that finalization sections, rather than exit procedures, be used for
all exit behavior. (See “The finalization section” on page 3-5.) Exit procedures are
available only for .EXE or .DLL targets; for packages, exit behavior must be
implemented in a finalization section. All exit procedures are called before execution
of finalization sections.
Units as well as programs can install exit procedures. A unit can install an exit
procedure as part of its initialization code, relying on the procedure to close files or
perform other clean-up tasks.
When implemented properly, an exit procedure is part of a chain of exit procedures.
The procedures are executed in reverse order of installation, ensuring that the exit
code of one unit isn’t executed before the exit code of any units that depend on it. To
keep the chain intact, you must save the current contents of ExitProc before pointing
it to the address of your own exit procedure. Also, the first statement in your exit
procedure must reinstall the saved value of ExitProc.
13
Inline assembler code
Chapter13
The built-in assembler allows you to write Intel assembler code within Object Pascal
programs. It implements a large subset of the syntax supported by Turbo Assembler
and Microsoft’s Macro Assembler, including all 8086/8087 and 80386/80387 opcodes
and all but a few of Turbo Assembler’s expression operators. Moreover, the built-in
assembler allows you to use Object Pascal identifiers in assembler statements.
Except for DB, DW, and DD (define byte, word, and double word), none of Turbo
Assembler’s directives (such as EQU, PROC, STRUC, SEGMENT, and MACRO) are
supported by the built-in assembler. Operations implemented through Turbo
Assembler directives, however, are largely matched by corresponding Object Pascal
constructions. For example, most EQU directives correspond to constant, variable,
and type declarations; the PROC directive corresponds to procedure and function
declarations; and the STRUC directive corresponds to record types.
As an alternative to the built-in assembler, you can link to .OBJ files that contain
external procedures and functions. See “Linking to .OBJ files” on page 6-6 for more
information.
Register use
In general, the rules of register use in an asm statement are the same as those of an
external procedure or function. An asm statement must preserve the EDI, ESI, ESP,
EBP, and EBX registers, but can freely modify the EAX, ECX, and EDX registers. On
entry to an asm statement, BP points to the current stack frame, SP points to the top
of the stack, SS contains the segment address of the stack segment, and DS contains
the segment address of the data segment. Except for EDI, ESI, ESP, EBP, and EBX, an
asm statement can assume nothing about register contents on entry to the statement.
Labels
Labels are used in built-in assembler statements as they are in Object Pascal—by
writing the label and a colon before a statement. There is no limit to a label’s length,
but only the first 32 characters are significant. As in Object Pascal, labels must be
declared in a label declaration part in the block containing the asm statement. There
is one exception to this rule: local labels.
Local labels are labels that start with an at-sign (@). They consist of an at-sign
followed by one or more letters, digits, underscores, or at-signs. Use of local labels is
restricted to asm statements, and the scope of a local label extends from the asm
reserved word to the end of the asm statement that contains it. A local label doesn’t
have to be declared.
Instruction opcodes
The built-in assembler supports the following opcodes.
(JMP), and to all conditional jump instructions when the target is a label (not a
procedure or function).
For an unconditional jump instruction (JMP), the built-in assembler generates a short
jump (one-byte opcode followed by a one-byte displacement) if the distance to the
target label is –128 to 127 bytes. Otherwise it generates a near jump (one-byte opcode
followed by a two-byte displacement).
For a conditional jump instruction, a short jump (one-byte opcode followed by a one-
byte displacement) is generated if the distance to the target label is –128 to 127 bytes.
Otherwise, the built-in assembler generates a short jump with the inverse condition,
which jumps over a near jump to the target label (five bytes in total). For example, the
assembler statement
JC Stop
where Stop isn’t within reach of a short jump, is converted to a machine code
sequence that corresponds to this:
JNC Skip
JMP Stop
Skip:
Jumps to the entry points of procedures and functions are always near.
Assembler directives
The built-in assembler supports three assembler directives: DB (define byte), DW
(define word), and DD (define double word). Each generates data corresponding to
the comma-separated operands that follow the directive.
The DB directive generates a sequence of bytes. Each operand can be a constant
expression with a value between –128 and 255, or a character string of any length.
Constant expressions generate one byte of code, and strings generate a sequence of
bytes with values corresponding to the ASCII code of each character.
The DW directive generates a sequence of words. Each operand can be a constant
expression with a value between –32,768 and 65,535, or an address expression. For an
address expression, the built-in assembler generates a near pointer—that is, a word
that contains the offset part of the address.
The DD directive generates a sequence of double words. Each operand can be a
constant expression with a value between –2,147,483,648 and 4,294,967,295, or an
address expression. For an address expression, the built-in assembler generates a far
pointer—that is, a word that contains the offset part of the address, followed by a
word that contains the segment part of the address.
The data generated by the DB, DW, and DD directives is always stored in the code
segment, just like the code generated by other built-in assembler statements. To
generate uninitialized or initialized data in the data segment, you should use Object
Pascal var or const declarations.
Operands
Built-in assembler operands are expressions that consist of constants, registers,
symbols, and operators.
Reserved words always take precedence over user-defined identifiers. For example,
var
Ch: Char;
ƒ
asm
MOV CH, 1
end;
loads 1 into the CH register, not into the Ch variable. To access a user-defined symbol
with the same name as a reserved word, you must use the ampersand (&) override
operator:
MOV &Ch, 1
It is best to avoid user-defined identifiers with the same names as built-in assembler
reserved words.
Expressions
The built-in assembler evaluates all expressions as 32-bit integer values. It doesn’t
support floating-point and string values, except string constants.
Expressions are built from expression elements and operators, and each expression has
an associated expression class and expression type.
Expression elements
The elements of an expression are constants, registers, and symbols.
Constants
The built-in assembler supports two types of constant: numeric constants and string
constants.
Numeric constants
Numeric constants must be integers, and their values must be between –2,147,483,648
and 4,294,967,295.
By default, numeric constants use decimal notation, but the built-in assembler also
supports binary, octal, and hexadecimal. Binary notation is selected by writing a B
after the number, octal notation by writing an O after the number, and hexadecimal
notation by writing an H after the number or a $ before the number.
Numeric constants must start with one of the digits 0 through 9 or the $ character.
When you write a hexadecimal constant using the H suffix, an extra zero is required
in front of the number if the first significant digit is one of the digits A through F. For
example, 0BAD4H and $BAD4 are hexadecimal constants, but BAD4H is an identifier
because it starts with a letter.
String constants
String constants must be enclosed in single or double quotation marks. Two
consecutive quotation marks of the same type as the enclosing quotation marks count
as only one character. Here are some examples of string constants:
'Z'
'Delphi'
"That's all folks"
'"That''s all folks," he said.'
'100'
'"'
"'"
String constants of any length are allowed in DB directives, and cause allocation of a
sequence of bytes containing the ASCII values of the characters in the string. In all
other cases, a string constant can be no longer than four characters and denotes a
numeric value which can participate in an expression. The numeric value of a string
constant is calculated as
Ord(Ch1) + Ord(Ch2) shl 8 + Ord(Ch3) shl 16 + Ord(Ch4) shl 24
where Ch1 is the rightmost (last) character and Ch4 is the leftmost (first) character. If
the string is shorter than four characters, the leftmost characters are assumed to be
zero. The following table shows string constants and their numeric values.
Registers
The following reserved symbols denote CPU registers:.
When an operand consists solely of a register name, it is called a register operand. All
registers can be used as register operands, and some registers can be used in other
contexts.
The base registers (BX and BP) and the index registers (SI and DI) can be written
within square brackets to indicate indexing. Valid base/index register combinations
are [BX], [BP], [SI], [DI], [BX+SI], [BX+DI], [BP+SI], and [BP+DI]. You can also index
with all the 32-bit registers—for example, [EAX+ECX], [ESP], and [ESP+EAX+5].
The segment registers (ES, CS, SS, DS, FS, and GS) are supported, but segments are
normally not useful in 32-bit applications.
The symbol ST denotes the topmost register on the 8087 floating-point register stack.
Each of the eight floating-point registers can be referred to using ST(X), where X is a
constant between 0 and 7 indicating the distance from the top of the register stack.
Symbols
The built-in assembler allows you to access almost all Object Pascal identifiers in
assembler expressions, including constants, types, variables, procedures, and
functions. In addition, the built-in assembler implements the special symbol @Result,
which corresponds to the Result variable within the body of a function. For example,
the function
function Sum(X, Y: Integer): Integer;
begin
Result := X + Y;
end;
could be written in assembler as
function Sum(X, Y: Integer): Integer; stdcall;
begin
asm
MOV EAX,X
ADD EAX,Y
MOV @Result,EAX
end;
end;
Identifiers can be qualified within asm statements. For example, given the declarations
type
TPoint = record
X, Y: Integer;
end;
TRect = record
A, B: TPoint;
end;
var
P: TPoint;
R: TRect;
the following constructions can be used in an asm statement to access fields.
MOV EAX,P.X
MOV EDX,P.Y
MOV ECX,R.A.X
MOV EBX,R.B.Y
A type identifier can be used to construct variables on the fly. Each of the following
instructions generates the same machine code, which loads the contents of [EDX] into
EAX.
MOV EAX,(TRect PTR [EDX]).B.X
MOV EAX,TRect(EDX]).B.X
MOV EAX,TRect[EDX].B.X
MOV EAX,[EDX].TRect.B.X
Expression classes
The built-in assembler divides expressions into three classes: registers, memory
references, and immediate values.
An expression that consists solely of a register name is a register expression. Examples
of register expressions are AX, CL, DI, and ES. Used as operands, register expressions
direct the assembler to generate instructions that operate on the CPU registers.
Expressions that denote memory locations are memory references. Object Pascal’s
labels, variables, typed constants, procedures, and functions belong to this category.
Expressions that aren’t registers and aren’t associated with memory locations are
immediate values. This group includes Object Pascal’s untyped constants and type
identifiers.
Immediate values and memory references cause different code to be generated when
used as operands. For example,
const
Start = 10;
var
Count: Integer;
ƒ
asm
MOV EAX,Start { MOV EAX,xxxx }
EBX,Count { MOV EBX,[xxxx] }
MOV ECX,[Start] { MOV ECX,[xxxx] }
MOV EDX,OFFSET Count { MOV EDX,xxxx }
end;
Because Start is an immediate value, the first MOV is assembled into a move
immediate instruction. The second MOV, however, is translated into a move memory
instruction, as Count is a memory reference. In the third MOV, the brackets convert
Start into a memory reference (in this case, the word at offset 10 in the data segment).
In the fourth MOV, the OFFSET operator converts Count into an immediate value
(the offset of Count in the data segment).
The brackets and OFFSET operator complement each other. The following asm statement
produces identical machine code to the first two lines of the previous asm statement.
asm
MOV EAX,OFFSET [Start]
MOV EBX,[OFFSET Count]
end;
Memory references and immediate values are further classified as either relocatable or
absolute. Relocation is the process by which the linker assigns absolute addresses to
symbols. A relocatable expression denotes a value that requires relocation at link
time, while an absolute expression denotes a value that requires no such relocation.
Typically, expressions that refer to labels, variables, procedures, or functions are
relocatable, since the final address of these symbols is unknown at compile time.
Expressions that operate solely on constants are absolute.
The built-in assembler allows you to carry out any operation on an absolute value, but
it restricts operations on relocatable values to addition and subtraction of constants.
Expression types
Every built-in assembler expression has a type—or, more correctly, a size, because the
assembler regards the type of an expression simply as the size of its memory location.
For example, the type of an Integer variable is four, because it occupies 4 bytes. The
built-in assembler performs type checking whenever possible, so in the instructions
var
QuitFlag: Boolean;
OutBufPtr: Word;
ƒ
asm
MOV AL,QuitFlag
MOV BX,OutBufPtr
end;
the assembler checks that the size of QuitFlag is one (a byte), and that the size of
OutBufPtr is two (a word). The instruction
MOV DL,OutBufPtr
produces an error because DL is a byte-sized register and OutBufPtr is a word. The
type of a memory reference can be changed through a typecast; these are correct
ways of writing the previous instruction:
MOV DL,BYTE PTR OutBufPtr
MOV DL,Byte(OutBufPtr)
MOV DL,OutBufPtr.Byte
These MOV instructions all refer to the first (least significant) byte of the OutBufPtr
variable.
In some cases, a memory reference is untyped. One example is an immediate value
enclosed in square brackets:
MOV AL,[100H]
MOV BX,[100H]
The built-in assembler permits both of these instructions, because the expression
[100H] has no type—it just means “the contents of address 100H in the data
segment,” and the type can be determined from the first operand (byte for AL, word
for BX). In cases where the type can’t be determined from another operand, the built-
in assembler requires an explicit typecast:
INC BYTE PTR [100H]
IMUL WORD PTR [100H]
The following table summarizes the predefined type symbols that the built-in
assembler provides in addition to any currently declared Object Pascal types.
Expression operators
The built-in assembler provides a variety of operators. Precedence rules are different
from Object Pascal; for example, in an asm statement, AND has lower precedence
than the addition and subtraction operators. The following table lists the built-in
assembler’s expression operators in decreasing order of precedence.
• The automatically generated entry and exit code for the routine looks like this:
PUSH EBP ;Present if Locals <> 0 or Params <> 0
MOV EBP,ESP ;Present if Locals <> 0 or Params <> 0
SUB ESP,Locals ;Present if Locals <> 0
ƒ
MOV ESP,EBP ;Present if Locals <> 0
POP EBP ;Present if Locals <> 0 or Params <> 0
RET Params ;Always present
If locals include variants, long strings, or interfaces, they are initialized to zero but
not finalized.
• Locals is the size of the local variables and Params is the size of the parameters. If
both Locals and Params are zero, there is no entry code, and the exit code consists
simply of a RET instruction.
Assembler functions return their results as follows.
• Ordinal values are returned in AL (8-bit values), AX (16-bit values), or EAX (32-bit
values).
• Real values are returned in ST(0) on the coprocessor’s register stack. (Currency
values are scaled by 10000.)
• Pointers, including long strings, are returned in EAX.
• Short strings and variants are returned in the temporary location pointed to by
@Result.
A
Object Pascal grammar
Appendix A
Index I-1
begin (reserved word) 3-2, 4-19, carriage-return 4-1, 4-5 Close function 8-4, 8-6
6-2, 6-3 case (reserved word) 4-23, 5-21 CloseFile function 8-5
binary operators 4-6 case statements 4-23 CloseFile procedure 8-6
binding case-sensitivity 4-1, 4-2, 6-7 CmdLine variable 9-5
fields 7-7 -cc compiler switch 8-3 colon See Symbols
methods 7-9 cdecl (calling convention) 6-4, COM 5-12, 10-1, 10-3
bitwise operators,not 4-8 12-2 See also Automation
blanks 4-1 constructors and error handling 6-5
BlockRead procedure 8-4 destructors 12-4 interfaces 10-1
blocks 4-27 Self 12-3 OleVariant 5-33
function 3-4, 6-1, 6-3 Char type 5-4, 5-12, 5-26, 11-3 out parameters 6-12
library 9-4 character operators 4-9 safecall 6-5
outer and inner 4-28 character sets variants and 5-29, 5-32, 11-11
procedure 3-4, 6-1, 6-2 ANSI 5-4, 5-11, 5-12 comma See Symbols
program 3-1, 3-2 extended 5-12 comments 4-1, 4-5
scope 4-27 to 4-28 multibyte (MBCS) 5-12 ComObj unit 7-5, 10-11
try...except 7-26, 7-28 Pascal 4-1, 4-2, 4-4 Comp type 5-8, 5-9, 11-5
try...finally 7-30 single-byte (SBCS) 5-12 comparison
BlockWrite procedure 8-4 character strings 4-1, 4-4, 5-42 classes 4-11
body (routine) 6-1 characters class-reference types 4-11
boldface 1-2 pointers 5-26 dynamic arrays 5-18
Boolean operators 4-7 string literals as 4-5, 5-5 integer types 4-11
complete vs. partial types 5-4, 11-3 objects 4-11
evaluation 4-7 wide 5-12, 11-3 packed strings 4-11
Boolean type 5-5, 11-3 checked typecasts PChar type 4-11
Boolean types 5-5, 11-3 interfaces 10-9 real types 4-11
BORLANDMM.DLL 9-6 objects 7-24 relational operators 4-10
.BPL files 2-3, 9-7, 9-9 Chr function 5-5 strings 4-11, 5-10
braces See Symbols circular references compiler 2-2, 2-3, 2-5, 3-1
brackets See Symbols packages 9-8 command-line 2-3 to 2-5
Break procedure 4-24 units 3-7 to 3-8 directives 3-2, 4-5
exception handlers 7-27 circumflex See Symbols packages 9-9
in try...finally block 7-30 classes 7-1 to 7-30 compile-time binding See static
BSTR type (COM) 5-12 class methods 7-1, 7-24 methods
built-in assembler 13-1 to 13-17 class references 7-22 complete evaluation 4-7
built-in types 5-1 class types 7-1 components, of classes See
by reference (parameters) 6-10, comparison 4-11 members
6-11, 10-12, 12-1 compatibility 7-3, 10-9 compound statements 4-19
by value (parameters) 6-10, declaring class types 7-1, 7-4, concatenation (strings) 4-9
10-12, 12-1 7-6, 7-7, 7-8, 7-16, 10-5 conditional statements 4-19
Byte type 5-4, 11-3 files and 5-23 conjunction 4-7
assembler 13-14 memory 11-9 console applications 2-3, 8-3
ByteArray type 5-26 metaclasses 7-22 const (reserved word) 5-38,
ByteBool type 5-5, 11-3 operators 4-11, 7-23 5-41, 6-9, 6-10, 6-11, 6-15, 12-1
scope 4-28 constant expression
C variants and 5-29 array constants 5-41
Classes unit 7-9, 7-22 case statements 4-23
C++ 10-1, 11-10 ClassParent method 7-23 constant declarations 5-38,
calling conventions 5-28, 6-4, class-reference types 7-22 5-41
12-1 comparison 4-11 default paramters 6-16
access specifiers 6-5, 7-17 constructors and 7-22 defined 5-39
DLLs 9-3 memory 11-10 initializing variables 5-36
interfaces 10-3, 10-6 variants and 5-29 subrange types 5-7, 5-8
methods 12-3 ClassType method 7-23 type 5-39, 6-8
Cardinal type 5-3 clients 3-4
caret See Symbols
Index I-3
.DRC files 2-3 declaring 7-25 Finalize procedure 5-18
.DSK files 2-2 destroying 7-26, 7-27 finally (reserved word) 7-30
.DTI files 2-2 DLLs 9-5, 9-6 floating-point types See real
dual interfaces 10-3, 10-12 file I/O 8-3 types
methods 6-5 handling 7-26, 7-28, 7-30 Flush function 8-4, 8-6
DWORD type (assembler) 13-14 in initialization section 7-26 for statements 4-19, 4-24, 4-25
dynamic arrays 5-17, 11-7 nested 7-29 form files 2-2, 2-5 to 2-7, 7-5,
assigning to 5-18 propagation 7-27, 7-29, 7-30 7-20
comparison 5-18 raising 7-25 formal parameters 6-17
files and 5-23 re-raising 7-28 forward declarations
in DLLs 9-6 standard exceptions 7-30 classes 7-6
memory management 11-2 standard routines 7-30 default parameters 6-17
multidimensional 5-19 ExceptObject function 7-30 interfaces 10-3
open array parameters .EXE files 2-3 overloading and 6-8
and 6-14 Exit procedure 6-1 routines 3-4, 6-5
records and 5-22 exception handlers 7-27 Free method 7-14
truncating 5-18 in try...finally block 7-30 FreeLibrary function 9-2
variants and 5-29 exit procedures 9-4, 12-4 to 12-5 FreeMem procedure 5-37, 9-6,
dynamic methods 7-9, 7-10 packages and 12-4 11-1, 11-2
dynamic variables 5-37 ExitCode variable 9-4, 12-5 functions 3-4, 6-1 to 6-18
and pointer constants 5-42 ExitProc variable 9-4, 9-5, 12-4 assembler 13-16
in DLLs 9-6 export (directive) 6-5 calling externally 6-6
dynamically loaded DLLs 9-2 exports clause 4-27, 9-4 declaring 6-3, 6-5
dynamic-link libraries See DLLs overloaded routines 9-4 function calls 4-13, 4-17, 6-1,
expressions 4-1, 4-5 6-17 to 6-18
E assembler 13-7 to 13-16 nested 5-28, 6-9
extended syntax 4-5 overloading 6-6, 6-7
E (in numerals) 4-4 Extended type 4-7, 5-8, 5-9, pointers 4-11, 5-27
else (reserved word) 4-21, 4-23, 5-26, 11-5 return type 6-3, 6-4
7-27 external (directive) 6-6, 9-1, 9-2 return value 6-3, 6-4
empty set 5-16 return values in
end (reserved word) 3-2, 4-19, F registers 12-3, 13-17
4-23, 5-20, 5-21, 6-2, 6-3, 7-2, fundamental types 5-1
7-27, 7-30, 9-7, 10-1, 10-10, 13-1 False 5-5, 11-3
end-of-line character 4-1, 8-3 far (directive) 6-5 G
enumerated types 5-6, 11-3 fields 5-20 to 5-23, 7-1, 7-7
Eof function 8-5 See also records, classes -$G- compiler switch 9-10
Eoln function 8-5 publishing 7-5 $G directive 9-9
equality operator 4-10 file (reserved word) 5-23 generic types 5-1
error handling See exceptions file I/O 8-1 to 8-6 GetHeapStatus function 11-2
ErrorAddr variable 12-5 exceptions 8-3 GetMem procedure 5-25, 5-37,
EStackOverflow exception 11-2 file variables 8-2 9-6, 11-1, 11-2
EVariantError exception 5-31 FilePos function 8-2 GetMemoryManager
event handlers 2-7, 7-5 files procedure 11-2
events 2-7, 7-5 as parameters 6-10 GetProcAddress function 9-2
example programs 2-3 to 2-7 file types 5-23, 8-2 getter See read specifier
except (reserved word) 7-27 generated 2-2, 2-3, 9-8, 9-9 global identifiers 4-27
ExceptAddr function 7-30 initializing 5-37 global variables 5-36
Exception class 7-25, 7-30 memory 11-8 DLLs 9-5
exception handlers 7-25, 7-27 source code 2-1 interfaces 10-9
identifiers in 7-28 text 8-2, 8-3 memory management 11-2
ExceptionInformation typed 5-23, 8-2 GlobalAlloc 11-1
variable 9-6 untyped 5-24, 8-2, 8-4 globally unique identifiers See
exceptions 4-19, 7-13, 7-14, 7-25 variants and 5-29 GUIDs
to 7-30 FileSize function 8-2 goto statements 4-18
constructors 7-26, 7-30 finalization section 3-3, 3-5, 12-4 grammar (formal) A-1 to A-6
Index I-5
less-than See Symbols method resolution clauses 10-5, nested routines 5-28, 6-9
libraries See DLLs 10-6 New procedure 5-18, 5-25, 5-37,
library (reserved word) 9-3 methods 7-1, 7-2, 7-8 to 7-16 7-4, 9-6, 11-1, 11-2
Library search path 3-6 abstract 7-11 nil 5-26, 5-29, 11-5
line-feed 4-5 Automation 7-6, 10-12 nodefault specifier 7-6, 7-16,
-$LN- compiler switch 9-10 binding 7-9 7-20
LoadLibrary function 9-2 calling conventions 12-3 not 4-6, 4-7
local identifiers 4-27 class methods 7-1, 7-24 Null (variants) 5-30, 5-31, 5-32
local variables 5-36, 6-8 constructors 7-12, 12-4 null character 5-12, 11-6, 11-9
memory management 11-2 destructors 7-14, 12-4 null string 4-4
LocalAlloc 11-1 dispatch interface 10-11 null-terminated strings 5-12 to
logical operators 4-8 dispatching calls 7-11 5-15, 5-26, 11-6
long strings 4-9, 5-9, 5-11 dual-interface 6-5 mixing with Pascal
files and 5-23 dynamic 7-9, 7-10 strings 5-14
in DLLs 9-6 implementation 7-8 standard routines 8-6, 8-7
memory management 11-2, overloading 7-12 numerals 4-1, 4-4
11-5 overriding 7-10, 7-11, 10-5 as labels 4-4, 4-18
records and 5-22 pointers 4-11, 5-27 assembler 13-8
LongBool type 5-5, 11-3 publishing 7-5 type 5-39, 6-8
Longint type 5-3, 5-4, 11-3 static 7-9
Longword type 5-4, 11-3 virtual 7-6, 7-9, 7-10 O
loop statements 4-19, 4-24 $MINSTACKSIZE
Low function 5-3, 5-4, 5-11, directive 11-2 .OBJ files
5-17, 5-19, 6-14 minus See Symbols calling routines in 6-6
-$LU- compiler switch 9-10 mod 4-6 Object Inspector (Delphi) 7-5
modules See units object interfaces See interfaces,
M multibyte character sets 5-12 COM, CORBA
string-handling routines 8-7 object types 7-3
$M directive 7-4, 7-5 multidimensional arrays 5-17, objects 4-20, 7-1
main form 2-5 to 2-7 5-19, 5-41 See also classes
$MAXSTACKSIZE multiple unit references 3-6 to ’of object’ 5-27
directive 11-2 3-7 comparison 4-11
members See sets multiplication 4-6 files and 5-23
members, of classes 7-1 multithreaded applications 5-38 memory 11-9
interfaces 10-2 DLLs 9-5 of (reserved word) 4-23, 5-16,
visibility 7-4 mutually dependent classes 7-6 5-17, 5-23, 5-27, 6-13, 6-15, 7-22
memory 4-1, 5-2, 5-24, 5-25, mutually dependent units 3-7 of object (method pointers) 5-27
5-30, 5-37, 7-14 OleAuto unit 7-5
DLLs 9-5 N OleVariant type 5-26, 5-33
heap 5-37 on (reserved word) 7-27
management 11-1 to 11-11 name (directive) 6-7, 9-4 opcodes (assembler) 13-2, 13-3
overlays (in records) 5-22 named parameters 10-12 open array constructors 6-15,
shared memory manager 9-6 names 6-18
memory references See also identifiers open array parameters 6-13,
(assembler) 13-12 exported routines (DLLs) 9-4 6-18
message (directive) 7-15 functions 6-3, 6-4 and dynamic arrays 6-14
interfaces 10-6 identifiers 4-16 Open function 8-4, 8-5
message dispatching 7-15 packages 9-8 OpenString 6-13
message handlers 7-15 programs 3-1, 3-2 operands 4-6
inherited 7-15 units 3-3, 3-6 operators 4-6 to 4-12
overriding 7-15 naming conflicts 3-6, 4-28 assembler 13-14
Message property 7-30 near (directive) 6-5 class 7-23
Messages unit 7-15, 7-16 negation 4-7 precedence 4-12, 7-24
metaclasses 7-22 bitwse 4-8 or 4-7, 4-8
method pointers 4-11, 5-27 nested conditionals 4-22 Ord function 5-3, 5-4
nested exceptions 7-29 ordinal types 5-2 to 5-8
Index I-7
as parameters 7-16 readonly (directive) 10-11 resource strings 5-40
declaring 7-16, 7-18 read-only properties 7-18 resourcestring (reserved
default 7-19, 10-2 real (floating-point) word) 5-40
interfaces 10-3 operators 4-6 Result variable 6-3, 6-4
overriding 7-6, 7-20 Real type 5-9 RET instruction 13-4
read-only 7-18 real types 5-8, 11-3 return type (functions) 6-3, 6-4
write-only 7-18 comparison 4-11 return value (functions) 6-3, 6-4
protected class members 7-4, conversion 4-14 constructors 7-13
7-5 publishing 7-5 Rewrite procedure 8-2, 8-4, 8-5,
prototypes 6-1 Real48 type 5-8, 5-9, 7-5, 11-4 8-6
PShortString type 5-26 $REALCOMPATIBILITY Round function 5-4
PString type 5-26 directive 5-9 routines 6-1 to 6-18
PTextBuf type 5-26 ReallocMem procedure 5-37, See also functions, procedures
Ptr function 5-25 11-1 exporting 9-4
public class members 7-4, 7-5 records 4-20, 5-20 to 5-23 standard 8-1 to 8-10
public identifiers (interface constants 5-41 .RPS files 2-2
section) 3-4 memory 11-7 RTTI 7-5, 7-12, 7-20
published class members 7-4, record types 5-20 $RUNONLY directive 9-10
7-5 scope 4-28, 5-21 runtime binding See dynamic
$M directive 7-5 variant parts 5-21 to 5-23 methods, virtual methods
restrictions 7-5 variants and 5-29 runtime packages 9-7
PVariant type 5-26 recursive procedure and runtime type information See
PVarRec type 5-26 function calls 6-1, 6-4 RTTI
PWideChar type 5-12, 5-13, 5-26 reference-counting 5-11, 10-9,
PWideString type 5-26 11-6, 11-7 S
PWordArray type 5-26 register (calling
convention) 6-4, 7-6, 7-13, $S directive 11-2
Q 7-14, 12-2 safecall (calling convention) 6-4,
constructors and 12-2
qualified identifiers 3-6, 4-2, destructors 12-4 constructors and
4-28, 5-21 DLLs 9-3 destructors 12-4
in typecasts 4-14, 4-15 interfaces 10-3, 10-6 dual interfaces 10-12
pointers 5-25 Self 12-3 interfaces 10-3
with Self 7-9 registers 6-4, 6-5, 12-2, 12-3 Self 12-3
querying (interfaces) 10-9 assembler 13-2, 13-10, 13-12, scope 4-27 to 4-28
QueryInterface method 10-2, 13-17 classes 7-2
10-5, 10-10 reintroduce (directive) 7-11, records 5-21
quotation marks See Symbols 7-12 type identifiers 5-35
quoted strings 4-4, 5-42 relational operators 4-10 Seek procedure 8-2
assembler 13-9 _Release method 10-2, 10-5, SeekEof function 8-5
QWORD type (assembler) 13-14 10-9 SeekEoln function 8-5
relocatable expressions Self 7-9
R (assembler) 13-13 calling conventions 12-3
Rename procedure 8-6 class methods 7-24
raise (reserved word) 4-19, 7-25, semicolon See Symbols
repeat statements 4-19, 4-24
7-27, 7-28 separators 4-1, 4-5
requires clause 9-7, 9-8
range-checking 5-4, 5-5, 5-8 SetLength procedure 5-10, 5-15,
.RES files 2-2, 3-2
Read procedure 8-2, 8-3, 8-4, 5-17, 5-19, 6-14
reserved words 4-1, 4-2, 4-3
8-5, 8-6 SetMemoryManager
See also directives
read specifier 7-6, 7-16 procedure 11-2
assembler 13-7
array properties 7-18 sets
list 4-3
index specifier and 7-19 empty 5-16
Reset procedure 8-2, 8-4, 8-5,
object interfaces 10-1, 10-3, memory 11-6
8-6
10-6 operators 4-10
resident (directive) 9-4
overloading 7-12, 7-17 publishing 7-5
resource files 2-2, 2-3, 3-2
Readln procedure 8-5, 8-6 set constructors 4-13
Index I-9
types 5-1 to 5-36 units 2-1, 3-1 to 3-8 variant arrays 5-30
array 5-16 to 5-20, 11-7 scope 4-28 variant open array
assembler 13-13 syntax 3-3 to 3-8 parameters 6-15, 6-18
assignment- until (reserved word) 4-24 variant parts (records) 5-21 to
compatibility 5-34 untyped files 5-24, 8-2, 8-4 5-23
automatable 7-6, 10-11 untyped parameters 6-12 variants 5-29 to 5-33
Boolean 5-5, 11-3 UpCase function 5-10 and Automation 11-11
built-in 5-1 uses clause 2-1, 3-1, 3-2, 3-4, 3-5 conversions 5-30, 5-30 to
character 5-4, 11-3 to 3-8 5-32
class 7-1, 7-4, 7-6, 7-7, 7-8, interface section 3-7 files and 5-23
7-16, 11-9 ShareMem 9-6 initializing 5-30, 5-37
classification 5-1 syntax 3-5 interfaces and 10-9
class-reference 7-22, 11-10 System unit and 8-1 memory management 11-2,
compatibility 5-15, 5-28, 5-34 SysUtils unit and 8-1 11-10
constants 5-39 non-Delphi functions 11-11
declared 5-1 V OleVariant 5-33
declaring 5-35 operators 4-6, 5-32
dispatch interface 10-10 Val procedure 8-6 records and 5-22
enumerated 5-6, 11-3 value parameters 6-10, 6-17, typecasts 5-30
exception 7-25 12-1 variant arrays 5-32
file 5-23, 11-8 open array constructors 6-18 variant arrays and
fundamental 5-1 value typecasts 4-14 strings 5-32
generic 5-1 var (reserved word) 5-36, 6-9, Variant type 5-26, 5-29
identity 5-33 6-10, 12-1 variant types 5-29 to 5-33
integer 5-3, 11-2 VarArrayCreate function 5-32 varOleString constant 5-32
interface 10-1 to 10-4 VarArrayDimCount varString constant 5-32
internal data formats 11-2 to function 5-32 VarType function 5-30
11-11 VarArrayHighBound varTypeMask constant 5-30
object 7-3 function 5-32 VCL 1-1, 2-5
ordinal 5-2 to 5-8 VarArrayLock function 5-32, virgule See Symbols
pointer 5-26 10-11 virtual method table 11-9
predefined 5-1 VarArrayLowBound virtual methods 7-9, 7-10
procedural 5-27 to 5-29, 11-9 function 5-32 Automation 7-6
real 5-8, 11-3 VarArrayOf function 5-32 constructors 7-14
record 5-20 to 5-23, 11-7 VarArrayRedim function 5-32 overloading 7-12
scope 5-35 VarArrayRef function 5-32 VirtualAlloc function 11-1
set 5-16, 11-6 VarArrayUnlock VirtualFree function 11-1
simple 5-2 procedure 5-32, 10-11 visibility (class members) 7-4
string 5-9 to 5-15, 11-5, 11-6 VarAsType function 5-30 interfaces 10-2
structured 5-15 VarCast procedure 5-30 Visual Component Library See
subrange 5-7 variable (var) parameters 6-10, VCL
type identity 5-33 6-17, 12-1 VMT 11-9
user-defined 5-1 variable parameters 6-17
variant 5-29 to 5-33 variable typecasts 4-14 W
typographical conventions 1-2 variables 4-6, 5-36 to 5-38
absolute addresses 5-37 $WEAKPACKAGEUNIT
U declaring 5-36 directive 9-9
dynamic 5-37 while statements 4-19, 4-24,
unary operators 4-6 file 8-2 4-25
Unassigned (variants) 5-30, from DLLs 9-1 wide characters and
5-31, 5-32 global 5-36, 10-9 strings 5-12
underscores 4-2 heap-allocated 5-37 memory management 11-2
Unicode 5-4, 5-12 initializing 5-36, 5-37 standard routines 8-7
union (sets) 4-10 local 5-36, 6-8 WideChar type 4-9, 5-4, 5-10,
UniqueString procedure 5-15 memory management 11-2 5-12, 5-26, 11-3
unit files 2-1, 3-1, 3-3 thread 5-38
Index I-11
I-12 Object Pascal Language Guide