DOCSLIB.ORG

Section “Introduction” in Using the GNU Compiler Collection (GCC)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Section “Introduction” in Using the GNU Compiler Collection (GCC) Using the GNU Compiler Collection (GCC) Using the GNU Compiler Collection by Richard M. Stallman and the GCC Developer Community Last updated 23 May 2004 for GCC 3.4.6 For GCC Version 3.4.6 Published by: GNU Press Website: www.gnupress.org a division of the General: [email protected] Free Software Foundation Orders: [email protected] 59 Temple Place Suite 330 Tel 617-542-5942 Boston, MA 02111-1307 USA Fax 617-542-2652 Last printed October 2003 for GCC 3.3.1. Printed copies are available for $45 each. Copyright c 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with the Invariant Sections being “GNU General Public License” and “Funding Free Software”, the Front-Cover texts being (a) (see below), and with the Back-Cover Texts being (b) (see below). A copy of the license is included in the section entitled “GNU Free Documentation License”. (a) The FSF’s Front-Cover Text is: A GNU Manual (b) The FSF’s Back-Cover Text is: You have freedom to copy and modify this GNU Manual, like GNU software. Copies published by the Free Software Foundation raise funds for GNU development. i Short Contents Introduction ...................................... 1 1 Programming Languages Supported by GCC ............ 3 2 Language Standards Supported by GCC ............... 5 3 GCC Command Options .......................... 9 4 C Implementation-defined behavior ................. 175 5 Extensions to the C Language Family ................ 179 6 Extensions to the C++ Language ................... 301 7 GNU Objective-C runtime features.................. 313 8 Binary Compatibility ........................... 319 9 gcov—a Test Coverage Program ................... 323 10 Known Causes of Trouble with GCC ................ 331 11 Reporting Bugs ............................... 351 12 How To Get Help with GCC ...................... 353 13 Contributing to GCC Development ................. 355 Funding Free Software ............................. 357 The GNU Project and GNU/Linux..................... 359 GNU GENERAL PUBLIC LICENSE ................... 361 GNU Free Documentation License ..................... 367 Contributors to GCC .............................. 375 Option Index.................................... 387 Keyword Index .................................. 399 ii Using the GNU Compiler Collection (GCC) iii Table of Contents Introduction .................................. 1 1 Programming Languages Supported by GCC ......................................... 3 2 Language Standards Supported by GCC .... 5 3 GCC Command Options ................... 9 3.1 Option Summary .......................................... 9 3.2 Options Controlling the Kind of Output .................... 18 3.3 Compiling C++ Programs ................................. 21 3.4 Options Controlling C Dialect ............................. 21 3.5 Options Controlling C++ Dialect ........................... 25 3.6 Options Controlling Objective-C Dialect.................... 31 3.7 Options to Control Diagnostic Messages Formatting ......... 34 3.8 Options to Request or Suppress Warnings .................. 35 3.9 Options for Debugging Your Program or GCC .............. 49 3.10 Options That Control Optimization ....................... 56 3.11 Options Controlling the Preprocessor ..................... 77 3.12 Passing Options to the Assembler......................... 86 3.13 Options for Linking...................................... 86 3.14 Options for Directory Search ............................. 89 3.15 Specifying subprocesses and the switches to pass to them ... 90 3.16 Specifying Target Machine and Compiler Version .......... 97 3.17 Hardware Models and Configurations ..................... 97 3.17.1 M680x0 Options .................................. 98 3.17.2 M68hc1x Options ................................ 100 3.17.3 VAX Options .................................... 101 3.17.4 SPARC Options.................................. 101 3.17.5 ARM Options.................................... 106 3.17.6 MN10300 Options ................................ 110 3.17.7 M32R/D Options ................................ 110 3.17.8 IBM RS/6000 and PowerPC Options .............. 112 3.17.9 Darwin Options .................................. 121 3.17.10 MIPS Options .................................. 123 3.17.11 Intel 386 and AMD x86-64 Options ............... 127 3.17.12 HPPA Options.................................. 134 3.17.13 Intel 960 Options ............................... 137 3.17.14 DEC Alpha Options............................. 138 3.17.15 DEC Alpha/VMS Options ....................... 142 3.17.16 H8/300 Options................................. 142 3.17.17 SH Options ..................................... 143 iv Using the GNU Compiler Collection (GCC) 3.17.18 Options for System V ........................... 144 3.17.19 TMS320C3x/C4x Options ....................... 144 3.17.20 V850 Options ................................... 146 3.17.21 ARC Options ................................... 148 3.17.22 NS32K Options ................................. 148 3.17.23 AVR Options ................................... 150 3.17.24 MCore Options ................................. 151 3.17.25 IA-64 Options .................................. 151 3.17.26 D30V Options .................................. 153 3.17.27 S/390 and zSeries Options ....................... 154 3.17.28 CRIS Options................................... 155 3.17.29 MMIX Options ................................. 157 3.17.30 PDP-11 Options ................................ 158 3.17.31 Xstormy16 Options ............................. 159 3.17.32 FRV Options ................................... 159 3.17.33 Xtensa Options ................................. 162 3.18 Options for Code Generation Conventions ................ 163 3.19 Environment Variables Affecting GCC ................... 168 3.20 Using Precompiled Headers ............................. 171 3.21 Running Protoize....................................... 172 4 C Implementation-defined behavior ....... 175 4.1 Translation ............................................. 175 4.2 Environment ............................................ 175 4.3 Identifiers ............................................... 175 4.4 Characters .............................................. 175 4.5 Integers................................................. 176 4.6 Floating point........................................... 176 4.7 Arrays and pointers ..................................... 177 4.8 Hints ................................................... 177 4.9 Structures, unions, enumerations, and bit-fields ............ 177 4.10 Qualifiers .............................................. 178 4.11 Preprocessing directives ................................. 178 4.12 Library functions ....................................... 178 4.13 Architecture ........................................... 178 4.14 Locale-specific behavior ................................. 178 5 Extensions to the C Language Family ..... 179 5.1 Statements and Declarations in Expressions ............... 179 5.2 Locally Declared Labels .................................. 180 5.3 Labels as Values......................................... 181 5.4 Nested Functions ........................................ 182 5.5 Constructing Function Calls .............................. 184 5.6 Referring to a Type with typeof ......................... 184 5.7 Generalized Lvalues ..................................... 186 5.8 Conditionals with Omitted Operands ..................... 187 5.9 Double-Word Integers.................................... 187 5.10 Complex Numbers...................................... 187 v 5.11 Hex Floats ............................................. 188 5.12 Arrays of Length Zero .................................. 188 5.13 Structures With No Members ........................... 189 5.14 Arrays of Variable Length ............................... 190 5.15 Macros with a Variable Number of Arguments. ........... 191 5.16 Slightly Looser Rules for Escaped Newlines ............... 191 5.17 Non-Lvalue Arrays May Have Subscripts ................. 192 5.18 Arithmetic on void- and Function-Pointers ............... 192 5.19 Non-Constant Initializers................................ 192 5.20 Compound Literals ..................................... 192 5.21 Designated Initializers .................................. 193 5.22 Case Ranges ........................................... 194 5.23 Cast to a Union Type................................... 195 5.24 Mixed Declarations and Code ........................... 195 5.25 Declaring Attributes of Functions ........................ 195 5.26 Attribute Syntax ....................................... 206 5.27 Prototypes and Old-Style Function Definitions ............ 209 5.28 C++ Style Comments ................................... 209 5.29 Dollar Signs in Identifier Names ......................... 210 5.30 The Character hESCi in Constants ........................ 210 5.31 Inquiring on Alignment of Types or Variables............. 210 5.32 Specifying Attributes of Variables........................ 210 5.32.1 M32R/D Variable Attributes ...................... 214 5.32.2 i386 Variable Attributes .......................... 215 5.33 Specifying Attributes of Types .......................... 215 5.33.1 i386 Type Attributes ............................
Load more

