Dope vector
Encyclopedia
In computer programming
, a dope vector is a data structure
used to hold information about a data object, e.g. an array, especially its memory layout
.
A dope vector typically contains information about the type of array element, rank of an array
, the extents of an array, and the stride of an array
as well as a pointer to the block in memory containing the array elements.
It is often used in compilers to pass entire arrays between procedures in a high level language like Fortran
.
Prior to the invention of the linked-list a dope vector was used internally in the internal structure of computer systems.
The dope vector included a identifier, a length, a parent address, and a next child address. The identifier was an assigned name and was mostly useless, but the length was the amount of allocated storage to this vector from the end of the dope vector that contained data of use to the internal processes of the computer. This length by many was called the offset, span of vector length. The parent and child references were absolute core references, or register and offset settings to the parent or child depending on the type of computer.
Dope vectors were managed internally by the operating system and allowed the processor to allocate and de-allocate storage in specific segments as needed.
Later dope vectors had a status bit that told the system if they were active; if it was not active it would be reallocated when needed. Using this technology the computer could perform a more granular memory management.
Computer programming
Computer programming is the process of designing, writing, testing, debugging, and maintaining the source code of computer programs. This source code is written in one or more programming languages. The purpose of programming is to create a program that performs specific operations or exhibits a...
, a dope vector is a data structure
Data structure
In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks...
used to hold information about a data object, e.g. an array, especially its memory layout
Computer storage
Computer data storage, often called storage or memory, refers to computer components and recording media that retain digital data. Data storage is one of the core functions and fundamental components of computers....
.
A dope vector typically contains information about the type of array element, rank of an array
Rank (computer programming)
In computer programming, rank with no further specifications is usually a synonym for "number of dimensions"; thus, a bi-dimensional array has rank two, a three-dimensional array has rank three and so on....
, the extents of an array, and the stride of an array
Stride of an array
In computer programming, the stride of an array refers to the number of locations in memory between successive array elements, measured in bytes or in units of the size of the array's elements....
as well as a pointer to the block in memory containing the array elements.
It is often used in compilers to pass entire arrays between procedures in a high level language like Fortran
Fortran
Fortran is a general-purpose, procedural, imperative programming language that is especially suited to numeric computation and scientific computing...
.
Prior to the invention of the linked-list a dope vector was used internally in the internal structure of computer systems.
The dope vector included a identifier, a length, a parent address, and a next child address. The identifier was an assigned name and was mostly useless, but the length was the amount of allocated storage to this vector from the end of the dope vector that contained data of use to the internal processes of the computer. This length by many was called the offset, span of vector length. The parent and child references were absolute core references, or register and offset settings to the parent or child depending on the type of computer.
Dope vectors were managed internally by the operating system and allowed the processor to allocate and de-allocate storage in specific segments as needed.
Later dope vectors had a status bit that told the system if they were active; if it was not active it would be reallocated when needed. Using this technology the computer could perform a more granular memory management.