DOCSLIB.ORG

BLISS-36 User's Guide

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
BLISS-36 User's Guide BLISS-36 User's Guide Order No. AA-H712D-TK February 1984 This document describes the BLlSS-36 compiler and its use, gives basic information about linking, executing, and debugging BLlSS-36 programs, and describes BLlSS-36 machine-specific functions, BLISS tools, and other topics relevant to BLlSS-36 programming. SUPERSESSION/UPDATE INFORMATION: BLlSS-36 V4(216) OPERATING SYSTEMS AND VERSIONS: TOPS-10 V7.01A TOPS-20 V5.1 (KL) TOPS-20 V4.1 (KS) SOFTWARE VERSION: BLlSS-36 V4(216) implementing BLISS language V4.0 digital equipment corporation · maynard, massachusetts First Printing, June 1979 Revised, September 1980 Revised, February 1982 Revised, February 1984 The information in this document is subject to change without notice and should not be construed as a commitment by Digital Equipment Corporation. Digital Equipment Cor~oration assumes no responsibility for any errors that may appear in this document. The software described in this document is furnished under a license and may be used or copied only in accordance with the terms of such license. No responsibility is assumed for the use or reliability of software on equipment that is not supplied by Digital Equipment Corporation or its affiliated companies. Copyright 1979,1980, 1982, 1984 by Digital Equipment Corporation All Rights Reserved. Printed in U.S.A. The postpaid READER'S COMMENTS form on the last page of this document requests the user's critical evaluation to assist in preparing future documentation. The following are trademarks of Digital Equipment Corporation: DEC OIBOL RSTS DEC/CMS EduSystern RSX DEC/MMS lAS UNIBUS DECnet MASSBUS VAX DECsystem-lO MICRO/PDP-II VMS OECSYSTEM-20 Micro/RSX VT OECUS PDP DECwriter PDT ZK2260 HOW TO ORDER ADDITIONAL DOCUMENTATION In Continental USA and Puerto Rico call 800-258-1710 DIRECT MAIL ORDERS (CANADA) In New Hampshire, Alaska, and Hawaii call 603-884-6660 Digital Equipment of Canada Ltd. 940 Belfast Road In Canada call 613-234-7726 (Ottawa-Hull) Ottawa, Ontario K1G 4C2 800-267-6146 (all other Canadian) Attn: A&SG Business Manager DIRECT MAIL ORDERS (USA & PUERTO RICO)* DIRECT MAIL ORDERS (INTERNATIONAL) Digital Equipment Corporation Digital Equipment Corporation P.O. Box CS2008 A&SG Business Manager Nashua, New Hampshire 03061 c/o Digital's local subsidiary or approved distributor * Any prepaid order from Puerto Rico must be placed with the local Digital subsidiary (809-754-7575) Internal orders should be placed through the Software Distribution Center (SDC), Digital Equipment Corporation, Northboro, Massachusetts 01532 CONTENTS Page PREFACE v SUMMARY OF TECHNICAL CHANGES xv CHAPTER 1 TOPS-20 OPERATING PROCEDURES 1.1 COMPILING A BLISS PROGRAM ... 1-1 1.1.1 Command-Line Syntax · 1-3 1.1.2 Command-Line Semantics . · ........ 1-3 1.2 FILE SPECIFICATIONS . 1-4 1.3 COMMAND-LINE SWITCHES . · 1-5 1.3.1 Output Switches . 1-6 1.3.1.1 Syntax . .. ... · .... 1-7 1.3.1.2 Defaults . · 1-7 1.3.1.3 Semantics .. 1-7 1.3.2 General Switches . · .... 1-8 1.3.2.1 Syntax .. ... .. .. 1-9 1.3.2.2 Defaults ..... 1-9 1.3.2.3 Semantics . .. .. 1-9 1.3.3 Check Switch . · . 1-10 1.3.3.1 Syntax .. · . 1-10 1.3.3.2 Defaul ts . 1-10 1.3.3.3 Semantics 1-10 1.3.4 Terminal Switches · . 1-11 1.3.4.1 Syntax .... 1-11 1.3.4.2 Defaults . 1-11 1.3.4.3 Semantics 1-11 1.3.5 Optimization Switches 1-12 1.3.5.1 Syntax .... · . 1-12 1.3.5.2 Defaults . 1-12 1.3.5.3 Semantics . 1-13 1.3.6 Listing Switches . 1-14 1.3.6.1 Syntax . 1-14 1.3.6.2 Defaults .... 1-15 1.3.6.3 Semantics . 1-15 1.3.7 Reference Switches . · . 1-17 1.3.7.1 Syntax . 1-18 1.3.7.2 Defaults . 1-18 1.3.7.3 Semantics . 1-18 1.3.8 Environment Switches . 1-18 1.3.8.1 Syntax .. ... · . 1-19 1.3.8.2 Defaults . .. ... · . 1-19 1.3.8.3 Semantics . 1-19 1.3.9 Placement of Switches ..... 1-20 1.3.10 Switches and Default Module Switch Settings 1-20 1.3.11 positive and Negative Forms of Switches 1-22 1.3.12 Abbreviations of Switch and Value Names 1-22 1.4 SPECIAL FEATURES . 1-22 1.4.1 Indirect Files · . 1-22 1.4.2 EXEC Command . 1-23 CHAPTER 2 TOPS-I0 OPERATING PROCEDURES 2.1 COMPILING A BLISS PROGRAM · 2-1 2.1.1 Command-Line Syntax . · 2-3 2.1.2 Command-Line Semantics . · ........ 2-3 2.2 FILE SPECIFICATIONS · .... 2-3 2.2.1 Syntax . · 2-4 2.2.2 Semantics . w • • · 2-4 iii CONTENTS 2.2.3 Default Extension · ..... 2-4 2.3 OUTPUT SPECIFICATIONS 2-5 2.4 COMMAND-LINE SWITCHES . • . • . 2-6 2.4.1 Library Switches . · . 2-6 2.4.1.1 Syntax ..... · . 2-7 2.4.1.2 Defaults . • . · ..... 2-7 2.4.2 General SWitches . 2-7 2.4.2.1 Syntax .. · 2-8 2.4.2.2 Defau1 ts . .............. 2-8 2.4.2.3 Semantics · 2-8 2.4.3 Check SWi tch . · .... 2-8 2.4.3.1 Syntax ... .. 2-9 2.4.3.2 Defaults . .• 2-9 2.4.3.3 Semantics · 2-9 2.4.4 Terminal SWitches · 2-9 2.4.4.1 Syntax ... · . 2-10 2.4.4.2 Defaults . 2-10 2.4.4.3 Semantics . · . 2-10 2.4.5 Optimization SWitches .... · . 2-10 2.4.5.1 Syntax . ... · . • 2-11 2.4.5.2 Defaults . ... 2-11 2.4.5.3 Semantics · . 2-12 2.4.6 Listing SWitches ..... · . 2-12 2.4.6.1 Syntax . 2-13 2.4.6.2 Defaults .... 2-13 2.4.6.3 Semantics . · . 2-13 2.4.7 Reference SWitches . • . 2-15 2.4.7.1 Syntax ... 2-16 2.4.7.2 Defaults . · . 2-16 2.4.7.3 Semantics · . 2-17 2.4.8 Environment Switches 2-17 2.4.8.1 Syntax . .... · . 2-17 2.4.8.2 Defaults ............... 2-17 2.4.8.3 Semantics . · . 2-18 2.4.9 Placement of Switches 2-18 2.4.10 Switches and Default Settings . 2-18 2.4.11 positive and Negative Forms of Switches 2-20 2.4.12 Abbreviations 2-20 2.5 SPECIAL FEATURES . 2-20 2.5.1 Indirect Files . 2-20 2.5.2 Option File . 2-20 CHAPTER 3 COMPILER OUTPUT 3.1 TERMINAL OUTPUT · ..... 3-2 3.2 OUTPUT LISTING . · 3-3 3.2.1 Listing Header . · ..... 3-4 3.2.2 Source Listing . ... 3-5 3.2.3 Object Listing · 3-7 3.2.4 Source Part Options · . 3-10 3.2.4.1 Default Source Listing 3-11 3.2.4.2 Listing with LIBRARY/REQUIRE Information .. 3-11 3.2.4.3 Listing with Macro Expansions ... 3-11 3.2.4.4 Listing with Macro Tracing . .. 3-11 3.3 CROSS-REFERENCE LISTING . 3-16 3.3.1 Cross-Reference Header . · . 3-16 3.3.2 Cross-Reference Entries . 3-16 3.3.3 Output Listing with Cross-Reference Listing 3-20 3.4 COMPILATION SUMMARY . 3-22 3.5 ERROR MESSAGES . 3-22 CHAPTER 4 LINKING, EXECUTING, AND DEBUGGING 4.1 LINKING ........ 4-1 iv CONTENTS 4.1.1 Syntax . • . 4-2 4.1.2 Defaults . • 4-2 4.1.3 Semantics .. 4-3 4.2 EXECUTING .• 4-3 4.3 DEBUGGING · 4-3 4.3.1 Debug Example · 4-3 4.3.2 Other SIX12 Commands . · 4-4 CHAPTER 5 MACHINE-SPECIFIC FUNCTIONS 5.1 GENERAL CONVENTIONS 5-1 5.1.1 Machine Code Insertion Functions • 5-1 5.1.2 Logical Functions 5-3 5.1.3 Arithmetic Functions 5-3 5.1.4 System Interface Functions 5-3 5.2 ADDD (ADD DOUBLE OPERANDS) 5-3 5.3 ADDF (ADD FLOATING OPERANDS) 5-4 5.4 ADDG (ADD FLOAT-G OPERANDS) 5-4 5.5 ASH (ARITHMETIC SHIFT) 5-5 5.6 CMPD (COMPARE DOUBLE OPERANDS) 5-5 5.7 CMPF (COMPARE FLOATING OPERANDS) 5-5 5.8 CMPG (COMPARE FLOAT-G OPERANDS) 5-6 5.9 COPYII, COPYIN, COPYNI, AND COPYNN (COpy A BYTE) 5-6 5.10 CVTDF (CONVERT DOUBLE TO FLOATING) 5-6 5.11 CVTDI (CONVERT DOUBLE TO INTEGER) 5-7 5.12 CVTFD (CONVERT FLOATING TO DOUBLE) 5-7 5.13 CVTFG (CONVERT FLOATING TO FLOAT-G) 5-7 5.14 CVTFI (CONVERT FLOATING TO INTEGER) 5-8 5.15 CVTGF (CONVERT FLOAT-G TO FLOATING) 5-8 5.16 CVTGI (CONVERT FLOAT-G TO INTEGER) 5-8 5.17 CVTID (CONVERT INTEGER TO DOUBLE) 5-9 5.18 CVTIF (CONVERT INTEGER TO FLOATING) 5-9 5.19 CVTIG (CONVERT INTEGER TO FLOAT-G) 5-9 5.20 DIVD (DIVIDE DOUBLE OPERANDS) 5-10 5.21 DIVF (DIVIDE FLOATING OPERANDS) 5-10 5.22 DIVG (DIVIDE FLOAT-G OPERANDS) 5-10 5.23 FIRSTONE (FIND FIRST BIT) • '. 5-11 5.24 INCP (INCREMENT A BYTE POINTER) 5-11 5.25 JSYS (INVOKE A TOPS-20 SYSTEM SERVICE) 5-11 5.26 LSH (LOGICAL SHIFT) 5-13 5.27 MACHOP AND MACHSKIP (EMIT AN INSTRUCTION) 5-13 5.28 MULD (MULTIPLY DOUBLE OPERANDS) 5-14 5.29 MULF (MULTIPLY FLOATING OPERANDS) 5-14 5.30 MULG (MULTIPLY FLOAT-G OPERANDS) 5-14 5.31 POINT (BUILD A BYTE POINTER) 5-15 5.32 REPLACEI AND REPLACEN (STORE A BYTE) 5-15 5.33 ROT (ROTATE A VALUE) 5-15 5.34 SCANN AND SCANI (FETCH A BYTE) 5-16 5.35 SUBD (SUBTRACT DOUBLE OPERANDS) 5-16 5.36 SUBF (SUBTRACT FLOATING OPERANDS) 5-16 5.37 SUBG (SUBTRACT FLOAT-G OPERANDS) 5-17 5.38 UUO (INVOKE A TOPS-I0 SYSTEM SERVICE) 5-17 CHAPTER 6 PROGRAMMING CONSIDERATIONS 6.1 LIBRARY AND REQUIRE USAGE DIFFERENCES 6-1 6.2 FREQUENT BLISS CODING ERRORS 6-2 6.2.1 Missing Dots 6-3 6.2.2 Valued and Nonvalued Routines 6-3 6.2.3 Semicolons and Values of Blocks 6-3 6.2.4 Complex Expressions Using AND, OR, and NOT 6-4 6.2.5 Computed Routine Calls 6-4 6.2.6 Signed and Unsigned Fields 6-4 6.2.7 Complex Macros 6-5 v CONTENTS 6.2.8 Missing Code .
Load more

