Extensibility, Safety and Performance in the SPIN Operating System

Total Page:16

File Type:pdf, Size:1020Kb

Extensibility, Safety and Performance in the SPIN Operating System Extensibility, Safety and Performance in the SPIN Operating System Brian N. Bershad Stefan Savage Przemysøaw Pardyak Emin GÈun Sirer Marc E. Fiuczynski David Becker Craig Chambers Susan Eggers Department of Computer Science and Engineering University of Washington Seattle, WA 98195 Abstract purpose network protocol implementations are frequently in- adequate for supporting the demands of high performance This paper describes the motivation, architecture and per- parallel applications [von Eicken et al. 92]. Other applica- formance of SPIN, an extensible operating system. SPIN tions, such as multimedia clients and servers, and realtime provides an extension infrastructure, together with a core and fault tolerant programs, can also present demands that set of extensible services, that allow applications to safely poorly match operating system services. Using SPIN,an change the operating system's interface and implementation. application can extend the operating system's interfaces and Extensions allow an application to specialize the underly- implementations to provide a better match between the needs ing operating system in order to achieve a particular level of the application and the performance and functional char- of performance and functionality. SPIN uses language and acteristics of the system. link-time mechanisms to inexpensively export ®ne-grained interfaces to operating system services. Extensions are writ- ten in a type safe language, and are dynamically linked into 1.1 Goals and approach the operating system kernel. This approach offers extensions The goal of our research is to build a general purpose op- rapid access to system services, while protecting the operat- erating system that provides extensibility, safety and good ing system code executing within the kernel address space. performance. Extensibility is determined by the interfaces SPIN and its extensions are written in Modula-3 and run on to services and resources that are exported to applications; DEC Alpha workstations. it depends on an infrastructure that allows ®ne-grained ac- cess to system services. Safety determines the exposure of 1 Introduction applications to the actions of others, and requires that access be controlled at the same granularity at which extensions are SPIN is an operating system that can be dynamically spe- de®ned. Finally, good performance requires low overhead cialized to safely meet the performance and functionality re- communication between an extension and the system. quirements of applications. SPIN is motivated by the need to The design of SPIN re¯ects our view that an operating support applications that present demands poorly matched by system can be extensible, safe, and fast through the use of an operating system's implementation or interface. A poorly language and runtime services that provide low-cost, ®ne- matched implementation prevents an application from work- grained, protected access to operating system resources. ing well, while a poorly matched interface prevents it from Speci®cally, the SPIN operating system relies on four tech- working at all. For example, the implementations of disk niques implemented at the level of the language or its runtime: buffering and paging algorithms found in modern operat- ing systems can be inappropriate for database applications, Co-location. Operating system extensions are dynam- resulting in poor performance [Stonebraker 81]. General ically linked into the kernel virtual address space. Co- location enables communication between system and This research was sponsored by the Advanced Research Projects Agency, the National Science Foundation (Grants no. CDA-9123308 and extension code to have low cost. CCR-9200832) and by an equipment grant from Digital Equipment Corpo- ration. Bershad was partially supported by a National Science Foundation Enforced modularity. Extensions are written in Modula- Presidential Faculty Fellowship. Chambers was partially sponsored by a 3 [Nelson 91], a modular programming language for National Science Foundation Presidential Young Investigator Award. Sirer was supported by an IBM Graduate Student Fellowship. Fiuczynski was which the compiler enforces interface boundaries be- partially supported by a National Science Foundation GEE Fellowship. tween modules. Extensions, which execute in the ker- nel's virtual address space, cannot access memory or execute privileged instructions unless they have been given explicit access through an interface. Modularity enforced by the compiler enables modules to be isolated to the client'sscreen. Using SPIN the server de®nes an exten- from one another with low cost. sion that implements a direct stream between the disk and the network. The client viewer application installs an extension Logical protection domains. Extensions exist within into the kernel that decompresses incoming network video logical protection domains, which are kernel names- packets and displays them to the video frame buffer. paces that contain code and exported interfaces. Inter- faces, which are language-level units, represent views on system resources that are protected by the operat- 1.3 The rest of this paper ing system. An in-kernel dynamic linker resolves code in separate logical protection domains at runtime, en- The rest of this paper describes the motivation, design, and abling cross-domain communication to occur with the performanceof SPIN. In thenext section wemotivatetheneed overhead of a procedure call. for extensible operating systems and discuss related work. In Section 3 we describe the system's architecture in terms of its Dynamic call binding. Extensions execute in response protection and extension facilities. In Section 4 we describe to system events. An event can describe any potential the core services provided by the system. In Section 5 we action in the system, such as a virtual memory page fault discuss the system's performance and compare it against that or the scheduling of a thread. Events are declared within of several other operating systems. In Section 6 we discuss interfaces, and can be dispatched with the overhead of a our experiences writing an operating system in Modula-3. procedure call. Finally, in Section 7 we present our conclusions. Co-location, enforced modularity, logical protection do- mains, and dynamic call binding enable interfaces to be de- ®ned and safely accessed with low overhead. However, these 2 Motivation techniques do not guarantee the system's extensibility. Ulti- mately, extensibility is achieved through the system service Most operating systems are forced to balance generality and interfaces themselves, which de®ne the set of resources and specialization. A general system runs many programs, but operations that are exported to applications. SPIN provides may run few well. In contrast, a specialized system may a set of interfaces to core system services, such as memory run few programs, but runs them all well. In practice, most management and scheduling, that rely on co-location to ef- general systems can, with some effort, be specialized to ad- ®ciently export ®ne-grained operations, enforced modularity dress the performance and functional requirements of a par- and logical protection domains to manage protection, and ticular application's needs, such as interprocess communica- dynamic call binding to de®ne relationships between system tion, synchronization, thread management, networking, vir- components and extensions at runtime. tual memory and cache management [Draves et al. 91, Ber- shad et al. 92b, Stodolsky et al. 93, Bershad 93, Yuhara et al. 94, Maeda & Bershad 93, Felten 92, Young et al. 87, Harty 1.2 System overview & Cheriton 91, McNamee & Armstrong 90, Anderson et al. The SPIN operating system consists of a set of extension 92, Fall & Pasquale 94, Wheeler & Bershad 92, Romer et al. services and core system services that execute within the 94, Romer et al. 95, Cao et al. 94]. Unfortunately, exist- kernel's virtual address space. Extensions can be loaded ing system structures are not well-suited for specialization, into the kernel at any time. Once loaded, they integrate often requiring a substantial programming effort to affect themselvesinto theexisting infrastructureand providesystem even a small change in system behavior. Moreover, changes services speci®c to the applications that require them. SPIN intended to improve the performance of one class of appli- is primarily written in Modula-3, which allows extensions cations can often degrade that of others. As a result, system to directly use system interfaces without requiring runtime specialization is a costly and error-prone process. conversion when communicating with other system code. An extensible system is one that can be changed dynam- AlthoughSPIN relies on language features to ensure safety ically to meet the needs of an application. The need for within the kernel, applications can be written in any language extensibility in operating systems is shown clearly by sys- and execute within their own virtual address space. Only tems such as MS-DOS, Windows, or the Macintosh Operat- code that requires low-latency access to system services is ing System. Although these systems were not designed to be written in the system's safe extension language. For exam- extensible, their weak protection mechanisms have allowed ple, we have used SPIN to implement a UNIX operating application programmers to directly modify operating sys- system server. The bulk of the server is written in C, and tem data structures and code [Schulman
Recommended publications
  • Performance Best Practices for Vmware Workstation Vmware Workstation 7.0
    Performance Best Practices for VMware Workstation VMware Workstation 7.0 This document supports the version of each product listed and supports all subsequent versions until the document is replaced by a new edition. To check for more recent editions of this document, see http://www.vmware.com/support/pubs. EN-000294-00 Performance Best Practices for VMware Workstation You can find the most up-to-date technical documentation on the VMware Web site at: http://www.vmware.com/support/ The VMware Web site also provides the latest product updates. If you have comments about this documentation, submit your feedback to: [email protected] Copyright © 2007–2009 VMware, Inc. All rights reserved. This product is protected by U.S. and international copyright and intellectual property laws. VMware products are covered by one or more patents listed at http://www.vmware.com/go/patents. VMware is a registered trademark or trademark of VMware, Inc. in the United States and/or other jurisdictions. All other marks and names mentioned herein may be trademarks of their respective companies. VMware, Inc. 3401 Hillview Ave. Palo Alto, CA 94304 www.vmware.com 2 VMware, Inc. Contents About This Book 5 Terminology 5 Intended Audience 5 Document Feedback 5 Technical Support and Education Resources 5 Online and Telephone Support 5 Support Offerings 5 VMware Professional Services 6 1 Hardware for VMware Workstation 7 CPUs for VMware Workstation 7 Hyperthreading 7 Hardware-Assisted Virtualization 7 Hardware-Assisted CPU Virtualization (Intel VT-x and AMD AMD-V)
    [Show full text]
  • Chapter 1. Origins of Mac OS X
    1 Chapter 1. Origins of Mac OS X "Most ideas come from previous ideas." Alan Curtis Kay The Mac OS X operating system represents a rather successful coming together of paradigms, ideologies, and technologies that have often resisted each other in the past. A good example is the cordial relationship that exists between the command-line and graphical interfaces in Mac OS X. The system is a result of the trials and tribulations of Apple and NeXT, as well as their user and developer communities. Mac OS X exemplifies how a capable system can result from the direct or indirect efforts of corporations, academic and research communities, the Open Source and Free Software movements, and, of course, individuals. Apple has been around since 1976, and many accounts of its history have been told. If the story of Apple as a company is fascinating, so is the technical history of Apple's operating systems. In this chapter,[1] we will trace the history of Mac OS X, discussing several technologies whose confluence eventually led to the modern-day Apple operating system. [1] This book's accompanying web site (www.osxbook.com) provides a more detailed technical history of all of Apple's operating systems. 1 2 2 1 1.1. Apple's Quest for the[2] Operating System [2] Whereas the word "the" is used here to designate prominence and desirability, it is an interesting coincidence that "THE" was the name of a multiprogramming system described by Edsger W. Dijkstra in a 1968 paper. It was March 1988. The Macintosh had been around for four years.
    [Show full text]
  • Zenon Manual Programming Interfaces
    zenon manual Programming interfaces v.7.11 ©2014 Ing. Punzenberger COPA-DATA GmbH All rights reserved. Distribution and/or reproduction of this document or parts thereof in any form are permitted solely with the written permission of the company COPA-DATA. The technical data contained herein has been provided solely for informational purposes and is not legally binding. Subject to change, technical or otherwise. Contents 1. Welcome to COPA-DATA help ...................................................................................................... 6 2. Programming interfaces ............................................................................................................... 6 3. Process Control Engine (PCE) ........................................................................................................ 9 3.1 The PCE Editor ............................................................................................................................................. 9 3.1.1 The Taskmanager ....................................................................................................................... 10 3.1.2 The editing area .......................................................................................................................... 10 3.1.3 The output window .................................................................................................................... 11 3.1.4 The menus of the PCE Editor .....................................................................................................
    [Show full text]
  • Operating System Architectures
    Operating System Architectures • Learning objectives: • Explain how OS functionality is orthogonal to where you place services relative to processor modes. • Describe some alternative ways to structure the operating system. • Operating systems evolve over time, but that evolution is frequently in terms of their architecture: how they structure functionality relative to protection boundaries. • We’ll review some of the basic architectures: • Executives • Monolithic kernels • Micro kernels • Exo kernels • Extensible operating systems 2/3/15 CS161 Spring 2015 1 OS Executives • Think MS-DOS: With no hardware protection, the OS is simply a set of services: • Live in memory • Applications can invoke them • Requires a software trap to invoke them. • Live in same address space as application 1-2-3 QBasic WP Applications Command Software Traps Operating System routlines 2/3/15 CS161 Spring 2015 2 Monolithic Operating System • Traditional architecture • Applications and operating system run in different address spaces. • Operating system runs in privileged mode; applications run in user mode. Applications Operating System file system processes networking Device drivers virtual memory 2/3/15 CS161 Spring 2015 3 Microkernels (late 80’s and on) • Put as little of OS as possible in privileged mode (the microkernel). • Implement most core OS services as user-level servers. • Only microkernel really knows about hardware • File system, device drivers, virtual memory all implemented in unprivileged servers. • Must use IPC (interprocess communication) to communicate among different servers. Applications Process Virtual management memory file system networking Microkernel 2/3/15 CS161 Spring 2015 4 Microkernels: Past and Present • Much research and debate in late 80’s early 90’s • Pioneering effort in Mach (CMU).
    [Show full text]
  • Access Control for the SPIN Extensible Operating System
    Access Control for the SPIN Extensible Operating System Robert Grimm Brian N. Bershad Dept. of Computer Science and Engineering University of Washington Seattle, WA 98195, U.S.A. Extensible systems, such as SPIN or Java, raise new se- on extensions and threads, are enforced at link time (when curity concerns. In these systems, code can be added to a an extension wants to link against other extensions) and at running system in almost arbitrary fashion, and it can inter- call time (when a thread wants to call an extension). Ac- act through low latency (but type safe) interfaces with other cess restrictions on objects are enforced by the extension code. Consequently, it is necessary to devise and apply that provides an object’s abstraction (if an extension is not security mechanisms that allow the expression of policies trusted to enforce access control on its objects but is ex- controlling an extension’s access to other extensions and its pected to do so, DTE can be used to prevent other exten- ability to extend, or override, the behavior of already exist- sions from linking against the untrusted extension). ing services. In the SPIN operating system [3, 4] built at the Due to the fine grained composition of extensions in University of Washington, we are experimenting with a ver- SPIN, it is important to minimize the performance overhead sion of domain and type enforcement (DTE) [1, 2] that has of call time access control. We are therefore exploring opti- been extended to address the security concerns of extensible mization that make it possible to avoid some dynamic ac- systems.
    [Show full text]
  • Designing a Concurrent File Server
    Communicating Process Architectures 2012 1 P.H. Welch et al. (Eds.) Open Channel Publishing Ltd., 2012 c 2012 The authors and Open Channel Publishing Ltd. All rights reserved. Designing a Concurrent File Server James WHITEHEAD II Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, Oxford, OX1 3QD, United Kingdom; [email protected] Abstract. In this paper we present a design and architecture for a concurrent file sys- tem server. This architecture is a compromise between the fully concurrent V6 UNIX implementation, and the simple sequential implementation in the MINIX operating system. The design of the server is made easier through the use of a disciplined model of concurrency, based on the CSP process algebra. By viewing the problem through this restricted lens, without traditional explicit locking mechanisms, we can construct the system as a process network of components with explicit connections and depen- dencies. This provides us with insight into the problem domain, and allows us to anal- yse the issues present in concurrent file system implementation. Keywords. file system, Go, CSP, UNIX, MINIX. Introduction Modern operating systems allow multiple users and programs to share the computing re- sources on a single machine. They also serve as an intermediary between programs and the physical computing hardware, such as persistent storage devices. In the UNIX family of op- erating systems, disk access is accomplished by interacting with files and directories through a hierarchical file system, using system calls. Managing access to the file system in a concurrent environment is a challenging problem. An implementation must ensure that a program cannot corrupt the state of the file system, or the data stored on disk.
    [Show full text]
  • Z/OS Basics Preface
    Contents Preface . iii How this course is organized . iii How each topic is organized . iv Part 1. Introduction to z/OS and the mainframe environment Chapter 1. Introduction to the new mainframe . 3 1.1 The new mainframe. 4 1.2 The S/360: A turning point in mainframe history . 4 1.3 An evolving architecture . 5 1.4 Mainframes in our midst . 6 1.5 What is a mainframe? . 7 1.6 Who uses mainframe computers?. 10 1.7 Factors contributing to mainframe use . 11 1.8 Typical mainframe workloads . 14 1.9 Roles in the mainframe world . 21 1.10 z/OS and other mainframe operating systems . 27 1.11 Summary . 29 Chapter 2. z/OS overview. 31 2.1 What is an operating system? . 32 2.2 Overview of z/OS facilities. 32 2.3 What is z/OS? . 34 2.4 Virtual storage and other mainframe concepts . 39 2.5 What is workload management? . 57 2.6 I/O and data management. 60 2.7 Supervising the execution of work in the system . 60 2.8 Defining characteristics of z/OS . 68 2.9 Licensed programs for z/OS . 69 2.10 Middleware for z/OS . 70 2.11 A brief comparison of z/OS and UNIX. 71 2.12 Summary . 73 Chapter 3. TSO/E, ISPF, and UNIX: Interactive facilities of z/OS . 75 3.1 How do we interact with z/OS? . 76 3.2 TSO overview . 76 3.3 ISPF overview . 80 3.4 z/OS UNIX interactive interfaces. 99 3.5 Summary .
    [Show full text]
  • Contents of Lecture 8 on UNIX History
    Contents of Lecture 8 on UNIX History Before UNIX Origin of UNIX Commerical wars and other threats Linux Game over. UNIX won. Continued work by the original UNIX team: Plan 9 and Inferno Microkernels vs Monolithic kernels and other issues. Jonas Skeppstedt ([email protected]) Lecture 8 2014 1 / 67 CTSS The Compatible Time-Sharing System was designed at MIT in the early 1960s. Supported up to 32 simultanously logged in users: proof of the time-sharing idea. Ran on IBM 7090 with 32K 36 bit words, of which the monitor used 5K. User programs were swapped in from a magnetic drum (disk). Multilevel feedback scheduling queue. Higher priorities have shorter time quantum Initial priority (quantum) reflects size of the executable file so it can be swapped in and run. CTSS was extremely successful and used as late as 1972: basis for MULTICS. Jonas Skeppstedt ([email protected]) Lecture 8 2014 2 / 67 MULTICS Multiplexed Information and Computing Ser vice designed by MIT, AT&T, and GE. AT&T and GE provided telephone and electricity ser vices as utilities. GE also produced computers, eg the GE-645 used in MULTICS development. Why not do the same with computing power? The goal was one computer for 100,000s users in Boston (on hardware equivalent to about 386 or 486). Designed as an extension to CTSS with virtual memory and sophisticated protection (more levels than UNIX user vs superuser). MULTICS was written in PL/1 and consisted of about 300,000 lines. Jonas Skeppstedt ([email protected]) Lecture 8 2014 3 / 67 End of MULTICS Lots of people were very enthusiastic about MULTICS, including the newly graduated Ken Thompson from Berkeley.
    [Show full text]
  • A Generic Software Modeling Framework for Building Heterogeneous Distributed and Parallel Software Systems
    Loyola University Chicago Loyola eCommons Computer Science: Faculty Publications and Other Works Faculty Publications 1994 A Generic Software Modeling Framework for Building Heterogeneous Distributed and Parallel Software Systems William T. O'Connell George K. Thiruvathukal Loyola University Chicago, [email protected] Thomas W. Christopher Follow this and additional works at: https://ecommons.luc.edu/cs_facpubs Part of the Computer Sciences Commons Recommended Citation William T. O'Connell, George K. Thiruvathukal, and Thomas W. Christopher. A generic modeling environment for heterogeneous parallel and distributed computing. In International Conference on Advanced Science and Technology 1994 (ICAST 1994), AT&T Bell Laboratories, 1994. This Conference Proceeding is brought to you for free and open access by the Faculty Publications at Loyola eCommons. It has been accepted for inclusion in Computer Science: Faculty Publications and Other Works by an authorized administrator of Loyola eCommons. For more information, please contact [email protected]. This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License. Copyright © 1994 William T. O'Connell, George K. Thiruvathukal, and Thomas W. Christopher A Generic Software Modelling Framework for Building Heterogeneous Distributed and Parallel Software Systems William T. O’Connell George K. Thiruvathukal Thomas W. Christopher AT&T Bell Laboratories R.R. Donnelley and Sons Company Illinois Institute of Technology Building IX, Rm. 1B-422 Technical Center Department of Computer Science 1200 E. Warrenville Rd. 750 Warrenville Road 10 West Federal Street Naperville, IL 60566 Lisle, IL 60532 Chicago, IL 60616 [email protected] [email protected] [email protected] Abstract Processing Language) are available as alternative interfaces to our distributed computing environment [1].
    [Show full text]
  • Microkernels in a Bit More Depth
    MICROKERNELS IN A BIT MORE DEPTH COMP9242 2006/S2 Week 4 MOTIVATION • Early operating systems had very little structure • A strictly layered approach was promoted by [Dij68] • Later OS (more or less) followed that approach (e.g., Unix). • Such systems are known as monolithic kernels COMP924206S2W04 MICROKERNELS... 2 ADVANTAGES OF MONOLITHIC KERNELS • Kernel has access to everything: ➜ all optimisations possible ➜ all techniques/mechanisms/concepts implementable • Kernel can be extended by adding more code, e.g. for: ➜ new services ➜ support for new hardare COMP924206S2W04 MICROKERNELS... 3 PROBLEMS WITH LAYERED APPROACH • Widening range of services and applications ⇒ OS bigger, more complex, slower, more error prone. • Need to support same OS on different hardware. • Like to support various OS environments. • Distribution ⇒ impossible to provide all services from same (local) kernel. COMP924206S2W04 MICROKERNELS... 4 EVOLUTION OF THE LINUX KERNEL Linux Kernel Size (.tar.gz) 35 30 25 20 15 Size (Mb)Size 10 5 0 31-Jan-93 28-Oct-95 24-Jul-98 19-Apr-01 14-Jan-04 Date Linux 2.4.18: 2.7M LoC COMP924206S2W04 MICROKERNELS... 5 APPROACHES TO TACKLING COMPLEXITY • Classical software-engineering approach: modularity ➜ (relatively) small, mostly self-contained components ➜ well-defined interfaces between them ➜ enforcement of interfaces ➜ containment of faults to few modules COMP924206S2W04 MICROKERNELS... 6 APPROACHES TO TACKLING COMPLEXITY • Classical software-engineering approach: modularity ➜ (relatively) small, mostly self-contained components ➜ well-defined interfaces between them ➜ enforcement of interfaces ➜ containment of faults to few modules • Doesn’t work with monolithic kernels: ➜ all kernel code executes in privileged mode ➜ faults aren’t contained ➜ interfaces cannot be enforced ➜ performance takes priority over structure COMP924206S2W04 MICROKERNELS..
    [Show full text]
  • Extensibility, Safety and Performance in the SPIN Operating
    Overview Extensibility, Safety Background and Motivation and Performance in Modula-3 the SPIN Operating SPIN architecture System Benchmarks Conclusion Presented by Allen Kerr Hardware Vs Software Protection How Network Video works Hardware One-size-fits-all approach to system calls Requires software abstraction Software Applications tell the system what needs to be done Allows checks to be optimized using assumptions Allows untrusted user code to be safely integrated into the kernel How It Ought to Be Motivation Taken from talk “Language Support for Extensible Operating Systems” 1 Modula-3 SPIN Similar feature set to Java Kernel programmed almost exclusively in Pointer safety Exceptions Modula-3 Interfaces Applications can link into kernel Modules Static Type Checking Examples of services Dynamic Linking Filing and buffer cache management Concerns Execution Speed Protocol processing Threads, allocation, and garbage collection Scheduling and thread management Memory Usage Mixed-Language Environment Virtual memory Further SPIN Motivation Goals Most OSs balance generality with specialization Extensibility General systems run many programs but run Allow applications to extend any service few well Performance Specializing general operating system Dynamically inject application code into the kernel Costly Safety Time consuming Rely on language protection for memory safety Error-prone Rely on interface design for component safety SPIN System Components Related Work Hydra Applications manage resources High overhead Microkernels
    [Show full text]
  • In-Kernel Servers on Mach
    InKernel ServersonMach Implementation and Performance Jay Lepreau Mike Hibler Bryan Ford Jerey Law Center for Software Science Department of Computer Science University of Utah Salt LakeCity UT Email flepreaumikebafordlawgcsuta hedu Abstract The advantages in mo dularityandpower of microkernelbased op erating systems suchas Macharewell known The existing p erformance problems of these systems however are signicant Much of the p erformance degradation is due to the cost of maintaining separate protection domains traversing software layers and using a semantically richinterpro cess com munication mechanism An approach that optimizes the common case is to p ermit merging of protection domains in p erformance critical applications while maintainin g protection b ound aries for debugging or in situations that demand robustness In our system client calls to the server are eectively b ound either to a simple system call interface or to a full RPC mechanism dep ending on the servers lo cation The optimization reduces argument copies as well as work done in the control path to handle complex and infrequently encountered message typ es In this pap er we present a general metho d of doing this for Mach and the results of applying it to the Mach microkernel and the OSF single server We describ e the necessary mo dications to the kernel the single server and the RPC stub generator Semantic equivalence backwards compatibility and common source and binary co de are preserved Performance on micro and macro b enchmarks is rep orted with RPC p erformance
    [Show full text]