make libsass as subtree, in the future do "git pull -s subtree libsass master"…

make libsass as subtree, in the future do "git pull -s subtree libsass master" to pull in new changes

libsass/.gitignore

+src/Makefile
+.DS_Store
+tmp/
+.sass-cache
+sassc
+build/*
+*.o
+*.a
+a.out
+bin/*
+*.gem

libsass/LICENSE

+
+Copyright (C) 2012 by Hampton Catlin
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is furnished to do
+so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+
+The following files in the spec were taken from the original Ruby Sass project which
+is copyright Hampton Catlin, Nathan Weizenbaum, and Chris Eppstein and under
+the same license.

libsass/Makefile

+CC=g++
+CFLAGS=-c -Wall -O2 -fPIC
+LDFLAGS= -fPIC
+SOURCES = \
+	context.cpp functions.cpp document.cpp \
+	document_parser.cpp eval_apply.cpp node.cpp \
+	node_factory.cpp node_emitters.cpp prelexer.cpp \
+	sass_interface.cpp
+OBJECTS = $(SOURCES:.cpp=.o)
+
+all: $(OBJECTS)
+	ar rvs libsass.a $(OBJECTS)
+
+shared: $(OBJECTS)
+	gcc -shared -o libsass.so *.o
+
+.cpp.o:
+	$(CC) $(CFLAGS) $< -o $@
+
+clean:
+	rm -rf *.o *.a *.so
\ No newline at end of file

libsass/Readme.md

+Libsass
+=======
+
+by Aaron Leung and Hampton Catlin (@hcatlin)
+
+[![Build Status](https://secure.travis-ci.org/hcatlin/sassc.png?branch=master)](http://travis-ci.org/hcatlin/sassc)
+
+http://github.com/hcatlin/libsass
+
+Libsass is just a library, but if you want to RUN libsass,
+then go to http://github.com/hcatlin/sassc or
+http://github.com/hcatlin/sassruby or find your local 
+implementer.
+
+About
+-----
+
+Libsass is a C/C++ port of the Sass CSS precompiler. The original version was written in Ruby, but this version is meant for efficiency and portability.
+
+This library strives to be light, simple, and easy to build and integrate with a variety of platforms and languages.
+
+Developing
+----------
+
+As you may have noticed, the libsass repo itself has 
+no executables and no tests. Oh noes! How can you develop???
+
+Well, luckily, SassC is the official binary wrapper for 
+libsass and is *always* kept in sync. SassC uses a git submodule
+to include libsass. When developing libsass, its best to actually
+check out SassC and develop in that directory with the SassC spec
+and tests there.
+
+We even run Travis tests for SassC!
+
+Usage
+-----
+
+While libsass is primarily implemented in C++, it provides a simple
+C interface that is defined in [sass_inteface.h]. Its usage is pretty
+straight forward.
+
+First, you create a sass context struct. We use these objects to define
+different execution parameters for the library. There are three 
+different context types. 
+
+    sass_context        // string-in-string-out compilation
+    sass_file_context   // file-based compilation
+    sass_folder_context // full-folder multi-file 
+
+Each of the context's have slightly different behavior and are
+implemented seperately. This does add extra work to implementing
+a wrapper library, but we felt that a mixed-use context object
+provides for too much implicit logic. What if you set "input_string"
+AND "input_file"... what do we do? This would introduce bugs into
+wrapper libraries that would be difficult to debug. 
+
+We anticipate that most adapters in most languages will define
+their own logic for how to separate these use cases based on the
+language. For instance, the original Ruby interface has a combined
+interface, but is backed by three different processes.
+
+To generate a context, use one of the following methods.
+
+    new_sass_context()
+    new_sass_file_context()
+    new_sass_folder_context()
+
+Again, please see the sass_interface.h for more information.
+
+And, to get even more information, then please see the implementations
+in SassC and SassC-Ruby.
+
+About Sass
+----------
+
+Sass is a CSS pre-processor language to add on exciting, new, 
+awesome features to CSS. Sass was the first language of its kind
+and by far the most mature and up to date codebase.
+
+Sass was originally created by the co-creator of this library, 
+Hampton Catlin (@hcatlin). The extension and continuing evolution
+of the language has all been the result of years of work by Nathan
+Weizenbaum (@nex3) and Chris Eppstein (@chriseppstein). 
+
+For more information about Sass itself, please visit http://sass-lang.com
+
+Contribution Agreement
+----------------------
+
+Any contribution to the project are seen as copyright assigned to Hampton Catlin. Your contribution warrants that you have the right to assign copyright on your work. This is to ensure that the project remains free and open -- similar to the Apache Foundation.
+
+Our license is designed to be as simple as possible.
+
+

libsass/context.cpp

+#include "context.hpp"
+#include <iostream>
+#include <unistd.h>
+#include "prelexer.hpp"
+using std::cerr; using std::endl;
+
+namespace Sass {
+  using std::pair;
+  
+  void Context::collect_include_paths(const char* paths_str)
+  {
+    const size_t wd_len = 1024;
+    char wd[wd_len];
+    include_paths.push_back(getcwd(wd, wd_len));
+    if (*include_paths.back().rbegin() != '/') include_paths.back() += '/';
+
+    if (paths_str) {
+      const char* beg = paths_str;
+      const char* end = Prelexer::find_first<':'>(beg);
+
+      while (end) {
+        string path(beg, end - beg);
+        if (!path.empty()) {
+          if (*path.rbegin() != '/') path += '/';
+          include_paths.push_back(path);
+        }
+        beg = end + 1;
+        end = Prelexer::find_first<':'>(beg);
+      }
+
+      string path(beg);
+      if (!path.empty()) {
+        if (*path.rbegin() != '/') path += '/';
+        include_paths.push_back(path);
+      }
+    }
+
+    // for (int i = 0; i < include_paths.size(); ++i) {
+    //   cerr << include_paths[i] << endl;
+    // }
+  }
+  
+  Context::Context(const char* paths_str)
+  : global_env(Environment()),
+    function_env(map<pair<string, size_t>, Function>()),
+    extensions(multimap<Node, Node>()),
+    pending_extensions(vector<pair<Node, Node> >()),
+    source_refs(vector<char*>()),
+    include_paths(vector<string>()),
+    new_Node(Node_Factory()),
+    ref_count(0),
+    has_extensions(false)
+  {
+    register_functions();
+    collect_include_paths(paths_str);
+  }
+  
+  Context::~Context()
+  {
+    for (size_t i = 0; i < source_refs.size(); ++i) {
+      delete[] source_refs[i];
+    }
+
+    new_Node.free();
+    // cerr << "Deallocated " << i << " source string(s)." << endl;
+  }
+  
+  inline void Context::register_function(Function_Descriptor d, Primitive ip)
+  {
+    Function f(d, ip);
+    function_env[pair<string, size_t>(f.name, f.parameters.size())] = f;
+  }
+  
+  inline void Context::register_function(Function_Descriptor d, Primitive ip, size_t arity)
+  {
+    Function f(d, ip);
+    function_env[pair<string, size_t>(f.name, arity)] = f;
+  }
+  
+  void Context::register_functions()
+  {
+    using namespace Functions;
+    // RGB Functions
+    register_function(rgb_descriptor,  rgb);
+    register_function(rgba_4_descriptor, rgba_4);
+    register_function(rgba_2_descriptor, rgba_2);
+    register_function(red_descriptor, red);
+    register_function(green_descriptor, green);
+    register_function(blue_descriptor, blue);
+    register_function(mix_2_descriptor, mix_2);
+    register_function(mix_3_descriptor, mix_3);
+    // HSL Functions
+    register_function(hsla_descriptor, hsla);
+    register_function(hsl_descriptor, hsl);
+    register_function(invert_descriptor, invert);
+    // Opacity Functions
+    register_function(alpha_descriptor, alpha);
+    register_function(opacity_descriptor, alpha);
+    register_function(opacify_descriptor, opacify);
+    register_function(fade_in_descriptor, opacify);
+    register_function(transparentize_descriptor, transparentize);
+    register_function(fade_out_descriptor, transparentize);
+    // String Functions
+    register_function(unquote_descriptor, unquote);
+    register_function(quote_descriptor, quote);
+    // Number Functions
+    register_function(percentage_descriptor, percentage);
+    register_function(round_descriptor, round);
+    register_function(ceil_descriptor, ceil);
+    register_function(floor_descriptor, floor);
+    register_function(abs_descriptor, abs);
+    // List Functions
+    register_function(length_descriptor, length);
+    register_function(nth_descriptor, nth);
+    register_function(join_2_descriptor, join_2);
+    register_function(join_3_descriptor, join_3);
+    register_function(append_2_descriptor, append_2);
+    register_function(append_3_descriptor, append_3);
+    register_function(compact_1_descriptor, compact);
+    register_function(compact_2_descriptor, compact);
+    register_function(compact_3_descriptor, compact);
+    register_function(compact_4_descriptor, compact);
+    register_function(compact_5_descriptor, compact);
+    register_function(compact_6_descriptor, compact);
+    register_function(compact_7_descriptor, compact);
+    register_function(compact_8_descriptor, compact);
+    register_function(compact_9_descriptor, compact);
+    register_function(compact_10_descriptor, compact);
+    // Introspection Functions
+    register_function(type_of_descriptor, type_of);
+    register_function(unit_descriptor, unit);
+    register_function(unitless_descriptor, unitless);
+    register_function(comparable_descriptor, comparable);
+    // Boolean Functions
+    register_function(not_descriptor, not_impl);
+  }
+  
+}

libsass/context.hpp

+#define SASS_CONTEXT_INCLUDED
+
+
+#include <utility>
+#include <map>
+#include "node_factory.hpp"
+#include "functions.hpp"
+
+namespace Sass {
+  using std::pair;
+  using std::map;
+  
+  struct Environment {
+    map<Token, Node> current_frame;
+    Environment* parent;
+    Environment* global;
+    
+    Environment()
+    : current_frame(map<Token, Node>()), parent(0), global(0)
+    { }
+    
+    void link(Environment& env)
+    {
+      parent = &env;
+      global = parent->global ? parent->global : parent;
+    }
+    
+    bool query(const Token& key) const
+    {
+      if (current_frame.count(key)) return true;
+      else if (parent)              return parent->query(key);
+      else                          return false;
+    }
+    
+    Node& operator[](const Token& key)
+    {
+      if (current_frame.count(key)) return current_frame[key];
+      else if (parent)              return (*parent)[key];
+      else                          return current_frame[key];
+    }
+  };
+
+  struct Context {
+    Environment global_env;
+    map<pair<string, size_t>, Function> function_env;
+    multimap<Node, Node> extensions;
+    vector<pair<Node, Node> > pending_extensions;
+    vector<char*> source_refs; // all the source c-strings
+    vector<string> include_paths;
+    Node_Factory new_Node;
+    size_t ref_count;
+    string sass_path;
+    string css_path;
+    bool has_extensions;
+
+    void collect_include_paths(const char* paths_str);
+    Context(const char* paths_str = 0);
+    ~Context();
+    
+    void register_function(Function_Descriptor d, Primitive ip);
+    void register_function(Function_Descriptor d, Primitive ip, size_t arity);
+    void register_functions();
+  };
+
+}

libsass/css_color_names.txt

+AliceBlue 		#F0F8FF
+AntiqueWhite 		#FAEBD7
+Aqua 			#00FFFF
+Aquamarine 		#7FFFD4
+Azure 			#F0FFFF
+Beige 			#F5F5DC
+Bisque 			#FFE4C4
+Black 			#000000
+BlanchedAlmond	 	#FFEBCD
+Blue 			#0000FF
+BlueViolet 		#8A2BE2
+Brown 			#A52A2A
+BurlyWood 		#DEB887
+CadetBlue 		#5F9EA0
+Chartreuse 		#7FFF00
+Chocolate 		#D2691E
+Coral 			#FF7F50
+CornflowerBlue 		#6495ED
+Cornsilk 		#FFF8DC
+Crimson 		#DC143C
+Cyan 			#00FFFF
+DarkBlue 		#00008B
+DarkCyan 		#008B8B
+DarkGoldenRod 		#B8860B
+DarkGray 		#A9A9A9
+DarkGrey 		#A9A9A9
+DarkGreen 		#006400
+DarkKhaki 		#BDB76B
+DarkMagenta 		#8B008B
+DarkOliveGreen	 	#556B2F
+Darkorange 		#FF8C00
+DarkOrchid 		#9932CC
+DarkRed 		#8B0000
+DarkSalmon 		#E9967A
+DarkSeaGreen 		#8FBC8F
+DarkSlateBlue 		#483D8B
+DarkSlateGray 		#2F4F4F
+DarkSlateGrey 		#2F4F4F
+DarkTurquoise 		#00CED1
+DarkViolet 		#9400D3
+DeepPink 		#FF1493
+DeepSkyBlue 		#00BFFF
+DimGray 		#696969
+DimGrey 		#696969
+DodgerBlue 		#1E90FF
+FireBrick 		#B22222
+FloralWhite 		#FFFAF0
+ForestGreen 		#228B22
+Fuchsia 		#FF00FF
+Gainsboro 		#DCDCDC
+GhostWhite 		#F8F8FF
+Gold 			#FFD700
+GoldenRod 		#DAA520
+Gray 			#808080
+Grey 			#808080
+Green 			#008000
+GreenYellow 		#ADFF2F
+HoneyDew 		#F0FFF0
+HotPink 		#FF69B4
+IndianRed  		#CD5C5C
+Indigo  		#4B0082
+Ivory 			#FFFFF0
+Khaki 			#F0E68C
+Lavender 		#E6E6FA
+LavenderBlush 		#FFF0F5
+LawnGreen 		#7CFC00
+LemonChiffon 		#FFFACD
+LightBlue 		#ADD8E6
+LightCoral 		#F08080
+LightCyan 		#E0FFFF
+LightGoldenRodYellow 	#FAFAD2
+LightGray 		#D3D3D3
+LightGrey 		#D3D3D3
+LightGreen 		#90EE90
+LightPink 		#FFB6C1
+LightSalmon 		#FFA07A
+LightSeaGreen 		#20B2AA
+LightSkyBlue 		#87CEFA
+LightSlateGray 		#778899
+LightSlateGrey 		#778899
+LightSteelBlue 		#B0C4DE
+LightYellow 		#FFFFE0
+Lime 			#00FF00
+LimeGreen 		#32CD32
+Linen 			#FAF0E6
+Magenta 		#FF00FF
+Maroon 			#800000
+MediumAquaMarine 	#66CDAA
+MediumBlue 		#0000CD
+MediumOrchid 		#BA55D3
+MediumPurple 		#9370D8
+MediumSeaGreen 		#3CB371
+MediumSlateBlue 	#7B68EE
+MediumSpringGreen 	#00FA9A
+MediumTurquoise 	#48D1CC
+MediumVioletRed 	#C71585
+MidnightBlue 		#191970
+MintCream 		#F5FFFA
+MistyRose 		#FFE4E1
+Moccasin 		#FFE4B5
+NavajoWhite 		#FFDEAD
+Navy 			#000080
+OldLace 		#FDF5E6
+Olive 			#808000
+OliveDrab 		#6B8E23
+Orange 			#FFA500
+OrangeRed 		#FF4500
+Orchid		 	#DA70D6
+PaleGoldenRod 		#EEE8AA
+PaleGreen 		#98FB98
+PaleTurquoise 		#AFEEEE
+PaleVioletRed 		#D87093
+PapayaWhip 		#FFEFD5
+PeachPuff 		#FFDAB9
+Peru 			#CD853F
+Pink 			#FFC0CB
+Plum 			#DDA0DD
+PowderBlue 		#B0E0E6
+Purple 			#800080
+Red 			#FF0000
+RosyBrown 		#BC8F8F
+RoyalBlue 		#4169E1
+SaddleBrown 		#8B4513
+Salmon 			#FA8072
+SandyBrown 		#F4A460
+SeaGreen 		#2E8B57
+SeaShell 		#FFF5EE
+Sienna 			#A0522D
+Silver 			#C0C0C0
+SkyBlue 		#87CEEB
+SlateBlue 		#6A5ACD
+SlateGray 		#708090
+SlateGrey 		#708090
+Snow 			#FFFAFA
+SpringGreen 		#00FF7F
+SteelBlue 		#4682B4
+Tan 			#D2B48C
+Teal 			#008080
+Thistle 		#D8BFD8
+Tomato 			#FF6347
+Turquoise 		#40E0D0
+Violet 			#EE82EE
+Wheat 			#F5DEB3
+White 			#FFFFFF
+WhiteSmoke 		#F5F5F5
+Yellow 			#FFFF00
+YellowGreen 		#9ACD32
\ No newline at end of file

libsass/document.cpp

+#include <cstdio>
+#include <cstring>
+#include "document.hpp"
+#include "eval_apply.hpp"
+#include "error.hpp"
+#include <iostream>
+#include <sstream>
+
+namespace Sass {
+
+  Document::Document(Context& ctx) : context(ctx)
+  { ++context.ref_count; }
+
+  Document::Document(const Document& doc)
+  : path(doc.path),
+    source(doc.source),
+    position(doc.position),
+    end(doc.end),
+    line(doc.line),
+    own_source(doc.own_source),
+    context(doc.context),
+    root(doc.root),
+    lexed(doc.lexed)
+  { ++doc.context.ref_count; }
+
+  Document::~Document()
+  { --context.ref_count; }
+
+  Document Document::make_from_file(Context& ctx, string path)
+  {
+    std::FILE *f;
+    f = std::fopen(path.c_str(), "rb");
+    if (!f) throw path;
+    if (std::fseek(f, 0, SEEK_END)) throw path;
+    int status = std::ftell(f);
+    if (status < 0) throw path;
+    size_t len = status;
+    std::rewind(f);
+    char* source = new char[len + 1];
+    size_t bytes_read = std::fread(source, sizeof(char), len, f);
+    if (bytes_read != len) {
+      std::cerr << "Warning: possible error reading from " << path << std::endl;
+    }
+    if (std::ferror(f)) throw path;
+    source[len] = '\0';
+    char* end = source + len;
+    if (std::fclose(f)) throw path;
+
+    Document doc(ctx);
+    doc.path        = path;
+    doc.line = 1;
+    doc.root        = ctx.new_Node(Node::root, path, 1, 0);
+    doc.lexed       = Token::make();
+    doc.own_source  = true;
+    doc.source      = source;
+    doc.end         = end;
+    doc.position    = source;
+    doc.context.source_refs.push_back(source);
+
+    return doc;
+  }
+
+  Document Document::make_from_source_chars(Context& ctx, char* src, string path, bool own_source)
+  {
+    Document doc(ctx);
+    doc.path = path;
+    doc.line = 1;
+    doc.root = ctx.new_Node(Node::root, path, 1, 0);
+    doc.lexed = Token::make();
+    doc.own_source = own_source;
+    doc.source = src;
+    doc.end = src + std::strlen(src);
+    doc.position = src;
+    if (own_source) doc.context.source_refs.push_back(src);
+
+    return doc;
+  }
+
+  Document Document::make_from_token(Context& ctx, Token t, string path, size_t line_number)
+  {
+    Document doc(ctx);
+    doc.path = path;
+    doc.line = line_number;
+    doc.root = ctx.new_Node(Node::root, path, 1, 0);
+    doc.lexed = Token::make();
+    doc.own_source = false;
+    doc.source = const_cast<char*>(t.begin);
+    doc.end = t.end;
+    doc.position = doc.source;
+
+    return doc;
+  }
+  
+  void Document::throw_syntax_error(string message, size_t ln)
+  { throw Error(Error::syntax, path, ln ? ln : line, message); }
+  
+  void Document::throw_read_error(string message, size_t ln)
+  { throw Error(Error::read, path, ln ? ln : line, message); }
+  
+  using std::string;
+  using std::stringstream;
+  using std::endl;
+  
+  string Document::emit_css(CSS_Style style) {
+    stringstream output;
+    switch (style) {
+    case echo:
+      root.echo(output);
+      break;
+    case nested:
+      root.emit_nested_css(output, 0, true);
+      break;
+    case expanded:
+      root.emit_expanded_css(output, "");
+      break;
+    default:
+      break;
+    }
+    string retval(output.str());
+    if (!retval.empty()) retval.resize(retval.size()-1);
+    return retval;
+  }
+}

libsass/document.hpp

+#include <map>
+
+#ifndef SASS_PRELEXER_INCLUDED
+#include "prelexer.hpp"
+#endif
+
+#ifndef SASS_NODE_INCLUDED
+#include "node.hpp"
+#endif
+
+#ifndef SASS_CONTEXT_INCLUDED
+#include "context.hpp"
+#endif
+
+struct Selector_Lookahead {
+  const char* found;
+  bool has_interpolants;
+};
+
+namespace Sass {
+  using std::string;
+  using std::vector;
+  using std::map;
+  using namespace Prelexer;
+
+  struct Document {
+    enum CSS_Style { nested, expanded, compact, compressed, echo };
+    
+    string path;
+    char* source;
+    const char* position;
+    const char* end;
+    size_t line;
+    bool own_source;
+
+    Context& context;
+    
+    Node root;
+    Token lexed;
+
+  private:
+    // force the use of the "make_from_..." factory funtions
+    Document(Context& ctx);
+  public:
+    Document(const Document& doc);
+    ~Document();
+
+    static Document make_from_file(Context& ctx, string path);
+    static Document make_from_source_chars(Context& ctx, char* src, string path = "", bool own_source = false);
+    static Document make_from_token(Context& ctx, Token t, string path = "", size_t line_number = 1);
+
+    template <prelexer mx>
+    const char* peek(const char* start = 0)
+    {
+      if (!start) start = position;
+      const char* after_whitespace;
+      if (mx == block_comment) {
+        after_whitespace = // start;
+          zero_plus< alternatives<spaces, line_comment> >(start);
+      }
+      else if (/*mx == ancestor_of ||*/ mx == no_spaces) {
+        after_whitespace = position;
+      }
+      else if (mx == spaces || mx == ancestor_of) {
+        after_whitespace = mx(start);
+        if (after_whitespace) {
+          return after_whitespace;
+        }
+        else {
+          return 0;
+        }
+      }
+      else if (mx == optional_spaces) {
+        after_whitespace = optional_spaces(start);
+      }
+      else {
+        after_whitespace = spaces_and_comments(start);
+      }
+      const char* after_token = mx(after_whitespace);
+      if (after_token) {
+        return after_token;
+      }
+      else {
+        return 0;
+      }
+    }
+    
+    template <prelexer mx>
+    const char* lex()
+    {
+      const char* after_whitespace;
+      if (mx == block_comment) {
+        after_whitespace = // position;
+          zero_plus< alternatives<spaces, line_comment> >(position);
+      }
+      else if (mx == ancestor_of || mx == no_spaces) {
+        after_whitespace = position;
+      }
+      else if (mx == spaces) {
+        after_whitespace = spaces(position);
+        if (after_whitespace) {
+          line += count_interval<'\n'>(position, after_whitespace);
+          lexed = Token::make(position, after_whitespace);
+          return position = after_whitespace;
+        }
+        else {
+          return 0;
+        }
+      }
+      else if (mx == optional_spaces) {
+        after_whitespace = optional_spaces(position);
+      }
+      else {
+        after_whitespace = spaces_and_comments(position);
+      }
+      const char* after_token = mx(after_whitespace);
+      if (after_token) {
+        line += count_interval<'\n'>(position, after_token);
+        lexed = Token::make(after_whitespace, after_token);
+        return position = after_token;
+      }
+      else {
+        return 0;
+      }
+    }
+    
+    void parse_scss();
+    Node parse_import();
+    Node parse_include();
+    Node parse_mixin_definition();
+    Node parse_function_definition();
+    Node parse_parameters();
+    Node parse_parameter();
+    Node parse_mixin_call();
+    Node parse_arguments();
+    Node parse_argument();
+    Node parse_assignment();
+    Node parse_propset();
+    Node parse_ruleset(Selector_Lookahead lookahead, Node::Type inside_of = Node::none);
+    Node parse_selector_schema(const char* end_of_selector);
+    Node parse_selector_group();
+    Node parse_selector();
+    Node parse_selector_combinator();
+    Node parse_simple_selector_sequence();
+    Node parse_simple_selector();
+    Node parse_pseudo();
+    Node parse_attribute_selector();
+    Node parse_block(Node surrounding_ruleset, Node::Type inside_of = Node::none);
+    Node parse_rule();
+    Node parse_values();
+    Node parse_list();
+    Node parse_comma_list();
+    Node parse_space_list();
+    Node parse_disjunction();
+    Node parse_conjunction();
+    Node parse_relation();
+    Node parse_expression();
+    Node parse_term();
+    Node parse_factor();
+    Node parse_value();
+    Node parse_function_call();
+    Node parse_string();
+    Node parse_value_schema();
+    Node parse_identifier_schema();
+    Node parse_if_directive(Node surrounding_ruleset, Node::Type inside_of = Node::none);
+    Node parse_for_directive(Node surrounding_ruleset, Node::Type inside_of = Node::none);
+    Node parse_each_directive(Node surrounding_ruleset, Node::Type inside_of = Node::none);
+    Node parse_while_directive(Node surrounding_ruleset, Node::Type inside_of = Node::none);
+    Node parse_media_query(Node::Type inside_of = Node::none);
+    Node parse_media_expression();
+    Node parse_warning();
+
+    Selector_Lookahead lookahead_for_selector(const char* start = 0);
+    
+    void throw_syntax_error(string message, size_t ln = 0);
+    void throw_read_error(string message, size_t ln = 0);
+    
+    string emit_css(CSS_Style style);
+
+  };
+}
\ No newline at end of file

