X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=lily%2Flily-parser.cc;h=2cc3916ca681edf3155563f2d63e3d153beed30a;hb=b76beb7b3bb1ee422ff9c4e35b486f26732cbe17;hp=04b15622bfc7c20cca5e0470378aa728aaae0ce0;hpb=e42585017a01fd02f6353b994cf0c87b03a7bb2e;p=lilypond.git diff --git a/lily/lily-parser.cc b/lily/lily-parser.cc index 04b15622bf..2cc3916ca6 100644 --- a/lily/lily-parser.cc +++ b/lily/lily-parser.cc @@ -1,10 +1,21 @@ /* - lily-parser.cc -- implement Lily_parser + This file is part of LilyPond, the GNU music typesetter. - source file of the GNU LilyPond music typesetter - - (c) 1997--2006 Han-Wen Nienhuys + Copyright (C) 1997--2009 Han-Wen Nienhuys Jan Nieuwenhuizen + + LilyPond 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 3 of the License, or + (at your option) any later version. + + LilyPond 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 LilyPond. If not, see . */ #include "lily-parser.hh" @@ -15,15 +26,15 @@ #include "international.hh" #include "lily-lexer.hh" #include "lily-version.hh" -#include "lilypond-key.hh" +#include "ly-module.hh" #include "main.hh" #include "output-def.hh" #include "paper-book.hh" #include "parser.hh" #include "score.hh" -#include "source.hh" -#include "text-metrics.hh" +#include "sources.hh" #include "warn.hh" +#include "program-option.hh" #include "ly-smobs.icc" @@ -86,12 +97,8 @@ Lily_parser::print_smob (SCM s, SCM port, scm_print_state*) void Lily_parser::parse_file (string init, string name, string out_name) { - if (output_backend_global == "tex") - try_load_text_metrics (out_name); - // TODO: use $parser - lexer_->set_identifier (ly_symbol2scm ("parser"), - self_scm ()); + lexer_->set_identifier (ly_symbol2scm ("parser"), self_scm ()); output_basename_ = out_name; lexer_->main_input_name_ = name; @@ -221,17 +228,54 @@ get_midi (Lily_parser *parser) return layout; } +/* Return a copy of the top of $papers stack, or $defaultpaper if the + * stack is empty */ Output_def * get_paper (Lily_parser *parser) { - SCM id = parser->lexer_->lookup_identifier ("$defaultpaper"); - Output_def *layout = unsmob_output_def (id); + SCM papers = parser->lexer_->lookup_identifier ("$papers"); + Output_def *layout = ((papers == SCM_UNDEFINED) || scm_is_null (papers)) ? + 0 : unsmob_output_def (scm_car (papers)); + SCM default_paper = parser->lexer_->lookup_identifier ("$defaultpaper"); + layout = layout ? layout : unsmob_output_def (default_paper); layout = layout ? dynamic_cast (layout->clone ()) : new Output_def; layout->set_variable (ly_symbol2scm ("is-paper"), SCM_BOOL_T); return layout; } +/* Initialize (reset) the $papers stack */ +void +init_papers (Lily_parser *parser) +{ + parser->lexer_->set_identifier (ly_symbol2scm ("$papers"), SCM_EOL); +} + +/* Push a paper on top of $papers stack */ +void +push_paper (Lily_parser *parser, Output_def *paper) +{ + parser->lexer_->set_identifier (ly_symbol2scm ("$papers"), + scm_cons (paper->self_scm (), + parser->lexer_->lookup_identifier ("$papers"))); +} + +/* Pop a paper from $papers stack */ +void +pop_paper (Lily_parser *parser) +{ + if (! scm_is_null (parser->lexer_->lookup_identifier ("$papers"))) + parser->lexer_->set_identifier (ly_symbol2scm ("$papers"), + scm_cdr (parser->lexer_->lookup_identifier ("$papers"))); +} + +/* Change the paper on top of $papers stack */ +void +set_paper (Lily_parser *parser, Output_def *paper) +{ + scm_set_car_x (parser->lexer_->lookup_identifier ("$papers"), paper->self_scm ()); +} + SCM get_header (Lily_parser *parser) { @@ -251,5 +295,6 @@ get_header (Lily_parser *parser) SCM Lily_parser::make_scope () const { - return ly_make_anonymous_module (be_safe_global); + SCM module = ly_make_anonymous_module (be_safe_global); + return module; }