home *** CD-ROM | disk | FTP | other *** search
- TABLE OF CONTENTS "SYSTEM"
- --------------------------
-
- Chapter 1 "HARDWARE"
- --------------------
- 1.1 INTRODUCTION
- 1.2 AMIGA MODELS
- 1.2.1 AMIGA 1000
- 1.2.2 AMIGA 2000
- 1.2.3 AMIGA 500
- 1.2.4 AMIGA 3000
- 1.2.5 AMIGA 500+
- 1.2.6 AMIGA 600
- 1.2.7 FUTURE MODELS
- 1.3 PROCESSORS AND SPECIAL CHIPS
- 1.3.1 MOTOROLA MC680X0 PROCESSORS
- 1.3.2 BLITTER
- 1.3.3 COPPER
- 1.3.4 AUDIO CHANNELS
- 1.3.5 HARDWARE SPRITES
- 1.3.6 COMPLEX INTERFACE ADAPTOR (CIA)
- 1.3.7 DMA
- 1.3.8 THE ENHANCED CHIP SET
- 1.4 AMIGA DOS V2.0
- 1.5 MEMORY
- 1.5.1 CHIP
- 1.5.2 SLOW
- 1.5.3 FAST
- 1.6 HIT THE HARDWARE
- 1.6.1 GET ACCESS TO THE CUSTOM CHIPS
- 1.6.2 GET ACCESS TO THE CIA CHIPS
- 1.7 EXAMPLES
-
-
-
- Chapter 2 "AMIGA DOS"
- ---------------------
- 2.1 INTRODUCTION
- 2.1.1 PHYSICAL DEVICES
- 2.1.2 VOLUMES
- 2.1.3 DIRECTORIES/SUBDIRECTORIES/FILES
- 2.1.4 LOGICAL DEVICES
- 2.2 OPEN AND CLOSE FILES
- 2.3 READ AND WRITE FILES
- 2.3.1 READ()
- 2.3.2 WRITE()
- 2.4 MOVE INSIDE FILES
- 2.5 FILES AND MULTITASKING
- 2.6 OTHER USEFUL FUNCTIONS
- 2.6.1 CREATE DIRECTORIES
- 2.6.2 DELETE FILES AND DIRECTORIES
- 2.6.3 RENAME FILES AND DIRECTORIES
- 2.6.4 ATTACH COMMENTS TO FILES AND DIRECTORIES
- 2.6.5 PROTECT FILES AND DIRECTORIES
- 2.7 EXAMINE FILES AND DIRECTORIES
- 2.7.1 FILEINFOBLOCK AND DATESTAMP STRUCTURE
- 2.7.2 EXAMINE()
- 2.7.3 4 BYTE BOUNDARY
- 2.7.4 EXAMPLE
- 2.7.5 EXAMINE FILES/SUBDIRECTORIES IN A DIRECTORY/DEVICE
- 2.7.5.1 EXNEXT()
- 2.7.5.2 ERROR MESSAGES
- 2.7.5.3 EXAMPLE
- 2.8 FUNCTIONS
- 2.9 EXAMPLES
-
-
-
- Chapter 3 "LISTS"
- -----------------
- 3.1 INTRODUCTION
- 3.2 THE LIST
- 3.2.1 THE LIST STRUCTURE
- 3.2.2 INITIALIZE THE LIST STRUCTURE
- 3.2.3 MINI LISTS
- 3.3 NODES
- 3.3.1 THE NODE STRUCTURE
- 3.3.2 INITIALIZE THE NODE STRUCTURE
- 3.3.3 CREATE A COMPLETE NODE
- 3.3.4 MINI NODES
- 3.4 INSERT AND REMOVE LISTS
- 3.4.1 INSERT NODES INTO A LIST
- 3.4.1.1 INSERT NODES AT THE HEAD OF A LIST
- 3.4.1.2 INSERT NODES AT THE TAIL OF A LIST
- 3.4.2 REMOVE NODES FROM A LIST
- 3.4.2.1 REMOVE NODES AT THE HEAD OF A LIST
- 3.4.2.2 REMOVE NODES AT THE TAIL OF A LIST
- 3.4.3 FIFO AND LIFO
- 3.4.4 INSERT NODES CONSIDERING THEIR PRIORITIES
- 3.5 WORK WITH THE LISTS
- 3.5.1 IS THE LIST EMPTY?
- 3.5.2 SCAN THROUGH A LIST
- 3.5.3 SEARCH FOR A NODE WITH A SPECIAL NAME
- 3.6 A COMPLETE EXAMPLE
- 3.7 FUNCTIONS
- 3.8 EXAMPLES
-
-
-
- Chapter 4 "MESSAGES"
- --------------------
- 4.1 INTRODUCTION
- 4.2 EXEC'S MESSAGE SYSTEM
- 4.2.1 MESSAGES
- 4.2.2 PREPARE MESSAGES
- 4.2.3 MESSAGE PORTS
- 4.2.4 PREPARE MESSAGE PORTS
- 4.2.5 FIND OTHER TASK'S MESSAGE PORTS
- 4.2.6 SEND MESSAGES
- 4.2.7 WAITING FOR MESSAGES TO ARRIVE
- 4.2.8 COLLECT MESSAGES
- 4.2.9 REPLY
- 4.3 EXAMPLE
- 4.3.1 PROGRAM A
- 4.3.2 PROGRAM B
- 4.4 FUNCTIONS
- 4.5 EXAMPLES
-
-
-
- Chapter 5 "Dirty Input"
- -----------------------
- 5.1 INTRODUCTION
- 5.2 PROGRAMS
-
-