The Hiphop Compiler for PHP

Total Page:16

File Type:pdf, Size:1020Kb

The Hiphop Compiler for PHP The HipHop Compiler for PHP Haiping Zhao Iain Proctor Minghui Yang Xin Qi Mark Williams Qi Gao Guilherme Ottoni ∗ Andrew Paroski Scott MacVicar Jason Evans Stephen Tu † Facebook, Inc. Abstract 1. Introduction Scripting languages are widely used to quickly accomplish General-purpose scripting languages like Perl, Python, PHP, a variety of tasks because of the high productivity they en- Ruby, and Lua have been widely used to quickly accom- able. Among other reasons, this increased productivity re- plish a broad variety of tasks. Although there are several sults from a combination of extensive libraries, fast devel- reasons for the widespread adoption of these languages, the opment cycle, dynamic typing, and polymorphism. The dy- key common factor across all of them is the high program- namic features of scripting languages are traditionally asso- mers’ productivity that they enable [14]. This high produc- ciated with interpreters, which is the approach used to imple- tivity is the result of a number of factors. First, these lan- ment most scripting languages. Although easy to implement, guages typically provide a rich set of libraries, which re- interpreters are generally slow, which makes scripting lan- duce the amount of code that programmers need to write, guages prohibitive for implementing large, CPU-intensive test, and debug. Second, the dynamically-typed nature of applications. This efficiency problem is particularly impor- scripting languages provides flexibility and high degrees of tant for PHP given that it is the most commonly used lan- dynamic polymorphism. Last, and most important, dynamic guage for server-side web development. languages are in general purely interpreted, thus providing This paper presents the design, implementation, and an a fast cycle to modify and test source changes. By “purely evaluation of the HipHop compiler for PHP. HipHop goes interpreted” we mean that there is no compilation step nec- against the standard practice and implements a very dy- essary to run a program after writing or modifying it. This namic language through static compilation. After describ- advantage is particularly relevant in the development of very ing the most challenging PHP features to support through large systems, which typically take substantial time to stati- static compilation, this paper presents HipHop’s design and cally compile and link. techniques that support almost all PHP features. We then On the down side, the major issue with scripting lan- present a thorough evaluation of HipHop running both stan- guages in general is performance. Because of their dynamic dard benchmarks and the Facebook web site. Overall, our features, these languages are typically implemented via in- experiments demonstrate that HipHop is about 5.5× faster terpreters. Experiments have shown that programs tend to than standard, interpreted PHP engines. As a result, HipHop take an order of magnitude more CPU time to run when im- has reduced the number of servers needed to run Facebook plemented in interpreted languages compared to correspond- and other web sites by a factor between 4 and 6, thus drasti- ing implementations in compiled languages [22]. cally cutting operating costs. Although performance is often not important for small Categories and Subject Descriptors D.3.4 [Programming scripts written to accomplish simple tasks, it does become a Languages]: Processors – compilers, optimization, code major problem when developing large CPU-intensive appli- generation cations. This has spurred a number of efforts to try to im- General Terms Languages, Design, Performance prove the performance of scripting languages [3, 8, 10, 19, Keywords PHP, dynamic languages, compilation, C++ 21, 24]. Among all general-purpose scripting languages, this ∗ Contact author. E-mail address: [email protected] problem is probably most pronounced for PHP, since it is the † Currently affiliated with MIT. most commonly used language for server-side web develop- ment [23]. Given the scale of users and data that Internet Permission to make digital or hard copies of all or part of this work for personal or companies have, improving server efficiency is a key factor 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 to reduce their operating costs incurred by running huge data on the first page. To copy otherwise, to republish, to post on servers or to redistribute centers. to lists, requires prior specific permission and/or a fee. OOPSLA’12, October 19–26, 2012, Tucson, Arizona, USA. Copyright c 2012 ACM 978-1-4503-1561-6/12/10. .. $10.00 This paper describes the approach that we took at Face- 01) <?php book to address the performance problem of PHP. Our main 02) insight to improve performance was to implement PHP via 03) define("confName", "OOPSLA"); a static compiler, called HipHop. Although static compila- 04) define("firstYear", 1986); 05) tion requires all the code to be known in advance, this is a 06) function year($edition) { minor imposition for server-side applications, which are the 07) return firstYear - 1 + $edition; core usage of PHP. Going against the standard practice of 08) } implementing PHP via interpreters, HipHop has proved to 09) be a high risk, high reward project. As this paper describes, 10) echo "Hello ". confName . "’" . year(27); there are a number of challenges to enable static compila- tion of a dynamic language like PHP. Despite these chal- Figure 1. PHP code example lenges, HipHop supports a very large subset of PHP, and it only lacks a few, less useful language features. HipHop is a source-to-source compiler, and it transforms PHP programs 2. PHP Background into semantically equivalent C++ programs. This design en- ables leveraging high-quality optimizing C++ compilers to PHP is an imperative scripting language, originally con- produce machine code, and we currently use GCC [9]. To ceived in 1995 for creating dynamic web pages. After its ini- obtain high performance, in addition to leveraging GCC op- tial definition, PHP has evolved significantly. Since version timizations, HipHop also implements a number of optimiza- 3, PHP is an object-oriented programming language and to- tions. As our experiments show, this approach has enabled day, at version 5.4, it is a general-purpose language used be- HipHop to run both benchmark and real-world applications yond web development. Like Java, PHP combines interfaces 5.5× faster on average than the standard PHP implementa- and single inheritance. However, since version 5.4, PHP also tion [25]. Finally, although HipHop only supports PHP, we supports traits [5]. In the absence of a formal specification, believe that many of its techniques can be used to improve the language is defined by its standard implementation [25]. the performance of other scripting languages as well. Although PHP syntactically resembles C++, PHP is in- HipHop has been released by Facebook as an open-source herently much more dynamic. Figure 1 illustrates a simple project [6], and it is currently deployed not only within PHP example, which prints “Hello OOPSLA’2012”. The Facebook but also in other companies. In all these cases, defines in lines 3 and 4 are calls to a built-in function that HipHop has reduced the number of servers needed to run declares a constant named after its first argument and with web sites by a factor between 4 and 6, thus drastically cutting value given by its second argument. In line 10, echo prints operating costs. to the output and ‘.’ is string concatenation. Syntactically, This paper describes our experience in the design and some key differences from C++ are: (1) names of variables implementation of the HipHop compiler. More specifically, start with ‘$’, and (2) variables are not declared. this paper makes the following main contributions: Given that C++ well represents the class of static, high- performing languages, while PHP is representative of the much worse performing scripting languages1, it is worth 1. It describes the set of techniques that enabled implement- pointing out the main differences between the two lan- ing a general-purpose, dynamic scripting language with a guages. After describing these differences in Section 2.1, static compiler. Section 2.2 briefly introduces the approach used in PHP’s 2. It describes the set of compilation techniques that enable standard implementation. This brief overview provides key HipHop to achieve outstanding performance for PHP. insights into the performance gap between PHP and C++. 3. It presents a thorough experimental evaluation of HipHop 2.1 Comparison between PHP and C++ running both benchmarks and real-world applications Table 1 summarizes the key language features that are more from Facebook. This evaluation includes comparisons general in PHP than in C++. In general, these PHP features with other PHP execution engines. incur significant runtime costs, and their more restricted forms in C++ enable more efficient execution. Below, we The rest of this paper is organized as follows. Section 2 briefly discuss and illustrate each of these features. This gives a brief introduction to PHP, its key dynamic features, discussion not only gives insights into the performance gap and its standard implementation. Section 3 then presents the between the two languages, but it also demonstrates the design of the HipHop compiler and its main techniques. Fol- biggest challenges that HipHop faces to translate PHP code lowing that, Section 4 presents a detailed experimental eval- into C++. uation of HipHop and compares it to other PHP execution engines. Finally, Section 5 discusses related work and Sec- 1 The performance gap is 36.8× for measured benchmarks using Zend tion 6 concludes the paper. PHP [22]. Feature PHP C++ to oo. In the last statement, this example creates an object of types dynamic static class oo. function and class name binding dynamic static The following example illustrates dynamic properties: dynamic name resolution yes no class C{ dynamic symbol inspection yes no public $declProp = 1; reflection yes no } dynamic code evaluation (eval) yes no $obj = new C; Table 1.
Recommended publications
  • Differential Fuzzing the Webassembly
    Master’s Programme in Security and Cloud Computing Differential Fuzzing the WebAssembly Master’s Thesis Gilang Mentari Hamidy MASTER’S THESIS Aalto University - EURECOM MASTER’STHESIS 2020 Differential Fuzzing the WebAssembly Fuzzing Différentiel le WebAssembly Gilang Mentari Hamidy This thesis is a public document and does not contain any confidential information. Cette thèse est un document public et ne contient aucun information confidentielle. Thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in Technology. Antibes, 27 July 2020 Supervisor: Prof. Davide Balzarotti, EURECOM Co-Supervisor: Prof. Jan-Erik Ekberg, Aalto University Copyright © 2020 Gilang Mentari Hamidy Aalto University - School of Science EURECOM Master’s Programme in Security and Cloud Computing Abstract Author Gilang Mentari Hamidy Title Differential Fuzzing the WebAssembly School School of Science Degree programme Master of Science Major Security and Cloud Computing (SECCLO) Code SCI3084 Supervisor Prof. Davide Balzarotti, EURECOM Prof. Jan-Erik Ekberg, Aalto University Level Master’s thesis Date 27 July 2020 Pages 133 Language English Abstract WebAssembly, colloquially known as Wasm, is a specification for an intermediate representation that is suitable for the web environment, particularly in the client-side. It provides a machine abstraction and hardware-agnostic instruction sets, where a high-level programming language can target the compilation to the Wasm instead of specific hardware architecture. The JavaScript engine implements the Wasm specification and recompiles the Wasm instruction to the target machine instruction where the program is executed. Technically, Wasm is similar to a popular virtual machine bytecode, such as Java Virtual Machine (JVM) or Microsoft Intermediate Language (MSIL).
    [Show full text]
  • Managing Projects with GNU Make, Third Edition by Robert Mecklenburg
    ManagingProjects with GNU Make Other resources from O’Reilly Related titles Unix in a Nutshell sed and awk Unix Power Tools lex and yacc Essential CVS Learning the bash Shell Version Control with Subversion oreilly.com oreilly.com is more than a complete catalog of O’Reilly books. You’ll also find links to news, events, articles, weblogs, sample chapters, and code examples. oreillynet.com is the essential portal for developers interested in open and emerging technologies, including new platforms, pro- gramming languages, and operating systems. Conferences O’Reilly brings diverse innovators together to nurture the ideas that spark revolutionary industries. We specialize in document- ing the latest tools and systems, translating the innovator’s knowledge into useful skills for those in the trenches. Visit con- ferences.oreilly.com for our upcoming events. Safari Bookshelf (safari.oreilly.com) is the premier online refer- ence library for programmers and IT professionals. Conduct searches across more than 1,000 books. Subscribers can zero in on answers to time-critical questions in a matter of seconds. Read the books on your Bookshelf from cover to cover or sim- ply flip to the page you need. Try it today with a free trial. THIRD EDITION ManagingProjects with GNU Make Robert Mecklenburg Beijing • Cambridge • Farnham • Köln • Sebastopol • Tokyo Managing Projects with GNU Make, Third Edition by Robert Mecklenburg Copyright © 2005, 1991, 1986 O’Reilly Media, Inc. All rights reserved. Printed in the United States of America. Published by O’Reilly Media, Inc., 1005 Gravenstein Highway North, Sebastopol, CA 95472. O’Reilly books may be purchased for educational, business, or sales promotional use.
    [Show full text]
  • Red Hat Enterprise Linux 6 Developer Guide
    Red Hat Enterprise Linux 6 Developer Guide An introduction to application development tools in Red Hat Enterprise Linux 6 Dave Brolley William Cohen Roland Grunberg Aldy Hernandez Karsten Hopp Jakub Jelinek Developer Guide Jeff Johnston Benjamin Kosnik Aleksander Kurtakov Chris Moller Phil Muldoon Andrew Overholt Charley Wang Kent Sebastian Red Hat Enterprise Linux 6 Developer Guide An introduction to application development tools in Red Hat Enterprise Linux 6 Edition 0 Author Dave Brolley [email protected] Author William Cohen [email protected] Author Roland Grunberg [email protected] Author Aldy Hernandez [email protected] Author Karsten Hopp [email protected] Author Jakub Jelinek [email protected] Author Jeff Johnston [email protected] Author Benjamin Kosnik [email protected] Author Aleksander Kurtakov [email protected] Author Chris Moller [email protected] Author Phil Muldoon [email protected] Author Andrew Overholt [email protected] Author Charley Wang [email protected] Author Kent Sebastian [email protected] Editor Don Domingo [email protected] Editor Jacquelynn East [email protected] Copyright © 2010 Red Hat, Inc. and others. The text of and illustrations in this document are licensed by Red Hat under a Creative Commons Attribution–Share Alike 3.0 Unported license ("CC-BY-SA"). An explanation of CC-BY-SA is available at http://creativecommons.org/licenses/by-sa/3.0/. In accordance with CC-BY-SA, if you distribute this document or an adaptation of it, you must provide the URL for the original version. Red Hat, as the licensor of this document, waives the right to enforce, and agrees not to assert, Section 4d of CC-BY-SA to the fullest extent permitted by applicable law.
    [Show full text]
  • The LLVM Instruction Set and Compilation Strategy
    The LLVM Instruction Set and Compilation Strategy Chris Lattner Vikram Adve University of Illinois at Urbana-Champaign lattner,vadve ¡ @cs.uiuc.edu Abstract This document introduces the LLVM compiler infrastructure and instruction set, a simple approach that enables sophisticated code transformations at link time, runtime, and in the field. It is a pragmatic approach to compilation, interfering with programmers and tools as little as possible, while still retaining extensive high-level information from source-level compilers for later stages of an application’s lifetime. We describe the LLVM instruction set, the design of the LLVM system, and some of its key components. 1 Introduction Modern programming languages and software practices aim to support more reliable, flexible, and powerful software applications, increase programmer productivity, and provide higher level semantic information to the compiler. Un- fortunately, traditional approaches to compilation either fail to extract sufficient performance from the program (by not using interprocedural analysis or profile information) or interfere with the build process substantially (by requiring build scripts to be modified for either profiling or interprocedural optimization). Furthermore, they do not support optimization either at runtime or after an application has been installed at an end-user’s site, when the most relevant information about actual usage patterns would be available. The LLVM Compilation Strategy is designed to enable effective multi-stage optimization (at compile-time, link-time, runtime, and offline) and more effective profile-driven optimization, and to do so without changes to the traditional build process or programmer intervention. LLVM (Low Level Virtual Machine) is a compilation strategy that uses a low-level virtual instruction set with rich type information as a common code representation for all phases of compilation.
    [Show full text]
  • ( 12 ) United States Patent
    US010430263B2 (12 ) United States Patent ( 10 ) Patent No. : US 10 ,430 , 263 B2 Polar Seminario (45 ) Date of Patent : Oct. 1 , 2019 ( 54 ) DEVICES, SYSTEMS AND METHODS FOR ( 56 ) References Cited VALIDATING AND UPGRADING FIRMWARE IN INTELLIGENT ELECTRONIC DEVICES U . S . PATENT DOCUMENTS (71 ) Applicant: Electro Industries /Gauge Tech , 2 ,883 , 255 A 4 / 1959 Anderson Westbury , NY (US ) 2 , 987 , 704 A 6 / 1961 Gimpel et al . ( Continued ) ( 72 ) Inventor: Jorge A . Polar Seminario , Westbury, NY (US ) FOREIGN PATENT DOCUMENTS (73 ) Assignee : Electro Industries /Gauge Tech , CN 101799681 A 8 /2010 Westbury, NY (US ) WO 2009044369 A2 4 / 2009 ( * ) Notice: Subject to any disclaimer, the term of this OTHER PUBLICATIONS patent is extended or adjusted under 35 U . S . C . 154 ( b ) by 59 days. Microsoft TechNet , Using DNS Servers with DHCP, Jan . 21, 2005 , Accessed from https: // technet. microsoft . com / en -us / library / ( 21 ) Appl. No. : 15 /421 , 573 cc787034 on Jun . 9 , 2015 ; pp . 1 - 4 . (22 ) Filed : Feb . 1, 2017 (Continued ) Primary Examiner — Charles Ehne (65 ) Prior Publication Data (74 ) Attorney , Agent, or Firm — Gerald E . Hespos ; US 2017/ 0220404 A1 Aug . 3 , 2017 Michael J . Porco ; Matthew T . Hespos Related U . S . Application Data (57 ) ABSTRACT (60 ) Provisional application No . 62 /289 , 440 , filed on Feb . Apparatuses , systems, and method for validating and 1 , 2016 . upgrading firmware in an intelligent electronic device ( IED ) (51 ) Int. Ci. are provided. In one aspect of the present disclosure , an IED G06F 11 /00 ( 2006 . 01 ) is provided including at least one processor and at least one GO6F 11/ 07 (2006 .
    [Show full text]
  • WHO Guidance on Management of Snakebites
    GUIDELINES FOR THE MANAGEMENT OF SNAKEBITES 2nd Edition GUIDELINES FOR THE MANAGEMENT OF SNAKEBITES 2nd Edition 1. 2. 3. 4. ISBN 978-92-9022- © World Health Organization 2016 2nd Edition All rights reserved. Requests for publications, or for permission to reproduce or translate WHO publications, whether for sale or for noncommercial distribution, can be obtained from Publishing and Sales, World Health Organization, Regional Office for South-East Asia, Indraprastha Estate, Mahatma Gandhi Marg, New Delhi-110 002, India (fax: +91-11-23370197; e-mail: publications@ searo.who.int). The designations employed and the presentation of the material in this publication do not imply the expression of any opinion whatsoever on the part of the World Health Organization concerning the legal status of any country, territory, city or area or of its authorities, or concerning the delimitation of its frontiers or boundaries. Dotted lines on maps represent approximate border lines for which there may not yet be full agreement. The mention of specific companies or of certain manufacturers’ products does not imply that they are endorsed or recommended by the World Health Organization in preference to others of a similar nature that are not mentioned. Errors and omissions excepted, the names of proprietary products are distinguished by initial capital letters. All reasonable precautions have been taken by the World Health Organization to verify the information contained in this publication. However, the published material is being distributed without warranty of any kind, either expressed or implied. The responsibility for the interpretation and use of the material lies with the reader. In no event shall the World Health Organization be liable for damages arising from its use.
    [Show full text]
  • Report on Biodiversity and Tropical Forests in Indonesia
    Report on Biodiversity and Tropical Forests in Indonesia Submitted in accordance with Foreign Assistance Act Sections 118/119 February 20, 2004 Prepared for USAID/Indonesia Jl. Medan Merdeka Selatan No. 3-5 Jakarta 10110 Indonesia Prepared by Steve Rhee, M.E.Sc. Darrell Kitchener, Ph.D. Tim Brown, Ph.D. Reed Merrill, M.Sc. Russ Dilts, Ph.D. Stacey Tighe, Ph.D. Table of Contents Table of Contents............................................................................................................................. i List of Tables .................................................................................................................................. v List of Figures............................................................................................................................... vii Acronyms....................................................................................................................................... ix Executive Summary.................................................................................................................... xvii 1. Introduction............................................................................................................................1- 1 2. Legislative and Institutional Structure Affecting Biological Resources...............................2 - 1 2.1 Government of Indonesia................................................................................................2 - 2 2.1.1 Legislative Basis for Protection and Management of Biodiversity and
    [Show full text]
  • Toward IFVM Virtual Machine: a Model Driven IFML Interpretation
    Toward IFVM Virtual Machine: A Model Driven IFML Interpretation Sara Gotti and Samir Mbarki MISC Laboratory, Faculty of Sciences, Ibn Tofail University, BP 133, Kenitra, Morocco Keywords: Interaction Flow Modelling Language IFML, Model Execution, Unified Modeling Language (UML), IFML Execution, Model Driven Architecture MDA, Bytecode, Virtual Machine, Model Interpretation, Model Compilation, Platform Independent Model PIM, User Interfaces, Front End. Abstract: UML is the first international modeling language standardized since 1997. It aims at providing a standard way to visualize the design of a system, but it can't model the complex design of user interfaces and interactions. However, according to MDA approach, it is necessary to apply the concept of abstract models to user interfaces too. IFML is the OMG adopted (in March 2013) standard Interaction Flow Modeling Language designed for abstractly expressing the content, user interaction and control behaviour of the software applications front-end. IFML is a platform independent language, it has been designed with an executable semantic and it can be mapped easily into executable applications for various platforms and devices. In this article we present an approach to execute the IFML. We introduce a IFVM virtual machine which translate the IFML models into bytecode that will be interpreted by the java virtual machine. 1 INTRODUCTION a fundamental standard fUML (OMG, 2011), which is a subset of UML that contains the most relevant The software development has been affected by the part of class diagrams for modeling the data apparition of the MDA (OMG, 2015) approach. The structure and activity diagrams to specify system trend of the 21st century (BRAMBILLA et al., behavior; it contains all UML elements that are 2014) which has allowed developers to build their helpful for the execution of the models.
    [Show full text]
  • Superoptimization of Webassembly Bytecode
    Superoptimization of WebAssembly Bytecode Javier Cabrera Arteaga Shrinish Donde Jian Gu Orestis Floros [email protected] [email protected] [email protected] [email protected] Lucas Satabin Benoit Baudry Martin Monperrus [email protected] [email protected] [email protected] ABSTRACT 2 BACKGROUND Motivated by the fast adoption of WebAssembly, we propose the 2.1 WebAssembly first functional pipeline to support the superoptimization of Web- WebAssembly is a binary instruction format for a stack-based vir- Assembly bytecode. Our pipeline works over LLVM and Souper. tual machine [17]. As described in the WebAssembly Core Specifica- We evaluate our superoptimization pipeline with 12 programs from tion [7], WebAssembly is a portable, low-level code format designed the Rosetta code project. Our pipeline improves the code section for efficient execution and compact representation. WebAssembly size of 8 out of 12 programs. We discuss the challenges faced in has been first announced publicly in 2015. Since 2017, it has been superoptimization of WebAssembly with two case studies. implemented by four major web browsers (Chrome, Edge, Firefox, and Safari). A paper by Haas et al. [11] formalizes the language and 1 INTRODUCTION its type system, and explains the design rationale. The main goal of WebAssembly is to enable high performance After HTML, CSS, and JavaScript, WebAssembly (WASM) has be- applications on the web. WebAssembly can run as a standalone VM come the fourth standard language for web development [7]. This or in other environments such as Arduino [10]. It is independent new language has been designed to be fast, platform-independent, of any specific hardware or languages and can be compiled for and experiments have shown that WebAssembly can have an over- modern architectures or devices, from a wide variety of high-level head as low as 10% compared to native code [11].
    [Show full text]
  • Constrained Polymorphic Types for a Calculus with Name Variables∗
    Constrained Polymorphic Types for a Calculus with Name Variables∗ Davide Ancona1, Paola Giannini†2, and Elena Zucca3 1 DIBRIS, Università di Genova, via Dodecaneso 35, Genova, Italy [email protected] 2 DISIT, Università del Piemonte Orientale, via Teresa Michel 11, Alessandria, Italy [email protected] 3 DIBRIS, Università di Genova, via Dodecaneso 35, Genova, Italy [email protected] Abstract We extend the simply-typed lambda-calculus with a mechanism for dynamic rebinding of code based on parametric nominal interfaces. That is, we introduce values which represent single fragments, or families of named fragments, of open code, where free variables are associated with names which do not obey α-equivalence. In this way, code fragments can be passed as function arguments and manipulated, through their nominal interface, by operators such as rebinding, overriding and renaming. Moreover, by using name variables, it is possible to write terms which are parametric in their nominal interface and/or in the way it is adapted, greatly enhancing expressivity. However, in order to prevent conflicts when instantiating name variables, the name- polymorphic types of such terms need to be equipped with simple inequality constraints. We show soundness of the type system. 1998 ACM Subject Classification D.3.1 Programming Languages: Formal Definitions and The- ory, D.3.3 Programming Languages: Language Constructs and Features Keywords and phrases open code, incremental rebinding, name polymorphism, metaprogram- ming Digital Object Identifier 10.4230/LIPIcs.TYPES.2015.4 1 Introduction We propose an extension of the simply-typed lambda-calculus with a mechanism for dynamic and incremental rebinding of code based on parametric nominal interfaces.
    [Show full text]
  • 4500/6500 Programming Languages Name, Binding and Scope Binding
    Name, Binding and Scope !! A name is exactly what you think it is CSCI: 4500/6500 Programming »! Most names are identifiers Languages »! symbols (like '+') can also be names !! A binding is an association between two things, such as a name and the thing it names Names, Scopes (review) and Binding »! Example: the association of Reflecting on the Concepts –! values with identifiers !! The scope of a binding is the part of the program (textually) in which the binding is active 1 Maria Hybinette, UGA Maria Hybinette, UGA 2 Binding Time Bind Time: Language System View !! When the “binding” is created or, more !! language design time generally, the point at which any »! bind operator symbols (e.g., * + …) to operations implementation decision is made (multiplication, addition, …) »! Set of primitive types »! language design time »! language implementation time !! language implementation time »! bind data type, such as int in C to the range of »! program writing time possible values (determined by number of bits and »! compile time affect the precision) »! link time –! Considerations: arithmetic overflow, precision of fundamental type, coupling of I/O to the OS’ notion of »! load time files »! run time Maria Hybinette, UGA 3 Maria Hybinette, UGA 4 Bind Time: User View Bind Time: User View !! program writing time !! run time (dynamically) »! Programmers choose algorithms, data structures »! value/variable bindings, sizes of strings and names. »! subsumes !! compile time –! program start-up time »! plan for data layout (bind a variable to a data type in –! module entry time Java or C) –! elaboration time (point a which a declaration is first "seen") !! link time –! procedure entry time »! layout of whole program in memory (names of –! block entry time separate modules (libraries) are finalized.
    [Show full text]
  • (Pdf) of from Push/Enter to Eval/Apply by Program Transformation
    From Push/Enter to Eval/Apply by Program Transformation MaciejPir´og JeremyGibbons Department of Computer Science University of Oxford [email protected] [email protected] Push/enter and eval/apply are two calling conventions used in implementations of functional lan- guages. In this paper, we explore the following observation: when considering functions with mul- tiple arguments, the stack under the push/enter and eval/apply conventions behaves similarly to two particular implementations of the list datatype: the regular cons-list and a form of lists with lazy concatenation respectively. Along the lines of Danvy et al.’s functional correspondence between def- initional interpreters and abstract machines, we use this observation to transform an abstract machine that implements push/enter into an abstract machine that implements eval/apply. We show that our method is flexible enough to transform the push/enter Spineless Tagless G-machine (which is the semantic core of the GHC Haskell compiler) into its eval/apply variant. 1 Introduction There are two standard calling conventions used to efficiently compile curried multi-argument functions in higher-order languages: push/enter (PE) and eval/apply (EA). With the PE convention, the caller pushes the arguments on the stack, and jumps to the function body. It is the responsibility of the function to find its arguments, when they are needed, on the stack. With the EA convention, the caller first evaluates the function to a normal form, from which it can read the number and kinds of arguments the function expects, and then it calls the function body with the right arguments.
    [Show full text]