Mercurial > hg > truffle
changeset 2567:b96f9fcc53b1
Merge
| author | Gilles Duboscq <gilles.duboscq@oracle.com> |
|---|---|
| date | Mon, 02 May 2011 10:24:43 +0200 |
| parents | d524ad648049 (current diff) 0023bd42eefe (diff) |
| children | 95a9b8906b09 |
| files | doc/design/graal_compiler_aux.tex doc/design/graal_compiler_design.tex doc/design/graal_compiler_org.tex doc/design/graph_test.aux doc/design/graph_test.log |
| diffstat | 10 files changed, 242 insertions(+), 749 deletions(-) [+] |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/doc/design/.project Mon May 02 10:24:43 2011 +0200 @@ -0,0 +1,24 @@ +<?xml version="1.0" encoding="UTF-8"?> +<projectDescription> + <name>GraalDocDesign</name> + <comment></comment> + <projects> + </projects> + <buildSpec> + <buildCommand> + <name>net.sourceforge.texlipse.builder.TexlipseBuilder</name> + <arguments> + </arguments> + </buildCommand> + </buildSpec> + <natures> + <nature>net.sourceforge.texlipse.builder.TexlipseNature</nature> + </natures> + <linkedResources> + <link> + <name>fleqn.clo</name> + <type>1</type> + <location>C:/Program Files (x86)/MiKTeX 2.8/tex/latex/base/fleqn.clo</location> + </link> + </linkedResources> +</projectDescription>
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/doc/design/.texlipse Mon May 02 10:24:43 2011 +0200 @@ -0,0 +1,13 @@ +#TeXlipse project settings +#Fri Apr 29 14:13:11 CEST 2011 +builderNum=2 +outputDir= +makeIndSty= +bibrefDir= +outputFormat=pdf +tempDir=tmp +mainTexFile=graal_compiler.tex +outputFile=graal_compiler.pdf +langSpell=en +markDer=true +srcDir=
--- a/doc/design/graal_compiler.tex Mon May 02 10:24:16 2011 +0200 +++ b/doc/design/graal_compiler.tex Mon May 02 10:24:43 2011 +0200 @@ -17,6 +17,17 @@ \newcommand{\Sb}{{\Large$^\dag$}} \newcommand{\Sc}{{\Large$^\S$}} + +\newcommand{\mynote}[2]{ +\textcolor{red}{\fbox{\bfseries\sffamily\scriptsize#1} + {\small\textsf{\emph{#2}}} +\fbox{\bfseries\sffamily\scriptsize }}} + +\newcommand\TODO[1]{\mynote{TODO}{#1}} +\newcommand\cw[1]{\mynote{CW}{#1}} + + + \smartqed % flush right qed marks, e.g. at end of proof \journalname{Graal Compiler Design} @@ -29,7 +40,7 @@ \begin{document} -\author{Thomas Würthinger \Sa, Lukas Stadler \Sc, Gilles Duboscq \Sa} +\author{Thomas W\"{u}rthinger \Sa, Lukas Stadler \Sc, Gilles Duboscq \Sa} \institute{\Sa Oracle, \Sc Johannes Kepler University, Linz} \date{Created: \today} @@ -39,8 +50,197 @@ \maketitle -\input{graal_compiler_org} -\input{graal_compiler_design} -\input{graal_compiler_aux} +\abstract{ +The Graal compiler aims at improving C1X, the Java port of the HotSpot client compiler, both in terms of modularity and peak performance. +The compiler should work with the Maxine VM and the HotSpot VM. +This document contains information about the proposed design and strategy for developing the Graal compiler.} + +\section{Context} + +In 2009, the Maxine team started with creating C1X, a Java port of the HotSpot client compiler, and integrate it into the Maxine VM. +Part of this effort, was the development of a clear and clean compiler-runtime interface that allows the separation of the compiler and the VM that enables the use of one compiler for multiple VMs. +In June 2010, we started integrating C1X into the HotSpot VM and we called the resulting system Graal~VM. +Currently, the Graal~VM is fully functional and runs benchmarks (SciMark, DaCapo) at a similar speed to the HotSpot client compiler. + +\section{Goals} +The Graal compiler effort aims at rewriting the high-level intermediate representation of C1X with two main goals: +\begin{description} +\item[Modularity:] A modular design of the compiler should simplify the implementation of new languages, new back-ends, and new optimizations. +\item[Peak Performance:] A more powerful intermediate representation should enable the implementation of heavy-weight optimizations that impact the peak performance of the resulting machine code. +\end{description} + +\section{Design} +For the implementation of the Graal compiler, we rely on the following design decisions: +\begin{description} +\item[Graph Representation:] +The compiler's intermediate representation is modeled as a graph with nodes that are connected with directed edges. +There is only a single node base class and every node has an associated graph object that does not change during the node's lifetime. +Every node is serializable and has an id that is unique within its graph. +Every edge is classified as either a control flow edge (anti-dependency) or a data flow edge (dependency) and represented as a simple pointer from the source node to the target node. +There is no cycle in the graph that contains only control flow edges or only data flow edges. \cw{What does that sentence mean? I can certainly think of a loop that has a control-flow cycle, but no data-flow cycle.} +It is possible to replace a node with another node without traversing the full graph. +\item[Extensibility:] +The compiler is extensible by adding new compiler phases and new node subclasses without modifying the compiler's sources. +A node has an abstract way of expressing its effect and new compiler phases can ask compiler nodes for their properties and capabilities. +\cw{Add: We use the ``everything is an extension'' concept. Even standard compiler optimizations are internally modeled as extensions, to show that the extension mechanism exposes all necessary functionality.} +\item[Detailing:] +The compilation starts with a graph that contains nodes that represent the operations of the source language (e.g., one node for an array store to an object array). +During the compilation, the nodes are replaced with more detailed nodes (e.g., the array store node is split into a null check, a bounds check, a store check, and a memory access). +Compiler phases can choose whether they want to work on the earlier versions of the graph (e.g., escape analysis) or on later versions (e.g., null check elimination). +\cw{In general, I agree that the lowering should happen without changing the style of IR. However, I don't agree that optimizations such as null check elimination should work on a lower level graph. Isn't it bette to model ``needs null check'' as a capability of high-level instructions? Then the eliminator just sets a property that no null check is necessary. But that is a good discussion point: How much optimization do we want to do by augmenting a high-level IR, and how much do we want to do by rewriting a low-level IR.} +\item[Generality:] +The compiler does not require Java as its input. +This is achieved by having a graph as the starting point of the compilation and not a Java bytecodes array. +Building the graph from the Java bytecodes must happen before giving a method to the compiler. +This enables front-ends for different languages (e.g., Ruby) to provide their own graph. +Also, there is no dependency on a specific back-end, but the output of the compiler is a graph that can then be converted to a different representation in a final compiler phase. +\cw{Here we are getting into the nits of terminology. I think the term ``compiler'' should always refer to the whole system that goes from bytecodes to machine code. Yes, there will be additional parsers for different bytecode formats. But still, the compiler doesn't have graphs as input and outputs, but still bytecodes and machine code, respectively.} +\end{description} + +\section{Milestones} +The Graal compiler is developed starting from the current C1X source code base. +This helps us testing the compiler at every intermediate development step on a variety of Java benchmarks. +We define the following development milestones and when they are considered achieved: +\begin{description} +\item[M1:] We have a fully working Graal VM version with a stripped down C1X compiler that does not perform any optimizations. +\item[M2:] We modified the high-level intermediate representation to be based on the Graal compiler graph data structure. +\item[M3:] We have reimplemented and reenabled compiler optimizations in the Graal compiler that previously existed in C1X. +\item[M4:] We have reintegrated the new Graal compiler into the Maxine VM and can use it as a Maxine VM bootstrapping compiler. +\end{description} + +\cw{That's a very coarse (not to say useless) listing, sound a bit like the generic ``define problem - think hard about it - publish it''...} + +\cw{Mario wants a timeline. You better think about that carefully, so that you can keep the timeline. Mario doesn't want to repeat the C1X experience where at first it should take only 2 months, but it finally takes 2 years. Take that as a confidential hint from me...} + +After those four milestones, we see three different possible further development directions that can be followed in parallel: +\begin{itemize} + \item Removal of the XIR template mechanism and replacement with a snippet mechanism that works with the Graal compiler graph. + \item Improvements for Graal peak performance (loop optimizations, escape analysis, bounds check elimination, processing additional interpreter runtime feedback). + \item Implementation of a prototype front-end for different languages, e.g., JavaScript. +\end{itemize} + +\section{Implementation} + + +\subsection{Project Source Structure} +In order to have clear interfaces between the different parts of the compiler, the code will be divided into the following source code projects: +\cw{Use new naming scheme com.oracle.graal...} +\begin{description} + \item[Graph] contains the abstract node implementation, the graph implementation and all the associated tools and auxiliary classes. + \item[Nodes] contains the node implementations, ranging from high-level to machine-level nodes. \cw{Can't we just stay with the name ``instruction'', which everyone understands, instead of ``Node''? I strongly vote for that.} + \item[GraphBuilder] contains helpers for building graphs from Java bytecodes and other source representations. + \item[Assembler] contains the assembler classes that are used to generate the compiled code of methods and stubs. + \item[Optimizations] contains all the optimizations, along with different optimization plans. + \item[GraalCompiler] contains the compiler, including: + \begin{itemize} + \item Handling of compilation phases. + \item Compilation-related data structures. + \item Implementation of the \emph{compiler interface} (CI). + \item Register allocation. + \item Machine code creation, including debug info. + \item Debug output and compilation observation. + \item Compiler options management. + \end{itemize} + \cw{So you want to keep the backend as part of the ``main compiler'' at first. Seems OK for me.} +\end{description} + +\subsection{Initial Steps} +\begin{itemize} + \item Restructuring of the project to include the compiler and the modified HotSpot code within one repository. The CRI project will remain in the Maxine repository, because it will remain mostly unchanged. + \item Stripping optimizations from the existing compiler, they will be reimplemented later on using the new infrastructure. + \item Creating Node and Graph classes, along with the necessary auxiliary classes. + \item Writing documentation on the design of the compiler. + \item Use the Node class as the superclass of the existing Value class. + \item Identify (and later: remove) extended bytecodes. + \item Implement the new frame state concept. + \item Remove LIR - in the long run there should only be one IR, which will be continually lowered until only nodes that can be translated into machine code remain. \cw{That cannot be an initial step, because you have nothing yet that could replace the LIR.} +\end{itemize} + +\subsection{Nodes and Graphs} +The most important aspect of a compiler is the data structure that holds information about an executable piece of code, called \emph{intermediate representation}~(IR). +The IR used in the Graal Compiler (simply referred to as \emph{the compiler} in the rest of this document) was designed in such a way as to allow for extensive optimizations, easy traversal, compact storage and efficient processing. + +\subsubsection{The Node Data Structure} +\begin{itemize} + \item Each node is always associated with a graph. + \item Each node has an immutable id which is unique within its associated graph. \cw{The server compiler supports ``renumbering'' of nodes to make the ids dense again after large graph manipulations that deleted many nodes.} + \item Nodes represent either operations on values or control flow operations. + \item Nodes can have a data dependency, which means that one node requires the result of some other node as its input. The fact that the result of the first node needs to be computed before the second node can be executed introduces a partial order to the set of nodes. + \item Nodes can have a control flow dependency, which means that the execution of one node depends on some other node. This includes conditional execution, memory access serialization and other reasons, and again introduces a partial order to the set of nodes. + \item Nodes can only have data and control dependencies to nodes which belong to the same graph. + \item Control dependencies and data dependencies each represent a \emph{directed acyclic graph} (DAG) on the same set of nodes. This means that data dependencies always point upwards, and control dependencies always point downwards. Situations that are normally incur cycles (like loops) are represented by special nodes (like LoopEnd). + \cw{I don't like that item. Cycles are a normal thing for control flow and for phi functions. I would phrase it as something like that: Nodes can only have data and control dependencies to nodes that are dominators. The only exception of that are control loop headers and phi functions} + \item Ordering between nodes is specified only to the extent which is required to correctly express the semantics of a given program. Some compilers (notably the HotSpot client compiler \cw{Wrong: the client compiler only has a fixed order of pinned instructions, most instructions are not pinned and can be moved around freely}) always maintain a complete order for all nodes (called \emph{scheduling}), which impedes advanced optimizations. For algorithms that require a fixed ordering of nodes, a temporary schedule can always be generated. + \item Both data and control dependencies can be traversed in both directions, so that each node can be traversed in four directions: + \begin{itemize} + \item \emph{inputs} are all nodes that this node has data dependencies on. + \item \emph{usages} are all nodes that have data dependencies on this node, this is regarded as the inverse of inputs. + \item \emph{successors} are all nodes that have a control dependency on this node. + \item \emph{predecessors} are all nodes that this node has control dependencies on, this is regarded as the inverse of successors. + \end{itemize} + \item Only inputs and successors can be changed, and changes to them will update the usages and predecessors. + \item The Node class needs to provide facilities for subclasses to perform actions upon cloning, dependency changes, etc. + \item Nodes cannot be reassigned to another graph, they are cloned instead \cw{Why should there be the need for more than one graph when compiling a method?} +\end{itemize} + +\subsubsection{The Graph Data Structure} +\begin{itemize} + \item A graph deals out ids for new nodes and can be queried for the node corresponding to a given id. + \item Graphs can manage side data structures, which will be automatically invalidated and lazily recomputed whenever the graph changes. Examples for side data structures are dominator trees and temporary schedules. These side data structures will usually be understood by more than one optimization. + \item Graphs are +\end{itemize} + +\subsection{Frame States} +Frame states capture the state of the program, in terms of the source representation (e.g., Java state: local variables, expressions, ...). +Whenever a safepoint is reached or \cwi{why is that an ``or'', both is basically the same} a deoptimization is needed a valid frame state needs to be available. +A frame state is valid as long as the program performs only actions that can safely be reexecuted (e.g., operations on local variables, etc.). +Thus, frame states need only be generated for bytecodes that cannot be reexecuted: putfield, astore, invoke, monitorenter/exit, ... + +Within the node graph a frame state is represented as a node that is fixed between the node that caused it to be generated (data dependency) and the node that invalidates it (control dependency). + +Deopmization nodes are not fixed to a certain frame state node, they can move around freely and will always use the correct frame state. +At some point during the compilation, deoptimization nodes need to be fixed, which means that appropriate data and control dependencies will be inserted so that it can not move outside the scope of the associated frame state. +This will generate deoptimization-free zones that can be targeted by the most aggressive optimizations. + +Frame states should be represented using a delta-encoding. +This will make them significantly smaller and will make inlining, etc. much easier. +In later compilation phases unnecessary frame states might be removed, using a mark-and-merge algorithm. + + + +\subsection{Graph Building} +\begin{itemize} + \item The graph built by the initial parser (called \emph{GraphBuilder}) should be as close to the source representation (bytecode, ...) as possible. + \item All nodes should be able to immediately lower themselves to a machine-level representation. \cw{What is that? You mean every node has x86 specific code that spits out machine code? Hope you are joking...} This allows for easier compiler development, and also leads to a compiler that is very flexible in the amount of optimizations it performs (e.g. recompilation of methods with more aggressive optimizations). + \item +\end{itemize} + +\subsection{Graphical Representation} +The graphs in this document use the following node layout: + +\begin{digraphenv}{scale=0.5}{layout01} +\node{node1}{nop} +\nodebi{node2}{+} +\nodetri{node3}{phi} +\nodesplit{node4}{if} +\end{digraphenv} + +\cw{That doesn't compile with my latex. What do I have to do to get it working?} + +Red arrows always represents control dependencies, while black arrows represent data dependencies: + +\begin{digraphenv}{scale=0.5}{layout1} +\node{a}{a} +\node{b}{b} +\nodesplit{if}{if} +\node{nop}{nop} +\nodebi{add}{+} +\controllabel{if:succ1}{nop} +\controllabel{if:succ2}{add} +\datalabel{add:in1}{a} +\datalabel{add:in2}{b} +\end{digraphenv} + + \end{document}
--- a/doc/design/graal_compiler_aux.tex Mon May 02 10:24:16 2011 +0200 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000 @@ -1,24 +0,0 @@ -\section{Graphical Representation} -The graphs in this document use the following node layout: - -\begin{digraphenv}{scale=0.5}{layout01} -\node{node1}{nop} -\nodebi{node2}{+} -\nodetri{node3}{phi} -\nodesplit{node4}{if} -\end{digraphenv} - -Red arrows always represents control dependencies, while black arrows represent data dependencies: - -\begin{digraphenv}{scale=0.5}{layout1} -\node{a}{a} -\node{b}{b} -\nodesplit{if}{if} -\node{nop}{nop} -\nodebi{add}{+} -\controllabel{if:succ1}{nop} -\controllabel{if:succ2}{add} -\datalabel{add:in1}{a} -\datalabel{add:in2}{b} -\end{digraphenv} -
--- a/doc/design/graal_compiler_design.tex Mon May 02 10:24:16 2011 +0200 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000 @@ -1,57 +0,0 @@ -\section{Nodes and Graphs} -The most important aspect of a compiler is the data structure that holds information about an executable piece of code, called \emph{intermediate representation}~(IR). -The IR used in the Graal Compiler (simply refered to as \emph{the compiler} in the rest of this document) was designed in such a way as to allow for extensive optimizations, easy traversal, compact storage and efficient processing. - -\subsection{The Node Data Structure} -\begin{itemize} - \item Each node is always associated with a graph. - \item Each node has an immutable id which is unique within its associated graph. - \item Nodes represent either operations on values or control flow operations. - \item Nodes can have a data dependency, which means that one node requires the result of some other node as its input. The fact that the result of the first node needs to be computed before the second node can be executed introduces a partial order to the set of nodes. - \item Nodes can have a control flow dependency, which means that the execution of one node depends on some other node. This includes conditional execution, memory access serialization and other reasons, and again introduces a partial order to the set of nodes. - \item Nodes can only have data and control dependencies to nodes which belong to the same graph. - \item Control dependencies and data dependencies each represent a \emph{directed acyclic graph} (DAG) on the same set of nodes. This means that data dependencies always point upwards, and control dependencies always point downwards. Situations that are normally incurr cycles (like loops) are represented by special nodes (like LoopEnd). - \item Ordering between nodes is specified only to the extent which is required to correctly express the semantics of a given program. Some compilers (notably the HotSpot client compiler) always maintain a complete order for all nodes (called \emph{scheduling}), which impedes advanced optimizations. For algorithms that require a fixed ordering of nodes, a temporary schedule can always be generated. - \item Both data and control dependencies can be traversed in both directions, so that each node can be traversed in four directions: - \begin{itemize} - \item \emph{inputs} are all nodes that this node has data dependencies on. - \item \emph{usages} are all nodes that have data dependencies on this node, this is regarded as the inverse of inputs. - \item \emph{successors} are all nodes that have a control dependency on this node. - \item \emph{predecessors} are all nodes that this node has control dependencies on, this is regarded as the inverse of successors. - \end{itemize} - \item Only inputs and successors can be changed, and changes to them will update the usages and predecessors. - \item The Node class needs to provide facilities for subclasses to perform actions upon cloning, dependency changes, etc. - \item Nodes cannot be reassigned to another graph, they are cloned instead -\end{itemize} - -\subsection{The Graph Data Structure} -\begin{itemize} - \item A graph deals out ids for new nodes and can be queried for the node corresponding to a given id. - \item Graphs can manage side data structures, which will be automatically invalidated and lazily recomputed whenever the graph changes. Examples for side data structures are dominator trees and temporary schedules. These side data structures will usually be understood by more than one optimization. - \item Graphs are -\end{itemize} - -\section{Frame States} -Frame states capture the state of the program, in terms of the source representation (e.g., Java state: local variables, expressions, ...). -Whenever a safepoint is reached or the a deoptimization is needed a valid frame state needs to be available. -A frame state is valid as long as the program performs only actions that can safely be reexecuted (e.g., operations on local variables, etc.). -Thus, frame states need only be generated for bytecodes that can not be reexecuted: putfield, astore, invoke, monitorenter/exit, ... - -Within the node graph a frame state is represented as a node that is fixed between the node that caused it to be generated (data dependency) and the node that will invalidate it (control dependency). - -Deopmization nodes are not fixed to a certain frame state node, they can move around freely and will always use the correct frame state. -At some point during the compilation deoptimization nodes need to be fixed, which means that appropriate data and control dependencies will be inserted so that it can not move outside the scope of the associated frame state. -This will generate deoptimization-free zones that can be targeted by the most aggressive optimizations. - -Frame states should be represented using a delta-encoding. -This will make them significantly smaller and will make inlining, etc. much easier. -In later compilation phases unnecessary frame states might be removed, using a mark-and-merge algorithm. - - - -\section{Graph Building} -\begin{itemize} - \item The graph built by the initial parser (called \emph{GraphBuilder}) should be as close to the source representation (bytecode, ...) as possible. - \item All nodes should be able to immediately lower themselves to a machine-level representation. This allows for easier compiler development, and also leads to a compiler that is very flexible in the amount of optimizations it performs (e.g. recompilation of methods with more aggressive optimizations). - \item -\end{itemize}
--- a/doc/design/graal_compiler_org.tex Mon May 02 10:24:16 2011 +0200 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000 @@ -1,34 +0,0 @@ -\abstract{The basic motivation of graal is to show the advantage, both in terms of development effort and runtime speed, a compiler written in Java can deliver to a C++-based virtual machine. -This document contains information about the proposed structure and design of the Graal Compiler, which is part of the Maxine project.} - -\section{Project Source Structure} -In order to have clear interfaces between the different parts of the compiler, the code will be divided into the following source code projects: -\begin{description} - \item[Graph] contains the abstract node implementation, the graph implementation and all the associated tools and auxiliary classes. - \item[Nodes] contains the node implementations, ranging from high-level to machine-level nodes. - \item[GraphBuilder] contains helpers for building graphs from java bytecodes and other source representations. - \item[Assembler] contains the assembler classes that are used to generate the compiled code of methods and stubs. - \item[Optimizations] contains all the optimizations, along with different optimization plans. - \item[GraalCompiler] contains the compiler, including: - \begin{itemize} - \item Handling of compilation phases. - \item Compilation-related data structures. - \item Implementation of the \emph{compiler interface} (CI). - \item Register allocation. - \item Machine code creation, including debug info. - \item Debug output and compilation observation. - \item Compiler options management. - \end{itemize} -\end{description} - -\section{Initial Steps} -\begin{itemize} - \item Restructuring of the project to include the compiler and the modified HotSpot code within one repository. The CRI project will remain in the Maxine repository, because it will remain mostly unchanged. - \item Stripping optimizations from the existing compiler, they will be reimplemented later on using the new infrastructure. - \item Creating Node and Graph classes, along with the necessary auxiliary classes. - \item Writing documentation on the design of the compiler. - \item Use the Node class as the superclass of the existing Value class. - \item Identify (and later: remove) extended bytecodes. - \item Implement the new frame state concept. - \item Remove LIR - in the long run there should only be one IR, which will be continually lowered until only nodes that can be translated into machine code remain. -\end{itemize}
--- a/doc/design/graph_test.aux Mon May 02 10:24:16 2011 +0200 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000 @@ -1,5 +0,0 @@ -\relax -\select@language{english} -\@writefile{toc}{\select@language{english}} -\@writefile{lof}{\select@language{english}} -\@writefile{lot}{\select@language{english}}
--- a/doc/design/graph_test.log Mon May 02 10:24:16 2011 +0200 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000 @@ -1,624 +0,0 @@ -This is pdfTeX, Version 3.1415926-1.40.10 (TeX Live 2009/Debian) (format=pdflatex 2011.4.5) 28 APR 2011 09:57 -entering extended mode - \write18 enabled. - %&-line parsing enabled. -**graph_test.tex -(./graph_test.tex -LaTeX2e <2009/09/24> -Babel <v3.8l> and hyphenation patterns for english, usenglishmax, dumylang, noh -yphenation, ngerman, german, german-x-2009-06-19, ngerman-x-2009-06-19, loaded. - -(./svjour3.cls -Document Class: svjour3 2007/05/08 v3.2 -LaTeX document class for Springer journals -(/usr/share/texmf-texlive/tex/latex/base/fleqn.clo -File: fleqn.clo 1998/08/17 v1.1c Standard LaTeX option (flush left equations) -\mathindent=\dimen102 -) -Class Springer-SVJour3 Info: extra/valid Springer sub-package (-> *.clo) -(Springer-SVJour3) not found in option list of \documentclass -(Springer-SVJour3) - autoactivating "global" style. - (./svglov3.clo -File: svglov3.clo 2006/02/03 v3.1 style option for standardised journals - -SVJour Class option: svglov3.clo for standardised journals -) -LaTeX Font Info: Redeclaring math symbol \Gamma on input line 147. -LaTeX Font Info: Redeclaring math symbol \Delta on input line 148. -LaTeX Font Info: Redeclaring math symbol \Theta on input line 149. -LaTeX Font Info: Redeclaring math symbol \Lambda on input line 150. -LaTeX Font Info: Redeclaring math symbol \Xi on input line 151. -LaTeX Font Info: Redeclaring math symbol \Pi on input line 152. -LaTeX Font Info: Redeclaring math symbol \Sigma on input line 153. -LaTeX Font Info: Redeclaring math symbol \Upsilon on input line 154. -LaTeX Font Info: Redeclaring math symbol \Phi on input line 155. -LaTeX Font Info: Redeclaring math symbol \Psi on input line 156. -LaTeX Font Info: Redeclaring math symbol \Omega on input line 157. -\logodepth=\dimen103 -\headerboxheight=\dimen104 -\betweenumberspace=\dimen105 -\aftertext=\dimen106 -\headlineindent=\dimen107 -\c@inst=\count79 -\c@auth=\count80 -\instindent=\dimen108 -\authrun=\box26 -\authorrunning=\toks14 -\titrun=\box27 -\titlerunning=\toks15 -\combirun=\box28 -\c@lastpage=\count81 -\rubricwidth=\dimen109 -\c@section=\count82 -\c@subsection=\count83 -\c@subsubsection=\count84 -\c@paragraph=\count85 -\c@subparagraph=\count86 -\spthmsep=\dimen110 -\c@theorem=\count87 -\c@case=\count88 -\c@conjecture=\count89 -\c@corollary=\count90 -\c@definition=\count91 -\c@example=\count92 -\c@exercise=\count93 -\c@lemma=\count94 -\c@note=\count95 -\c@problem=\count96 -\c@property=\count97 -\c@proposition=\count98 -\c@question=\count99 -\c@solution=\count100 -\c@remark=\count101 -\c@figure=\count102 -\c@table=\count103 -\abovecaptionskip=\skip41 -\belowcaptionskip=\skip42 -\figcapgap=\dimen111 -\tabcapgap=\dimen112 -\figgap=\dimen113 -\bibindent=\dimen114 -\@tempcntc=\count104 -) (/usr/share/texmf-texlive/tex/latex/graphics/graphicx.sty -Package: graphicx 1999/02/16 v1.0f Enhanced LaTeX Graphics (DPC,SPQR) - -(/usr/share/texmf-texlive/tex/latex/graphics/keyval.sty -Package: keyval 1999/03/16 v1.13 key=value parser (DPC) -\KV@toks@=\toks16 -) -(/usr/share/texmf-texlive/tex/latex/graphics/graphics.sty -Package: graphics 2009/02/05 v1.0o Standard LaTeX Graphics (DPC,SPQR) - -(/usr/share/texmf-texlive/tex/latex/graphics/trig.sty -Package: trig 1999/03/16 v1.09 sin cos tan (DPC) -) -(/etc/texmf/tex/latex/config/graphics.cfg -File: graphics.cfg 2009/08/28 v1.8 graphics configuration of TeX Live -) -Package graphics Info: Driver file: pdftex.def on input line 91. - -(/usr/share/texmf-texlive/tex/latex/pdftex-def/pdftex.def -File: pdftex.def 2010/03/12 v0.04p Graphics/color for pdfTeX -\Gread@gobject=\count105 -)) -\Gin@req@height=\dimen115 -\Gin@req@width=\dimen116 -) -(/usr/share/texmf-texlive/tex/latex/environ/environ.sty -Package: environ 2008/06/18 v0.2 A new way to define environments -\@emptytoks=\toks17 -\@envbody=\toks18 -) -(/usr/share/texmf-texlive/tex/latex/amsmath/amsmath.sty -Package: amsmath 2000/07/18 v2.13 AMS math features -\@mathmargin=\skip43 - -For additional information on amsmath, use the `?' option. -(/usr/share/texmf-texlive/tex/latex/amsmath/amstext.sty -Package: amstext 2000/06/29 v2.01 - -(/usr/share/texmf-texlive/tex/latex/amsmath/amsgen.sty -File: amsgen.sty 1999/11/30 v2.0 -\@emptytoks=\toks19 -\ex@=\dimen117 -)) -(/usr/share/texmf-texlive/tex/latex/amsmath/amsbsy.sty -Package: amsbsy 1999/11/29 v1.2d -\pmbraise@=\dimen118 -) -(/usr/share/texmf-texlive/tex/latex/amsmath/amsopn.sty -Package: amsopn 1999/12/14 v2.01 operator names -) -\inf@bad=\count106 -LaTeX Info: Redefining \frac on input line 211. -\uproot@=\count107 -\leftroot@=\count108 -LaTeX Info: Redefining \overline on input line 307. -\classnum@=\count109 -\DOTSCASE@=\count110 -LaTeX Info: Redefining \ldots on input line 379. -LaTeX Info: Redefining \dots on input line 382. -LaTeX Info: Redefining \cdots on input line 467. -\Mathstrutbox@=\box29 -\strutbox@=\box30 -\big@size=\dimen119 -LaTeX Font Info: Redeclaring font encoding OML on input line 567. -LaTeX Font Info: Redeclaring font encoding OMS on input line 568. - - -Package amsmath Warning: Unable to redefine math accent \vec. - -\macc@depth=\count111 -\c@MaxMatrixCols=\count112 -\dotsspace@=\muskip10 -\c@parentequation=\count113 -\dspbrk@lvl=\count114 -\tag@help=\toks20 -\row@=\count115 -\column@=\count116 -\maxfields@=\count117 -\andhelp@=\toks21 -\eqnshift@=\dimen120 -\alignsep@=\dimen121 -\tagshift@=\dimen122 -\tagwidth@=\dimen123 -\totwidth@=\dimen124 -\lineht@=\dimen125 -\@envbody=\toks22 -\multlinegap=\skip44 -\multlinetaggap=\skip45 -\mathdisplay@stack=\toks23 -LaTeX Info: Redefining \[ on input line 2666. -LaTeX Info: Redefining \] on input line 2667. -) (/usr/share/texmf-texlive/tex/latex/amsfonts/amsfonts.sty -Package: amsfonts 2009/06/22 v3.00 Basic AMSFonts support -\symAMSa=\mathgroup4 -\symAMSb=\mathgroup5 -LaTeX Font Info: Overwriting math alphabet `\mathfrak' in version `bold' -(Font) U/euf/m/n --> U/euf/b/n on input line 96. -) -(/usr/share/texmf-texlive/tex/generic/babel/babel.sty -Package: babel 2008/07/06 v3.8l The Babel package - -(/usr/share/texmf-texlive/tex/generic/babel/english.ldf -Language: english 2005/03/30 v3.3o English support from the babel system - -(/usr/share/texmf-texlive/tex/generic/babel/babel.def -File: babel.def 2008/07/06 v3.8l Babel common definitions -\babel@savecnt=\count118 -\U@D=\dimen126 -) -\l@british = a dialect from \language\l@english -\l@UKenglish = a dialect from \language\l@english -\l@canadian = a dialect from \language\l@american -\l@australian = a dialect from \language\l@british -\l@newzealand = a dialect from \language\l@british -)) -(/usr/share/texmf-texlive/tex/latex/base/inputenc.sty -Package: inputenc 2008/03/30 v1.1d Input encoding file -\inpenc@prehook=\toks24 -\inpenc@posthook=\toks25 - -(/usr/share/texmf-texlive/tex/latex/base/utf8.def -File: utf8.def 2008/04/05 v1.1m UTF-8 support for inputenc -Now handling font encoding OML ... -... no UTF-8 mapping file for font encoding OML -Now handling font encoding T1 ... -... processing UTF-8 mapping file for font encoding T1 - -(/usr/share/texmf-texlive/tex/latex/base/t1enc.dfu -File: t1enc.dfu 2008/04/05 v1.1m UTF-8 support for inputenc - defining Unicode char U+00A1 (decimal 161) - defining Unicode char U+00A3 (decimal 163) - defining Unicode char U+00AB (decimal 171) - defining Unicode char U+00BB (decimal 187) - defining Unicode char U+00BF (decimal 191) - defining Unicode char U+00C0 (decimal 192) - defining Unicode char U+00C1 (decimal 193) - defining Unicode char U+00C2 (decimal 194) - defining Unicode char U+00C3 (decimal 195) - defining Unicode char U+00C4 (decimal 196) - defining Unicode char U+00C5 (decimal 197) - defining Unicode char U+00C6 (decimal 198) - defining Unicode char U+00C7 (decimal 199) - defining Unicode char U+00C8 (decimal 200) - defining Unicode char U+00C9 (decimal 201) - defining Unicode char U+00CA (decimal 202) - defining Unicode char U+00CB (decimal 203) - defining Unicode char U+00CC (decimal 204) - defining Unicode char U+00CD (decimal 205) - defining Unicode char U+00CE (decimal 206) - defining Unicode char U+00CF (decimal 207) - defining Unicode char U+00D0 (decimal 208) - defining Unicode char U+00D1 (decimal 209) - defining Unicode char U+00D2 (decimal 210) - defining Unicode char U+00D3 (decimal 211) - defining Unicode char U+00D4 (decimal 212) - defining Unicode char U+00D5 (decimal 213) - defining Unicode char U+00D6 (decimal 214) - defining Unicode char U+00D8 (decimal 216) - defining Unicode char U+00D9 (decimal 217) - defining Unicode char U+00DA (decimal 218) - defining Unicode char U+00DB (decimal 219) - defining Unicode char U+00DC (decimal 220) - defining Unicode char U+00DD (decimal 221) - defining Unicode char U+00DE (decimal 222) - defining Unicode char U+00DF (decimal 223) - defining Unicode char U+00E0 (decimal 224) - defining Unicode char U+00E1 (decimal 225) - defining Unicode char U+00E2 (decimal 226) - defining Unicode char U+00E3 (decimal 227) - defining Unicode char U+00E4 (decimal 228) - defining Unicode char U+00E5 (decimal 229) - defining Unicode char U+00E6 (decimal 230) - defining Unicode char U+00E7 (decimal 231) - defining Unicode char U+00E8 (decimal 232) - defining Unicode char U+00E9 (decimal 233) - defining Unicode char U+00EA (decimal 234) - defining Unicode char U+00EB (decimal 235) - defining Unicode char U+00EC (decimal 236) - defining Unicode char U+00ED (decimal 237) - defining Unicode char U+00EE (decimal 238) - defining Unicode char U+00EF (decimal 239) - defining Unicode char U+00F0 (decimal 240) - defining Unicode char U+00F1 (decimal 241) - defining Unicode char U+00F2 (decimal 242) - defining Unicode char U+00F3 (decimal 243) - defining Unicode char U+00F4 (decimal 244) - defining Unicode char U+00F5 (decimal 245) - defining Unicode char U+00F6 (decimal 246) - defining Unicode char U+00F8 (decimal 248) - defining Unicode char U+00F9 (decimal 249) - defining Unicode char U+00FA (decimal 250) - defining Unicode char U+00FB (decimal 251) - defining Unicode char U+00FC (decimal 252) - defining Unicode char U+00FD (decimal 253) - defining Unicode char U+00FE (decimal 254) - defining Unicode char U+00FF (decimal 255) - defining Unicode char U+0102 (decimal 258) - defining Unicode char U+0103 (decimal 259) - defining Unicode char U+0104 (decimal 260) - defining Unicode char U+0105 (decimal 261) - defining Unicode char U+0106 (decimal 262) - defining Unicode char U+0107 (decimal 263) - defining Unicode char U+010C (decimal 268) - defining Unicode char U+010D (decimal 269) - defining Unicode char U+010E (decimal 270) - defining Unicode char U+010F (decimal 271) - defining Unicode char U+0110 (decimal 272) - defining Unicode char U+0111 (decimal 273) - defining Unicode char U+0118 (decimal 280) - defining Unicode char U+0119 (decimal 281) - defining Unicode char U+011A (decimal 282) - defining Unicode char U+011B (decimal 283) - defining Unicode char U+011E (decimal 286) - defining Unicode char U+011F (decimal 287) - defining Unicode char U+0130 (decimal 304) - defining Unicode char U+0131 (decimal 305) - defining Unicode char U+0132 (decimal 306) - defining Unicode char U+0133 (decimal 307) - defining Unicode char U+0139 (decimal 313) - defining Unicode char U+013A (decimal 314) - defining Unicode char U+013D (decimal 317) - defining Unicode char U+013E (decimal 318) - defining Unicode char U+0141 (decimal 321) - defining Unicode char U+0142 (decimal 322) - defining Unicode char U+0143 (decimal 323) - defining Unicode char U+0144 (decimal 324) - defining Unicode char U+0147 (decimal 327) - defining Unicode char U+0148 (decimal 328) - defining Unicode char U+014A (decimal 330) - defining Unicode char U+014B (decimal 331) - defining Unicode char U+0150 (decimal 336) - defining Unicode char U+0151 (decimal 337) - defining Unicode char U+0152 (decimal 338) - defining Unicode char U+0153 (decimal 339) - defining Unicode char U+0154 (decimal 340) - defining Unicode char U+0155 (decimal 341) - defining Unicode char U+0158 (decimal 344) - defining Unicode char U+0159 (decimal 345) - defining Unicode char U+015A (decimal 346) - defining Unicode char U+015B (decimal 347) - defining Unicode char U+015E (decimal 350) - defining Unicode char U+015F (decimal 351) - defining Unicode char U+0160 (decimal 352) - defining Unicode char U+0161 (decimal 353) - defining Unicode char U+0162 (decimal 354) - defining Unicode char U+0163 (decimal 355) - defining Unicode char U+0164 (decimal 356) - defining Unicode char U+0165 (decimal 357) - defining Unicode char U+016E (decimal 366) - defining Unicode char U+016F (decimal 367) - defining Unicode char U+0170 (decimal 368) - defining Unicode char U+0171 (decimal 369) - defining Unicode char U+0178 (decimal 376) - defining Unicode char U+0179 (decimal 377) - defining Unicode char U+017A (decimal 378) - defining Unicode char U+017B (decimal 379) - defining Unicode char U+017C (decimal 380) - defining Unicode char U+017D (decimal 381) - defining Unicode char U+017E (decimal 382) - defining Unicode char U+200C (decimal 8204) - defining Unicode char U+2013 (decimal 8211) - defining Unicode char U+2014 (decimal 8212) - defining Unicode char U+2018 (decimal 8216) - defining Unicode char U+2019 (decimal 8217) - defining Unicode char U+201A (decimal 8218) - defining Unicode char U+201C (decimal 8220) - defining Unicode char U+201D (decimal 8221) - defining Unicode char U+201E (decimal 8222) - defining Unicode char U+2030 (decimal 8240) - defining Unicode char U+2031 (decimal 8241) - defining Unicode char U+2039 (decimal 8249) - defining Unicode char U+203A (decimal 8250) - defining Unicode char U+2423 (decimal 9251) -) -Now handling font encoding OT1 ... -... processing UTF-8 mapping file for font encoding OT1 - -(/usr/share/texmf-texlive/tex/latex/base/ot1enc.dfu -File: ot1enc.dfu 2008/04/05 v1.1m UTF-8 support for inputenc - defining Unicode char U+00A1 (decimal 161) - defining Unicode char U+00A3 (decimal 163) - defining Unicode char U+00B8 (decimal 184) - defining Unicode char U+00BF (decimal 191) - defining Unicode char U+00C5 (decimal 197) - defining Unicode char U+00C6 (decimal 198) - defining Unicode char U+00D8 (decimal 216) - defining Unicode char U+00DF (decimal 223) - defining Unicode char U+00E6 (decimal 230) - defining Unicode char U+00EC (decimal 236) - defining Unicode char U+00ED (decimal 237) - defining Unicode char U+00EE (decimal 238) - defining Unicode char U+00EF (decimal 239) - defining Unicode char U+00F8 (decimal 248) - defining Unicode char U+0131 (decimal 305) - defining Unicode char U+0141 (decimal 321) - defining Unicode char U+0142 (decimal 322) - defining Unicode char U+0152 (decimal 338) - defining Unicode char U+0153 (decimal 339) - defining Unicode char U+2013 (decimal 8211) - defining Unicode char U+2014 (decimal 8212) - defining Unicode char U+2018 (decimal 8216) - defining Unicode char U+2019 (decimal 8217) - defining Unicode char U+201C (decimal 8220) - defining Unicode char U+201D (decimal 8221) -) -Now handling font encoding OMS ... -... processing UTF-8 mapping file for font encoding OMS - -(/usr/share/texmf-texlive/tex/latex/base/omsenc.dfu -File: omsenc.dfu 2008/04/05 v1.1m UTF-8 support for inputenc - defining Unicode char U+00A7 (decimal 167) - defining Unicode char U+00B6 (decimal 182) - defining Unicode char U+00B7 (decimal 183) - defining Unicode char U+2020 (decimal 8224) - defining Unicode char U+2021 (decimal 8225) - defining Unicode char U+2022 (decimal 8226) -) -Now handling font encoding OMX ... -... no UTF-8 mapping file for font encoding OMX -Now handling font encoding U ... -... no UTF-8 mapping file for font encoding U - defining Unicode char U+00A9 (decimal 169) - defining Unicode char U+00AA (decimal 170) - defining Unicode char U+00AE (decimal 174) - defining Unicode char U+00BA (decimal 186) - defining Unicode char U+02C6 (decimal 710) - defining Unicode char U+02DC (decimal 732) - defining Unicode char U+200C (decimal 8204) - defining Unicode char U+2026 (decimal 8230) - defining Unicode char U+2122 (decimal 8482) - defining Unicode char U+2423 (decimal 9251) -)) -(/usr/share/texmf/tex/latex/lm/lmodern.sty -Package: lmodern 2009/10/30 v1.6 Latin Modern Fonts -LaTeX Font Info: Overwriting symbol font `operators' in version `normal' -(Font) OT1/cmr/m/n --> OT1/lmr/m/n on input line 22. -LaTeX Font Info: Overwriting symbol font `letters' in version `normal' -(Font) OML/cmm/m/it --> OML/lmm/m/it on input line 23. -LaTeX Font Info: Overwriting symbol font `symbols' in version `normal' -(Font) OMS/cmsy/m/n --> OMS/lmsy/m/n on input line 24. -LaTeX Font Info: Overwriting symbol font `largesymbols' in version `normal' -(Font) OMX/cmex/m/n --> OMX/lmex/m/n on input line 25. -LaTeX Font Info: Overwriting symbol font `operators' in version `bold' -(Font) OT1/cmr/bx/n --> OT1/lmr/bx/n on input line 26. -LaTeX Font Info: Overwriting symbol font `letters' in version `bold' -(Font) OML/cmm/b/it --> OML/lmm/b/it on input line 27. -LaTeX Font Info: Overwriting symbol font `symbols' in version `bold' -(Font) OMS/cmsy/b/n --> OMS/lmsy/b/n on input line 28. -LaTeX Font Info: Overwriting symbol font `largesymbols' in version `bold' -(Font) OMX/cmex/m/n --> OMX/lmex/m/n on input line 29. -LaTeX Font Info: Overwriting math alphabet `\mathbf' in version `normal' -(Font) OT1/cmr/bx/n --> OT1/lmr/bx/n on input line 31. -LaTeX Font Info: Overwriting math alphabet `\mathsf' in version `normal' -(Font) OT1/cmss/m/n --> OT1/lmss/m/n on input line 32. -LaTeX Font Info: Overwriting math alphabet `\mathit' in version `normal' -(Font) OT1/cmr/m/it --> OT1/lmr/m/it on input line 33. -LaTeX Font Info: Overwriting math alphabet `\mathtt' in version `normal' -(Font) OT1/cmtt/m/n --> OT1/lmtt/m/n on input line 34. -LaTeX Font Info: Overwriting math alphabet `\mathbf' in version `bold' -(Font) OT1/cmr/bx/n --> OT1/lmr/bx/n on input line 35. -LaTeX Font Info: Overwriting math alphabet `\mathsf' in version `bold' -(Font) OT1/cmss/bx/n --> OT1/lmss/bx/n on input line 36. -LaTeX Font Info: Overwriting math alphabet `\mathit' in version `bold' -(Font) OT1/cmr/bx/it --> OT1/lmr/bx/it on input line 37. -LaTeX Font Info: Overwriting math alphabet `\mathtt' in version `bold' -(Font) OT1/cmtt/m/n --> OT1/lmtt/m/n on input line 38. -) -(/usr/share/texmf-texlive/tex/latex/base/fontenc.sty -Package: fontenc 2005/09/27 v1.99g Standard LaTeX package - -(/usr/share/texmf-texlive/tex/latex/base/t1enc.def -File: t1enc.def 2005/09/27 v1.99g Standard LaTeX file -LaTeX Font Info: Redeclaring font encoding T1 on input line 43. -)) -(/usr/share/texmf-texlive/tex/latex/graphics/color.sty -Package: color 2005/11/14 v1.0j Standard LaTeX Color (DPC) - -(/etc/texmf/tex/latex/config/color.cfg -File: color.cfg 2007/01/18 v1.5 color configuration of teTeX/TeXLive -) -Package color Info: Driver file: pdftex.def on input line 130. -) (./graphdrawing.tex) (./graph_test.aux) -\openout1 = `graph_test.aux'. - -LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 30. -LaTeX Font Info: ... okay on input line 30. -LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 30. -LaTeX Font Info: ... okay on input line 30. -LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 30. -LaTeX Font Info: ... okay on input line 30. -LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 30. -LaTeX Font Info: ... okay on input line 30. -LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 30. -LaTeX Font Info: ... okay on input line 30. -LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 30. -LaTeX Font Info: ... okay on input line 30. -LaTeX Font Info: Try loading font information for T1+lmr on input line 30. - (/usr/share/texmf/tex/latex/lm/t1lmr.fd -File: t1lmr.fd 2009/10/30 v1.6 Font defs for Latin Modern -) -(/usr/share/texmf-texlive/tex/context/base/supp-pdf.mkii -[Loading MPS to PDF converter (version 2006.09.02).] -\scratchcounter=\count119 -\scratchdimen=\dimen127 -\scratchbox=\box31 -\nofMPsegments=\count120 -\nofMParguments=\count121 -\everyMPshowfont=\toks26 -\MPscratchCnt=\count122 -\MPscratchDim=\dimen128 -\MPnumerator=\count123 -\everyMPtoPDFconversion=\toks27 -) -LaTeX Font Info: Calculating math sizes for size <8.5> on input line 40. -LaTeX Font Info: Try loading font information for OT1+lmr on input line 40. - (/usr/share/texmf/tex/latex/lm/ot1lmr.fd -File: ot1lmr.fd 2009/10/30 v1.6 Font defs for Latin Modern -) -LaTeX Font Info: Try loading font information for OML+lmm on input line 40. - -(/usr/share/texmf/tex/latex/lm/omllmm.fd -File: omllmm.fd 2009/10/30 v1.6 Font defs for Latin Modern -) -LaTeX Font Info: Try loading font information for OMS+lmsy on input line 40. - - -(/usr/share/texmf/tex/latex/lm/omslmsy.fd -File: omslmsy.fd 2009/10/30 v1.6 Font defs for Latin Modern -) -LaTeX Font Info: Try loading font information for OMX+lmex on input line 40. - - -(/usr/share/texmf/tex/latex/lm/omxlmex.fd -File: omxlmex.fd 2009/10/30 v1.6 Font defs for Latin Modern -) -LaTeX Font Info: External font `lmex10' loaded for size -(Font) <8.5> on input line 40. -LaTeX Font Info: External font `lmex10' loaded for size -(Font) <5.94997> on input line 40. -LaTeX Font Info: External font `lmex10' loaded for size -(Font) <4.25> on input line 40. -LaTeX Font Info: Try loading font information for U+msa on input line 40. - -(/usr/share/texmf-texlive/tex/latex/amsfonts/umsa.fd -File: umsa.fd 2009/06/22 v3.00 AMS symbols A -) -LaTeX Font Info: Try loading font information for U+msb on input line 40. - -(/usr/share/texmf-texlive/tex/latex/amsfonts/umsb.fd -File: umsb.fd 2009/06/22 v3.00 AMS symbols B -) -\dotfile=\write3 -\openout3 = `dot_temp_layout1.dot'. - -runsystem(bash -c "dot -Tpdf dot_temp_layout1.dot > dot_temp_layout1.pdf")...ex -ecuted. - - - -pdfTeX warning: pdflatex (file ./dot_temp_layout1.pdf): PDF inclusion: found PD -F version <1.5>, but at most version <1.4> allowed -<dot_temp_layout1.pdf, id=1, 252.945pt x 297.11pt> -File: dot_temp_layout1.pdf Graphic file (type pdf) - <use dot_temp_layout1.pdf> -\dotfile=\write4 -\openout4 = `dot_temp_layout2.dot'. - -runsystem(bash -c "dot -Tpdf dot_temp_layout2.dot > dot_temp_layout2.pdf")...ex -ecuted. - - - -pdfTeX warning: pdflatex (file ./dot_temp_layout2.pdf): PDF inclusion: found PD -F version <1.5>, but at most version <1.4> allowed -<dot_temp_layout2.pdf, id=3, 369.38pt x 48.18pt> -File: dot_temp_layout2.pdf Graphic file (type pdf) - <use dot_temp_layout2.pdf> -\dotfile=\write5 -\openout5 = `dot_temp_layout3.dot'. - -runsystem(bash -c "dot -Tpdf dot_temp_layout3.dot > dot_temp_layout3.pdf")...ex -ecuted. - - - -pdfTeX warning: pdflatex (file ./dot_temp_layout3.pdf): PDF inclusion: found PD -F version <1.5>, but at most version <1.4> allowed -<dot_temp_layout3.pdf, id=5, 252.945pt x 132.495pt> -File: dot_temp_layout3.pdf Graphic file (type pdf) - <use dot_temp_layout3.pdf> -\dotfile=\write6 -\openout6 = `dot_temp_layout4.dot'. - -runsystem(bash -c "dot -Tpdf dot_temp_layout4.dot > dot_temp_layout4.pdf")...ex -ecuted. - - - -pdfTeX warning: pdflatex (file ./dot_temp_layout4.pdf): PDF inclusion: found PD -F version <1.5>, but at most version <1.4> allowed -<dot_temp_layout4.pdf, id=7, 358.33875pt x 301.125pt> -File: dot_temp_layout4.pdf Graphic file (type pdf) - -<use dot_temp_layout4.pdf> -\dotfile=\write7 -\openout7 = `dot_temp_layout5.dot'. - -runsystem(bash -c "dot -Tpdf dot_temp_layout5.dot > dot_temp_layout5.pdf")...ex -ecuted. - - - -pdfTeX warning: pdflatex (file ./dot_temp_layout5.pdf): PDF inclusion: found PD -F version <1.5>, but at most version <1.4> allowed -<dot_temp_layout5.pdf, id=9, 197.73875pt x 634.37pt> -File: dot_temp_layout5.pdf Graphic file (type pdf) - -<use dot_temp_layout5.pdf> -Underfull \vbox (badness 10000) has occurred while \output is active [] - - [1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map} - - - <./dot_temp_layout1.pdf> <./dot_temp_layout2.pdf> <./dot_temp_layout3.pdf> <./ -dot_temp_layout4.pdf> <./dot_temp_layout5.pdf>] (./graph_test.aux) ) -Here is how much of TeX's memory you used: - 2832 strings out of 495021 - 33460 string characters out of 1181036 - 90398 words of memory out of 3000000 - 5967 multiletter control sequences out of 15000+50000 - 31644 words of font info for 36 fonts, out of 3000000 for 9000 - 28 hyphenation exceptions out of 8191 - 27i,7n,33p,421b,226s stack positions out of 5000i,500n,10000p,200000b,50000s -{/usr/share -/texmf/fonts/enc/dvips/lm/lm-ec.enc}</usr/share/texmf/fonts/type1/public/lm/lmb -x10.pfb></usr/share/texmf/fonts/type1/public/lm/lmbx12.pfb></usr/share/texmf/fo -nts/type1/public/lm/lmr9.pfb> -Output written on graph_test.pdf (1 page, 100830 bytes). -PDF statistics: - 69 PDF objects out of 1000 (max. 8388607) - 0 named destinations out of 1000 (max. 500000) - 26 words of extra memory for PDF output out of 10000 (max. 10000000) -
--- a/src/share/vm/c1/c1_globals.hpp Mon May 02 10:24:16 2011 +0200 +++ b/src/share/vm/c1/c1_globals.hpp Mon May 02 10:24:43 2011 +0200 @@ -288,7 +288,7 @@ product(intx, CompilationRepeat, 0, \ "Number of times to recompile method before returning result") \ \ - develop(intx, NMethodSizeLimit, (32*K)*wordSize, \ + develop(intx, NMethodSizeLimit, (64*K)*wordSize, \ "Maximum size of a compiled method.") \ \ develop(bool, TraceFPUStack, false, \