Library (computing)

Short description: Collection of non-volatile resources used by computer programs

Illustration of an application which uses libvorbisfile to play an Ogg Vorbis file

In computer science, a library is a collection of non-volatile resources used by computer programs, often for software development. These may include configuration data, documentation, help data, message templates, pre-written code and subroutines, classes, values or type specifications. In IBM's OS/360 and its successors they are referred to as partitioned data sets.

A library is also a collection of implementations of behavior, written in terms of a language, that has a well-defined interface by which the behavior is invoked. For instance, people who want to write a higher-level program can use a library to make system calls instead of implementing those system calls over and over again. In addition, the behavior is provided for reuse by multiple independent programs. A program invokes the library-provided behavior via a mechanism of the language. For example, in a simple imperative language such as C, the behavior in a library is invoked by using C's normal function-call. What distinguishes the call as being to a library function, versus being to another function in the same program, is the way that the code is organized in the system.[1]

Library code is organized in such a way that it can be used by multiple programs that have no connection to each other, while code that is part of a program is organized to be used only within that one program. This distinction can gain a hierarchical notion when a program grows large, such as a multi-million-line program. In that case, there may be internal libraries that are reused by independent sub-portions of the large program. The distinguishing feature is that a library is organized for the purposes of being reused by independent programs or sub-programs, and the user only needs to know the interface and not the internal details of the library.

The value of a library lies in the reuse of standardized program elements. When a program invokes a library, it gains the behavior implemented inside that library without having to implement that behavior itself. Libraries encourage the sharing of code in a modular fashion and ease the distribution of the code.

The behavior implemented by a library can be connected to the invoking program at different program lifecycle phases. If the code of the library is accessed during the build of the invoking program, then the library is called a static library.[2] An alternative is to build the executable of the invoking program and distribute that, independently of the library implementation. The library behavior is connected after the executable has been invoked to be executed, either as part of the process of starting the execution, or in the middle of execution. In this case the library is called a dynamic library (loaded at runtime). A dynamic library can be loaded and linked when preparing a program for execution, by the linker. Alternatively, in the middle of execution, an application may explicitly request that a module be loaded.

Most compiled languages have a standard library, although programmers can also create their own custom libraries. Most modern software systems provide libraries that implement the majority of the system services. Such libraries have organized the services which a modern application requires. As such, most code used by modern applications is provided in these system libraries.

## Contents

* 1 History
* 2 Linking
* 3 Relocation
* 4 Static libraries
* 5 Shared libraries
* 6 Object libraries
* 7 Class libraries
* 8 Remote libraries
* 9 Code generation libraries
* 10 File naming
* 10.1 Most modern Unix-like systems
* 10.2 macOS
* 10.3 Microsoft Windows
* 11 CAD library
* 12 See also
* 13 Notes
* 14 References
* 15 Further reading

## History

The idea of a computer library dates back to the first computers created by Charles Babbage. An 1888 paper on his Analytical Engine suggested that computer operations could be punched on separate cards from numerical input. If these operation punch cards were saved for reuse then "by degrees the engine would have a library of its own."[3]

A woman working next to a filing cabinet containing the subroutine library on reels of punched tape for the EDSAC computer.

In 1947 Goldstine and von Neumann speculated that it would be useful to create a "library" of subroutines for their work on the IAS machine, an early computer that was not yet operational at that time.[4] They envisioned a physical library of magnetic wire recordings, with each wire storing reusable computer code.[5]

Inspired by von Neumann, Wilkes and his team constructed EDSAC. A filing cabinet of punched tape held the subroutine library for this computer.[6] Programs for EDSAC consisted of a main program and a sequence of subroutines copied from the subroutine library.[7] In 1951 the team published the first textbook on programming, The Preparation of Programs for an Electronic Digital Computer, which detailed the creation and the purpose of the library.[8]

COBOL included "primitive capabilities for a library system" in 1959,[9] but Jean Sammet described them as "inadequate library facilities" in retrospect.[10]

JOVIAL had a Communication Pool (COMPOOL), roughly a library of header files.

Another major contributor to the modern library concept came in the form of the subprogram innovation of FORTRAN. FORTRAN subprograms can be compiled independently of each other, but the compiler lacked a linker. So prior to the introduction of modules in Fortran-90, type checking between FORTRAN[NB 1] subprograms was impossible.[11]

By the mid 1960s, copy and macro libraries for assemblers were common. Starting with the popularity of the IBM System/360, libraries containing other types of text elements, e.g., system parameters, also became common.