libsass/error.hpp

+namespace Sass {
+  
+  struct Error {
+    enum Type { read, write, syntax, evaluation };
+    
+    Type type;
+    string path;
+    size_t line;
+    string message;
+    
+    Error(Type type, string path, size_t line, string message)
+    : type(type), path(path), line(line), message(message)
+    { }
+
+  };
+  
+}
\ No newline at end of file

libsass/eval_apply.hpp

+#include <map>
+
+#ifndef SASS_NODE_INCLUDED
+#include "node.hpp"
+#endif
+
+#ifndef SASS_CONTEXT_INCLUDED
+#include "context.hpp"
+#endif
+
+namespace Sass {
+  using std::map;
+  
+  Node eval(Node expr, Node prefix, Environment& env, map<pair<string, size_t>, Function>& f_env, Node_Factory& new_Node, Context& ctx);
+  Node function_eval(string name, Node stm, Environment& bindings, Node_Factory& new_Node, Context& ctx, bool toplevel = false);
+  Node accumulate(Node::Type op, Node acc, Node rhs, Node_Factory& new_Node);
+  double operate(Node::Type op, double lhs, double rhs);
+  
+  Node apply_mixin(Node mixin, const Node args, Node prefix, Environment& env, map<pair<string, size_t>, Function>& f_env, Node_Factory& new_Node, Context& ctx, bool dynamic_scope = false);
+  Node apply_function(const Function& f, const Node args, Node prefix, Environment& env, map<pair<string, size_t>, Function>& f_env, Node_Factory& new_Node, Context& ctx);
+  Node expand_selector(Node sel, Node pre, Node_Factory& new_Node);
+  Node expand_backref(Node sel, Node pre);
+  void extend_selectors(vector<pair<Node, Node> >&, multimap<Node, Node>&, Node_Factory&);
+  Node generate_extension(Node extendee, Node extender, Node_Factory& new_Node);
+
+  Node selector_prefix(Node sel, Node_Factory& new_Node);
+  Node selector_base(Node sel);
+
+  Node selector_butfirst(Node sel, Node_Factory& new_Node);
+  Node selector_butlast(Node sel, Node_Factory& new_Node);
+
+}
\ No newline at end of file