Recommended publications
  • A Case Against the GOT' O William a . Wulf, Carnegie-Mellon Universit Y
    A Case Against the GOT' O William A . Wulf, Carnegie-Mellon Universit y ABSTRAC T suggestion to ban the goto appears to have been a part of the computing folklore for several years , It has been proposed, by E . W . Dijkstra and others , to this author's knowledge the suggestion wa s that the goto statement in programming language i s first made in print by Professor E . W . Dijkstra i n a principal culprit in programs which are diffi- a letter to the editor of the _Communications o f cult to understand, modify, and debug . More cor- the ACM in 1968 (1) . rectly, the argument is that it is possible t o In this paper we shall examine the rational e use the goto to synthesize program structures wit h for the elimination of the Soto in programin g these undesirable properties . Not all uses of th e languages, and some of the theoretical and practi- goto are to be considered harmful ; however, it i s cal implications of its (total) elimination . further argued that the "good" uses of the got o fall into one of a small number of specific case s RATIONAL E which may be handled by specific language con- structs . This paper summarizes the arguments i n At one level, the rationale for eliminatin g favor of eliminating the goto statement and som e the poto has already been given in the introduc- of the theoretical and practical implications o f tion . Namely, it is possible to use the goto in a the proposal . manner which obscures the logical structure of a program to a point where it becomes virtually im- KEY WORDS AND PHRASES : programming, programmin g possible to understand (1,3,4), It is not claimed languages, goto-less programming, structured pro- that every use of the goto obscures the logica l grammin g structure of a program ; it is only claimed that i t CR CATEGORIES : 4 .2, 4 .22, 5 .2 4 is possible to use the Soto to fabricate a "rat' s nest" of control flow which has the undesirabl e INTRODUCTION properties mentioned above .
    [Show full text]
  • Does the Seventh Amendment Compel Fact-‐Finding Before
    HAVE WE GONE TOO FAR: DOES THE SEVENTH AMENDMENT COMPEL FACT-FINDING BEFORE REACHING A DECISION ON PATENT- ELIGIBLE SUBJECT MATTER? JESSE D.H. SNYDER* I. INTRODUCTION Something seems amiss. Settled notions of what can be Patenta- ble are changing.1 To complicate matters further, so far, neither the SuPreme Court nor the Federal Circuit has addressed whether the in- quiry into Patent-eliGible subject matter is factual, legal, or both. And while the scoPe of Patentable subject matter is understandably con- strictinG, the end result may not be coterminous with the SuPreme Court’s Guidance in Alice Corporation Party Limited v. CLS Bank.2 Under Alice, which built uPon the Patent-eliGible subject matter frameworks of Prior cases, for those Patent claims that are directed to a Patent- ineligible concePt (e.G., abstract ideas), Patentability turns on whether an “inventive concePt” exists to “‘transform the nature of the claim’ into a Patent-eliGible aPPlication.”3 The lower courts have seized on the Alice holding, inhuming Pa- tents whose subject-matter failures render them invalid as a matter of law. But what if the means adoPted by the lower courts to reach that leGal conclusion also sidestePs certain constitutional guarantees? What if they are simPlifyinG the analysis at a facial level when a more granular investigation is required? What if, at the motion to dismiss staGe, fact-findinG is still required to determine whether a Patent is * 2015-2016 term law clerk to the Honorable Jimmie V. Reyna of the U.S. Court of APPeals for the Federal Circuit. I earned my J.D., summa cum laude, from Texas Wesleyan School of Law and my B.S.
    [Show full text]
  • Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore
    SHRI VAISHNAV VIDYAPEETH VISHWAVIDYALAYA, INDORE Memories are special moments that tell our story SMRITI मृत ALUMNI DIRECTORY 2020 The rising flame epitomises leadership through enlightenment The bright orange colour represents brilliance and colour blue reflects serenity and infinity तमसो मा योतगमय Lead me from darkness to light ABOUT UNIVERSITY Shri Vaishnav Vidyapeeth Vishwavidyalaya is a state private university established under Madhya Pradesh Niji Vishwavidyalaya (Sthapana Avam Sanchalan) Adhiniyam in 2015 at Indore, MP(India). The University has been established with a vision to be a leader in shaping better future for mankind through quality education, training and research. It shall pursue the mission to make a difference in sustaining the growth of global societies by developing socially responsible citizens. Value based education being at the helm, the University offers degree and diploma programs through 13 constituent institutes and schools, besides Faculty of Doctoral Studies and Research. Some of the objectives of the University are as under: • To provide teaching and training in higher education and make provision for research as well as advancement and dissemination of knowledge. • To ensure world class quality in its offerings and create higher levels of intellectual abilities. • To create centres of excellence for research and development for sharing knowledge and its applications. Shri Vaishnav Vidyapeeth Vishwavidyalaya at Indore is a multi-disciplinary university focusing on the needs of various segments of the society. FROM THE DESK OF CHANCELLOR “To emerge as a winner, learn to balance relaxation and action” Shri Vaishnav Vidyapeeth Vishwavidyalaya was conceived as an institution of higher learning for imparting quality education to the young and experienced learners alike.
    [Show full text]
  • A Look at Some Compilers MATERIALS from the DRAGON BOOK and WIKIPEDIA MICHAEL WOLLOWSKI
    2/11/20 A Look at some Compilers MATERIALS FROM THE DRAGON BOOK AND WIKIPEDIA MICHAEL WOLLOWSKI EQN oTakes inputs like “E sub 1” and produces commands for text formatter TROFF to produce “E1” 1 2/11/20 EQN EQN oTreating EQN as a language and applying compiler technologies has several benefits: oEase of implementation. oLanguage evolution. In response to user needs 2 2/11/20 Pascal Developed by Nicolas Wirth. Generated machine code for the CDC 6000 series machines To increase portability, the Pascal-P compiler generates P-code for an abstract stack machine. One pass recursive-descent compiler Storage is organized into 4 areas: ◦ Code for procedures ◦ Constants ◦ Stack for activation records ◦ Heap for data allocated by the new operator. Procedures may be nested, hence, activation record for a procedure contains both access and control links. CDC 6000 series The first member of the CDC 6000 series Was the supercomputer CDC 6600, Designed by Seymour Cray and James E. Thornton Introduced in September 1964 Performed up to three million instructions per second, three times faster than the IBM Stretch, the speed champion for the previous couple of years. It remained the fastest machine for five years until the CDC 7600 Was launched. The machine Was Freon refrigerant cooled. Control Data manufactured about 100 machines of this type, selling for $6 to $10 million each. 3 2/11/20 CDC 6000 series By Steve Jurvetson from Menlo Park, USA - Flickr, CC BY 2.0, https://commons.Wikimedia.org/w/index.php?curid=1114605 CDC 205 CDC 205 DKRZ 4 2/11/20 CDC 205 CDC 205 Wiring, davdata.nl Pascal 5 2/11/20 Pascal One of the compiler Writers states about the use of a one-pass compiler: ◦ Easy to implement ◦ Imposes severe restrictions on the quality of the generated code and suffers from relatively high storage requirements.
    [Show full text]
  • Mach-O Programming Topics
    Mach-O Programming Topics Tools > Compiling & Debugging 2006-11-28 subsidiaries in the United States and other Apple Inc. countries. © 2003, 2006 Apple Computer, Inc. Java and all Java-based trademarks are All rights reserved. trademarks or registered trademarks of Sun Microsystems, Inc. in the U.S. and other No part of this publication may be countries. reproduced, stored in a retrieval system, or transmitted, in any form or by any means, PowerPC and and the PowerPC logo are mechanical, electronic, photocopying, trademarks of International Business recording, or otherwise, without prior Machines Corporation, used under license written permission of Apple Inc., with the therefrom. following exceptions: Any person is hereby UNIX is a registered trademark of The Open authorized to store documentation on a Group single computer for personal use only and Simultaneously published in the United to print copies of documentation for States and Canada. personal use provided that the documentation contains Apple’s copyright Even though Apple has reviewed this document, APPLE MAKES NO WARRANTY OR notice. REPRESENTATION, EITHER EXPRESS OR IMPLIED, WITH RESPECT TO THIS The Apple logo is a trademark of Apple Inc. DOCUMENT, ITS QUALITY, ACCURACY, MERCHANTABILITY, OR FITNESS FOR A Use of the “keyboard” Apple logo PARTICULAR PURPOSE. AS A RESULT, THIS (Option-Shift-K) for commercial purposes DOCUMENT IS PROVIDED “AS IS,” AND YOU, THE READER, ARE ASSUMING THE without the prior written consent of Apple ENTIRE RISK AS TO ITS QUALITY AND may constitute trademark infringement and ACCURACY. unfair competition in violation of federal IN NO EVENT WILL APPLE BE LIABLE FOR and state laws.
    [Show full text]
  • Steps Toward a Compiler for BLISS-360
    STEPS TOWARD A COMPILER FOR BLISS-360 Richard Charles Bahler HffiE 1 ihshL postgraduate school Monterey, California THESIS - STEPS TOWARD A COMPILER FOR BLISS- 360 by Richard Charles Bahler Thesis Advisor: Gary A . Kildall June 1972 Appiov&d ^oh. pubtic k.qA.qju> e; diA&iibntion untimittd. Steps Toward a Compiler for BLISS-360 by Richard Charles Bahler Major, United States Marine Corps Reserve B.A., University of Rochester, 1955 Submitted in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE IN COMPUTER SCIENCE from the NAVAL POSTGRADUATE SCHOOL June 1972 ABSTRACT The design of a compiler for the IBM S/360 systems implementation language BLISS-360, a modification of the PDP-10 language BLISS- 10, is described. The compiler has a two-pass structure that is based upon the XPL Compiler Generator System. The first of these passes, which uses the XPL prototype compiler Skeleton,, is examined in some detail. Funda- mental data structures are described for this pass, including a constant table, a dictionary for variable definitions, and an intermediate language table to retain the source program structure and semantics. Modifications which allow the Skeleton compiler to perform a syntax analysis of BLISS- 360 programs are discussed and demonstrated. General requirements are defined for the functions to be performed by the second pass, including machine language code generation from the intermediate language, storage allocation and building program interface linkage. TABLE OF CONTENTS I. INTRODUCTION 9 A. PROJECT GOAL 9 B. THESIS OBJECTIVES 9 II. A BLISS-360 COMPILER — POSSIBLE APPROACHES 11 A. REQUIREMENTS OF THE COMPILER 11 B.
    [Show full text]
  • The Design of an Optimizing Compiler Wulf, Johnsson, Weinstock, Hobbs
    The Design of an Optimizing Compiler Wulf, Johnsson, Weinstock, Hobbs, and Geschke and The Production-Quality Compiler-Compiler Project Leverett, Cattell, Hobbs, Newcomer, Reiner, Schatz, Wulf Bliss/11 • an outstanding optimizing compiler for the PDP-11 • a fairly simple systems programming language • relied heavily on special case knowledge • strong emphasis on code selection & limited resources Comp 12, Spring 1996 Lecture 5, Page 1 Structure of the Bliss/11 Compiler delay tla - lex syn flo - - - rank final - pack - code - - The phases lexsynflo — scanning, parsing, data-flow analysis delay — determines shape & evaluation order, estimates costs tla, rank, pack — register allocation (memory–memory ops) code — tries to generate optimal code for each expression final — produce object code and perform peephole optimizations Comp 12, Spring 1996 Lecture 5, Page 2 lex-syn-flo lex-syn • hand constructed dfa finds lexemes & builds tables • top-down, recursive descent parser on simplified language (operator language w/o left recursion) • uses an explicit, auxilliary stack to construct tree • local constant folding in constructors • retain extra information to improve error recovery flo • flow analysis to identify optimization opportunities • finds common subexpressions and threads them together • finds possible code motion (hoisting, licm) & threads them • works inside out & incrementally (action routines) Output is set of tables, trees, and threaded opportunities Comp 12, Spring 1996 Lecture 5, Page 3 delay Goals 1. determine the “general shape” of the
    [Show full text]
  • Openvms Linker Utility Manual
    OpenVMS Linker Utility Manual Order Number: AA–PV6CD–TK April 2001 This manual describes the OpenVMS Linker utility. Revision/Update Information: This manual supersedes the OpenVMS Linker Utility Manual, Version 7.1 Software Version: OpenVMS Alpha Version 7.3 OpenVMS VAX Version 7.3 Compaq Computer Corporation Houston, Texas © 2001 Compaq Computer Corporation Compaq, VAX, VMS, and the Compaq logo Registered in U.S. Patent and Trademark Office. OpenVMS is a trademark of Compaq Information Technologies Group, L.P. in the United States and other countries. UNIX is a trademark of The Open Group. All other product names mentioned herein may be the trademarks or registered trademarks of their respective companies. Confidential computer software. Valid license from Compaq required for possession, use, or copying. Consistent with FAR 12.211 and 12.212, Commercial Computer Software, Computer Software Documentation, and Technical Data for Commercial Items are licensed to the U.S. Government under vendor’s standard commercial license. Compaq shall not be liable for technical or editorial errors or omissions contained herein. The information in this document is provided "as is" without warranty of any kind and is subject to change without notice. The warranties for Compaq products are set forth in the express limited warranty statements accompanying such products. Nothing herein should be construed as constituting an additional warranty. ZK4548 The Compaq OpenVMS documentation set is available on CD–ROM. This document was prepared using VAX DOCUMENT Version 2.1. Contents Preface ............................................................ xi Part I Linker Utility Description 1 Introduction 1.1 Overview . ................................................ 1–1 1.1.1 Linker Functions .
    [Show full text]
  • The Blacklisting Memory Scheduler: Balancing Performance, Fairness and Complexity
    SAFARI Technical Report No. 2015-004 (March, 2015) The Blacklisting Memory Scheduler: Balancing Performance, Fairness and Complexity Lavanya Subramanian, Donghyuk Lee, Vivek Seshadri, Harsha Rastogi, Onur Mutlu Carnegie Mellon University flsubrama,donghyu1,visesh,harshar,[email protected] SAFARI Technical Report No. 2015-004 Abstract—In a multicore system, applications running on different cores is application-aware memory request scheduling (e.g., [30, interfere at main memory. This inter-application interference degrades 31, 28, 17, 18, 41]). The basic idea of application-aware overall system performance and unfairly slows down applications. Prior works have developed application-aware memory request schedulers to memory scheduling is to prioritize requests of different ap- tackle this problem. State-of-the-art application-aware memory request plications differently, based on the applications’ memory ac- schedulers prioritize memory requests of applications that are vulner- cess characteristics. State-of-the-art application-aware memory able to interference, by ranking individual applications based on their memory access characteristics and enforcing a total rank order. schedulers typically i) monitor applications’ memory access In this paper, we observe that state-of-the-art application-aware characteristics, ii) rank applications individually based on memory schedulers have two major shortcomings. First, such sched- these characteristics such that applications that are vulnerable ulers trade off hardware complexity in order to achieve high performance or fairness, since ranking applications individually with a total order to interference are ranked higher and iii) prioritize requests based on memory access characteristics leads to high hardware cost based on the computed ranking. and complexity. Such complexity could prevent the scheduler from We observe that there are two major problems with past meeting the stringent timing requirements of state-of-the-art DDR pro- tocols.
    [Show full text]
  • The Oracle, 1934 Bangor High School
    Bangor Public Library Bangor Community: Digital Commons@bpl Bangor High School Yearbooks Bangor High School 1934 The Oracle, 1934 Bangor High School Follow this and additional works at: https://digicom.bpl.lib.me.us/bhs_yearbooks Recommended Citation Bangor High School, "The Oracle, 1934" (1934). Bangor High School Yearbooks. 30. https://digicom.bpl.lib.me.us/bhs_yearbooks/30 This Book is brought to you for free and open access by the Bangor High School at Bangor Community: Digital Commons@bpl. It has been accepted for inclusion in Bangor High School Yearbooks by an authorized administrator of Bangor Community: Digital Commons@bpl. For more information, please contact [email protected]. c - ?- THE ORACLE JUNE, 1934 PUBLISHED SIX TIMES A YEAR BY THE STUDENTS OF BANGOR HIGH SCHOOL BANGOR, MAINE Tlot• "Or.ot·J,." ;, approvt•cl l1y the Bangor ( ' l1 ~11n lu.•r of Comml'H'l' a .. an ~lClvt"1 - l;\;11g tHl'ff;um . Entt•recl a\ St•,-ou cl LH\ Mattt.•r ,lnnt• 14. 19 14, at th,· p,.,t Qfl,.,.. 11 Ban gor, M .1in,., 111><lt•r tlw A, I of M ai< lc , 1879. ... - --- -- - - - -~ -· -- _.. • • • • • • • • • We wish to express our thanks to thr following through whm;p aid the Oratlc ha: hcc•n able to cont inu<': Thr ach·rrti. J"; ::\Ir. IIolyokc• and the .\Ianual Training dc•part 111 ·nt, for mounting; the linolC'um blocks; ~liss Knight, for lwr IH'lp with tlw typing. FOREWORD N THE past fifty yearn, progrC'ss has become increa.singly im­ I portant as the keynote of our civilization.
    [Show full text]
  • Department of English
    Department of English AFMILJ> @BOBJLKV May 19, 2018 welcome graduates, families, and friends! This is an exciting day for us, faculty and staff in the English department, as we honor and congratulate our undergrad- uate and graduate students on receiving their degrees from Carnegie Mellon University: 15 students who are receiving a B.A., five receiving a B.S., one receiving a B.H.A., eight Additional Majors, 24 Minors, 15 receiving an M.A. in Literary and Cultural Studies, 11 receiving an M.A. in Professional Writing, eight receiving an M.A. in Rhetoric, and seven receiving a Ph.D. You, students, will carry the Carnegie Mellon University English degree throughout your lives. We eagerly await what your journey will hold and hope to remain partners with you in your careers going forward. Your success is our success. Our faculty and staff are proud of you and will miss you. I am grateful to them for their dedication to teaching and mentoring. I am also grateful to you, parents, relatives, and friends, who have given our graduates the support they needed to reach this milestone. It takes hard work to earn a degree in English at Carnegie Mellon, but they could not have done it without support— emotional and practical—from all of you, friends and families. Thank you for giving us the opportunity to teach them and learn from them. We are not saying goodbye to you: as alumni, you will always remain our students, and we look forward to learning about your achievements, your plans, your bold ideas.
    [Show full text]
  • WAMOS 2015 Second Wiesbaden Workshop on Advanced Microkernel Operating Systems
    WAMOS 2015 Second Wiesbaden Workshop on Advanced Microkernel Operating Systems Editor / Program Chair: Robert Kaiser RheinMain University of Applied Sciences Information Science Unter den Eichen 5 65195 Wiesbaden Germany Technical Report August 2015 Contents Foreword 3 Program Committee 3 Keynote Talk 5 Session 1: Kernel Design Principles7 Unikernels Kevin Sapper ...........................................7 Shared libraries for the seL4 Kernel Andreas Werner .......................................... 13 Session 2: IPC Performance and Security 19 Improvement of IPC responsiveness in microkernel-based operating systems Steffen Reichmann ......................................... 19 Side Channel and Covert Channel Attacks on Microkernel Architectures Florian Schneider and Alexander Baumgartner¨ ......................... 23 Session 3: Microkernel Scheduling 29 Towards policy-free Microkernels Olga Dedi ............................................. 29 User-level CPU Inheritance Scheduling Sergej Bomke ........................................... 33 Session 4: Device Drivers and I/O 37 USB in a microkernel based operating system Daniel Mierswa and Daniel Tkocz ................................ 37 User-mode device driver development Annalena Gutheil and Benjamin Weißer ............................. 43 Program 50 © Copyright 2015 RheinMain University of Applies Sciences (HSRM). All rights reserved. The copyright of this collection is with HSRM. The copyright of the individual articles remains with their authors. Foreword Welcome to HSRM and to WAMOS
    [Show full text]