Simula was the first object-oriented programming language, and its classes were nearly identical to the modern concept as used in Java, C++, and C#. The class concept of Simula was also a progenitor of the package in Ada and the module of Modula-2.[12] Even when developed originally in 1965, Simula classes could be included in library files and added at compile time.[13]

## Linking

Main articles: Link time and Linker (computing)

Libraries are important in the program linking or binding process, which resolves references known as links or symbols to library modules. The linking process is usually automatically done by a linker or binder program that searches a set of libraries and other modules in a given order. Usually it is not considered an error if a link target can be found multiple times in a given set of libraries. Linking may be done when an executable file is created (static linking), or whenever the program is used at runtime (dynamic linking).

The references being resolved may be addresses for jumps and other routine calls. They may be in the main program, or in one module depending upon another. They are resolved into fixed or relocatable addresses (from a common base) by allocating runtime memory for the memory segments of each module referenced.

Some programming languages use a feature called smart linking whereby the linker is aware of or integrated with the compiler, such that the linker knows how external references are used, and code in a library that is never actually used, even though internally referenced, can be discarded from the compiled application. For example, a program that only uses integers for arithmetic, or does no arithmetic operations at all, can exclude floating-point library routines. This smart-linking feature can lead to smaller application file sizes and reduced memory usage.

## Relocation

Some references in a program or library module are stored in a relative or symbolic form which cannot be resolved until all code and libraries are assigned final static addresses. Relocation is the process of adjusting these references, and is done either by the linker or the loader. In general, relocation cannot be done to individual libraries themselves because the addresses in memory may vary depending on the program using them and other libraries they are combined with. Position-independent code avoids references to absolute addresses and therefore does not require relocation.

## Static libraries

Main article: Static library

When linking is performed during the creation of an executable or another object file, it is known as static linking or early binding. In this case, the linking is usually done by a linker, but may also be done by the compiler.[14] A static library, also known as an archive, is one intended to be statically linked. Originally, only static libraries existed. Static linking must be performed when any modules are recompiled.

All of the modules required by a program are sometimes statically linked and copied into the executable file. This process, and the resulting stand-alone file, is known as a static build of the program. A static build may not need any further relocation if virtual memory is used and no address space layout randomization is desired.[15]

## Shared libraries

Main article: Shared library

A shared library or shared object is a file that is intended to be shared by executable files and further shared object files. Modules used by a program are loaded from individual shared objects into memory at load time or runtime, rather than being copied by a linker when it creates a single monolithic executable file for the program.

Shared libraries can be statically linked during compile-time, meaning that references to the library modules are resolved and the modules are allocated memory when the executable file is created.[citation needed] But often linking of shared libraries is postponed until they are loaded.[dubious - discuss]

## Object libraries

Although originally pioneered in the 1960s, dynamic linking did not reach operating systems used by consumers until the late 1980s. It was generally available in some form in most operating systems by the early 1990s. During this same period, object-oriented programming (OOP) was becoming a significant part of the programming landscape. OOP with runtime binding requires additional information that traditional libraries do not supply. In addition to the names and entry points of the code located within, they also require a list of the objects they depend on. This is a side-effect of one of OOP's core concepts, inheritance, which means that parts of the complete definition of any method may be in different places. This is more than simply listing that one library requires the services of another: in a true OOP system, the libraries themselves may not be known at compile time, and vary from system to system.

At the same time many developers worked on the idea of multi-tier programs, in which a "display" running on a desktop computer would use the services of a mainframe or minicomputer for data storage or processing. For instance, a program on a GUI-based computer would send messages to a minicomputer to return small samples of a huge dataset for display. Remote procedure calls (RPC) already handled these tasks, but there was no standard RPC system.

Soon the majority of the minicomputer and mainframe vendors instigated projects to combine the two, producing an OOP library format that could be used anywhere. Such systems were known as object libraries, or distributed objects, if they supported remote access (not all did). Microsoft's COM is an example of such a system for local use. DCOM, a modified version of COM, supports remote access.

For some time object libraries held the status of the "next big thing" in the programming world. There were a number of efforts to create systems that would run across platforms, and companies competed to try to get developers locked into their own system. Examples include IBM's System Object Model (SOM/DSOM), Sun Microsystems' Distributed Objects Everywhere (DOE), NeXT's Portable Distributed Objects (PDO), Digital's ObjectBroker, Microsoft's Component Object Model (COM/DCOM), and any number of CORBA-based systems.

## Class libraries

