Transactional Runtime Extensions for Dynamic Language Performance

Total Page:16

File Type:pdf, Size:1020Kb

Transactional Runtime Extensions for Dynamic Language Performance Transactional Runtime Extensions for Dynamic Language Performance Nicholas Riley Craig Zilles [email protected] [email protected] Department of Computer Science University of Illinois at Urbana-Champaign ABSTRACT tates improved dynamic language performance with mini- We propose exposing best-effort atomic execution, as pro- mal cost in implementation complexity when compared with vided by a simple hardware transactional memory (HTM), software-only approaches. in a managed runtime's bytecode interface. Dynamic lan- guage implementations built on such a runtime can gener- Our framework consists of three components. First, an ef- ate more efficient, code, using speculation to eliminate the ficient hardware checkpoint/rollback mechanism provides a overhead and obstructions to optimization incurred by code set of transactional memory (TM) primitives to a Java vir- needed to preserve rarely used language semantics. In this tual machine (JVM). Second, the JVM exposes the TM's initial work, we demonstrate the applicability of this frame- capabilities as an interface for explicit speculation. Finally, work with two optimizations in Jython, a Python imple- dynamic language runtimes written in Java employ these mentation for the Java virtual machine, that would yield extensions at the implementation language level in order speedups between 13% and 38% in the presence of HTM. to speculatively execute code with common case semantics. Three additional optimizations, which we applied by hand to With hardware and JVM support for speculation, the dy- Jython-generated code, provide an additional 60% speedup namic language implementation doesn't need to know a pri- for one benchmark. ori when the common case applies: it can simply try it at runtime. 1. INTRODUCTION Dynamic languages such as Python and Ruby are increas- We demonstrate this approach by modifying a JVM dynamic ingly popular choices for general-purpose application devel- language runtime|Jython [2], a Python implementation| opment. Programmers value the languages' unique features, to generate two copies of code (e.g., Figure 1). First, a spec- flexibility, pragmatic design and continued evolution; they ulatively specialized version implements a commonly used are eager to apply them to a widening range of tasks. How- subset of Python semantics in Java, which by simplifying or ever, performance can be limiting: most programs writ- eliminating unused data structures and control flow, exposes ten in these languages are executed by interpreters. At- additional optimization opportunities to the JVM. Second, tempts to build more faster, more sophisticated implemen- a nonspeculative version consists of the original implemen- tations (e.g., [5, 11, 15]) have been frustrated by the need to tation, which provides correct execution in all cases. Exe- preserve compatibility with the languages' flexible seman- cution begins with the faster, speculative version. If spec- tics. ulative code encounters an unsupported condition, an ex- plicit transactional abort transfers control to the nonspec- We evaluate the effectiveness of speculatively executing Py- ulative version. As a result, the JVM does not need dy- thon programs, where possible, with a common case sub- namic language-specific adaptations, and high-performance set of these semantics which correctly handles most Python dynamic language implementations can be written entirely code. It it difficult to efficiently perform this speculation in in languages such as Java and C#, maintaining the proper- software alone, but with hardware support for transactional ties of safety, security and ease of debugging which distin- execution, easier-to-optimize speculative code can execute at guish them from traditional interpreters written in C. Even full speed. When behavior unsupported by the common case without execution feedback to the dynamic language im- semantics is needed, our implementation initiates hardware- plementation, transactional speculation leads to significant assisted rollback, recovery and nontransactional reexecution performance gains in single-threaded code. In three Python with full semantic fidelity. Overall, our approach facili- benchmarks run on Jython, a few simple speculation tech- niques improved performance between 13 and 38%. The remainder of this paper is organized as follows. Sec- tion 2 introduces the challenges of dynamic language run- time performance. Section 3.3 describes the components of our framework and the optimizations we implemented in Jython, section 4 presents our experimental method and sec- tion 5 discusses the performance results. Python source Nonspeculative implementation Speculative implementation y = g(x) begin transaction y = g(x) g = frame.getglobal("g") ➝ Python function object y = g(x) ﹡ Compile Specialize z = 2 y x = frame.getglobal("x") ➝ Python integer object y = g_int$1(global$x) [specialized function body] y = g.__call__(x) ➝ Python integer object z = 2﹡y g.func_code.call(x, globals, closure) z = 2﹡y f = new PyFrame(g.func_code, globals) add x to Python frame object commit transaction g.func_code.call(f, closure) Function modified? Py.getThreadState() ➝ Python thread state object Global resolution modified? abort transaction finish setting up frame and closure Exception? Debugging? } g.funcs.call_function(g.func_id, f) g$1(f) [function body] Recover frame.setlocal(1, y) y z = 2﹡y … Figure 1: Potential transactional memory-aided speculative specialization of Python code. 2. BACKGROUND AND RELATED WORK JVM. On these platforms, dynamic language code is trans- Python, Ruby, Perl and similar dynamic languages differ lated into CLR/JVM bytecode, which references implemen- substantially from historically interpreted counterparts such tation components written in a platform-native language as Java and Smalltalk in that large portions of their basic (C#/Java). Dynamic language implementations must gen- data structures and libraries are written in the runtime's im- erate code and maintain data structures to express the lan- plementation language, typically C, rather than in the dy- guages' rich semantics in terms of more limited CLR/JVM namic languages themselves. This choice substantially im- functionality, even for such basic operations as function in- proves the performance and practicality of these languages vocation. This semantic adaptation layer acts as a barrier even as they remain interpreted. to optimization by the CLR/JVM, hindering performance. However, to get the best performance out of interpreted dy- One example of Python's flexible semantics is method dis- namic language implementations, programmers must ensure patch, which in Jython involves call frame object instanti- that as much work as possible takes place in native code. As ation and one or more hash table lookups (new PyFrame(...) a result, interpreter implementation details can inspire less- and frame.getglobal calls, respectively, as shown in Figure 1). than-optimal programming practices motivated by perfor- Dispatch must also simulate Python's multiple inheritance mance. For example, in the CPython interpreter, function of classes on Java's single inheritance model [18]. Each of calls are relatively expensive, so performance-critical inner these operations is significantly more costly than dynamic loops are typically written to minimize them. A more so- dispatch in Java. phisticated runtime could perform inlining and specializa- tion. Or, to sort a list by an arbitrary key, Perl and Python The CLR/JVM platforms could be extended with dynamic have adopted an idiom known as \decorate-sort-undecorate" language-specific primitives to reduce the cost of adapta- in which each list item is transformed to and from a sublist tion. But selecting the right set of primitives is challenging, of the form (sort key, item), so the list can be sorted entirely as each dynamic language has its own unique semantics. from compiled code instead of repeatedly invoking an inter- We have observed that the majority of a typical dynamic preted comparator. language program doesn't exploit its language's full seman- tic flexibility. In fact, existing CLR/JVM platform primi- To reduce the need for such workarounds and improve exe- tives can directly encode common uses of most dynamic lan- cution performance in general, an obvious next step in dy- guage features, significantly improving performance. How- namic language evolution is uniting the language and its ever, without a way to identify which operations can be so implementation on a single platform which can aggressively encoded without observing them during execution|which optimize both. New dynamic language platforms do this would require hooks into the CLR/JVM internals|dynamic in one of two ways. Some write the language implementa- language implementations cannot unconditionally generate tion and/or its libraries in a common language, and build a fast code for the common case. dynamic language-specific runtime to execute it: for exam- ple, Rubinius [12] executes Ruby on a Smalltalk-style VM; While adapting the CLR/JVM to accommodate individual PyPy [15] implements a translation infrastructure that can dynamic languages' semantics would be inadvisable, some transform a Python implementation written in a subset of general-purpose VM additions can simplify dynamic lan- Python into an interpreter or na¨ıve JIT, which is then com- guage implementation. For example, some CLR-based dy- piled for one of several platforms. While these systems are namic languages are hosted on a layer called the Dynamic written targeting dynamic
Recommended publications
  • Lap Around the .NET Framework 4
    Lap Around the .NET Framework 4 Marc Schweigert ([email protected]) Principal Developer Evangelist DPE US Federal Government Team http://blogs.msdn.com/devkeydet http://twitter.com/devkeydet .NET Framework 4.0 User Interface Services Data Access ASP.NET Windows Windows (WebForms, Entity Presentation Data Services Communication ADO.NET MVC, Dynamic Framework Foundation Foundation Data) Windows WinForms Workflow LINQ to SQL Foundation Core Managed Dynamic Parallel Base Class Extensibility LINQ Languages Language Extensions Library Framework Runtime Common Language Runtime ASP.NET MVC 1.0 (Model View Controller) A new Web Application Project type Simply an option Not a replacement for WebForms Builds on top ASP.NET Manual vs. Automatic Transmission Supports a clear separation of concerns Supports testability Supports “close to the metal” programming experience ASP.NET MVC 2 Visual Studio 2010 Included Visual Studio 2008 (Service Pack 1) Download Both versions built against .NET 3.5 What’s New in MVC 2? Better Separation of Concerns (Maintainability) Html.RenderAction() Areas Easier Validation (Maintainability/Productivity) Data Annotations Client Validation Helper Improvements (Maintainability/Productivity) Strongly-Typed Helpers Templated Helpers ASP.NET 4 Web Forms? Support for SEO with URL Routing Cleaner HTML Client ID improvements ViewState improvements Dynamic Data Improvements Chart Controls Productivity and Extensibility Rich Client Ajax supports both MVC & Web Forms WPF 4 Calendar, Data Grid, DatePicker Ribbon (separate download)
    [Show full text]
  • Ironpython in Action
    IronPytho IN ACTION Michael J. Foord Christian Muirhead FOREWORD BY JIM HUGUNIN MANNING IronPython in Action Download at Boykma.Com Licensed to Deborah Christiansen <[email protected]> Download at Boykma.Com Licensed to Deborah Christiansen <[email protected]> IronPython in Action MICHAEL J. FOORD CHRISTIAN MUIRHEAD MANNING Greenwich (74° w. long.) Download at Boykma.Com Licensed to Deborah Christiansen <[email protected]> For online information and ordering of this and other Manning books, please visit www.manning.com. The publisher offers discounts on this book when ordered in quantity. For more information, please contact Special Sales Department Manning Publications Co. Sound View Court 3B fax: (609) 877-8256 Greenwich, CT 06830 email: [email protected] ©2009 by Manning Publications Co. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by means electronic, mechanical, photocopying, or otherwise, without prior written permission of the publisher. Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in the book, and Manning Publications was aware of a trademark claim, the designations have been printed in initial caps or all caps. Recognizing the importance of preserving what has been written, it is Manning’s policy to have the books we publish printed on acid-free paper, and we exert our best efforts to that end. Recognizing also our responsibility to conserve the resources of our planet, Manning books are printed on paper that is at least 15% recycled and processed without the use of elemental chlorine.
    [Show full text]
  • Expression Trees 1 Dynamic Language Runtime Overview 5 Creating and Using Dynamic Objects 9 Early and Late Binding 17 Execute Ex
    Expression Trees 1 Dynamic Language Runtime Overview 5 Creating and Using Dynamic Objects 9 Early and Late Binding 17 Execute Expression Trees 19 Modify Expression Trees 21 Use Expression Trees to Build Dynamic Queries 23 Debugging Expression Trees 26 Expression Trees (Visual Basic) https://msdn.microsoft.com/en-us/library/mt654260(d=printer).aspx Expression Trees (Visual Basic) Visual Studio 2015 Expression trees represent code in a tree-like data structure, where each node is an expression, for example, a method call or a binary operation such as x < y . You can compile and run code represented by expression trees. This enables dynamic modification of executable code, the execution of LINQ queries in various databases, and the creation of dynamic queries. For more information about expression trees in LINQ, see How to: Use Expression Trees to Build Dynamic Queries (Visual Basic) . Expression trees are also used in the dynamic language runtime (DLR) to provide interoperability between dynamic languages and the .NET Framework and to enable compiler writers to emit expression trees instead of Microsoft intermediate language (MSIL). For more information about the DLR, see Dynamic Language Runtime Overview . You can have the C# or Visual Basic compiler create an expression tree for you based on an anonymous lambda expression, or you can create expression trees manually by using the System.Linq.Expressions namespace. Creating Expression Trees from Lambda Expressions When a lambda expression is assigned to a variable of type Expression(Of TDelegate) , the compiler emits code to build an expression tree that represents the lambda expression. The Visual Basic compiler can generate expression trees only from expression lambdas (or single-line lambdas).
    [Show full text]
  • Ironpython Und Die Dynamic Language Runtime (DLR) Softwareentwicklung Mit Python Auf Der Microsoft Windows Plattform
    IronPython und die Dynamic Language Runtime (DLR) Softwareentwicklung mit Python auf der Microsoft Windows Plattform Klaus Rohe ([email protected]) Microsoft Deutschland GmbH Einige Anmerkungen • Kein Python Tutorial: • Es werden einige Unterschiede von Python zu C# / Java dargestellt • Die Eigenschaften, Beispiele und Demos beziehen sich auf die Version IronPython 2.0 Beta 4. Die endgültig freigegebene Version von IronPython 2.0 kann andere Eigenschaften besitzen und sich anders verhalten. Herbstcampus 2008 – Titel des Vortrags 2 Agenda • Python • IronPython & die Dynamic Language Runtime • Benutzung von .NET Bibliotheken in IronPython • ADO.NET • WPF • Einbetten von IronPython in Applikationen • Interoperabilität • IronPython & Cpython • Interoperabilität CPython - .NET Herbstcampus 2008 – Titel des Vortrags 3 Historie von Python • Anfang der 1990er Jahre von Guido van Rossum am Zentrum für Mathematik und Informatik Amsterdam als Nachfolger für die Lehrsprache ABC entwickelt • Wurde ursprünglich für das verteilte Betriebssystem Amoeba entwickelt: http://www.cs.vu.nl/pub/amoeba/ • Der Name der Sprache bezieht sich auf die britische Komiker Gruppe Monty Python Herbstcampus 2008 – Titel des Vortrags 4 Charakterisierung von Python (1) • Python-Programm wird interpretiert • Unterstützt mehrere Programmierparadigmen: • Prozedural • Objektorientiert • Funktional • Klare, einfache Syntax • Portabel, verfügbar auf allen Plattformen mit C-Compiler • Windows, Mac OS, UNIX, LINUX, … • Leicht erweiterbar mit C/C++ Bibliotheken • Z. B. Bibliothek
    [Show full text]
  • A Multi-Programming-Language, Multi-Context Framework Designed for Computer Science Education Douglas Blank1, Jennifer S
    Bryn Mawr College Scholarship, Research, and Creative Work at Bryn Mawr College Computer Science Faculty Research and Computer Science Scholarship 2012 Calico: a multi-programming-language, multi- context framework designed for computer science education Doug Blank Bryn Mawr College, [email protected] Jennifer S. Kay James B. Marshall Keith O'Hara Mark Russo Let us know how access to this document benefits ouy . Follow this and additional works at: http://repository.brynmawr.edu/compsci_pubs Part of the Computer Sciences Commons Custom Citation Douglas Blank, Jennifer S. Kay, James B. Marshall, Keith O'Hara, and Mark Russo. Calico: A Multi-Programming-Language, Multi- Context Framework Designed for Computer Science Education. (2012). SIGCSE 2012 (Raleigh, NC). This paper is posted at Scholarship, Research, and Creative Work at Bryn Mawr College. http://repository.brynmawr.edu/compsci_pubs/53 For more information, please contact [email protected]. To appear in the Proceedings of the 43rd ACM Technical Symposium on Computer Science Education, SIGCSE 2012 Calico: A Multi-Programming-Language, Multi-Context Framework Designed for Computer Science Education Douglas Blank1, Jennifer S. Kay2, James B. Marshall3, Keith O'Hara4, and Mark Russo1 1Computer Science 2Computer Science 3Computer Science 4Computer Science Department Department Department Program Bryn Mawr College Rowan University Sarah Lawrence College Bard College Bryn Mawr, PA (USA) Glassboro, NJ (USA) Bronxville, NY (USA) Annandale-on-Hudson, NY (1) 610-526-6501 (1) 856-256-4593 (1) 914-395-2673 (1) 845-752-2359 [email protected] [email protected] [email protected] [email protected] ABSTRACT these contexts are often tied to a specific programming environ- The Calico project is a multi-language, multi-context program- ment, which limits their availability to only those willing to work ming framework and learning environment for computing educa- in that programming environment.
    [Show full text]
  • Faster Cpython Documentation Release 0.0
    Faster CPython Documentation Release 0.0 Victor Stinner January 29, 2016 Contents 1 FAT Python 3 2 Everything in Python is mutable9 3 Optimizations 13 4 Python bytecode 19 5 Python C API 21 6 AST Optimizers 23 7 Old AST Optimizer 25 8 Register-based Virtual Machine for Python 33 9 Read-only Python 39 10 History of Python optimizations 43 11 Misc 45 12 Kill the GIL? 51 13 Implementations of Python 53 14 Benchmarks 55 15 PEP 509: Add a private version to dict 57 16 PEP 510: Specialized functions with guards 59 17 PEP 511: API for AST transformers 61 18 Random notes about PyPy 63 19 Talks 65 20 Links 67 i ii Faster CPython Documentation, Release 0.0 Contents: Contents 1 Faster CPython Documentation, Release 0.0 2 Contents CHAPTER 1 FAT Python 1.1 Intro The FAT Python project was started by Victor Stinner in October 2015 to try to solve issues of previous attempts of “static optimizers” for Python. The main feature are efficient guards using versionned dictionaries to check if something was modified. Guards are used to decide if the specialized bytecode of a function can be used or not. Python FAT is expected to be FAT... maybe FAST if we are lucky. FAT because it will use two versions of some functions where one version is specialised to specific argument types, a specific environment, optimized when builtins are not mocked, etc. See the fatoptimizer documentation which is the main part of FAT Python. The FAT Python project is made of multiple parts: 3 Faster CPython Documentation, Release 0.0 • The fatoptimizer project is the static optimizer for Python 3.6 using function specialization with guards.
    [Show full text]
  • Pro DLR in .NET 4
    Pro DLR in .NET 4 Chaur Wu Pro DLR in .NET 4 Copyright © 2010 by Chaur Wu All rights reserved. No part of this work may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or by any information storage or retrieval system, without the prior written permission of the copyright owner and the publisher. ISBN 978-1-4302-3066-3 ISBN 978-1-4302-3067-0 (eBook) Printed and bound in the United States of America 9 8 7 6 5 4 3 2 1 Trademarked names, logos, and images may appear in this book. Rather than use a trademark symbol with every occurrence of a trademarked name, logo, or image we use the names, logos, and images only in an editorial fashion and to the benefit of the trademark owner, with no intention of infringement of the trademark. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. President and Publisher: Paul Manning Lead Editor: Jonathan Gennick Technical Reviewer: Scott Isaacs Editorial Board: Steve Anglin, Mark Beckner, Ewan Buckingham, Gary Cornell, Jonathan Gennick, Jonathan Hassell, Michelle Lowman, Matthew Moodie, Duncan Parkes, Jeffrey Pepper, Frank Pohlmann, Douglas Pundick, Ben Renow-Clarke, Dominic Shakeshaft, Matt Wade, Tom Welsh Coordinating Editor: Jennifer L. Blackwell Copy Editor: Sharon Terdeman Compositor: Bytheway Publishing Services Indexer: Brenda Miller Artist: Integra Software Services Pvt.
    [Show full text]
  • Data Driven Software Engineering Track
    Judith Bishop Microsoft Research 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 C# 1.0 C# 2.0 C# 3.0 C#4.0 Spec#1.0 Spec# Code CodeCont .5 1.0.6 Contracts racts 1.4 Java 1.5 F# Java 6 F# in VS F# C Ruby on LINQ Python Rails 3.0 Firefox 2 Firefox 3 IE6 Safari 1 IE7 Safari 4 IE8 Safari 5 Windows Windows DLR beta Windows DLR 1.0 XP Vista 7 .NET Rotor Mono 1.0 .NET 2 Rotor 2.0 .NET 3.5 .Net 4.0 Mac OS Ubuntu Mac OS Mac OSX Mac OS X Linux X Intel Leopard XSnow. VS 2003 VS 2005 VS2008 VS2010 Eclipse Eclipse Eclipse 1.0 3.0 3.6 Advantages Uses • Rapid feedback loop (REPL) • Scripting applications • Simultaneous top-down and • Building web sites bottom-up development • Test harnesses • Rapid refactoring and code • Server farm maintenance changing • One-off utilities or data • Easy glue code crunching C# 1.0 2001 C# 2.0 2005 C# 3.0 2007 C# 4.0 2009 structs generics implicit typing dynamic lookup properties anonymous anonymous types named and foreach loops methods object and array optional autoboxing iterators initializers arguments delegates and partial types extension COM interop events nullable types methods, variance indexers generic lambda operator delegates expressions overloading query expressions enumerated types (LINQ) with IO in, out and ref parameters formatted output API Serializable std generic Reflection delegates The dynamic language runtime (DLR) is a runtime environment that adds a set of services for dynamic languages – and dynamic featues of statically typed languages – to the common language runtime (CLR) • Dynamic Lookup • Calls, accesses and invocations bypass static type checking and get resolved at runtime • Named, default and optional parameters • COM interop • Variance • Extends type checking in generic types • E.g.
    [Show full text]
  • Pykota Documentation
    PyKota Documentation A full featured Print Quota Solution for CUPS Jérôme Alet C@LL - Conseil Internet & Logiciels Libres 48 Avenue Vincent Arnaud 06300 Nice France Email : [email protected] Phone : +33 (0) 4 93 27 12 98 PyKota Documentation: A full featured Print Quota Solution for CUPS by Jérôme Alet Copyright © 2003, 2004, 2005, 2006 Jerome Alet Abstract This document will describe the setup of the PyKota Print Quota system for the Common UNIX Printing System, and its day-to-day use. Legal Notice This documentation is licensed under the terms of the GNU General Public License as described below. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. A copy of the entire license is included in the section entitled "GNU General Public License". In case you encounter any problem, please contact Jérôme Alet (mailto:[email protected]) , author of the present document. $Date: 2006-12-03 11:50:20 +0100 (dim, 03 déc 2006) $ $Revision: 2422 $ Table of Contents 1.
    [Show full text]
  • Optimizing Runtime Performance of Dynamically Typed Code
    Optimizing Runtime Performance of Dynamically Typed Code Jose Quiroga Alvarez PhD Supervisor Dr. Francisco Ort´ınSoler Department of Computer Science University of Oviedo A thesis submitted for the degree of Doctor of Philosophy Oviedo, Spain April 2016 Acknowledgements This work has been partially funded by the Spanish Department of Science and Technology, under the National Program for Research, Development and Innovation. The main project was Obtaining Adapt- able, Robust and Efficient Software by including Structural Reflection to Statically Typed Programming Languages (TIN2011-25978). The work is also part of the project entitled Improving Performance and Robustness of Dynamic Languages to develop Efficient, Scalable and Reliable Software (TIN2008-00276). I was awarded a FPI grant by the Spanish Department of Science and Technology. The objective of these grants is to support gradu- ate students wishing to pursue a PhD degree associated to a specific research project. This PhD dissertation is associated to the project TIN2011-25978 (previous paragraph). This work has also been funded by Microsoft Research, under the project entitled Extending dynamic features of the SSCLI, awarded in the Phoenix and SSCLI, Compilation and Managed Execution Request for Proposals. Part of the research discussed in this dissertation has also been funded by the European Union, through the European Regional Development Funds (ERDF); and the Principality of Asturias, through its Science, Innovation Plan (grant GRUPIN14-100). Abstract Dynamic languages are widely used for different kinds of applications including rapid prototyping, Web development and programs that require a high level of runtime adaptiveness. However, the lack of compile-time type information involves fewer opportunities for com- piler optimizations, and no detection of type errors at compile time.
    [Show full text]
  • Metaprogramming in .NET by Kevin Hazzard Jason Bock
    S AMPLE CHAPTER in .NET Kevin Hazzard Jason Bock FOREWORD BY Rockford Lhotka MANNING Metaprogramming in .NET by Kevin Hazzard Jason Bock Chapter 1 Copyright 2013 Manning Publications brief contents PART 1DEMYSTIFYING METAPROGRAMMING ..............................1 1 ■ Metaprogramming concepts 3 2 ■ Exploring code and metadata with reflection 41 PART 2TECHNIQUES FOR GENERATING CODE ..........................63 3 ■ The Text Template Transformation Toolkit (T4) 65 4 ■ Generating code with the CodeDOM 101 5 ■ Generating code with Reflection.Emit 139 6 ■ Generating code with expressions 171 7 ■ Generating code with IL rewriting 199 PART 3LANGUAGES AND TOOLS ............................................221 8 ■ The Dynamic Language Runtime 223 9 ■ Languages and tools 267 10 ■ Managing the .NET Compiler 287 v Metaprogramming concepts In this chapter ■ Defining metaprogramming ■ Exploring examples of metaprogramming The basic principles of object-oriented programming (OOP) are understood by most software developers these days. For example, you probably understand how encapsulation and implementation-hiding can increase the cohesion of classes. Languages like C# and Visual Basic are excellent for creating so-called coarsely grained types because they expose simple features for grouping and hiding both code and data. You can use cohesive types to raise the abstraction level across a system, which allows for loose coupling to occur. Systems that enjoy loose cou- pling at the top level are much easier to maintain because each subsystem isn’t as dependent on the others as they could be in a poor design. Those benefits are realized at the lower levels, too, typically through lowered complexity and greater reusability of classes. In figure 1.1, which of the two systems depicted would likely be easier to modify? Without knowing what the gray circles represent, most developers would pick the diagram on the right as the better one.
    [Show full text]
  • Discovering Ironpython
    PART I Introducing IronPython ⊲⊲ CHAPTER 1: Discovering IronPython ⊲⊲ CHAPTER 2: Understanding the IronPython Basics COPYRIGHTED MATERIAL 548592c01.indd 1 2/24/10 12:47:07 PM 548592c01.indd 2 2/24/10 12:47:08 PM 1 Discovering IronPython WHAT’S IN THIS CHAPTER? ➤➤ Understanding why you want to add IronPython to your developer toolbox ➤➤ Obtaining and installing IronPython on your machine ➤➤ Understanding some underlying basics of how IronPython works ➤➤ Using IronPython at the console and within a window ➤➤ Designing and building a simple application IronPython: It sounds like some kind of metal snake infesting your computer, but it isn’t. IronPython is the .NET version of the open source Python language (http://www .python.org/). Python is a dynamic language that can greatly enhance your programming experience, help you create applications in less time, and make the applications you create significantly more responsive to user needs. Of course, you’ve heard these promises before from other languages. This chapter helps you understand how IronPython delivers on these promises in specific situations. The smart developer soon learns that every language serves specific needs and might not work well in others. So this chapter isn’t here to blow smoke at you — ​once you complete it, you’ll understand the strengths and weaknesses of IronPython. Of course, you’ll need to obtain a copy of IronPython before you can use it because Visual Studio doesn’t include IronPython as part of the default installation. This chapter helps you get IronPython installed on your system and tells you about some options you may want to install as well.
    [Show full text]