Recommended publications
  • Risc I: a Reduced Instruction Set Vlsi Computer
    RISC I: A REDUCED INSTRUCTION SET VLSI COMPUTER DAVID A. PATTERSON and CARLO H. SEQUIN Computer Science Division University of California Berkeley, California ABSTRACT to implement CISC is the best way to use this “scarce” resource. The Reduced Instruction Set Computer (RISC) Project investigates an alternatrve to the general trend toward computers wrth increasingly complex instruction sets: With a The above findings led to the Reduced Instruction Set proper set of instructions and a corresponding architectural Computer (RISC) Project. The purpose of the project is design, a machine wrth a high effective throughput can be to explore alternatives to the general trend toward achieved. The simplicity of the instruction set and addressing architectural complexity. The hypothesis is that by modes allows most Instructions to execute in a single machine cycle, and the srmplicity of each instruction guarantees a short reducing the instruction set, VLSI architecture can be cycle time. In addition, such a machine should have a much designed that uses the scarce resources more effectively shorter design trme. than CISC. We also expect this approach to reduce design time, the number of design errors, and the This paper presents the architecture of RISC I and its novel execution time of individual instructions. hardware support scheme for procedure call/return. Overlapprng sets of regrster banks that can pass parameters directly to subrouttnes are largely responsible for the excellent Our initial version of such a computer is called RISC I. performance of RISC I. Static and dynamtc comparisons To meet our goals of simplicity and effective single-chip between this new architecture and more traditional machines implementation, we placed the following “constraints” are given.
    [Show full text]
  • Computer Architecture and Assembly Language
    Computer Architecture and Assembly Language Gabriel Laskar EPITA 2015 License I Copyright c 2004-2005, ACU, Benoit Perrot I Copyright c 2004-2008, Alexandre Becoulet I Copyright c 2009-2013, Nicolas Pouillon I Copyright c 2014, Joël Porquet I Copyright c 2015, Gabriel Laskar Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with the Invariant Sections being just ‘‘Copying this document’’, no Front-Cover Texts, and no Back-Cover Texts. Introduction Part I Introduction Gabriel Laskar (EPITA) CAAL 2015 3 / 378 Introduction Problem definition 1: Introduction Problem definition Outline Gabriel Laskar (EPITA) CAAL 2015 4 / 378 Introduction Problem definition What are we trying to learn? Computer Architecture What is in the hardware? I A bit of history of computers, current machines I Concepts and conventions: processing, memory, communication, optimization How does a machine run code? I Program execution model I Memory mapping, OS support Gabriel Laskar (EPITA) CAAL 2015 5 / 378 Introduction Problem definition What are we trying to learn? Assembly Language How to “talk” with the machine directly? I Mechanisms involved I Assembly language structure and usage I Low-level assembly language features I C inline assembly Gabriel Laskar (EPITA) CAAL 2015 6 / 378 I Programmers I Wise managers Introduction Problem definition Who do I talk to? I System gurus I Low-level enthusiasts Gabriel Laskar (EPITA) CAAL
    [Show full text]
  • GNU M4, Version 1.4.7 a Powerful Macro Processor Edition 1.4.7, 23 September 2006
    GNU M4, version 1.4.7 A powerful macro processor Edition 1.4.7, 23 September 2006 by Ren´eSeindal This manual is for GNU M4 (version 1.4.7, 23 September 2006), a package containing an implementation of the m4 macro language. Copyright c 1989, 1990, 1991, 1992, 1993, 1994, 2004, 2005, 2006 Free Software Foundation, Inc. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled “GNU Free Documentation License.” i Table of Contents 1 Introduction and preliminaries ................ 3 1.1 Introduction to m4 ............................................. 3 1.2 Historical references ............................................ 3 1.3 Invoking m4 .................................................... 4 1.4 Problems and bugs ............................................. 8 1.5 Using this manual .............................................. 8 2 Lexical and syntactic conventions ............ 11 2.1 Macro names ................................................. 11 2.2 Quoting input to m4........................................... 11 2.3 Comments in m4 input ........................................ 11 2.4 Other kinds of input tokens ................................... 12 2.5 How m4 copies input to output ................................ 12 3 How to invoke macros........................
    [Show full text]
  • UNIX Reference Card
    UNlxt Reference Card distributed by Computing Information Service BELL LABORATORIES Murray Hill, N. J. 07974 compiled by Lorinda Cherry Second Edition March, 1979 TABLE OF CO~TEJIo"TS la. GENERAL UNIX COMMANDS adb general purpose debugger ...S. 21 ar archive & library maimainer. ..S as assembler. ..S at execute commands at designated time S awk pattern scanning & processing language S bas basic ...S basename strip filename affixes ...5 be arbitrary precision interactive language ... S calendar reminder service ... 5 cat concatenate & print...5 cb C program beautifier ...no arguments cc C compiler ...5 cd change working directory 5 chgrp change groupoid of files 6 . chmod change mode of files S chown change owner of files 6 cmp compare 2 files ...6 col filter reverse line feeds ...6 comm print" lines common to 2 files ...6 cp copy ...6 crypt encode/decode 6 date print or set date 6 de desk calculator 6 dd convert & copy a file ...6 deroff remove text formatting commands ...6 diff differential file comparator. ..6 dUO 3-way differential file comparison ...6 du summarize disk usage ...6 echo echo arguments ...7 ed text editor. ..7, 20 egrep full regular expression pattern search ...8 enroll enroll in secret mail...no arguments eqn typeset mathematics ...7. 29 expr evaluate arguments as expressions ...7 fT7 Fortran 77 compiler ... 7 factor factor a number ...7 false truth value ...no arguments fgrep search for a fixed pauern ...8 file determine file type ...7 find find files ...7 graph draw a graph ...7 grep search a file for a pattern ...8 join relational database operator.
    [Show full text]
  • GNU M4, Version 1.4.19 a Powerful Macro Processor Edition 1.4.19, 28 May 2021
    GNU M4, version 1.4.19 A powerful macro processor Edition 1.4.19, 28 May 2021 by Ren´eSeindal, Fran¸coisPinard, Gary V. Vaughan, and Eric Blake ([email protected]) This manual (28 May 2021) is for GNU M4 (version 1.4.19), a package containing an implementation of the m4 macro language. Copyright c 1989{1994, 2004{2014, 2016{2017, 2020{2021 Free Software Foundation, Inc. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled \GNU Free Documentation License." i Table of Contents 1 Introduction and preliminaries ::::::::::::::::: 3 1.1 Introduction to m4 :::::::::::::::::::::::::::::::::::::::::::::: 3 1.2 Historical references :::::::::::::::::::::::::::::::::::::::::::: 3 1.3 Problems and bugs ::::::::::::::::::::::::::::::::::::::::::::: 4 1.4 Using this manual :::::::::::::::::::::::::::::::::::::::::::::: 5 2 Invoking m4::::::::::::::::::::::::::::::::::::::: 7 2.1 Command line options for operation modes ::::::::::::::::::::: 7 2.2 Command line options for preprocessor features ::::::::::::::::: 8 2.3 Command line options for limits control ::::::::::::::::::::::: 10 2.4 Command line options for frozen state ::::::::::::::::::::::::: 11 2.5 Command line options for debugging :::::::::::::::::::::::::: 11 2.6 Specifying input files on the command line :::::::::::::::::::::
    [Show full text]
  • Programmer's Manual. the Documents Here Are Grouped
    Programmer’s Manual. The documents here are grouped roughly into the areas of basics, editing, language tools, document preparation, and system maintenance. Further general information may be found in the Bell System Tech- nical Journal special issue on UNIX, July-August, 1978. Many of the documents cited within this volume as Bell Laboratories internal memoranda or Computing Science Technical Reports (CSTR) are also contained here. These documents contain occasional localisms, typically references to other operating systems like GCOS and IBM. In all cases, such references may be safely ignored by UNIX users. General Works 1.7th Edition UNIX — Summary. A concise summary of the facilities available on UNIX. 2.The UNIX Time-Sharing System. D. M. Ritchie and K. Thompson. The original UNIX paper, reprinted from CACM. Getting Started 3.UNIX for Beginners — Second Edition. B. W. Kernighan. An introduction to the most basic use of the system. 4.A Tutorial Introduction to the UNIX Text Editor. B. W. Kernighan. An easy way to get started with the editor. 5.Advanced Editing on UNIX. B. W. Kernighan. The next step. 6.An Introduction to the UNIX Shell. S. R. Bourne. An introduction to the capabilities of the command interpreter, the shell. 7.Learn — Computer Aided Instruction on UNIX. M. E. Lesk and B. W. Kernighan. Describes a computer-aided instruction program that walks new users through the basics of files, the edi- tor, and document preparation software. Document Preparation 8.Typing Documents on the UNIX System. M. E. Lesk. Describes the basic use of the formatting tools. Also describes ‘‘−ms’’, a standardized package of format- ting requests that can be used to lay out most documents (including those in this volume).
    [Show full text]
  • VME for Experiments Chairman: Junsei Chiba (KEK)
    KEK Report 89-26 March 1990 D PROCEEDINGS of SYMPOSIUM on Data Acquisition and Processing for Next Generation Experiments 9 -10 March 1989 KEK, Tsukuba Edited by H. FUJII, J. CHIBA and Y. WATASE NATIONAL LABORATORY FOR HIGH ENERGY PHYSICS PROCEEDINGS of SYMPOSIUM on Data Acquisition and Processing for Next Generation Experiments 9 - 10 March 1989 KEK, Tsukuba Edited H. Fiflii, J. Chiba andY. Watase i National Laboratory for High Energy Physics, 1990 KEK Reports are available from: Technical Infonnation&Libraiy National Laboratory for High Energy Physics 1-1 Oho, Tsukuba-shi Ibaraki-ken, 305 JAPAN Phone: 0298-64-1171 Telex: 3652-534 (Domestic) (0)3652-534 (International) Fax: 0298-64-4604 Cable: KEKOHO Foreword This symposium has been organized to foresee the next generation of data acquisition and processing system in high energy physics and nuclear physics experiments. The recent revolutionary progress in the semiconductor and computer technologies is giving us an oppotunity to extend our idea on the experiments. The high density electronics of LSI technology provides an ideal front-end electronics such as readout circuits for silicon strip detector and multi-anode phototubes as well as wire chambers. The VLSI technology has advantages over the obsolite discrete one in the various aspects ; reduction of noise, small propagation delay, lower power dissipation, small space for the installation, improvement of the system reliability and maintenability. The small sized front-end electronics will be mounted just on the detector and the digital data might be transfered off the detector to the computer room with optical fiber data transmission lines. Then, a monster of bandies of signal cables might disappear from the experimental area.
    [Show full text]
  • MIPS Assembly Language Programming Using Qtspim
    MIPS Assembly Language Programming using QtSpim Ed Jorgensen, Ph.D. Version 1.1.50 July 2019 Cover image: MIPS R3000 Custom Chip http://commons.wikimedia.org/wiki/File:RCP-NUS_01.jpg Spim is copyrighted by James Larus and distributed under a BSD license. Copyright (c) 1990-2011, James R. Larus. All rights reserved. Copyright © 2013, 2014, 2015, 2016, 2017 by Ed Jorgensen You are free: To Share — to copy, distribute and transmit the work To Remix — to adapt the work Under the following conditions: Attribution — you must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work). Noncommercial — you may not use this work for commercial purposes. Share Alike — if you alter, transform, or build upon this work, you may distribute the resulting work only under the same or similar license to this one. Table of Contents 1.0 Introduction...........................................................................................................1 1.1 Additional References.........................................................................................1 2.0 MIPS Architecture Overview..............................................................................3 2.1 Architecture Overview........................................................................................3 2.2 Data Types/Sizes.................................................................................................4 2.3 Memory...............................................................................................................4
    [Show full text]
  • Time-Sharing System
    UNIXTM TIME-SHARING SYSTEM: UNIX PROGRAMMER'S MANUAL Seventh Edition, Volume 2B January, 1979 Bell Telephone Laboratories, Incorporated Murray Hill, New Jersey Yacc: Yet Another Compiler-Compiler Stephen C. Johnson Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT Computer program input generally has some structure; in fact, every computer program that does input can be thought of as de®ning an ``input language'' which it accepts. An input language may be as complex as a programming language, or as sim- ple as a sequence of numbers. Unfortunately, usual input facilities are limited, dif®cult to use, and often are lax about checking their inputs for validity. Yacc provides a general tool for describing the input to a computer program. The Yacc user speci®es the structures of his input, together with code to be invoked as each such structure is recognized. Yacc turns such a speci®cation into a subroutine that handles the input process; frequently, it is convenient and appropriate to have most of the ¯ow of control in the user's application handled by this subroutine. The input subroutine produced by Yacc calls a user-supplied routine to return the next basic input item. Thus, the user can specify his input in terms of individual input characters, or in terms of higher level constructs such as names and numbers. The user-supplied routine may also handle idiomatic features such as comment and con- tinuation conventions, which typically defy easy grammatical speci®cation. Yacc is written in portable C. The class of speci®cations accepted is a very gen- eral one: LALR(1) grammars with disambiguating rules.
    [Show full text]
  • Design of the RISC-V Instruction Set Architecture
    Design of the RISC-V Instruction Set Architecture Andrew Waterman Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-2016-1 http://www.eecs.berkeley.edu/Pubs/TechRpts/2016/EECS-2016-1.html January 3, 2016 Copyright © 2016, by the author(s). All rights reserved. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission. Design of the RISC-V Instruction Set Architecture by Andrew Shell Waterman A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate Division of the University of California, Berkeley Committee in charge: Professor David Patterson, Chair Professor Krste Asanovi´c Associate Professor Per-Olof Persson Spring 2016 Design of the RISC-V Instruction Set Architecture Copyright 2016 by Andrew Shell Waterman 1 Abstract Design of the RISC-V Instruction Set Architecture by Andrew Shell Waterman Doctor of Philosophy in Computer Science University of California, Berkeley Professor David Patterson, Chair The hardware-software interface, embodied in the instruction set architecture (ISA), is arguably the most important interface in a computer system. Yet, in contrast to nearly all other interfaces in a modern computer system, all commercially popular ISAs are proprietary.
    [Show full text]
  • Computer Architectures an Overview
    Computer Architectures An Overview PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sat, 25 Feb 2012 22:35:32 UTC Contents Articles Microarchitecture 1 x86 7 PowerPC 23 IBM POWER 33 MIPS architecture 39 SPARC 57 ARM architecture 65 DEC Alpha 80 AlphaStation 92 AlphaServer 95 Very long instruction word 103 Instruction-level parallelism 107 Explicitly parallel instruction computing 108 References Article Sources and Contributors 111 Image Sources, Licenses and Contributors 113 Article Licenses License 114 Microarchitecture 1 Microarchitecture In computer engineering, microarchitecture (sometimes abbreviated to µarch or uarch), also called computer organization, is the way a given instruction set architecture (ISA) is implemented on a processor. A given ISA may be implemented with different microarchitectures.[1] Implementations might vary due to different goals of a given design or due to shifts in technology.[2] Computer architecture is the combination of microarchitecture and instruction set design. Relation to instruction set architecture The ISA is roughly the same as the programming model of a processor as seen by an assembly language programmer or compiler writer. The ISA includes the execution model, processor registers, address and data formats among other things. The Intel Core microarchitecture microarchitecture includes the constituent parts of the processor and how these interconnect and interoperate to implement the ISA. The microarchitecture of a machine is usually represented as (more or less detailed) diagrams that describe the interconnections of the various microarchitectural elements of the machine, which may be everything from single gates and registers, to complete arithmetic logic units (ALU)s and even larger elements.
    [Show full text]
  • Oral History of Brian Kernighan
    Oral History of Brian Kernighan Interviewed by: John R. Mashey Recorded April 24, 2017 Princeton, NJ CHM Reference number: X8185.2017 © 2017 Computer History Museum Oral History of Brian Kernighan Mashey: Well, hello, Brian. It’s great to see you again. Been a long time. So we’re here at Princeton, with Brian Kernighan, and we want to go do a whole oral history with him. So why don’t we start at the beginning. As I recall, you’re Canadian. Kernighan: That is right. I was born in Toronto long ago, and spent my early years in the city of Toronto. Moved west to a small town, what was then a small town, when I was in the middle of high school, and then went to the University of Toronto for my undergraduate degree, and then came here to Princeton for graduate school. Mashey: And what was your undergraduate work in? Kernighan: It was in one of these catch-all courses called Engineering Physics. It was for people who were kind of interested in engineering and math and science and didn’t have a clue what they wanted to actually do. Mashey: <laughs> So how did you come to be down here? Kernighan: I think it was kind of an accident. It was relatively unusual for people from Canada to wind up in the United States for graduate school at that point, but I thought I would try something different and so I applied to six or seven different schools in the United States, got accepted at some of them, and then it was a question of balancing things like, “Well, they promised that they would get you out in a certain number of years and they promised that they would give you money,” but the question is whether, either that was true or not and I don’t know.
    [Show full text]