Class libraries are the rough OOP equivalent of older types of code libraries. They contain classes, which describe characteristics and define actions (methods) that involve objects. Class libraries are used to create instances, or objects with their characteristics set to specific values. In some OOP languages, like Java, the distinction is clear, with the classes often contained in library files (like Java's JAR file format) and the instantiated objects residing only in memory (although potentially able to be made persistent in separate files). In others, like Smalltalk, the class libraries are merely the starting point for a system image that includes the entire state of the environment, classes and all instantiated objects.

Today most class libraries are stored in a package repository (such as Maven Central for Java). Client code explicitly declare the dependencies to external libraries in build configuration files (such as a Maven Pom in Java).

## Remote libraries

Another library technique uses completely separate executables (often in some lightweight form) and calls them using a remote procedure call (RPC) over a network to another computer. This maximizes operating system re-use: the code needed to support the library is the same code being used to provide application support and security for every other program. Additionally, such systems do not require the library to exist on the same machine, but can forward the requests over the network.

However, such an approach means that every library call requires a considerable amount of overhead. RPC calls are much more expensive than calling a shared library that has already been loaded on the same machine. This approach is commonly used in a distributed architecture that makes heavy use of such remote calls, notably client-server systems and application servers such as Enterprise JavaBeans.

## Code generation libraries

Code generation libraries are high-level APIs that can generate or transform byte code for Java. They are used by aspect-oriented programming, some data access frameworks, and for testing to generate dynamic proxy objects. They also are used to intercept field access.[16]

## File naming

### Most modern Unix-like systems

The system stores `libfoo.a` and `libfoo.so` files in directories such as `/lib`, `/usr/lib` or `/usr/local/lib`. The filenames always start with `lib`, and end with a suffix of `.a` (archive, static library) or of `.so` (shared object, dynamically linked library). Some systems might have multiple names for a dynamically linked library. These names typically share the same prefix and have different suffixes indicating the version number. Most of the names are names for symbolic links to the latest version. For example, on some systems `libfoo.so.2` would be the filename for the second major interface revision of the dynamically linked library `libfoo`. The `.la` files sometimes found in the library directories are libtool archives, not usable by the system as such.

### macOS

The system inherits static library conventions from BSD, with the library stored in a `.a` file, and can use `.so`-style dynamically linked libraries (with the `.dylib` suffix instead). Most libraries in macOS, however, consist of "frameworks", placed inside special directories called "bundles" which wrap the library's required files and metadata. For example, a framework called `MyFramework` would be implemented in a bundle called `MyFramework.framework`, with `MyFramework.framework/MyFramework` being either the dynamically linked library file or being a symlink to the dynamically linked library file in `MyFramework.framework/Versions/Current/MyFramework`.

### Microsoft Windows

Dynamic-link libraries usually have the suffix `*.DLL`,[17] although other file name extensions may identify specific-purpose dynamically linked libraries, e.g. `*.OCX` for OLE libraries. The interface revisions are either encoded in the file names, or abstracted away using COM-object interfaces. Depending on how they are compiled, `*.LIB` files can be either static libraries or representations of dynamically linkable libraries needed only during compilation, known as "import libraries". Unlike in the UNIX world, which uses different file extensions, when linking against `.LIB` file in Windows one must first know if it is a regular static library or an import library. In the latter case, a `.DLL` file must be present at runtime.

## CAD library

A computer-aided design library or CAD library is a cloud based repository of 3D models or parts for computer-aided design (CAD), computer-aided engineering (CAE), Building information modeling (BIM) and computer-aided manufacturing (CAM). Examples of CAD libraries are GrabCAD, Sketchup 3D Warehouse, McMaster-Carr, and Thingiverse.[18] The models can be free and open source or proprietary and have to pay a subscription to have access to the CAD library 3D models. Artificial intelligence CAD libraries are being developed using linked open data of schematics and diagrams.[19]

## See also

* Code reuse - Use of existing software to build new software
* Linker (computing) - Computer program which combines multiple object files into a single file
* Software:Loader (computing) - Part of an operating system
* Dynamic-link library
* Object file - File containing relocatable format machine code
* Plug-in - Software component that adds a specific feature to an existing software application
* Prelink, also known as Prebinding
* Static library - Software library used via static linking
* Runtime library - Access to a program's runtime environment
* Software:Visual Component Library (VCL)
* Component Library for Cross Platform (CLX)
* C standard library - Standard library for the C programming language
* Java Class Library - Core Java libraries
* Software:Framework Class Library - Standard library of Microsoft's .NET Framework
* Generic programming - Style of computer programming (used by the C++ Standard Library)
* Soname
* Method stub
* Sketchup 3D Warehouse - 3D modeling CAD library for SketchUp

## Notes

1. ↑ It was possible earlier between, e.g., Ada subprograms.

## References

1. ↑ Deshpande, Prasad (2013). Metamorphic Detection Using Function Call Graph Analysis (Thesis). San Jose State University Library. doi:10.31979/etd.t9xm-ahsc.
2. ↑ "Static Libraries". TLDP. http://tldp.org/HOWTO/Program-Library-HOWTO/static-libraries.html.
3. ↑ Babbage, H. P. (September 12, 1888). "The Analytical Engine". Proceedings of the British Association (Bath). https://www.fourmilab.ch/babbage/hpb.html.
4. ↑ Goldstine, Herman H. (2008-12-31). The Computer from Pascal to von Neumann. Princeton: Princeton University Press. doi:10.1515/9781400820139. ISBN 978-1-4008-2013-9. http://dx.doi.org/10.1515/9781400820139.
5. ↑ Goldstine, Herman; von Neumann, John (1947). ﻿Planning and coding of problems for an electronic computing instrument﻿ (Report). Institute for Advanced Study. pp. 3, 21–22. OCLC 26239859. "it will probably be very important to develop an extensive "library" of subroutines"
6. ↑ Wilkes, M. V. (1951). "1951 International Workshop on Managing Requirements Knowledge". 1951 International Workshop on Managing Requirements Knowledge. IEEE. p. 79. doi:10.1109/afips.1951.13.
7. ↑ Campbell-Kelly, Martin (September 2011). "In Praise of 'Wilkes, Wheeler, and Gill'". Communications of the ACM 54 (9): 25–27. doi:10.1145/1995376.1995386. https://cacm.acm.org/magazines/2011/9/122802-in-praise-of-wilkes-wheeler-and-gill/fulltext.
8. ↑ Wilkes, Maurice; Wheeler, David; Gill, Stanley (1951). The Preparation of Programs for an Electronic Digital Computer. Addison-Wesley. p. 45, 80–91, 100. OCLC 641145988. https://archive.org/details/programsforelect00wilk/page/80/mode/2up?q=library.
9. ↑ Wexelblat, Richard (1981). History of Programming Languages. ACM Monograph Series. New York, NY: Academic Press (A subsidiary of Harcourt Brace). p. 274. ISBN 0-12-745040-8. https://archive.org/details/historyofprogram0000hist/page/274.
10. ↑ Wexelblat, op. cit., p. 258
11. ↑ Wilson, Leslie B.; Clark, Robert G. (1988). Comparative Programming Languages. Wokingham, England: Addison-Wesley. p. 126. ISBN 0-201-18483-4.
12. ↑ Wilson and Clark, op. cit., p. 52
13. ↑ Wexelblat, op. cit., p. 716
14. ↑ Kaminsky, Dan (2008). "Chapter 3 - Portable Executable and Executable and Linking Formats". Reverse Engineering Code with IDA Pro. Elsevier. pp. 37–66. doi:10.1016/b978-1-59749-237-9.00003-x. ISBN 978-1-59749-237-9. http://dx.doi.org/10.1016/b978-1-59749-237-9.00003-x. Retrieved 2021-05-27.
15. ↑ Collberg, Christian; Hartman, John H.; Babu, Sridivya; Udupa, Sharath K. (2003). "SLINKY: Static Linking Reloaded". USENIX '05. Department of Computer Science, University of Arizona. http://usenix.org/legacy/publications/library/proceedings/usenix05/tech/general/full_papers/collberg/collberg_html/main.html. Retrieved 2016-03-17.
16. ↑ "Code Generation Library". Source Forge. https://sourceforge.net/projects/cglib/. "Byte Code Generation Library is high level API to generate and transform JAVA byte code. It is used by AOP, testing, data access frameworks to generate dynamic proxy objects and intercept field access."
17. ↑ Bresnahan, Christine; Blum, Richard (2015-04-27). LPIC-1 Linux Professional Institute Certification Study Guide: Exam 101-400 and Exam 102-400. John Wiley & Sons (published 2015). p. 82. ISBN 9781119021186. https://books.google.com/books?id=jf3zBgAAQBAJ. Retrieved 2015-09-03. "Linux shared libraries are similar to the dynamic link libraries (DLLs) of Windows. Windows DLLs are usually identified by `.dll` filename extensions."
18. ↑ https://all3dp.com/2/best-sites-for-free-3d-cad-models-cad-libraries/
19. ↑ "Slash CAD model build times with new AI-driven part creation methodology | GlobalSpec". https://insights.globalspec.com/article/21167/slash-cad-model-build-times-with-new-ai-driven-part-creation-methodology.

## Further reading

* "Chapter 9: Shared Libraries & Chapter 10: Dynamic Linking and Loading". Linkers and Loaders. The Morgan Kaufmann Series in Software Engineering and Programming (1 ed.). San Francisco, USA: Morgan Kaufmann. 2000. ISBN 1-55860-496-0. OCLC 42413382. https://www.iecc.com/linker/. Retrieved 2020-01-12. Code: [1][2] Errata: [3]
* Article Beginner's Guide to Linkers by David Drysdale
* Article Faster C++ program startups by improving runtime linking efficiency by Léon Bottou and John Ryland
* How to Create Program Libraries by Baris Simsek
* BFD \- the Binary File Descriptor Library
* 1st Library-Centric Software Design Workshop LCSD'05 at OOPSLA'05
* 2nd Library-Centric Software Design Workshop LCSD'06 at OOPSLA'06
* How to create shared library by Ulrich Drepper (with much background info)
* Anatomy of Linux dynamic libraries at IBM.com

* v
* t
* e

Computer science

Note: This template roughly follows the 2012 ACM Computing Classification System.

Hardware|

* Printed circuit board
* Peripheral
* Integrated circuit
* Very Large Scale Integration
* Systems on Chip (SoCs)
* Energy consumption (Green computing)
* Electronic design automation
* Hardware acceleration

Computer systems
organization|

* Computer architecture
* Embedded system
* Real-time computing
* Dependability

Networks|

* Network architecture
* Network protocol
* Network components
* Network scheduler
* Network performance evaluation
* Network service

Software organization|

* Interpreter
* Middleware
* Virtual machine
* Operating system
* Software quality

Software notations
and tools|

* Programming paradigm
* Programming language
* Compiler
* Domain-specific language
* Modeling language
* Software framework
* Integrated development environment
* Software configuration management
* Software library
* Software repository

Software development|

* Software development process
* Requirements analysis
* Software design
* Software construction
* Software deployment
* Software maintenance
* Programming team
* Open-source model

Theory of computation|

* Model of computation
* Formal language
* Automata theory
* Computational complexity theory
* Logic
* Semantics

Algorithms|

* Algorithm design
* Analysis of algorithms
* Algorithmic efficiency
* Randomized algorithm
* Computational geometry

Mathematics
of computing|

* Discrete mathematics
* Probability
* Statistics
* Mathematical software
* Information theory
* Mathematical analysis
* Numerical analysis

Information
systems|

* Database management system
* Information storage systems
* Enterprise information system
* Social information systems
* Geographic information system
* Decision support system
* Process control system
* Multimedia information system
* Data mining
* Digital library
* Computing platform
* Digital marketing
* World Wide Web
* Information retrieval

Security|

* Cryptography
* Formal methods
* Security services
* Intrusion detection system
* Hardware security
* Network security
* Information security
* Application security

Human–computer
interaction|

* Interaction design
* Social computing
* Ubiquitous computing
* Visualization
* Accessibility

Concurrency|

* Concurrent computing
* Parallel computing
* Distributed computing
* Multithreading
* Multiprocessing

Artificial
intelligence|

* Natural language processing
* Knowledge representation and reasoning
* Computer vision
* Automated planning and scheduling
* Search methodology
* Control method
* Philosophy of artificial intelligence
* Distributed artificial intelligence

Machine learning|

* Supervised learning
* Unsupervised learning
* Reinforcement learning
* Multi-task learning
* Cross-validation

Graphics|

* Animation
* Rendering
* Image manipulation
* Graphics processing unit
* Mixed reality
* Virtual reality
* Image compression
* Solid modeling

Applied
computing|

* E-commerce
* Enterprise software
* Computational mathematics
* Computational physics
* Computational chemistry
* Computational biology
* Computational social science
* Computational engineering
* Computational healthcare
* Digital art
* Electronic publishing
* Cyberwarfare
* Electronic voting
* Video games
* Word processing
* Operations research
* Educational technology
* Document management

* Book
* Category
* Outline
* WikiProject
* Commons

* v
* t
* e

Application binary interface (ABI)

Parts and
conventions|

* Alignment
* Calling convention
* Call stack
* Library
* static
* Machine code
* Memory segmentation
* Name mangling
* Object code
* Opaque pointer
* Position-independent code
* Relocation
* System call
* Virtual method table

Related topics|

* Binary code compatibility
* Foreign function interface
* Language binding
* Linker
* dynamic
* Loader
* Year 2038 problem

* v
* t
* e

Executable and object file formats

* a.out
* AIF
* COFF
* CMD
* COM
* ECOFF
* ELF
* GOFF
* Hunk
* Mach-O
* MZ
* NE
* OMF
* OS/360
* PE
* PEF
* XCOFF

* Comparison of formats
* .exe

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Library (computing). Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Library_(computing)&oldid=202562"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template