libsass/extconf.rb

+require 'mkmf'
+# .. more stuff
+#$LIBPATH.push(Config::CONFIG['libdir'])
+$CFLAGS << " #{ENV["CFLAGS"]}"
+$LIBS << " #{ENV["LIBS"]}"
+create_makefile("libsass")

libsass/functions.hpp

+#include <cstring>
+#include <map>
+
+#ifndef SASS_NODE_INCLUDED
+#include "node.hpp"
+#endif
+
+namespace Sass {
+  using std::map;
+  
+  typedef Node (*Primitive)(const vector<Token>&, map<Token, Node>&, Node_Factory& new_Node);
+  typedef const char* str;
+  typedef str Function_Descriptor[];
+  
+  struct Function {
+    
+    string name;
+    vector<Token> parameters;
+    Node definition;
+    Primitive primitive;
+    
+    Function()
+    { /* TO DO: set up the generic callback here */ }
+
+    Function(Node def)
+    : name(def[0].to_string()),
+      parameters(vector<Token>()),
+      definition(def),
+      primitive(0)
+    { }
+    
+    Function(Function_Descriptor d, Primitive ip)
+    : name(d[0]),
+      parameters(vector<Token>()),
+      definition(Node()),
+      primitive(ip)
+    {
+      size_t len = 0;
+      while (d[len+1]) ++len;
+      
+      parameters.reserve(len);
+      for (size_t i = 0; i < len; ++i) {
+        const char* p = d[i+1];
+        Token name(Token::make(p, p + std::strlen(p)));
+        parameters.push_back(name);
+      }
+    }
+    
+    Node operator()(map<Token, Node>& bindings, Node_Factory& new_Node) const
+    {
+      if (primitive) return primitive(parameters, bindings, new_Node);
+      else           return Node();
+    }
+
+  };
+  
+  namespace Functions {
+
+    // RGB Functions ///////////////////////////////////////////////////////
+
+    extern Function_Descriptor rgb_descriptor;
+    Node rgb(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor rgba_4_descriptor;
+    Node rgba_4(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor rgba_2_descriptor;
+    Node rgba_2(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor red_descriptor;
+    Node red(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor green_descriptor;
+    Node green(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor blue_descriptor;
+    Node blue(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor mix_2_descriptor;
+    Node mix_2(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor mix_3_descriptor;
+    Node mix_3(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    // HSL Functions ///////////////////////////////////////////////////////
+    
+    extern Function_Descriptor hsla_descriptor;
+    Node hsla(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor hsl_descriptor;
+    Node hsl(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor invert_descriptor;
+    Node invert(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    // Opacity Functions ///////////////////////////////////////////////////
+
+    extern Function_Descriptor alpha_descriptor;
+    extern Function_Descriptor opacity_descriptor;
+    Node alpha(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor opacify_descriptor;
+    extern Function_Descriptor fade_in_descriptor;
+    Node opacify(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor transparentize_descriptor;
+    extern Function_Descriptor fade_out_descriptor;
+    Node transparentize(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    // String Functions ////////////////////////////////////////////////////
+
+    extern Function_Descriptor unquote_descriptor;
+    Node unquote(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor quote_descriptor;
+    Node quote(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    // Number Functions ////////////////////////////////////////////////////
+
+    extern Function_Descriptor percentage_descriptor;
+    Node percentage(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor round_descriptor;
+    Node round(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor ceil_descriptor;
+    Node ceil(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor floor_descriptor;
+    Node floor(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor abs_descriptor;    
+    Node abs(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    // List Functions //////////////////////////////////////////////////////
+    
+    extern Function_Descriptor length_descriptor;
+    Node length(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor nth_descriptor;
+    Node nth(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor join_2_descriptor;    
+    Node join_2(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor join_3_descriptor;    
+    Node join_3(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor append_2_descriptor;
+    Node append_2(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor append_3_descriptor;
+    Node append_3(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor compact_1_descriptor;
+    extern Function_Descriptor compact_2_descriptor;
+    extern Function_Descriptor compact_3_descriptor;
+    extern Function_Descriptor compact_4_descriptor;
+    extern Function_Descriptor compact_5_descriptor;
+    extern Function_Descriptor compact_6_descriptor;
+    extern Function_Descriptor compact_7_descriptor;
+    extern Function_Descriptor compact_8_descriptor;
+    extern Function_Descriptor compact_9_descriptor;
+    extern Function_Descriptor compact_10_descriptor;
+    Node compact(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    // Introspection Functions /////////////////////////////////////////////
+    
+    extern Function_Descriptor type_of_descriptor;
+    Node type_of(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+    extern Function_Descriptor unit_descriptor;
+    Node unit(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor unitless_descriptor;    
+    Node unitless(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    extern Function_Descriptor comparable_descriptor;    
+    Node comparable(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+    
+    // Boolean Functions ///////////////////////////////////////////////////
+    
+    extern Function_Descriptor not_descriptor;
+    Node not_impl(const vector<Token>& parameters, map<Token, Node>& bindings, Node_Factory& new_Node);
+
+  }
+  
+}

libsass/node.cpp

+#include <sstream>
+#include <algorithm>
+#include "node.hpp"
+#include "error.hpp"
+#include <iostream>
+
+namespace Sass {
+  using namespace std;
+
+  // ------------------------------------------------------------------------
+  // Node method implementations
+  // ------------------------------------------------------------------------
+
+  void Node::flatten()
+  {
+    switch (type())
+    {
+      case block:
+      case expansion:
+      case root:
+      case for_through_directive:
+      case for_to_directive:
+      case each_directive:
+      case while_directive:
+        break;
+
+      default:
+        return;
+    }
+    // size can change during flattening, so we need to call size() on each pass
+    for (size_t i = 0; i < size(); ++i) {
+      switch (at(i).type())
+      {
+        case expansion:
+        case block:
+        case for_through_directive:
+        case for_to_directive:
+        case each_directive:
+        case while_directive: {
+          Node expn(at(i));
+          if (expn.has_expansions()) expn.flatten();
+          ip_->has_statements |= expn.has_statements();
+          ip_->has_blocks     |= expn.has_blocks();
+          ip_->has_expansions |= expn.has_expansions();
+          // TO DO: make this more efficient -- replace with a dummy node instead of erasing
+          ip_->children.erase(begin() + i);
+          insert(begin() + i, expn.begin(), expn.end());
+          // skip over what we just spliced in
+          i += expn.size() - 1;
+        } break;
+
+        default: {
+        } break;
+      }
+    }
+  }
+
+  bool Node::operator==(Node rhs) const
+  {
+    Type t = type();
+    if (t != rhs.type()) return false;
+
+    switch (t)
+    {
+      case comma_list:
+      case space_list:
+      case expression:
+      case term:
+      case numeric_color: {
+        if (size() != rhs.size()) return false;
+        for (size_t i = 0, L = size(); i < L; ++i) {
+          if (at(i) == rhs[i]) continue;
+          else return false;
+        }
+        return true;
+      } break;
+      
+      case variable:
+      case identifier:
+      case uri:
+      case textual_percentage:
+      case textual_dimension:
+      case textual_number:
+      case textual_hex:
+      case string_constant: {
+        return token().unquote() == rhs.token().unquote();
+      } break;
+      
+      case number:
+      case numeric_percentage: {
+        return numeric_value() == rhs.numeric_value();
+      } break;
+      
+      case numeric_dimension: {
+        if (unit() == rhs.unit()) {
+          return numeric_value() == rhs.numeric_value();
+        }
+        else {
+          return false;
+        }
+      } break;
+      
+      case boolean: {
+        return boolean_value() == rhs.boolean_value();
+      } break;
+      
+      default: {
+        return true;
+      } break;
+    }
+    return false;
+  }
+  
+  bool Node::operator!=(Node rhs) const
+  { return !(*this == rhs); }
+  
+  bool Node::operator<(Node rhs) const
+  {
+    Type lhs_type = type();
+    Type rhs_type = rhs.type();
+    
+    // comparing atomic numbers
+    if ((lhs_type == number             && rhs_type == number) ||
+        (lhs_type == numeric_percentage && rhs_type == numeric_percentage)) {
+      return numeric_value() < rhs.numeric_value();
+    }
+
+    // comparing numbers with units
+    else if (lhs_type == numeric_dimension && rhs_type == numeric_dimension) {
+      if (unit() == rhs.unit()) {
+        return numeric_value() < rhs.numeric_value();
+      }
+      else {
+        throw Error(Error::evaluation, path(), line(), "incompatible units");
+      }
+    }
+
+    // comparing colors
+    else if (lhs_type == numeric_color && rhs_type == numeric_color) {
+      return lexicographical_compare(begin(), end(), rhs.begin(), rhs.end());
+    }
+
+    // comparing identifiers and strings (treat them as comparable)
+    else if ((lhs_type == identifier || lhs_type == string_constant || lhs_type == value) &&
+             (rhs_type == identifier || lhs_type == string_constant || rhs_type == value)) {
+      return token().unquote() < rhs.token().unquote();
+    }
+
+    // COMPARING SELECTORS -- IMPORTANT FOR INHERITANCE
+    else if ((type()     >= selector_group && type()     <=selector_schema) &&
+             (rhs.type() >= selector_group && rhs.type() <=selector_schema)) {
+
+      // if they're not the same kind, just compare type tags
+      if (type() != rhs.type()) return type() < rhs.type();
+
+      // otherwise we have to do more work
+      switch (type())
+      {
+        case simple_selector:
+        case pseudo: {
+          return token() < rhs.token();
+        } break;
+
+        case selector:
+        case attribute_selector: {
+          return lexicographical_compare(begin(), end(), rhs.begin(), rhs.end());
+        } break;
+
+
+
+        default: {
+          return false;
+        } break;
+
+      }
+    }
+    // END OF SELECTOR COMPARISON
+
+    // catch-all
+    else {
+      throw Error(Error::evaluation, path(), line(), "incomparable types");
+    }
+  }
+  
+  bool Node::operator<=(Node rhs) const
+  { return *this < rhs || *this == rhs; }
+  
+  bool Node::operator>(Node rhs) const
+  { return !(*this <= rhs); }
+  
+  bool Node::operator>=(Node rhs) const
+  { return !(*this < rhs); }
+
+
+  // ------------------------------------------------------------------------
+  // Token method implementations
+  // ------------------------------------------------------------------------
+  
+  string Token::unquote() const
+  {
+    string result;
+    const char* p = begin;
+    if (*begin == '\'' || *begin == '"') {
+      ++p;
+      while (p < end) {
+        if (*p == '\\') {
+          switch (*(++p)) {
+            case 'n':  result += '\n'; break;
+            case 't':  result += '\t'; break;
+            case 'b':  result += '\b'; break;
+            case 'r':  result += '\r'; break;
+            case 'f':  result += '\f'; break;
+            case 'v':  result += '\v'; break;
+            case 'a':  result += '\a'; break;
+            case '\\': result += '\\'; break;
+            default: result += *p; break;
+          }
+        }
+        else if (p == end - 1) {
+          return result;
+        }
+        else {
+          result += *p;
+        }
+        ++p;
+      }
+      return result;
+    }
+    else {
+      while (p < end) {
+        result += *(p++);
+      }
+      return result;
+    }
+  }
+  
+  void Token::unquote_to_stream(std::stringstream& buf) const
+  {
+    const char* p = begin;
+    if (*begin == '\'' || *begin == '"') {
+      ++p;
+      while (p < end) {
+        if (*p == '\\') {
+          switch (*(++p)) {
+            case 'n':  buf << '\n'; break;
+            case 't':  buf << '\t'; break;
+            case 'b':  buf << '\b'; break;
+            case 'r':  buf << '\r'; break;
+            case 'f':  buf << '\f'; break;
+            case 'v':  buf << '\v'; break;
+            case 'a':  buf << '\a'; break;
+            case '\\': buf << '\\'; break;
+            default: buf << *p; break;
+          }
+        }
+        else if (p == end - 1) {
+          return;
+        }
+        else {
+          buf << *p;
+        }
+        ++p;
+      }
+      return;
+    }
+    else {
+      while (p < end) {
+        buf << *(p++);
+      }
+      return;
+    }
+  }
+  
+  bool Token::operator<(const Token& rhs) const
+  {
+    const char* first1 = begin;
+    const char* last1  = end;
+    const char* first2 = rhs.begin;
+    const char* last2  = rhs.end;
+    while (first1!=last1)
+    {
+      if (first2 == last2 || *first2 < *first1) return false;
+      else if (*first1 < *first2) return true;
+      ++first1; ++first2;
+    }
+    return (first2 != last2);
+  }
+  
+  bool Token::operator==(const Token& rhs) const
+  {
+    if (length() != rhs.length()) return false;
+    
+    if ((begin[0]     == '"' || begin[0]     == '\'') &&
+        (rhs.begin[0] == '"' || rhs.begin[0] == '\''))
+    { return unquote() == rhs.unquote(); }
+    
+    const char* p = begin;
+    const char* q = rhs.begin;
+    for (; p < end; ++p, ++q) if (*p != *q) return false;
+    return true;
+  }
+
+
+  // ------------------------------------------------------------------------
+  // Node_Impl method implementations
+  // ------------------------------------------------------------------------
+
+  double Node_Impl::numeric_value()
+  {
+    switch (type)
+    {
+      case Node::number:
+      case Node::numeric_percentage:
+        return value.numeric;
+      case Node::numeric_dimension:
+        return value.dimension.numeric;
+      default:
+        break;
+        // throw an exception?
+    }
+    // if you reach this point, you've got a logic error somewhere
+    return 0;
+  }
+  
+  extern const char percent_str[] = "%";
+  extern const char empty_str[]   = "";
+  Token Node_Impl::unit()
+  {
+    switch (type)
+    {
+      case Node::numeric_percentage: {
+        return Token::make(percent_str);
+      } break;
+  
+      case Node::numeric_dimension: {
+        return value.dimension.unit;
+      } break;
+      
+      default: break;
+    }
+    return Token::make(empty_str);
+  }
+
+}
\ No newline at end of file

libsass/node_factory.cpp

+#include "node_factory.hpp"
+
+namespace Sass {
+  
+  Node_Impl* Node_Factory::alloc_Node_Impl(Node::Type type, string path, size_t line)
+  {
+    Node_Impl* ip = new Node_Impl();
+    ip->type = type;
+    if (type == Node::backref) ip->has_backref = true;
+    ip->path = path;
+    ip->line = line;
+    pool_.push_back(ip);
+    return ip;
+  }
+
+  // returns a deep-copy of its argument
+  Node_Impl* Node_Factory::alloc_Node_Impl(Node_Impl* ip)
+  {
+    Node_Impl* ip_cpy = new Node_Impl(*ip);
+    pool_.push_back(ip_cpy);
+    if (ip_cpy->has_children) {
+      for (size_t i = 0, S = ip_cpy->size(); i < S; ++i) {
+        Node n(ip_cpy->at(i));
+        ip_cpy->at(i) = (*this)(n);
+      }
+    }
+    return ip_cpy;
+  }
+
+  // for cloning nodes
+  Node Node_Factory::operator()(const Node& n1)
+  {
+    Node_Impl* ip_cpy = alloc_Node_Impl(n1.ip_); // deep-copy the implementation object
+    return Node(ip_cpy);
+  }
+
+  // for making leaf nodes out of terminals/tokens
+  Node Node_Factory::operator()(Node::Type type, string path, size_t line, Token t)
+  {
+    Node_Impl* ip = alloc_Node_Impl(type, path, line);
+    ip->value.token = t;
+    return Node(ip);
+  }
+
+  // for making boolean values or interior nodes that have children
+  Node Node_Factory::operator()(Node::Type type, string path, size_t line, size_t size)
+  {
+    Node_Impl* ip = alloc_Node_Impl(type, path, line);
+
+    if (type == Node::boolean) ip->value.boolean = size;
+    else                       ip->children.reserve(size);
+
+    return Node(ip);
+  }
+
+  // for making nodes representing numbers
+  Node Node_Factory::operator()(string path, size_t line, double v, Node::Type type)
+  {
+    Node_Impl* ip = alloc_Node_Impl(type, path, line);
+    ip->value.numeric = v;
+    return Node(ip);
+  }
+
+  // for making nodes representing numeric dimensions (e.g. 5px, 3em)
+  Node Node_Factory::operator()(string path, size_t line, double v, const Token& t)
+  {
+    Node_Impl* ip = alloc_Node_Impl(Node::numeric_dimension, path, line);
+    ip->value.dimension.numeric = v;
+    ip->value.dimension.unit = t;
+    return Node(ip);
+  }
+  
+  // for making nodes representing rgba color quads
+  Node Node_Factory::operator()(string path, size_t line, double r, double g, double b, double a)
+  {
+    Node color((*this)(Node::numeric_color, path, line, 4));
+    color << (*this)(path, line, r)
+          << (*this)(path, line, g)
+          << (*this)(path, line, b)
+          << (*this)(path, line, a);
+    return color;
+  }
+
+  void Node_Factory::free()
+  { for (size_t i = 0, S = pool_.size(); i < S; ++i) delete pool_[i]; }
+
+}
\ No newline at end of file

libsass/node_factory.hpp

+#include <vector>
+
+#ifndef SASS_NODE_INCLUDED
+#include "node.hpp"
+#endif
+
+namespace Sass {
+  using namespace std;
+
+  struct Token;
+  struct Node_Impl;
+  
+  class Node_Factory {
+    vector<Node_Impl*> pool_;
+    Node_Impl* alloc_Node_Impl(Node::Type type, string file, size_t line);
+    // returns a deep-copy of its argument
+    Node_Impl* alloc_Node_Impl(Node_Impl* ip);
+  public:
+    // for cloning nodes
+    Node operator()(const Node& n1);
+    // for making leaf nodes out of terminals/tokens
+    Node operator()(Node::Type type, string file, size_t line, Token t);
+    // for making boolean values or interior nodes that have children
+    Node operator()(Node::Type type, string file, size_t line, size_t size);
+    // // for making nodes representing boolean values
+    // Node operator()(Node::Type type, string file, size_t line, bool b);
+    // for making nodes representing numbers
+    Node operator()(string file, size_t line, double v, Node::Type type = Node::number);
+    // for making nodes representing numeric dimensions (e.g. 5px, 3em)
+    Node operator()(string file, size_t line, double v, const Token& t);
+    // for making nodes representing rgba color quads
+    Node operator()(string file, size_t line, double r, double g, double b, double a = 1.0);
+
+    void free();
+  };
+  
+}
\ No newline at end of file

libsass/sass_interface.cpp

+#include <iostream>
+#include <sstream>
+#include <string>
+#include <cstdlib>
+#include <unistd.h>
+#include <iostream>
+#include "document.hpp"
+#include "eval_apply.hpp"
+#include "error.hpp"
+#include "sass_interface.h"
+
+extern "C" {
+  using namespace std;
+
+  sass_context* sass_new_context()
+    { return (sass_context*) calloc(1, sizeof(sass_context)); }
+  
+  void sass_free_context(sass_context* ctx)
+  { 
+    if (ctx->output_string)
+      free(ctx->output_string);
+    free(ctx);
+  }
+
+  sass_file_context* sass_new_file_context()
+    { return (sass_file_context*) calloc(1, sizeof(sass_file_context)); }
+  
+  void sass_free_file_context(sass_file_context* ctx)
+  { 
+    if (ctx->output_string)
+      free(ctx->output_string);
+    free(ctx);
+  }
+  
+  sass_folder_context* sass_new_folder_context()
+    { return (sass_folder_context*) calloc(1, sizeof(sass_folder_context)); }
+
+  static char* process_document(Sass::Document& doc, int style)
+  {
+    using namespace Sass;
+    doc.parse_scss();
+    eval(doc.root,
+         doc.context.new_Node(Node::none, doc.path, doc.line, 0),
+         doc.context.global_env,
+         doc.context.function_env,
+         doc.context.new_Node,
+         doc.context);
+    extend_selectors(doc.context.pending_extensions, doc.context.extensions, doc.context.new_Node);
+    string output(doc.emit_css(static_cast<Document::CSS_Style>(style)));
+    char* c_output = (char*) malloc(output.size() + 1);
+    strcpy(c_output, output.c_str());
+    return c_output;
+  }
+
+  int sass_compile(sass_context* c_ctx)
+  {
+    using namespace Sass;
+    try {
+      Context cpp_ctx(c_ctx->options.include_paths);
+      // Document doc(0, c_ctx->input_string, cpp_ctx);
+      Document doc(Document::make_from_source_chars(cpp_ctx, c_ctx->source_string));
+      c_ctx->output_string = process_document(doc, c_ctx->options.output_style);
+      c_ctx->error_message = 0;
+      c_ctx->error_status = 0;
+    }
+    catch (Error& e) {
+      stringstream msg_stream;
+      msg_stream << "ERROR -- " << e.path << ", line " << e.line << ": " << e.message << endl;
+      string msg(msg_stream.str());
+      char* msg_str = (char*) malloc(msg.size() + 1);
+      strcpy(msg_str, msg.c_str());
+      c_ctx->error_status = 1;
+      c_ctx->output_string = 0;
+      c_ctx->error_message = msg_str;
+    }
+    catch(bad_alloc& ba) {
+      stringstream msg_stream;
+      msg_stream << "ERROR -- unable to allocate memory: " << ba.what() << endl;
+      string msg(msg_stream.str());
+      char* msg_str = (char*) malloc(msg.size() + 1);
+      strcpy(msg_str, msg.c_str());
+      c_ctx->error_status = 1;
+      c_ctx->output_string = 0;
+      c_ctx->error_message = msg_str;
+    }
+    // TO DO: CATCH EVERYTHING ELSE
+    return 0;
+  }
+  
+  int sass_compile_file(sass_file_context* c_ctx)
+  {
+    using namespace Sass;
+    try {
+      Context cpp_ctx(c_ctx->options.include_paths);
+      // Document doc(c_ctx->input_path, 0, cpp_ctx);
+      Document doc(Document::make_from_file(cpp_ctx, string(c_ctx->input_path)));
+      // cerr << "MADE A DOC AND CONTEXT OBJ" << endl;
+      // cerr << "REGISTRY: " << doc.context.registry.size() << endl;
+      c_ctx->output_string = process_document(doc, c_ctx->options.output_style);
+      c_ctx->error_message = 0;
+      c_ctx->error_status = 0;
+    }
+    catch (Error& e) {
+      stringstream msg_stream;
+      msg_stream << "ERROR -- " << e.path << ", line " << e.line << ": " << e.message << endl;
+      string msg(msg_stream.str());
+      char* msg_str = (char*) malloc(msg.size() + 1);
+      strcpy(msg_str, msg.c_str());
+      c_ctx->error_status = 1;
+      c_ctx->output_string = 0;
+      c_ctx->error_message = msg_str;
+    }
+    catch(bad_alloc& ba) {
+      stringstream msg_stream;
+      msg_stream << "ERROR -- unable to allocate memory: " << ba.what() << endl;
+      string msg(msg_stream.str());
+      char* msg_str = (char*) malloc(msg.size() + 1);
+      strcpy(msg_str, msg.c_str());
+      c_ctx->error_status = 1;
+      c_ctx->output_string = 0;
+      c_ctx->error_message = msg_str;
+    }
+    // TO DO: CATCH EVERYTHING ELSE
+    return 0;
+  }
+  
+  int sass_compile_folder(sass_folder_context* c_ctx)
+  {
+    return 1;
+  }
+
+}

libsass/sass_interface.h

+#include <node.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#define SASS_STYLE_NESTED     0
+#define SASS_STYLE_EXPANDED   1
+#define SASS_STYLE_COMPACT    2
+#define SASS_STYLE_COMPRESSED 3
+
+struct sass_options {
+  int output_style;
+  char* include_paths;
+};
+
+struct sass_context {
+  char* source_string;
+  char* output_string;
+  struct sass_options options;
+  int error_status;
+  char* error_message;
+  uv_work_t request;
+  v8::Persistent<v8::Function> callback;
+};
+
+struct sass_file_context {
+  char* input_path;
+  char* output_string;
+  struct sass_options options;
+  int error_status;
+  char* error_message;
+};
+
+struct sass_folder_context {
+  char* search_path;
+  char* output_path;
+  struct sass_options options;
+  int error_status;
+  char* error_message;
+};
+
+struct sass_context*        sass_new_context        (void);
+struct sass_file_context*   sass_new_file_context   (void);
+struct sass_folder_context* sass_new_folder_context (void);
+
+void sass_free_context        (struct sass_context* ctx);
+void sass_free_file_context   (struct sass_file_context* ctx);
+void sass_free_folder_context (struct sass_folder_context* ctx);
+
+int sass_compile            (struct sass_context* ctx);
+int sass_compile_file       (struct sass_file_context* ctx);
+int sass_compile_folder     (struct sass_folder_context* ctx);
+
+#ifdef __cplusplus
+}
+#endif
\ No newline at end of file

libsass/test_node_factory.cpp

+#include <iostream>
+#include <string>
+#include <tr1/unordered_map>
+#include <map>
+#include <algorithm>
+
+#ifndef SASS_NODE_INCLUDED
+#include "node.hpp"
+#endif
+
+#include "node_factory.hpp"
+
+int main()
+{
+  using namespace Sass;
+  using namespace std;
+  
+  cout << sizeof(Node_Impl*) << endl;
+  cout << sizeof(Node) << endl;
+  cout << sizeof(Node_Impl) << endl << endl;
+  
+  Node_Factory new_Node = Node_Factory();
+  
+  Node interior(new_Node(Node::block, "", 0, 3));
+  
+  cout << interior.size() << endl;
+  cout << interior.has_children() << endl;
+  cout << interior.should_eval() << endl << endl;
+  
+  Node num(new_Node("", 0, 255, 123, 32));
+  Node num2(new_Node("", 0, 255, 123, 32));
+  Node num3(new_Node("", 0, 255, 122, 20, .75));
+  
+  cout << num.size() << endl;
+  cout << num.has_children() << endl;
+  cout << num.has_statements() << endl << endl;
+  
+  cout << num[1].is_numeric() << endl;
+  cout << num[1].numeric_value() << endl << endl;
+  
+  cout << (num == num2) << endl;
+  cout << (num == num3) << endl << endl;
+  
+  cout << (num3[2] < num2[2]) << endl;
+  cout << (num2[3] < num3[3]) << endl << endl;
+  
+  cout << (num2[2] >= num3[2]) << endl;
+  cout << (num2[3] != num3[3]) << endl << endl;
+
+  Node num4(new_Node(num3));
+  cout << num3[3].numeric_value() << endl;
+  cout << num4[3].numeric_value() << endl;
+  num4[3] = new_Node("", 0, 0.4567);
+  cout << num3[3].numeric_value() << endl;
+  cout << num4[3].numeric_value() << endl << endl;
+
+  Node block1(new_Node(Node::block, "block", 1, 2));
+  block1 << num2 << num4;
+
+  Node block2(new_Node(block1));
+
+  cout << (block1 == block2) << endl;
+  cout << block1[1][3].numeric_value() << endl;
+  cout << block2[1][3].numeric_value() << endl;
+  block2[1][3] = new_Node("", 0, .9876);
+  cout << block1[1][3].numeric_value() << endl;
+  cout << block2[1][3].numeric_value() << endl << endl;
+
+  map<Node, string> dict;
+
+  Node n(new_Node("", 0, 42));
+  Node m(new_Node("", 0, 41));
+
+  dict[n] = "hello";
+  dict[m] = "goodbye";
+
+  cout << dict[m] << " " << dict[n] << endl;
+
+  cout << "Lexicographical comparison: " << endl;
+  cout << lexicographical_compare(num2.begin(), num2.end(),
+                                  num3.begin(), num3.end())
+       << endl;
+  cout << lexicographical_compare(num.begin(), num.end(),
+                                  num2.begin(), num2.end())
+       << endl;
+  cout << lexicographical_compare(num3.begin(), num3.end(),
+                                  num.begin(), num.end())
+       << endl << endl;
+
+
+
+
+  new_Node.free();
+  return 0;
+}
\ No newline at end of file

test.js

@@ -10,7 +10,7 @@ var scssStr = '#navbar {\
     a {\
       font-weight: bold; }}';
 
-sass.render(scssStr, function(css){
+sass.render(scssStr, function(err, css){
   console.log(css)
 })