[www-releases] r230777 - Upload 3.6.0

Hans Wennborg hans at hanshq.net
Fri Feb 27 10:44:12 PST 2015


Added: www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl5.txt
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl5.txt?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl5.txt (added)
+++ www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl5.txt Fri Feb 27 12:44:09 2015
@@ -0,0 +1,1362 @@
+==================================================
+Kaleidoscope: Extending the Language: Control Flow
+==================================================
+
+.. contents::
+   :local:
+
+Chapter 5 Introduction
+======================
+
+Welcome to Chapter 5 of the "`Implementing a language with
+LLVM <index.html>`_" tutorial. Parts 1-4 described the implementation of
+the simple Kaleidoscope language and included support for generating
+LLVM IR, followed by optimizations and a JIT compiler. Unfortunately, as
+presented, Kaleidoscope is mostly useless: it has no control flow other
+than call and return. This means that you can't have conditional
+branches in the code, significantly limiting its power. In this episode
+of "build that compiler", we'll extend Kaleidoscope to have an
+if/then/else expression plus a simple 'for' loop.
+
+If/Then/Else
+============
+
+Extending Kaleidoscope to support if/then/else is quite straightforward.
+It basically requires adding lexer support for this "new" concept to the
+lexer, parser, AST, and LLVM code emitter. This example is nice, because
+it shows how easy it is to "grow" a language over time, incrementally
+extending it as new ideas are discovered.
+
+Before we get going on "how" we add this extension, lets talk about
+"what" we want. The basic idea is that we want to be able to write this
+sort of thing:
+
+::
+
+    def fib(x)
+      if x < 3 then
+        1
+      else
+        fib(x-1)+fib(x-2);
+
+In Kaleidoscope, every construct is an expression: there are no
+statements. As such, the if/then/else expression needs to return a value
+like any other. Since we're using a mostly functional form, we'll have
+it evaluate its conditional, then return the 'then' or 'else' value
+based on how the condition was resolved. This is very similar to the C
+"?:" expression.
+
+The semantics of the if/then/else expression is that it evaluates the
+condition to a boolean equality value: 0.0 is considered to be false and
+everything else is considered to be true. If the condition is true, the
+first subexpression is evaluated and returned, if the condition is
+false, the second subexpression is evaluated and returned. Since
+Kaleidoscope allows side-effects, this behavior is important to nail
+down.
+
+Now that we know what we "want", lets break this down into its
+constituent pieces.
+
+Lexer Extensions for If/Then/Else
+---------------------------------
+
+The lexer extensions are straightforward. First we add new variants for
+the relevant tokens:
+
+.. code-block:: ocaml
+
+      (* control *)
+      | If | Then | Else | For | In
+
+Once we have that, we recognize the new keywords in the lexer. This is
+pretty simple stuff:
+
+.. code-block:: ocaml
+
+          ...
+          match Buffer.contents buffer with
+          | "def" -> [< 'Token.Def; stream >]
+          | "extern" -> [< 'Token.Extern; stream >]
+          | "if" -> [< 'Token.If; stream >]
+          | "then" -> [< 'Token.Then; stream >]
+          | "else" -> [< 'Token.Else; stream >]
+          | "for" -> [< 'Token.For; stream >]
+          | "in" -> [< 'Token.In; stream >]
+          | id -> [< 'Token.Ident id; stream >]
+
+AST Extensions for If/Then/Else
+-------------------------------
+
+To represent the new expression we add a new AST variant for it:
+
+.. code-block:: ocaml
+
+    type expr =
+      ...
+      (* variant for if/then/else. *)
+      | If of expr * expr * expr
+
+The AST variant just has pointers to the various subexpressions.
+
+Parser Extensions for If/Then/Else
+----------------------------------
+
+Now that we have the relevant tokens coming from the lexer and we have
+the AST node to build, our parsing logic is relatively straightforward.
+First we define a new parsing function:
+
+.. code-block:: ocaml
+
+    let rec parse_primary = parser
+      ...
+      (* ifexpr ::= 'if' expr 'then' expr 'else' expr *)
+      | [< 'Token.If; c=parse_expr;
+           'Token.Then ?? "expected 'then'"; t=parse_expr;
+           'Token.Else ?? "expected 'else'"; e=parse_expr >] ->
+          Ast.If (c, t, e)
+
+Next we hook it up as a primary expression:
+
+.. code-block:: ocaml
+
+    let rec parse_primary = parser
+      ...
+      (* ifexpr ::= 'if' expr 'then' expr 'else' expr *)
+      | [< 'Token.If; c=parse_expr;
+           'Token.Then ?? "expected 'then'"; t=parse_expr;
+           'Token.Else ?? "expected 'else'"; e=parse_expr >] ->
+          Ast.If (c, t, e)
+
+LLVM IR for If/Then/Else
+------------------------
+
+Now that we have it parsing and building the AST, the final piece is
+adding LLVM code generation support. This is the most interesting part
+of the if/then/else example, because this is where it starts to
+introduce new concepts. All of the code above has been thoroughly
+described in previous chapters.
+
+To motivate the code we want to produce, lets take a look at a simple
+example. Consider:
+
+::
+
+    extern foo();
+    extern bar();
+    def baz(x) if x then foo() else bar();
+
+If you disable optimizations, the code you'll (soon) get from
+Kaleidoscope looks like this:
+
+.. code-block:: llvm
+
+    declare double @foo()
+
+    declare double @bar()
+
+    define double @baz(double %x) {
+    entry:
+      %ifcond = fcmp one double %x, 0.000000e+00
+      br i1 %ifcond, label %then, label %else
+
+    then:    ; preds = %entry
+      %calltmp = call double @foo()
+      br label %ifcont
+
+    else:    ; preds = %entry
+      %calltmp1 = call double @bar()
+      br label %ifcont
+
+    ifcont:    ; preds = %else, %then
+      %iftmp = phi double [ %calltmp, %then ], [ %calltmp1, %else ]
+      ret double %iftmp
+    }
+
+To visualize the control flow graph, you can use a nifty feature of the
+LLVM '`opt <http://llvm.org/cmds/opt.html>`_' tool. If you put this LLVM
+IR into "t.ll" and run "``llvm-as < t.ll | opt -analyze -view-cfg``", `a
+window will pop up <../ProgrammersManual.html#ViewGraph>`_ and you'll
+see this graph:
+
+.. figure:: LangImpl5-cfg.png
+   :align: center
+   :alt: Example CFG
+
+   Example CFG
+
+Another way to get this is to call
+"``Llvm_analysis.view_function_cfg f``" or
+"``Llvm_analysis.view_function_cfg_only f``" (where ``f`` is a
+"``Function``") either by inserting actual calls into the code and
+recompiling or by calling these in the debugger. LLVM has many nice
+features for visualizing various graphs.
+
+Getting back to the generated code, it is fairly simple: the entry block
+evaluates the conditional expression ("x" in our case here) and compares
+the result to 0.0 with the "``fcmp one``" instruction ('one' is "Ordered
+and Not Equal"). Based on the result of this expression, the code jumps
+to either the "then" or "else" blocks, which contain the expressions for
+the true/false cases.
+
+Once the then/else blocks are finished executing, they both branch back
+to the 'ifcont' block to execute the code that happens after the
+if/then/else. In this case the only thing left to do is to return to the
+caller of the function. The question then becomes: how does the code
+know which expression to return?
+
+The answer to this question involves an important SSA operation: the
+`Phi
+operation <http://en.wikipedia.org/wiki/Static_single_assignment_form>`_.
+If you're not familiar with SSA, `the wikipedia
+article <http://en.wikipedia.org/wiki/Static_single_assignment_form>`_
+is a good introduction and there are various other introductions to it
+available on your favorite search engine. The short version is that
+"execution" of the Phi operation requires "remembering" which block
+control came from. The Phi operation takes on the value corresponding to
+the input control block. In this case, if control comes in from the
+"then" block, it gets the value of "calltmp". If control comes from the
+"else" block, it gets the value of "calltmp1".
+
+At this point, you are probably starting to think "Oh no! This means my
+simple and elegant front-end will have to start generating SSA form in
+order to use LLVM!". Fortunately, this is not the case, and we strongly
+advise *not* implementing an SSA construction algorithm in your
+front-end unless there is an amazingly good reason to do so. In
+practice, there are two sorts of values that float around in code
+written for your average imperative programming language that might need
+Phi nodes:
+
+#. Code that involves user variables: ``x = 1; x = x + 1;``
+#. Values that are implicit in the structure of your AST, such as the
+   Phi node in this case.
+
+In `Chapter 7 <OCamlLangImpl7.html>`_ of this tutorial ("mutable
+variables"), we'll talk about #1 in depth. For now, just believe me that
+you don't need SSA construction to handle this case. For #2, you have
+the choice of using the techniques that we will describe for #1, or you
+can insert Phi nodes directly, if convenient. In this case, it is really
+really easy to generate the Phi node, so we choose to do it directly.
+
+Okay, enough of the motivation and overview, lets generate code!
+
+Code Generation for If/Then/Else
+--------------------------------
+
+In order to generate code for this, we implement the ``Codegen`` method
+for ``IfExprAST``:
+
+.. code-block:: ocaml
+
+    let rec codegen_expr = function
+      ...
+      | Ast.If (cond, then_, else_) ->
+          let cond = codegen_expr cond in
+
+          (* Convert condition to a bool by comparing equal to 0.0 *)
+          let zero = const_float double_type 0.0 in
+          let cond_val = build_fcmp Fcmp.One cond zero "ifcond" builder in
+
+This code is straightforward and similar to what we saw before. We emit
+the expression for the condition, then compare that value to zero to get
+a truth value as a 1-bit (bool) value.
+
+.. code-block:: ocaml
+
+          (* Grab the first block so that we might later add the conditional branch
+           * to it at the end of the function. *)
+          let start_bb = insertion_block builder in
+          let the_function = block_parent start_bb in
+
+          let then_bb = append_block context "then" the_function in
+          position_at_end then_bb builder;
+
+As opposed to the `C++ tutorial <LangImpl5.html>`_, we have to build our
+basic blocks bottom up since we can't have dangling BasicBlocks. We
+start off by saving a pointer to the first block (which might not be the
+entry block), which we'll need to build a conditional branch later. We
+do this by asking the ``builder`` for the current BasicBlock. The fourth
+line gets the current Function object that is being built. It gets this
+by the ``start_bb`` for its "parent" (the function it is currently
+embedded into).
+
+Once it has that, it creates one block. It is automatically appended
+into the function's list of blocks.
+
+.. code-block:: ocaml
+
+          (* Emit 'then' value. *)
+          position_at_end then_bb builder;
+          let then_val = codegen_expr then_ in
+
+          (* Codegen of 'then' can change the current block, update then_bb for the
+           * phi. We create a new name because one is used for the phi node, and the
+           * other is used for the conditional branch. *)
+          let new_then_bb = insertion_block builder in
+
+We move the builder to start inserting into the "then" block. Strictly
+speaking, this call moves the insertion point to be at the end of the
+specified block. However, since the "then" block is empty, it also
+starts out by inserting at the beginning of the block. :)
+
+Once the insertion point is set, we recursively codegen the "then"
+expression from the AST.
+
+The final line here is quite subtle, but is very important. The basic
+issue is that when we create the Phi node in the merge block, we need to
+set up the block/value pairs that indicate how the Phi will work.
+Importantly, the Phi node expects to have an entry for each predecessor
+of the block in the CFG. Why then, are we getting the current block when
+we just set it to ThenBB 5 lines above? The problem is that the "Then"
+expression may actually itself change the block that the Builder is
+emitting into if, for example, it contains a nested "if/then/else"
+expression. Because calling Codegen recursively could arbitrarily change
+the notion of the current block, we are required to get an up-to-date
+value for code that will set up the Phi node.
+
+.. code-block:: ocaml
+
+          (* Emit 'else' value. *)
+          let else_bb = append_block context "else" the_function in
+          position_at_end else_bb builder;
+          let else_val = codegen_expr else_ in
+
+          (* Codegen of 'else' can change the current block, update else_bb for the
+           * phi. *)
+          let new_else_bb = insertion_block builder in
+
+Code generation for the 'else' block is basically identical to codegen
+for the 'then' block.
+
+.. code-block:: ocaml
+
+          (* Emit merge block. *)
+          let merge_bb = append_block context "ifcont" the_function in
+          position_at_end merge_bb builder;
+          let incoming = [(then_val, new_then_bb); (else_val, new_else_bb)] in
+          let phi = build_phi incoming "iftmp" builder in
+
+The first two lines here are now familiar: the first adds the "merge"
+block to the Function object. The second block changes the insertion
+point so that newly created code will go into the "merge" block. Once
+that is done, we need to create the PHI node and set up the block/value
+pairs for the PHI.
+
+.. code-block:: ocaml
+
+          (* Return to the start block to add the conditional branch. *)
+          position_at_end start_bb builder;
+          ignore (build_cond_br cond_val then_bb else_bb builder);
+
+Once the blocks are created, we can emit the conditional branch that
+chooses between them. Note that creating new blocks does not implicitly
+affect the IRBuilder, so it is still inserting into the block that the
+condition went into. This is why we needed to save the "start" block.
+
+.. code-block:: ocaml
+
+          (* Set a unconditional branch at the end of the 'then' block and the
+           * 'else' block to the 'merge' block. *)
+          position_at_end new_then_bb builder; ignore (build_br merge_bb builder);
+          position_at_end new_else_bb builder; ignore (build_br merge_bb builder);
+
+          (* Finally, set the builder to the end of the merge block. *)
+          position_at_end merge_bb builder;
+
+          phi
+
+To finish off the blocks, we create an unconditional branch to the merge
+block. One interesting (and very important) aspect of the LLVM IR is
+that it `requires all basic blocks to be
+"terminated" <../LangRef.html#functionstructure>`_ with a `control flow
+instruction <../LangRef.html#terminators>`_ such as return or branch.
+This means that all control flow, *including fall throughs* must be made
+explicit in the LLVM IR. If you violate this rule, the verifier will
+emit an error.
+
+Finally, the CodeGen function returns the phi node as the value computed
+by the if/then/else expression. In our example above, this returned
+value will feed into the code for the top-level function, which will
+create the return instruction.
+
+Overall, we now have the ability to execute conditional code in
+Kaleidoscope. With this extension, Kaleidoscope is a fairly complete
+language that can calculate a wide variety of numeric functions. Next up
+we'll add another useful expression that is familiar from non-functional
+languages...
+
+'for' Loop Expression
+=====================
+
+Now that we know how to add basic control flow constructs to the
+language, we have the tools to add more powerful things. Lets add
+something more aggressive, a 'for' expression:
+
+::
+
+     extern putchard(char);
+     def printstar(n)
+       for i = 1, i < n, 1.0 in
+         putchard(42);  # ascii 42 = '*'
+
+     # print 100 '*' characters
+     printstar(100);
+
+This expression defines a new variable ("i" in this case) which iterates
+from a starting value, while the condition ("i < n" in this case) is
+true, incrementing by an optional step value ("1.0" in this case). If
+the step value is omitted, it defaults to 1.0. While the loop is true,
+it executes its body expression. Because we don't have anything better
+to return, we'll just define the loop as always returning 0.0. In the
+future when we have mutable variables, it will get more useful.
+
+As before, lets talk about the changes that we need to Kaleidoscope to
+support this.
+
+Lexer Extensions for the 'for' Loop
+-----------------------------------
+
+The lexer extensions are the same sort of thing as for if/then/else:
+
+.. code-block:: ocaml
+
+      ... in Token.token ...
+      (* control *)
+      | If | Then | Else
+      | For | In
+
+      ... in Lexer.lex_ident...
+          match Buffer.contents buffer with
+          | "def" -> [< 'Token.Def; stream >]
+          | "extern" -> [< 'Token.Extern; stream >]
+          | "if" -> [< 'Token.If; stream >]
+          | "then" -> [< 'Token.Then; stream >]
+          | "else" -> [< 'Token.Else; stream >]
+          | "for" -> [< 'Token.For; stream >]
+          | "in" -> [< 'Token.In; stream >]
+          | id -> [< 'Token.Ident id; stream >]
+
+AST Extensions for the 'for' Loop
+---------------------------------
+
+The AST variant is just as simple. It basically boils down to capturing
+the variable name and the constituent expressions in the node.
+
+.. code-block:: ocaml
+
+    type expr =
+      ...
+      (* variant for for/in. *)
+      | For of string * expr * expr * expr option * expr
+
+Parser Extensions for the 'for' Loop
+------------------------------------
+
+The parser code is also fairly standard. The only interesting thing here
+is handling of the optional step value. The parser code handles it by
+checking to see if the second comma is present. If not, it sets the step
+value to null in the AST node:
+
+.. code-block:: ocaml
+
+    let rec parse_primary = parser
+      ...
+      (* forexpr
+            ::= 'for' identifier '=' expr ',' expr (',' expr)? 'in' expression *)
+      | [< 'Token.For;
+           'Token.Ident id ?? "expected identifier after for";
+           'Token.Kwd '=' ?? "expected '=' after for";
+           stream >] ->
+          begin parser
+            | [<
+                 start=parse_expr;
+                 'Token.Kwd ',' ?? "expected ',' after for";
+                 end_=parse_expr;
+                 stream >] ->
+                let step =
+                  begin parser
+                  | [< 'Token.Kwd ','; step=parse_expr >] -> Some step
+                  | [< >] -> None
+                  end stream
+                in
+                begin parser
+                | [< 'Token.In; body=parse_expr >] ->
+                    Ast.For (id, start, end_, step, body)
+                | [< >] ->
+                    raise (Stream.Error "expected 'in' after for")
+                end stream
+            | [< >] ->
+                raise (Stream.Error "expected '=' after for")
+          end stream
+
+LLVM IR for the 'for' Loop
+--------------------------
+
+Now we get to the good part: the LLVM IR we want to generate for this
+thing. With the simple example above, we get this LLVM IR (note that
+this dump is generated with optimizations disabled for clarity):
+
+.. code-block:: llvm
+
+    declare double @putchard(double)
+
+    define double @printstar(double %n) {
+    entry:
+            ; initial value = 1.0 (inlined into phi)
+      br label %loop
+
+    loop:    ; preds = %loop, %entry
+      %i = phi double [ 1.000000e+00, %entry ], [ %nextvar, %loop ]
+            ; body
+      %calltmp = call double @putchard(double 4.200000e+01)
+            ; increment
+      %nextvar = fadd double %i, 1.000000e+00
+
+            ; termination test
+      %cmptmp = fcmp ult double %i, %n
+      %booltmp = uitofp i1 %cmptmp to double
+      %loopcond = fcmp one double %booltmp, 0.000000e+00
+      br i1 %loopcond, label %loop, label %afterloop
+
+    afterloop:    ; preds = %loop
+            ; loop always returns 0.0
+      ret double 0.000000e+00
+    }
+
+This loop contains all the same constructs we saw before: a phi node,
+several expressions, and some basic blocks. Lets see how this fits
+together.
+
+Code Generation for the 'for' Loop
+----------------------------------
+
+The first part of Codegen is very simple: we just output the start
+expression for the loop value:
+
+.. code-block:: ocaml
+
+    let rec codegen_expr = function
+      ...
+      | Ast.For (var_name, start, end_, step, body) ->
+          (* Emit the start code first, without 'variable' in scope. *)
+          let start_val = codegen_expr start in
+
+With this out of the way, the next step is to set up the LLVM basic
+block for the start of the loop body. In the case above, the whole loop
+body is one block, but remember that the body code itself could consist
+of multiple blocks (e.g. if it contains an if/then/else or a for/in
+expression).
+
+.. code-block:: ocaml
+
+          (* Make the new basic block for the loop header, inserting after current
+           * block. *)
+          let preheader_bb = insertion_block builder in
+          let the_function = block_parent preheader_bb in
+          let loop_bb = append_block context "loop" the_function in
+
+          (* Insert an explicit fall through from the current block to the
+           * loop_bb. *)
+          ignore (build_br loop_bb builder);
+
+This code is similar to what we saw for if/then/else. Because we will
+need it to create the Phi node, we remember the block that falls through
+into the loop. Once we have that, we create the actual block that starts
+the loop and create an unconditional branch for the fall-through between
+the two blocks.
+
+.. code-block:: ocaml
+
+          (* Start insertion in loop_bb. *)
+          position_at_end loop_bb builder;
+
+          (* Start the PHI node with an entry for start. *)
+          let variable = build_phi [(start_val, preheader_bb)] var_name builder in
+
+Now that the "preheader" for the loop is set up, we switch to emitting
+code for the loop body. To begin with, we move the insertion point and
+create the PHI node for the loop induction variable. Since we already
+know the incoming value for the starting value, we add it to the Phi
+node. Note that the Phi will eventually get a second value for the
+backedge, but we can't set it up yet (because it doesn't exist!).
+
+.. code-block:: ocaml
+
+          (* Within the loop, the variable is defined equal to the PHI node. If it
+           * shadows an existing variable, we have to restore it, so save it
+           * now. *)
+          let old_val =
+            try Some (Hashtbl.find named_values var_name) with Not_found -> None
+          in
+          Hashtbl.add named_values var_name variable;
+
+          (* Emit the body of the loop.  This, like any other expr, can change the
+           * current BB.  Note that we ignore the value computed by the body, but
+           * don't allow an error *)
+          ignore (codegen_expr body);
+
+Now the code starts to get more interesting. Our 'for' loop introduces a
+new variable to the symbol table. This means that our symbol table can
+now contain either function arguments or loop variables. To handle this,
+before we codegen the body of the loop, we add the loop variable as the
+current value for its name. Note that it is possible that there is a
+variable of the same name in the outer scope. It would be easy to make
+this an error (emit an error and return null if there is already an
+entry for VarName) but we choose to allow shadowing of variables. In
+order to handle this correctly, we remember the Value that we are
+potentially shadowing in ``old_val`` (which will be None if there is no
+shadowed variable).
+
+Once the loop variable is set into the symbol table, the code
+recursively codegen's the body. This allows the body to use the loop
+variable: any references to it will naturally find it in the symbol
+table.
+
+.. code-block:: ocaml
+
+          (* Emit the step value. *)
+          let step_val =
+            match step with
+            | Some step -> codegen_expr step
+            (* If not specified, use 1.0. *)
+            | None -> const_float double_type 1.0
+          in
+
+          let next_var = build_add variable step_val "nextvar" builder in
+
+Now that the body is emitted, we compute the next value of the iteration
+variable by adding the step value, or 1.0 if it isn't present.
+'``next_var``' will be the value of the loop variable on the next
+iteration of the loop.
+
+.. code-block:: ocaml
+
+          (* Compute the end condition. *)
+          let end_cond = codegen_expr end_ in
+
+          (* Convert condition to a bool by comparing equal to 0.0. *)
+          let zero = const_float double_type 0.0 in
+          let end_cond = build_fcmp Fcmp.One end_cond zero "loopcond" builder in
+
+Finally, we evaluate the exit value of the loop, to determine whether
+the loop should exit. This mirrors the condition evaluation for the
+if/then/else statement.
+
+.. code-block:: ocaml
+
+          (* Create the "after loop" block and insert it. *)
+          let loop_end_bb = insertion_block builder in
+          let after_bb = append_block context "afterloop" the_function in
+
+          (* Insert the conditional branch into the end of loop_end_bb. *)
+          ignore (build_cond_br end_cond loop_bb after_bb builder);
+
+          (* Any new code will be inserted in after_bb. *)
+          position_at_end after_bb builder;
+
+With the code for the body of the loop complete, we just need to finish
+up the control flow for it. This code remembers the end block (for the
+phi node), then creates the block for the loop exit ("afterloop"). Based
+on the value of the exit condition, it creates a conditional branch that
+chooses between executing the loop again and exiting the loop. Any
+future code is emitted in the "afterloop" block, so it sets the
+insertion position to it.
+
+.. code-block:: ocaml
+
+          (* Add a new entry to the PHI node for the backedge. *)
+          add_incoming (next_var, loop_end_bb) variable;
+
+          (* Restore the unshadowed variable. *)
+          begin match old_val with
+          | Some old_val -> Hashtbl.add named_values var_name old_val
+          | None -> ()
+          end;
+
+          (* for expr always returns 0.0. *)
+          const_null double_type
+
+The final code handles various cleanups: now that we have the
+"``next_var``" value, we can add the incoming value to the loop PHI
+node. After that, we remove the loop variable from the symbol table, so
+that it isn't in scope after the for loop. Finally, code generation of
+the for loop always returns 0.0, so that is what we return from
+``Codegen.codegen_expr``.
+
+With this, we conclude the "adding control flow to Kaleidoscope" chapter
+of the tutorial. In this chapter we added two control flow constructs,
+and used them to motivate a couple of aspects of the LLVM IR that are
+important for front-end implementors to know. In the next chapter of our
+saga, we will get a bit crazier and add `user-defined
+operators <OCamlLangImpl6.html>`_ to our poor innocent language.
+
+Full Code Listing
+=================
+
+Here is the complete code listing for our running example, enhanced with
+the if/then/else and for expressions.. To build this example, use:
+
+.. code-block:: bash
+
+    # Compile
+    ocamlbuild toy.byte
+    # Run
+    ./toy.byte
+
+Here is the code:
+
+\_tags:
+    ::
+
+        <{lexer,parser}.ml>: use_camlp4, pp(camlp4of)
+        <*.{byte,native}>: g++, use_llvm, use_llvm_analysis
+        <*.{byte,native}>: use_llvm_executionengine, use_llvm_target
+        <*.{byte,native}>: use_llvm_scalar_opts, use_bindings
+
+myocamlbuild.ml:
+    .. code-block:: ocaml
+
+        open Ocamlbuild_plugin;;
+
+        ocaml_lib ~extern:true "llvm";;
+        ocaml_lib ~extern:true "llvm_analysis";;
+        ocaml_lib ~extern:true "llvm_executionengine";;
+        ocaml_lib ~extern:true "llvm_target";;
+        ocaml_lib ~extern:true "llvm_scalar_opts";;
+
+        flag ["link"; "ocaml"; "g++"] (S[A"-cc"; A"g++"]);;
+        dep ["link"; "ocaml"; "use_bindings"] ["bindings.o"];;
+
+token.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Lexer Tokens
+         *===----------------------------------------------------------------------===*)
+
+        (* The lexer returns these 'Kwd' if it is an unknown character, otherwise one of
+         * these others for known things. *)
+        type token =
+          (* commands *)
+          | Def | Extern
+
+          (* primary *)
+          | Ident of string | Number of float
+
+          (* unknown *)
+          | Kwd of char
+
+          (* control *)
+          | If | Then | Else
+          | For | In
+
+lexer.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Lexer
+         *===----------------------------------------------------------------------===*)
+
+        let rec lex = parser
+          (* Skip any whitespace. *)
+          | [< ' (' ' | '\n' | '\r' | '\t'); stream >] -> lex stream
+
+          (* identifier: [a-zA-Z][a-zA-Z0-9] *)
+          | [< ' ('A' .. 'Z' | 'a' .. 'z' as c); stream >] ->
+              let buffer = Buffer.create 1 in
+              Buffer.add_char buffer c;
+              lex_ident buffer stream
+
+          (* number: [0-9.]+ *)
+          | [< ' ('0' .. '9' as c); stream >] ->
+              let buffer = Buffer.create 1 in
+              Buffer.add_char buffer c;
+              lex_number buffer stream
+
+          (* Comment until end of line. *)
+          | [< ' ('#'); stream >] ->
+              lex_comment stream
+
+          (* Otherwise, just return the character as its ascii value. *)
+          | [< 'c; stream >] ->
+              [< 'Token.Kwd c; lex stream >]
+
+          (* end of stream. *)
+          | [< >] -> [< >]
+
+        and lex_number buffer = parser
+          | [< ' ('0' .. '9' | '.' as c); stream >] ->
+              Buffer.add_char buffer c;
+              lex_number buffer stream
+          | [< stream=lex >] ->
+              [< 'Token.Number (float_of_string (Buffer.contents buffer)); stream >]
+
+        and lex_ident buffer = parser
+          | [< ' ('A' .. 'Z' | 'a' .. 'z' | '0' .. '9' as c); stream >] ->
+              Buffer.add_char buffer c;
+              lex_ident buffer stream
+          | [< stream=lex >] ->
+              match Buffer.contents buffer with
+              | "def" -> [< 'Token.Def; stream >]
+              | "extern" -> [< 'Token.Extern; stream >]
+              | "if" -> [< 'Token.If; stream >]
+              | "then" -> [< 'Token.Then; stream >]
+              | "else" -> [< 'Token.Else; stream >]
+              | "for" -> [< 'Token.For; stream >]
+              | "in" -> [< 'Token.In; stream >]
+              | id -> [< 'Token.Ident id; stream >]
+
+        and lex_comment = parser
+          | [< ' ('\n'); stream=lex >] -> stream
+          | [< 'c; e=lex_comment >] -> e
+          | [< >] -> [< >]
+
+ast.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Abstract Syntax Tree (aka Parse Tree)
+         *===----------------------------------------------------------------------===*)
+
+        (* expr - Base type for all expression nodes. *)
+        type expr =
+          (* variant for numeric literals like "1.0". *)
+          | Number of float
+
+          (* variant for referencing a variable, like "a". *)
+          | Variable of string
+
+          (* variant for a binary operator. *)
+          | Binary of char * expr * expr
+
+          (* variant for function calls. *)
+          | Call of string * expr array
+
+          (* variant for if/then/else. *)
+          | If of expr * expr * expr
+
+          (* variant for for/in. *)
+          | For of string * expr * expr * expr option * expr
+
+        (* proto - This type represents the "prototype" for a function, which captures
+         * its name, and its argument names (thus implicitly the number of arguments the
+         * function takes). *)
+        type proto = Prototype of string * string array
+
+        (* func - This type represents a function definition itself. *)
+        type func = Function of proto * expr
+
+parser.ml:
+    .. code-block:: ocaml
+
+        (*===---------------------------------------------------------------------===
+         * Parser
+         *===---------------------------------------------------------------------===*)
+
+        (* binop_precedence - This holds the precedence for each binary operator that is
+         * defined *)
+        let binop_precedence:(char, int) Hashtbl.t = Hashtbl.create 10
+
+        (* precedence - Get the precedence of the pending binary operator token. *)
+        let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1
+
+        (* primary
+         *   ::= identifier
+         *   ::= numberexpr
+         *   ::= parenexpr
+         *   ::= ifexpr
+         *   ::= forexpr *)
+        let rec parse_primary = parser
+          (* numberexpr ::= number *)
+          | [< 'Token.Number n >] -> Ast.Number n
+
+          (* parenexpr ::= '(' expression ')' *)
+          | [< 'Token.Kwd '('; e=parse_expr; 'Token.Kwd ')' ?? "expected ')'" >] -> e
+
+          (* identifierexpr
+           *   ::= identifier
+           *   ::= identifier '(' argumentexpr ')' *)
+          | [< 'Token.Ident id; stream >] ->
+              let rec parse_args accumulator = parser
+                | [< e=parse_expr; stream >] ->
+                    begin parser
+                      | [< 'Token.Kwd ','; e=parse_args (e :: accumulator) >] -> e
+                      | [< >] -> e :: accumulator
+                    end stream
+                | [< >] -> accumulator
+              in
+              let rec parse_ident id = parser
+                (* Call. *)
+                | [< 'Token.Kwd '(';
+                     args=parse_args [];
+                     'Token.Kwd ')' ?? "expected ')'">] ->
+                    Ast.Call (id, Array.of_list (List.rev args))
+
+                (* Simple variable ref. *)
+                | [< >] -> Ast.Variable id
+              in
+              parse_ident id stream
+
+          (* ifexpr ::= 'if' expr 'then' expr 'else' expr *)
+          | [< 'Token.If; c=parse_expr;
+               'Token.Then ?? "expected 'then'"; t=parse_expr;
+               'Token.Else ?? "expected 'else'"; e=parse_expr >] ->
+              Ast.If (c, t, e)
+
+          (* forexpr
+                ::= 'for' identifier '=' expr ',' expr (',' expr)? 'in' expression *)
+          | [< 'Token.For;
+               'Token.Ident id ?? "expected identifier after for";
+               'Token.Kwd '=' ?? "expected '=' after for";
+               stream >] ->
+              begin parser
+                | [<
+                     start=parse_expr;
+                     'Token.Kwd ',' ?? "expected ',' after for";
+                     end_=parse_expr;
+                     stream >] ->
+                    let step =
+                      begin parser
+                      | [< 'Token.Kwd ','; step=parse_expr >] -> Some step
+                      | [< >] -> None
+                      end stream
+                    in
+                    begin parser
+                    | [< 'Token.In; body=parse_expr >] ->
+                        Ast.For (id, start, end_, step, body)
+                    | [< >] ->
+                        raise (Stream.Error "expected 'in' after for")
+                    end stream
+                | [< >] ->
+                    raise (Stream.Error "expected '=' after for")
+              end stream
+
+          | [< >] -> raise (Stream.Error "unknown token when expecting an expression.")
+
+        (* binoprhs
+         *   ::= ('+' primary)* *)
+        and parse_bin_rhs expr_prec lhs stream =
+          match Stream.peek stream with
+          (* If this is a binop, find its precedence. *)
+          | Some (Token.Kwd c) when Hashtbl.mem binop_precedence c ->
+              let token_prec = precedence c in
+
+              (* If this is a binop that binds at least as tightly as the current binop,
+               * consume it, otherwise we are done. *)
+              if token_prec < expr_prec then lhs else begin
+                (* Eat the binop. *)
+                Stream.junk stream;
+
+                (* Parse the primary expression after the binary operator. *)
+                let rhs = parse_primary stream in
+
+                (* Okay, we know this is a binop. *)
+                let rhs =
+                  match Stream.peek stream with
+                  | Some (Token.Kwd c2) ->
+                      (* If BinOp binds less tightly with rhs than the operator after
+                       * rhs, let the pending operator take rhs as its lhs. *)
+                      let next_prec = precedence c2 in
+                      if token_prec < next_prec
+                      then parse_bin_rhs (token_prec + 1) rhs stream
+                      else rhs
+                  | _ -> rhs
+                in
+
+                (* Merge lhs/rhs. *)
+                let lhs = Ast.Binary (c, lhs, rhs) in
+                parse_bin_rhs expr_prec lhs stream
+              end
+          | _ -> lhs
+
+        (* expression
+         *   ::= primary binoprhs *)
+        and parse_expr = parser
+          | [< lhs=parse_primary; stream >] -> parse_bin_rhs 0 lhs stream
+
+        (* prototype
+         *   ::= id '(' id* ')' *)
+        let parse_prototype =
+          let rec parse_args accumulator = parser
+            | [< 'Token.Ident id; e=parse_args (id::accumulator) >] -> e
+            | [< >] -> accumulator
+          in
+
+          parser
+          | [< 'Token.Ident id;
+               'Token.Kwd '(' ?? "expected '(' in prototype";
+               args=parse_args [];
+               'Token.Kwd ')' ?? "expected ')' in prototype" >] ->
+              (* success. *)
+              Ast.Prototype (id, Array.of_list (List.rev args))
+
+          | [< >] ->
+              raise (Stream.Error "expected function name in prototype")
+
+        (* definition ::= 'def' prototype expression *)
+        let parse_definition = parser
+          | [< 'Token.Def; p=parse_prototype; e=parse_expr >] ->
+              Ast.Function (p, e)
+
+        (* toplevelexpr ::= expression *)
+        let parse_toplevel = parser
+          | [< e=parse_expr >] ->
+              (* Make an anonymous proto. *)
+              Ast.Function (Ast.Prototype ("", [||]), e)
+
+        (*  external ::= 'extern' prototype *)
+        let parse_extern = parser
+          | [< 'Token.Extern; e=parse_prototype >] -> e
+
+codegen.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Code Generation
+         *===----------------------------------------------------------------------===*)
+
+        open Llvm
+
+        exception Error of string
+
+        let context = global_context ()
+        let the_module = create_module context "my cool jit"
+        let builder = builder context
+        let named_values:(string, llvalue) Hashtbl.t = Hashtbl.create 10
+        let double_type = double_type context
+
+        let rec codegen_expr = function
+          | Ast.Number n -> const_float double_type n
+          | Ast.Variable name ->
+              (try Hashtbl.find named_values name with
+                | Not_found -> raise (Error "unknown variable name"))
+          | Ast.Binary (op, lhs, rhs) ->
+              let lhs_val = codegen_expr lhs in
+              let rhs_val = codegen_expr rhs in
+              begin
+                match op with
+                | '+' -> build_add lhs_val rhs_val "addtmp" builder
+                | '-' -> build_sub lhs_val rhs_val "subtmp" builder
+                | '*' -> build_mul lhs_val rhs_val "multmp" builder
+                | '<' ->
+                    (* Convert bool 0/1 to double 0.0 or 1.0 *)
+                    let i = build_fcmp Fcmp.Ult lhs_val rhs_val "cmptmp" builder in
+                    build_uitofp i double_type "booltmp" builder
+                | _ -> raise (Error "invalid binary operator")
+              end
+          | Ast.Call (callee, args) ->
+              (* Look up the name in the module table. *)
+              let callee =
+                match lookup_function callee the_module with
+                | Some callee -> callee
+                | None -> raise (Error "unknown function referenced")
+              in
+              let params = params callee in
+
+              (* If argument mismatch error. *)
+              if Array.length params == Array.length args then () else
+                raise (Error "incorrect # arguments passed");
+              let args = Array.map codegen_expr args in
+              build_call callee args "calltmp" builder
+          | Ast.If (cond, then_, else_) ->
+              let cond = codegen_expr cond in
+
+              (* Convert condition to a bool by comparing equal to 0.0 *)
+              let zero = const_float double_type 0.0 in
+              let cond_val = build_fcmp Fcmp.One cond zero "ifcond" builder in
+
+              (* Grab the first block so that we might later add the conditional branch
+               * to it at the end of the function. *)
+              let start_bb = insertion_block builder in
+              let the_function = block_parent start_bb in
+
+              let then_bb = append_block context "then" the_function in
+
+              (* Emit 'then' value. *)
+              position_at_end then_bb builder;
+              let then_val = codegen_expr then_ in
+
+              (* Codegen of 'then' can change the current block, update then_bb for the
+               * phi. We create a new name because one is used for the phi node, and the
+               * other is used for the conditional branch. *)
+              let new_then_bb = insertion_block builder in
+
+              (* Emit 'else' value. *)
+              let else_bb = append_block context "else" the_function in
+              position_at_end else_bb builder;
+              let else_val = codegen_expr else_ in
+
+              (* Codegen of 'else' can change the current block, update else_bb for the
+               * phi. *)
+              let new_else_bb = insertion_block builder in
+
+              (* Emit merge block. *)
+              let merge_bb = append_block context "ifcont" the_function in
+              position_at_end merge_bb builder;
+              let incoming = [(then_val, new_then_bb); (else_val, new_else_bb)] in
+              let phi = build_phi incoming "iftmp" builder in
+
+              (* Return to the start block to add the conditional branch. *)
+              position_at_end start_bb builder;
+              ignore (build_cond_br cond_val then_bb else_bb builder);
+
+              (* Set a unconditional branch at the end of the 'then' block and the
+               * 'else' block to the 'merge' block. *)
+              position_at_end new_then_bb builder; ignore (build_br merge_bb builder);
+              position_at_end new_else_bb builder; ignore (build_br merge_bb builder);
+
+              (* Finally, set the builder to the end of the merge block. *)
+              position_at_end merge_bb builder;
+
+              phi
+          | Ast.For (var_name, start, end_, step, body) ->
+              (* Emit the start code first, without 'variable' in scope. *)
+              let start_val = codegen_expr start in
+
+              (* Make the new basic block for the loop header, inserting after current
+               * block. *)
+              let preheader_bb = insertion_block builder in
+              let the_function = block_parent preheader_bb in
+              let loop_bb = append_block context "loop" the_function in
+
+              (* Insert an explicit fall through from the current block to the
+               * loop_bb. *)
+              ignore (build_br loop_bb builder);
+
+              (* Start insertion in loop_bb. *)
+              position_at_end loop_bb builder;
+
+              (* Start the PHI node with an entry for start. *)
+              let variable = build_phi [(start_val, preheader_bb)] var_name builder in
+
+              (* Within the loop, the variable is defined equal to the PHI node. If it
+               * shadows an existing variable, we have to restore it, so save it
+               * now. *)
+              let old_val =
+                try Some (Hashtbl.find named_values var_name) with Not_found -> None
+              in
+              Hashtbl.add named_values var_name variable;
+
+              (* Emit the body of the loop.  This, like any other expr, can change the
+               * current BB.  Note that we ignore the value computed by the body, but
+               * don't allow an error *)
+              ignore (codegen_expr body);
+
+              (* Emit the step value. *)
+              let step_val =
+                match step with
+                | Some step -> codegen_expr step
+                (* If not specified, use 1.0. *)
+                | None -> const_float double_type 1.0
+              in
+
+              let next_var = build_add variable step_val "nextvar" builder in
+
+              (* Compute the end condition. *)
+              let end_cond = codegen_expr end_ in
+
+              (* Convert condition to a bool by comparing equal to 0.0. *)
+              let zero = const_float double_type 0.0 in
+              let end_cond = build_fcmp Fcmp.One end_cond zero "loopcond" builder in
+
+              (* Create the "after loop" block and insert it. *)
+              let loop_end_bb = insertion_block builder in
+              let after_bb = append_block context "afterloop" the_function in
+
+              (* Insert the conditional branch into the end of loop_end_bb. *)
+              ignore (build_cond_br end_cond loop_bb after_bb builder);
+
+              (* Any new code will be inserted in after_bb. *)
+              position_at_end after_bb builder;
+
+              (* Add a new entry to the PHI node for the backedge. *)
+              add_incoming (next_var, loop_end_bb) variable;
+
+              (* Restore the unshadowed variable. *)
+              begin match old_val with
+              | Some old_val -> Hashtbl.add named_values var_name old_val
+              | None -> ()
+              end;
+
+              (* for expr always returns 0.0. *)
+              const_null double_type
+
+        let codegen_proto = function
+          | Ast.Prototype (name, args) ->
+              (* Make the function type: double(double,double) etc. *)
+              let doubles = Array.make (Array.length args) double_type in
+              let ft = function_type double_type doubles in
+              let f =
+                match lookup_function name the_module with
+                | None -> declare_function name ft the_module
+
+                (* If 'f' conflicted, there was already something named 'name'. If it
+                 * has a body, don't allow redefinition or reextern. *)
+                | Some f ->
+                    (* If 'f' already has a body, reject this. *)
+                    if block_begin f <> At_end f then
+                      raise (Error "redefinition of function");
+
+                    (* If 'f' took a different number of arguments, reject. *)
+                    if element_type (type_of f) <> ft then
+                      raise (Error "redefinition of function with different # args");
+                    f
+              in
+
+              (* Set names for all arguments. *)
+              Array.iteri (fun i a ->
+                let n = args.(i) in
+                set_value_name n a;
+                Hashtbl.add named_values n a;
+              ) (params f);
+              f
+
+        let codegen_func the_fpm = function
+          | Ast.Function (proto, body) ->
+              Hashtbl.clear named_values;
+              let the_function = codegen_proto proto in
+
+              (* Create a new basic block to start insertion into. *)
+              let bb = append_block context "entry" the_function in
+              position_at_end bb builder;
+
+              try
+                let ret_val = codegen_expr body in
+
+                (* Finish off the function. *)
+                let _ = build_ret ret_val builder in
+
+                (* Validate the generated code, checking for consistency. *)
+                Llvm_analysis.assert_valid_function the_function;
+
+                (* Optimize the function. *)
+                let _ = PassManager.run_function the_function the_fpm in
+
+                the_function
+              with e ->
+                delete_function the_function;
+                raise e
+
+toplevel.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Top-Level parsing and JIT Driver
+         *===----------------------------------------------------------------------===*)
+
+        open Llvm
+        open Llvm_executionengine
+
+        (* top ::= definition | external | expression | ';' *)
+        let rec main_loop the_fpm the_execution_engine stream =
+          match Stream.peek stream with
+          | None -> ()
+
+          (* ignore top-level semicolons. *)
+          | Some (Token.Kwd ';') ->
+              Stream.junk stream;
+              main_loop the_fpm the_execution_engine stream
+
+          | Some token ->
+              begin
+                try match token with
+                | Token.Def ->
+                    let e = Parser.parse_definition stream in
+                    print_endline "parsed a function definition.";
+                    dump_value (Codegen.codegen_func the_fpm e);
+                | Token.Extern ->
+                    let e = Parser.parse_extern stream in
+                    print_endline "parsed an extern.";
+                    dump_value (Codegen.codegen_proto e);
+                | _ ->
+                    (* Evaluate a top-level expression into an anonymous function. *)
+                    let e = Parser.parse_toplevel stream in
+                    print_endline "parsed a top-level expr";
+                    let the_function = Codegen.codegen_func the_fpm e in
+                    dump_value the_function;
+
+                    (* JIT the function, returning a function pointer. *)
+                    let result = ExecutionEngine.run_function the_function [||]
+                      the_execution_engine in
+
+                    print_string "Evaluated to ";
+                    print_float (GenericValue.as_float Codegen.double_type result);
+                    print_newline ();
+                with Stream.Error s | Codegen.Error s ->
+                  (* Skip token for error recovery. *)
+                  Stream.junk stream;
+                  print_endline s;
+              end;
+              print_string "ready> "; flush stdout;
+              main_loop the_fpm the_execution_engine stream
+
+toy.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Main driver code.
+         *===----------------------------------------------------------------------===*)
+
+        open Llvm
+        open Llvm_executionengine
+        open Llvm_target
+        open Llvm_scalar_opts
+
+        let main () =
+          ignore (initialize_native_target ());
+
+          (* Install standard binary operators.
+           * 1 is the lowest precedence. *)
+          Hashtbl.add Parser.binop_precedence '<' 10;
+          Hashtbl.add Parser.binop_precedence '+' 20;
+          Hashtbl.add Parser.binop_precedence '-' 20;
+          Hashtbl.add Parser.binop_precedence '*' 40;    (* highest. *)
+
+          (* Prime the first token. *)
+          print_string "ready> "; flush stdout;
+          let stream = Lexer.lex (Stream.of_channel stdin) in
+
+          (* Create the JIT. *)
+          let the_execution_engine = ExecutionEngine.create Codegen.the_module in
+          let the_fpm = PassManager.create_function Codegen.the_module in
+
+          (* Set up the optimizer pipeline.  Start with registering info about how the
+           * target lays out data structures. *)
+          DataLayout.add (ExecutionEngine.target_data the_execution_engine) the_fpm;
+
+          (* Do simple "peephole" optimizations and bit-twiddling optzn. *)
+          add_instruction_combination the_fpm;
+
+          (* reassociate expressions. *)
+          add_reassociation the_fpm;
+
+          (* Eliminate Common SubExpressions. *)
+          add_gvn the_fpm;
+
+          (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
+          add_cfg_simplification the_fpm;
+
+          ignore (PassManager.initialize the_fpm);
+
+          (* Run the main "interpreter loop" now. *)
+          Toplevel.main_loop the_fpm the_execution_engine stream;
+
+          (* Print out all the generated code. *)
+          dump_module Codegen.the_module
+        ;;
+
+        main ()
+
+bindings.c
+    .. code-block:: c
+
+        #include <stdio.h>
+
+        /* putchard - putchar that takes a double and returns 0. */
+        extern double putchard(double X) {
+          putchar((char)X);
+          return 0;
+        }
+
+`Next: Extending the language: user-defined
+operators <OCamlLangImpl6.html>`_
+

Added: www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl6.txt
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl6.txt?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl6.txt (added)
+++ www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl6.txt Fri Feb 27 12:44:09 2015
@@ -0,0 +1,1441 @@
+============================================================
+Kaleidoscope: Extending the Language: User-defined Operators
+============================================================
+
+.. contents::
+   :local:
+
+Chapter 6 Introduction
+======================
+
+Welcome to Chapter 6 of the "`Implementing a language with
+LLVM <index.html>`_" tutorial. At this point in our tutorial, we now
+have a fully functional language that is fairly minimal, but also
+useful. There is still one big problem with it, however. Our language
+doesn't have many useful operators (like division, logical negation, or
+even any comparisons besides less-than).
+
+This chapter of the tutorial takes a wild digression into adding
+user-defined operators to the simple and beautiful Kaleidoscope
+language. This digression now gives us a simple and ugly language in
+some ways, but also a powerful one at the same time. One of the great
+things about creating your own language is that you get to decide what
+is good or bad. In this tutorial we'll assume that it is okay to use
+this as a way to show some interesting parsing techniques.
+
+At the end of this tutorial, we'll run through an example Kaleidoscope
+application that `renders the Mandelbrot set <#example>`_. This gives an
+example of what you can build with Kaleidoscope and its feature set.
+
+User-defined Operators: the Idea
+================================
+
+The "operator overloading" that we will add to Kaleidoscope is more
+general than languages like C++. In C++, you are only allowed to
+redefine existing operators: you can't programatically change the
+grammar, introduce new operators, change precedence levels, etc. In this
+chapter, we will add this capability to Kaleidoscope, which will let the
+user round out the set of operators that are supported.
+
+The point of going into user-defined operators in a tutorial like this
+is to show the power and flexibility of using a hand-written parser.
+Thus far, the parser we have been implementing uses recursive descent
+for most parts of the grammar and operator precedence parsing for the
+expressions. See `Chapter 2 <OCamlLangImpl2.html>`_ for details. Without
+using operator precedence parsing, it would be very difficult to allow
+the programmer to introduce new operators into the grammar: the grammar
+is dynamically extensible as the JIT runs.
+
+The two specific features we'll add are programmable unary operators
+(right now, Kaleidoscope has no unary operators at all) as well as
+binary operators. An example of this is:
+
+::
+
+    # Logical unary not.
+    def unary!(v)
+      if v then
+        0
+      else
+        1;
+
+    # Define > with the same precedence as <.
+    def binary> 10 (LHS RHS)
+      RHS < LHS;
+
+    # Binary "logical or", (note that it does not "short circuit")
+    def binary| 5 (LHS RHS)
+      if LHS then
+        1
+      else if RHS then
+        1
+      else
+        0;
+
+    # Define = with slightly lower precedence than relationals.
+    def binary= 9 (LHS RHS)
+      !(LHS < RHS | LHS > RHS);
+
+Many languages aspire to being able to implement their standard runtime
+library in the language itself. In Kaleidoscope, we can implement
+significant parts of the language in the library!
+
+We will break down implementation of these features into two parts:
+implementing support for user-defined binary operators and adding unary
+operators.
+
+User-defined Binary Operators
+=============================
+
+Adding support for user-defined binary operators is pretty simple with
+our current framework. We'll first add support for the unary/binary
+keywords:
+
+.. code-block:: ocaml
+
+    type token =
+      ...
+      (* operators *)
+      | Binary | Unary
+
+    ...
+
+    and lex_ident buffer = parser
+      ...
+          | "for" -> [< 'Token.For; stream >]
+          | "in" -> [< 'Token.In; stream >]
+          | "binary" -> [< 'Token.Binary; stream >]
+          | "unary" -> [< 'Token.Unary; stream >]
+
+This just adds lexer support for the unary and binary keywords, like we
+did in `previous chapters <OCamlLangImpl5.html#iflexer>`_. One nice
+thing about our current AST, is that we represent binary operators with
+full generalisation by using their ASCII code as the opcode. For our
+extended operators, we'll use this same representation, so we don't need
+any new AST or parser support.
+
+On the other hand, we have to be able to represent the definitions of
+these new operators, in the "def binary\| 5" part of the function
+definition. In our grammar so far, the "name" for the function
+definition is parsed as the "prototype" production and into the
+``Ast.Prototype`` AST node. To represent our new user-defined operators
+as prototypes, we have to extend the ``Ast.Prototype`` AST node like
+this:
+
+.. code-block:: ocaml
+
+    (* proto - This type represents the "prototype" for a function, which captures
+     * its name, and its argument names (thus implicitly the number of arguments the
+     * function takes). *)
+    type proto =
+      | Prototype of string * string array
+      | BinOpPrototype of string * string array * int
+
+Basically, in addition to knowing a name for the prototype, we now keep
+track of whether it was an operator, and if it was, what precedence
+level the operator is at. The precedence is only used for binary
+operators (as you'll see below, it just doesn't apply for unary
+operators). Now that we have a way to represent the prototype for a
+user-defined operator, we need to parse it:
+
+.. code-block:: ocaml
+
+    (* prototype
+     *   ::= id '(' id* ')'
+     *   ::= binary LETTER number? (id, id)
+     *   ::= unary LETTER number? (id) *)
+    let parse_prototype =
+      let rec parse_args accumulator = parser
+        | [< 'Token.Ident id; e=parse_args (id::accumulator) >] -> e
+        | [< >] -> accumulator
+      in
+      let parse_operator = parser
+        | [< 'Token.Unary >] -> "unary", 1
+        | [< 'Token.Binary >] -> "binary", 2
+      in
+      let parse_binary_precedence = parser
+        | [< 'Token.Number n >] -> int_of_float n
+        | [< >] -> 30
+      in
+      parser
+      | [< 'Token.Ident id;
+           'Token.Kwd '(' ?? "expected '(' in prototype";
+           args=parse_args [];
+           'Token.Kwd ')' ?? "expected ')' in prototype" >] ->
+          (* success. *)
+          Ast.Prototype (id, Array.of_list (List.rev args))
+      | [< (prefix, kind)=parse_operator;
+           'Token.Kwd op ?? "expected an operator";
+           (* Read the precedence if present. *)
+           binary_precedence=parse_binary_precedence;
+           'Token.Kwd '(' ?? "expected '(' in prototype";
+            args=parse_args [];
+           'Token.Kwd ')' ?? "expected ')' in prototype" >] ->
+          let name = prefix ^ (String.make 1 op) in
+          let args = Array.of_list (List.rev args) in
+
+          (* Verify right number of arguments for operator. *)
+          if Array.length args != kind
+          then raise (Stream.Error "invalid number of operands for operator")
+          else
+            if kind == 1 then
+              Ast.Prototype (name, args)
+            else
+              Ast.BinOpPrototype (name, args, binary_precedence)
+      | [< >] ->
+          raise (Stream.Error "expected function name in prototype")
+
+This is all fairly straightforward parsing code, and we have already
+seen a lot of similar code in the past. One interesting part about the
+code above is the couple lines that set up ``name`` for binary
+operators. This builds names like "binary@" for a newly defined "@"
+operator. This then takes advantage of the fact that symbol names in the
+LLVM symbol table are allowed to have any character in them, including
+embedded nul characters.
+
+The next interesting thing to add, is codegen support for these binary
+operators. Given our current structure, this is a simple addition of a
+default case for our existing binary operator node:
+
+.. code-block:: ocaml
+
+    let codegen_expr = function
+      ...
+      | Ast.Binary (op, lhs, rhs) ->
+          let lhs_val = codegen_expr lhs in
+          let rhs_val = codegen_expr rhs in
+          begin
+            match op with
+            | '+' -> build_add lhs_val rhs_val "addtmp" builder
+            | '-' -> build_sub lhs_val rhs_val "subtmp" builder
+            | '*' -> build_mul lhs_val rhs_val "multmp" builder
+            | '<' ->
+                (* Convert bool 0/1 to double 0.0 or 1.0 *)
+                let i = build_fcmp Fcmp.Ult lhs_val rhs_val "cmptmp" builder in
+                build_uitofp i double_type "booltmp" builder
+            | _ ->
+                (* If it wasn't a builtin binary operator, it must be a user defined
+                 * one. Emit a call to it. *)
+                let callee = "binary" ^ (String.make 1 op) in
+                let callee =
+                  match lookup_function callee the_module with
+                  | Some callee -> callee
+                  | None -> raise (Error "binary operator not found!")
+                in
+                build_call callee [|lhs_val; rhs_val|] "binop" builder
+          end
+
+As you can see above, the new code is actually really simple. It just
+does a lookup for the appropriate operator in the symbol table and
+generates a function call to it. Since user-defined operators are just
+built as normal functions (because the "prototype" boils down to a
+function with the right name) everything falls into place.
+
+The final piece of code we are missing, is a bit of top level magic:
+
+.. code-block:: ocaml
+
+    let codegen_func the_fpm = function
+      | Ast.Function (proto, body) ->
+          Hashtbl.clear named_values;
+          let the_function = codegen_proto proto in
+
+          (* If this is an operator, install it. *)
+          begin match proto with
+          | Ast.BinOpPrototype (name, args, prec) ->
+              let op = name.[String.length name - 1] in
+              Hashtbl.add Parser.binop_precedence op prec;
+          | _ -> ()
+          end;
+
+          (* Create a new basic block to start insertion into. *)
+          let bb = append_block context "entry" the_function in
+          position_at_end bb builder;
+          ...
+
+Basically, before codegening a function, if it is a user-defined
+operator, we register it in the precedence table. This allows the binary
+operator parsing logic we already have in place to handle it. Since we
+are working on a fully-general operator precedence parser, this is all
+we need to do to "extend the grammar".
+
+Now we have useful user-defined binary operators. This builds a lot on
+the previous framework we built for other operators. Adding unary
+operators is a bit more challenging, because we don't have any framework
+for it yet - lets see what it takes.
+
+User-defined Unary Operators
+============================
+
+Since we don't currently support unary operators in the Kaleidoscope
+language, we'll need to add everything to support them. Above, we added
+simple support for the 'unary' keyword to the lexer. In addition to
+that, we need an AST node:
+
+.. code-block:: ocaml
+
+    type expr =
+      ...
+      (* variant for a unary operator. *)
+      | Unary of char * expr
+      ...
+
+This AST node is very simple and obvious by now. It directly mirrors the
+binary operator AST node, except that it only has one child. With this,
+we need to add the parsing logic. Parsing a unary operator is pretty
+simple: we'll add a new function to do it:
+
+.. code-block:: ocaml
+
+    (* unary
+     *   ::= primary
+     *   ::= '!' unary *)
+    and parse_unary = parser
+      (* If this is a unary operator, read it. *)
+      | [< 'Token.Kwd op when op != '(' && op != ')'; operand=parse_expr >] ->
+          Ast.Unary (op, operand)
+
+      (* If the current token is not an operator, it must be a primary expr. *)
+      | [< stream >] -> parse_primary stream
+
+The grammar we add is pretty straightforward here. If we see a unary
+operator when parsing a primary operator, we eat the operator as a
+prefix and parse the remaining piece as another unary operator. This
+allows us to handle multiple unary operators (e.g. "!!x"). Note that
+unary operators can't have ambiguous parses like binary operators can,
+so there is no need for precedence information.
+
+The problem with this function, is that we need to call ParseUnary from
+somewhere. To do this, we change previous callers of ParsePrimary to
+call ``parse_unary`` instead:
+
+.. code-block:: ocaml
+
+    (* binoprhs
+     *   ::= ('+' primary)* *)
+    and parse_bin_rhs expr_prec lhs stream =
+            ...
+            (* Parse the unary expression after the binary operator. *)
+            let rhs = parse_unary stream in
+            ...
+
+    ...
+
+    (* expression
+     *   ::= primary binoprhs *)
+    and parse_expr = parser
+      | [< lhs=parse_unary; stream >] -> parse_bin_rhs 0 lhs stream
+
+With these two simple changes, we are now able to parse unary operators
+and build the AST for them. Next up, we need to add parser support for
+prototypes, to parse the unary operator prototype. We extend the binary
+operator code above with:
+
+.. code-block:: ocaml
+
+    (* prototype
+     *   ::= id '(' id* ')'
+     *   ::= binary LETTER number? (id, id)
+     *   ::= unary LETTER number? (id) *)
+    let parse_prototype =
+      let rec parse_args accumulator = parser
+        | [< 'Token.Ident id; e=parse_args (id::accumulator) >] -> e
+        | [< >] -> accumulator
+      in
+      let parse_operator = parser
+        | [< 'Token.Unary >] -> "unary", 1
+        | [< 'Token.Binary >] -> "binary", 2
+      in
+      let parse_binary_precedence = parser
+        | [< 'Token.Number n >] -> int_of_float n
+        | [< >] -> 30
+      in
+      parser
+      | [< 'Token.Ident id;
+           'Token.Kwd '(' ?? "expected '(' in prototype";
+           args=parse_args [];
+           'Token.Kwd ')' ?? "expected ')' in prototype" >] ->
+          (* success. *)
+          Ast.Prototype (id, Array.of_list (List.rev args))
+      | [< (prefix, kind)=parse_operator;
+           'Token.Kwd op ?? "expected an operator";
+           (* Read the precedence if present. *)
+           binary_precedence=parse_binary_precedence;
+           'Token.Kwd '(' ?? "expected '(' in prototype";
+            args=parse_args [];
+           'Token.Kwd ')' ?? "expected ')' in prototype" >] ->
+          let name = prefix ^ (String.make 1 op) in
+          let args = Array.of_list (List.rev args) in
+
+          (* Verify right number of arguments for operator. *)
+          if Array.length args != kind
+          then raise (Stream.Error "invalid number of operands for operator")
+          else
+            if kind == 1 then
+              Ast.Prototype (name, args)
+            else
+              Ast.BinOpPrototype (name, args, binary_precedence)
+      | [< >] ->
+          raise (Stream.Error "expected function name in prototype")
+
+As with binary operators, we name unary operators with a name that
+includes the operator character. This assists us at code generation
+time. Speaking of, the final piece we need to add is codegen support for
+unary operators. It looks like this:
+
+.. code-block:: ocaml
+
+    let rec codegen_expr = function
+      ...
+      | Ast.Unary (op, operand) ->
+          let operand = codegen_expr operand in
+          let callee = "unary" ^ (String.make 1 op) in
+          let callee =
+            match lookup_function callee the_module with
+            | Some callee -> callee
+            | None -> raise (Error "unknown unary operator")
+          in
+          build_call callee [|operand|] "unop" builder
+
+This code is similar to, but simpler than, the code for binary
+operators. It is simpler primarily because it doesn't need to handle any
+predefined operators.
+
+Kicking the Tires
+=================
+
+It is somewhat hard to believe, but with a few simple extensions we've
+covered in the last chapters, we have grown a real-ish language. With
+this, we can do a lot of interesting things, including I/O, math, and a
+bunch of other things. For example, we can now add a nice sequencing
+operator (printd is defined to print out the specified value and a
+newline):
+
+::
+
+    ready> extern printd(x);
+    Read extern: declare double @printd(double)
+    ready> def binary : 1 (x y) 0;  # Low-precedence operator that ignores operands.
+    ..
+    ready> printd(123) : printd(456) : printd(789);
+    123.000000
+    456.000000
+    789.000000
+    Evaluated to 0.000000
+
+We can also define a bunch of other "primitive" operations, such as:
+
+::
+
+    # Logical unary not.
+    def unary!(v)
+      if v then
+        0
+      else
+        1;
+
+    # Unary negate.
+    def unary-(v)
+      0-v;
+
+    # Define > with the same precedence as <.
+    def binary> 10 (LHS RHS)
+      RHS < LHS;
+
+    # Binary logical or, which does not short circuit.
+    def binary| 5 (LHS RHS)
+      if LHS then
+        1
+      else if RHS then
+        1
+      else
+        0;
+
+    # Binary logical and, which does not short circuit.
+    def binary& 6 (LHS RHS)
+      if !LHS then
+        0
+      else
+        !!RHS;
+
+    # Define = with slightly lower precedence than relationals.
+    def binary = 9 (LHS RHS)
+      !(LHS < RHS | LHS > RHS);
+
+Given the previous if/then/else support, we can also define interesting
+functions for I/O. For example, the following prints out a character
+whose "density" reflects the value passed in: the lower the value, the
+denser the character:
+
+::
+
+    ready>
+
+    extern putchard(char)
+    def printdensity(d)
+      if d > 8 then
+        putchard(32)  # ' '
+      else if d > 4 then
+        putchard(46)  # '.'
+      else if d > 2 then
+        putchard(43)  # '+'
+      else
+        putchard(42); # '*'
+    ...
+    ready> printdensity(1): printdensity(2): printdensity(3) :
+              printdensity(4): printdensity(5): printdensity(9): putchard(10);
+    *++..
+    Evaluated to 0.000000
+
+Based on these simple primitive operations, we can start to define more
+interesting things. For example, here's a little function that solves
+for the number of iterations it takes a function in the complex plane to
+converge:
+
+::
+
+    # determine whether the specific location diverges.
+    # Solve for z = z^2 + c in the complex plane.
+    def mandleconverger(real imag iters creal cimag)
+      if iters > 255 | (real*real + imag*imag > 4) then
+        iters
+      else
+        mandleconverger(real*real - imag*imag + creal,
+                        2*real*imag + cimag,
+                        iters+1, creal, cimag);
+
+    # return the number of iterations required for the iteration to escape
+    def mandleconverge(real imag)
+      mandleconverger(real, imag, 0, real, imag);
+
+This "z = z\ :sup:`2`\  + c" function is a beautiful little creature
+that is the basis for computation of the `Mandelbrot
+Set <http://en.wikipedia.org/wiki/Mandelbrot_set>`_. Our
+``mandelconverge`` function returns the number of iterations that it
+takes for a complex orbit to escape, saturating to 255. This is not a
+very useful function by itself, but if you plot its value over a
+two-dimensional plane, you can see the Mandelbrot set. Given that we are
+limited to using putchard here, our amazing graphical output is limited,
+but we can whip together something using the density plotter above:
+
+::
+
+    # compute and plot the mandlebrot set with the specified 2 dimensional range
+    # info.
+    def mandelhelp(xmin xmax xstep   ymin ymax ystep)
+      for y = ymin, y < ymax, ystep in (
+        (for x = xmin, x < xmax, xstep in
+           printdensity(mandleconverge(x,y)))
+        : putchard(10)
+      )
+
+    # mandel - This is a convenient helper function for plotting the mandelbrot set
+    # from the specified position with the specified Magnification.
+    def mandel(realstart imagstart realmag imagmag)
+      mandelhelp(realstart, realstart+realmag*78, realmag,
+                 imagstart, imagstart+imagmag*40, imagmag);
+
+Given this, we can try plotting out the mandlebrot set! Lets try it out:
+
+::
+
+    ready> mandel(-2.3, -1.3, 0.05, 0.07);
+    *******************************+++++++++++*************************************
+    *************************+++++++++++++++++++++++*******************************
+    **********************+++++++++++++++++++++++++++++****************************
+    *******************+++++++++++++++++++++.. ...++++++++*************************
+    *****************++++++++++++++++++++++.... ...+++++++++***********************
+    ***************+++++++++++++++++++++++.....   ...+++++++++*********************
+    **************+++++++++++++++++++++++....     ....+++++++++********************
+    *************++++++++++++++++++++++......      .....++++++++*******************
+    ************+++++++++++++++++++++.......       .......+++++++******************
+    ***********+++++++++++++++++++....                ... .+++++++*****************
+    **********+++++++++++++++++.......                     .+++++++****************
+    *********++++++++++++++...........                    ...+++++++***************
+    ********++++++++++++............                      ...++++++++**************
+    ********++++++++++... ..........                        .++++++++**************
+    *******+++++++++.....                                   .+++++++++*************
+    *******++++++++......                                  ..+++++++++*************
+    *******++++++.......                                   ..+++++++++*************
+    *******+++++......                                     ..+++++++++*************
+    *******.... ....                                      ...+++++++++*************
+    *******.... .                                         ...+++++++++*************
+    *******+++++......                                    ...+++++++++*************
+    *******++++++.......                                   ..+++++++++*************
+    *******++++++++......                                   .+++++++++*************
+    *******+++++++++.....                                  ..+++++++++*************
+    ********++++++++++... ..........                        .++++++++**************
+    ********++++++++++++............                      ...++++++++**************
+    *********++++++++++++++..........                     ...+++++++***************
+    **********++++++++++++++++........                     .+++++++****************
+    **********++++++++++++++++++++....                ... ..+++++++****************
+    ***********++++++++++++++++++++++.......       .......++++++++*****************
+    ************+++++++++++++++++++++++......      ......++++++++******************
+    **************+++++++++++++++++++++++....      ....++++++++********************
+    ***************+++++++++++++++++++++++.....   ...+++++++++*********************
+    *****************++++++++++++++++++++++....  ...++++++++***********************
+    *******************+++++++++++++++++++++......++++++++*************************
+    *********************++++++++++++++++++++++.++++++++***************************
+    *************************+++++++++++++++++++++++*******************************
+    ******************************+++++++++++++************************************
+    *******************************************************************************
+    *******************************************************************************
+    *******************************************************************************
+    Evaluated to 0.000000
+    ready> mandel(-2, -1, 0.02, 0.04);
+    **************************+++++++++++++++++++++++++++++++++++++++++++++++++++++
+    ***********************++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+    *********************+++++++++++++++++++++++++++++++++++++++++++++++++++++++++.
+    *******************+++++++++++++++++++++++++++++++++++++++++++++++++++++++++...
+    *****************+++++++++++++++++++++++++++++++++++++++++++++++++++++++++.....
+    ***************++++++++++++++++++++++++++++++++++++++++++++++++++++++++........
+    **************++++++++++++++++++++++++++++++++++++++++++++++++++++++...........
+    ************+++++++++++++++++++++++++++++++++++++++++++++++++++++..............
+    ***********++++++++++++++++++++++++++++++++++++++++++++++++++........        .
+    **********++++++++++++++++++++++++++++++++++++++++++++++.............
+    ********+++++++++++++++++++++++++++++++++++++++++++..................
+    *******+++++++++++++++++++++++++++++++++++++++.......................
+    ******+++++++++++++++++++++++++++++++++++...........................
+    *****++++++++++++++++++++++++++++++++............................
+    *****++++++++++++++++++++++++++++...............................
+    ****++++++++++++++++++++++++++......   .........................
+    ***++++++++++++++++++++++++.........     ......    ...........
+    ***++++++++++++++++++++++............
+    **+++++++++++++++++++++..............
+    **+++++++++++++++++++................
+    *++++++++++++++++++.................
+    *++++++++++++++++............ ...
+    *++++++++++++++..............
+    *+++....++++................
+    *..........  ...........
+    *
+    *..........  ...........
+    *+++....++++................
+    *++++++++++++++..............
+    *++++++++++++++++............ ...
+    *++++++++++++++++++.................
+    **+++++++++++++++++++................
+    **+++++++++++++++++++++..............
+    ***++++++++++++++++++++++............
+    ***++++++++++++++++++++++++.........     ......    ...........
+    ****++++++++++++++++++++++++++......   .........................
+    *****++++++++++++++++++++++++++++...............................
+    *****++++++++++++++++++++++++++++++++............................
+    ******+++++++++++++++++++++++++++++++++++...........................
+    *******+++++++++++++++++++++++++++++++++++++++.......................
+    ********+++++++++++++++++++++++++++++++++++++++++++..................
+    Evaluated to 0.000000
+    ready> mandel(-0.9, -1.4, 0.02, 0.03);
+    *******************************************************************************
+    *******************************************************************************
+    *******************************************************************************
+    **********+++++++++++++++++++++************************************************
+    *+++++++++++++++++++++++++++++++++++++++***************************************
+    +++++++++++++++++++++++++++++++++++++++++++++**********************************
+    ++++++++++++++++++++++++++++++++++++++++++++++++++*****************************
+    ++++++++++++++++++++++++++++++++++++++++++++++++++++++*************************
+    +++++++++++++++++++++++++++++++++++++++++++++++++++++++++**********************
+    +++++++++++++++++++++++++++++++++.........++++++++++++++++++*******************
+    +++++++++++++++++++++++++++++++....   ......+++++++++++++++++++****************
+    +++++++++++++++++++++++++++++.......  ........+++++++++++++++++++**************
+    ++++++++++++++++++++++++++++........   ........++++++++++++++++++++************
+    +++++++++++++++++++++++++++.........     ..  ...+++++++++++++++++++++**********
+    ++++++++++++++++++++++++++...........        ....++++++++++++++++++++++********
+    ++++++++++++++++++++++++.............       .......++++++++++++++++++++++******
+    +++++++++++++++++++++++.............        ........+++++++++++++++++++++++****
+    ++++++++++++++++++++++...........           ..........++++++++++++++++++++++***
+    ++++++++++++++++++++...........                .........++++++++++++++++++++++*
+    ++++++++++++++++++............                  ...........++++++++++++++++++++
+    ++++++++++++++++...............                 .............++++++++++++++++++
+    ++++++++++++++.................                 ...............++++++++++++++++
+    ++++++++++++..................                  .................++++++++++++++
+    +++++++++..................                      .................+++++++++++++
+    ++++++........        .                               .........  ..++++++++++++
+    ++............                                         ......    ....++++++++++
+    ..............                                                    ...++++++++++
+    ..............                                                    ....+++++++++
+    ..............                                                    .....++++++++
+    .............                                                    ......++++++++
+    ...........                                                     .......++++++++
+    .........                                                       ........+++++++
+    .........                                                       ........+++++++
+    .........                                                           ....+++++++
+    ........                                                             ...+++++++
+    .......                                                              ...+++++++
+                                                                        ....+++++++
+                                                                       .....+++++++
+                                                                        ....+++++++
+                                                                        ....+++++++
+                                                                        ....+++++++
+    Evaluated to 0.000000
+    ready> ^D
+
+At this point, you may be starting to realize that Kaleidoscope is a
+real and powerful language. It may not be self-similar :), but it can be
+used to plot things that are!
+
+With this, we conclude the "adding user-defined operators" chapter of
+the tutorial. We have successfully augmented our language, adding the
+ability to extend the language in the library, and we have shown how
+this can be used to build a simple but interesting end-user application
+in Kaleidoscope. At this point, Kaleidoscope can build a variety of
+applications that are functional and can call functions with
+side-effects, but it can't actually define and mutate a variable itself.
+
+Strikingly, variable mutation is an important feature of some languages,
+and it is not at all obvious how to `add support for mutable
+variables <OCamlLangImpl7.html>`_ without having to add an "SSA
+construction" phase to your front-end. In the next chapter, we will
+describe how you can add variable mutation without building SSA in your
+front-end.
+
+Full Code Listing
+=================
+
+Here is the complete code listing for our running example, enhanced with
+the if/then/else and for expressions.. To build this example, use:
+
+.. code-block:: bash
+
+    # Compile
+    ocamlbuild toy.byte
+    # Run
+    ./toy.byte
+
+Here is the code:
+
+\_tags:
+    ::
+
+        <{lexer,parser}.ml>: use_camlp4, pp(camlp4of)
+        <*.{byte,native}>: g++, use_llvm, use_llvm_analysis
+        <*.{byte,native}>: use_llvm_executionengine, use_llvm_target
+        <*.{byte,native}>: use_llvm_scalar_opts, use_bindings
+
+myocamlbuild.ml:
+    .. code-block:: ocaml
+
+        open Ocamlbuild_plugin;;
+
+        ocaml_lib ~extern:true "llvm";;
+        ocaml_lib ~extern:true "llvm_analysis";;
+        ocaml_lib ~extern:true "llvm_executionengine";;
+        ocaml_lib ~extern:true "llvm_target";;
+        ocaml_lib ~extern:true "llvm_scalar_opts";;
+
+        flag ["link"; "ocaml"; "g++"] (S[A"-cc"; A"g++"; A"-cclib"; A"-rdynamic"]);;
+        dep ["link"; "ocaml"; "use_bindings"] ["bindings.o"];;
+
+token.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Lexer Tokens
+         *===----------------------------------------------------------------------===*)
+
+        (* The lexer returns these 'Kwd' if it is an unknown character, otherwise one of
+         * these others for known things. *)
+        type token =
+          (* commands *)
+          | Def | Extern
+
+          (* primary *)
+          | Ident of string | Number of float
+
+          (* unknown *)
+          | Kwd of char
+
+          (* control *)
+          | If | Then | Else
+          | For | In
+
+          (* operators *)
+          | Binary | Unary
+
+lexer.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Lexer
+         *===----------------------------------------------------------------------===*)
+
+        let rec lex = parser
+          (* Skip any whitespace. *)
+          | [< ' (' ' | '\n' | '\r' | '\t'); stream >] -> lex stream
+
+          (* identifier: [a-zA-Z][a-zA-Z0-9] *)
+          | [< ' ('A' .. 'Z' | 'a' .. 'z' as c); stream >] ->
+              let buffer = Buffer.create 1 in
+              Buffer.add_char buffer c;
+              lex_ident buffer stream
+
+          (* number: [0-9.]+ *)
+          | [< ' ('0' .. '9' as c); stream >] ->
+              let buffer = Buffer.create 1 in
+              Buffer.add_char buffer c;
+              lex_number buffer stream
+
+          (* Comment until end of line. *)
+          | [< ' ('#'); stream >] ->
+              lex_comment stream
+
+          (* Otherwise, just return the character as its ascii value. *)
+          | [< 'c; stream >] ->
+              [< 'Token.Kwd c; lex stream >]
+
+          (* end of stream. *)
+          | [< >] -> [< >]
+
+        and lex_number buffer = parser
+          | [< ' ('0' .. '9' | '.' as c); stream >] ->
+              Buffer.add_char buffer c;
+              lex_number buffer stream
+          | [< stream=lex >] ->
+              [< 'Token.Number (float_of_string (Buffer.contents buffer)); stream >]
+
+        and lex_ident buffer = parser
+          | [< ' ('A' .. 'Z' | 'a' .. 'z' | '0' .. '9' as c); stream >] ->
+              Buffer.add_char buffer c;
+              lex_ident buffer stream
+          | [< stream=lex >] ->
+              match Buffer.contents buffer with
+              | "def" -> [< 'Token.Def; stream >]
+              | "extern" -> [< 'Token.Extern; stream >]
+              | "if" -> [< 'Token.If; stream >]
+              | "then" -> [< 'Token.Then; stream >]
+              | "else" -> [< 'Token.Else; stream >]
+              | "for" -> [< 'Token.For; stream >]
+              | "in" -> [< 'Token.In; stream >]
+              | "binary" -> [< 'Token.Binary; stream >]
+              | "unary" -> [< 'Token.Unary; stream >]
+              | id -> [< 'Token.Ident id; stream >]
+
+        and lex_comment = parser
+          | [< ' ('\n'); stream=lex >] -> stream
+          | [< 'c; e=lex_comment >] -> e
+          | [< >] -> [< >]
+
+ast.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Abstract Syntax Tree (aka Parse Tree)
+         *===----------------------------------------------------------------------===*)
+
+        (* expr - Base type for all expression nodes. *)
+        type expr =
+          (* variant for numeric literals like "1.0". *)
+          | Number of float
+
+          (* variant for referencing a variable, like "a". *)
+          | Variable of string
+
+          (* variant for a unary operator. *)
+          | Unary of char * expr
+
+          (* variant for a binary operator. *)
+          | Binary of char * expr * expr
+
+          (* variant for function calls. *)
+          | Call of string * expr array
+
+          (* variant for if/then/else. *)
+          | If of expr * expr * expr
+
+          (* variant for for/in. *)
+          | For of string * expr * expr * expr option * expr
+
+        (* proto - This type represents the "prototype" for a function, which captures
+         * its name, and its argument names (thus implicitly the number of arguments the
+         * function takes). *)
+        type proto =
+          | Prototype of string * string array
+          | BinOpPrototype of string * string array * int
+
+        (* func - This type represents a function definition itself. *)
+        type func = Function of proto * expr
+
+parser.ml:
+    .. code-block:: ocaml
+
+        (*===---------------------------------------------------------------------===
+         * Parser
+         *===---------------------------------------------------------------------===*)
+
+        (* binop_precedence - This holds the precedence for each binary operator that is
+         * defined *)
+        let binop_precedence:(char, int) Hashtbl.t = Hashtbl.create 10
+
+        (* precedence - Get the precedence of the pending binary operator token. *)
+        let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1
+
+        (* primary
+         *   ::= identifier
+         *   ::= numberexpr
+         *   ::= parenexpr
+         *   ::= ifexpr
+         *   ::= forexpr *)
+        let rec parse_primary = parser
+          (* numberexpr ::= number *)
+          | [< 'Token.Number n >] -> Ast.Number n
+
+          (* parenexpr ::= '(' expression ')' *)
+          | [< 'Token.Kwd '('; e=parse_expr; 'Token.Kwd ')' ?? "expected ')'" >] -> e
+
+          (* identifierexpr
+           *   ::= identifier
+           *   ::= identifier '(' argumentexpr ')' *)
+          | [< 'Token.Ident id; stream >] ->
+              let rec parse_args accumulator = parser
+                | [< e=parse_expr; stream >] ->
+                    begin parser
+                      | [< 'Token.Kwd ','; e=parse_args (e :: accumulator) >] -> e
+                      | [< >] -> e :: accumulator
+                    end stream
+                | [< >] -> accumulator
+              in
+              let rec parse_ident id = parser
+                (* Call. *)
+                | [< 'Token.Kwd '(';
+                     args=parse_args [];
+                     'Token.Kwd ')' ?? "expected ')'">] ->
+                    Ast.Call (id, Array.of_list (List.rev args))
+
+                (* Simple variable ref. *)
+                | [< >] -> Ast.Variable id
+              in
+              parse_ident id stream
+
+          (* ifexpr ::= 'if' expr 'then' expr 'else' expr *)
+          | [< 'Token.If; c=parse_expr;
+               'Token.Then ?? "expected 'then'"; t=parse_expr;
+               'Token.Else ?? "expected 'else'"; e=parse_expr >] ->
+              Ast.If (c, t, e)
+
+          (* forexpr
+                ::= 'for' identifier '=' expr ',' expr (',' expr)? 'in' expression *)
+          | [< 'Token.For;
+               'Token.Ident id ?? "expected identifier after for";
+               'Token.Kwd '=' ?? "expected '=' after for";
+               stream >] ->
+              begin parser
+                | [<
+                     start=parse_expr;
+                     'Token.Kwd ',' ?? "expected ',' after for";
+                     end_=parse_expr;
+                     stream >] ->
+                    let step =
+                      begin parser
+                      | [< 'Token.Kwd ','; step=parse_expr >] -> Some step
+                      | [< >] -> None
+                      end stream
+                    in
+                    begin parser
+                    | [< 'Token.In; body=parse_expr >] ->
+                        Ast.For (id, start, end_, step, body)
+                    | [< >] ->
+                        raise (Stream.Error "expected 'in' after for")
+                    end stream
+                | [< >] ->
+                    raise (Stream.Error "expected '=' after for")
+              end stream
+
+          | [< >] -> raise (Stream.Error "unknown token when expecting an expression.")
+
+        (* unary
+         *   ::= primary
+         *   ::= '!' unary *)
+        and parse_unary = parser
+          (* If this is a unary operator, read it. *)
+          | [< 'Token.Kwd op when op != '(' && op != ')'; operand=parse_expr >] ->
+              Ast.Unary (op, operand)
+
+          (* If the current token is not an operator, it must be a primary expr. *)
+          | [< stream >] -> parse_primary stream
+
+        (* binoprhs
+         *   ::= ('+' primary)* *)
+        and parse_bin_rhs expr_prec lhs stream =
+          match Stream.peek stream with
+          (* If this is a binop, find its precedence. *)
+          | Some (Token.Kwd c) when Hashtbl.mem binop_precedence c ->
+              let token_prec = precedence c in
+
+              (* If this is a binop that binds at least as tightly as the current binop,
+               * consume it, otherwise we are done. *)
+              if token_prec < expr_prec then lhs else begin
+                (* Eat the binop. *)
+                Stream.junk stream;
+
+                (* Parse the unary expression after the binary operator. *)
+                let rhs = parse_unary stream in
+
+                (* Okay, we know this is a binop. *)
+                let rhs =
+                  match Stream.peek stream with
+                  | Some (Token.Kwd c2) ->
+                      (* If BinOp binds less tightly with rhs than the operator after
+                       * rhs, let the pending operator take rhs as its lhs. *)
+                      let next_prec = precedence c2 in
+                      if token_prec < next_prec
+                      then parse_bin_rhs (token_prec + 1) rhs stream
+                      else rhs
+                  | _ -> rhs
+                in
+
+                (* Merge lhs/rhs. *)
+                let lhs = Ast.Binary (c, lhs, rhs) in
+                parse_bin_rhs expr_prec lhs stream
+              end
+          | _ -> lhs
+
+        (* expression
+         *   ::= primary binoprhs *)
+        and parse_expr = parser
+          | [< lhs=parse_unary; stream >] -> parse_bin_rhs 0 lhs stream
+
+        (* prototype
+         *   ::= id '(' id* ')'
+         *   ::= binary LETTER number? (id, id)
+         *   ::= unary LETTER number? (id) *)
+        let parse_prototype =
+          let rec parse_args accumulator = parser
+            | [< 'Token.Ident id; e=parse_args (id::accumulator) >] -> e
+            | [< >] -> accumulator
+          in
+          let parse_operator = parser
+            | [< 'Token.Unary >] -> "unary", 1
+            | [< 'Token.Binary >] -> "binary", 2
+          in
+          let parse_binary_precedence = parser
+            | [< 'Token.Number n >] -> int_of_float n
+            | [< >] -> 30
+          in
+          parser
+          | [< 'Token.Ident id;
+               'Token.Kwd '(' ?? "expected '(' in prototype";
+               args=parse_args [];
+               'Token.Kwd ')' ?? "expected ')' in prototype" >] ->
+              (* success. *)
+              Ast.Prototype (id, Array.of_list (List.rev args))
+          | [< (prefix, kind)=parse_operator;
+               'Token.Kwd op ?? "expected an operator";
+               (* Read the precedence if present. *)
+               binary_precedence=parse_binary_precedence;
+               'Token.Kwd '(' ?? "expected '(' in prototype";
+                args=parse_args [];
+               'Token.Kwd ')' ?? "expected ')' in prototype" >] ->
+              let name = prefix ^ (String.make 1 op) in
+              let args = Array.of_list (List.rev args) in
+
+              (* Verify right number of arguments for operator. *)
+              if Array.length args != kind
+              then raise (Stream.Error "invalid number of operands for operator")
+              else
+                if kind == 1 then
+                  Ast.Prototype (name, args)
+                else
+                  Ast.BinOpPrototype (name, args, binary_precedence)
+          | [< >] ->
+              raise (Stream.Error "expected function name in prototype")
+
+        (* definition ::= 'def' prototype expression *)
+        let parse_definition = parser
+          | [< 'Token.Def; p=parse_prototype; e=parse_expr >] ->
+              Ast.Function (p, e)
+
+        (* toplevelexpr ::= expression *)
+        let parse_toplevel = parser
+          | [< e=parse_expr >] ->
+              (* Make an anonymous proto. *)
+              Ast.Function (Ast.Prototype ("", [||]), e)
+
+        (*  external ::= 'extern' prototype *)
+        let parse_extern = parser
+          | [< 'Token.Extern; e=parse_prototype >] -> e
+
+codegen.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Code Generation
+         *===----------------------------------------------------------------------===*)
+
+        open Llvm
+
+        exception Error of string
+
+        let context = global_context ()
+        let the_module = create_module context "my cool jit"
+        let builder = builder context
+        let named_values:(string, llvalue) Hashtbl.t = Hashtbl.create 10
+        let double_type = double_type context
+
+        let rec codegen_expr = function
+          | Ast.Number n -> const_float double_type n
+          | Ast.Variable name ->
+              (try Hashtbl.find named_values name with
+                | Not_found -> raise (Error "unknown variable name"))
+          | Ast.Unary (op, operand) ->
+              let operand = codegen_expr operand in
+              let callee = "unary" ^ (String.make 1 op) in
+              let callee =
+                match lookup_function callee the_module with
+                | Some callee -> callee
+                | None -> raise (Error "unknown unary operator")
+              in
+              build_call callee [|operand|] "unop" builder
+          | Ast.Binary (op, lhs, rhs) ->
+              let lhs_val = codegen_expr lhs in
+              let rhs_val = codegen_expr rhs in
+              begin
+                match op with
+                | '+' -> build_add lhs_val rhs_val "addtmp" builder
+                | '-' -> build_sub lhs_val rhs_val "subtmp" builder
+                | '*' -> build_mul lhs_val rhs_val "multmp" builder
+                | '<' ->
+                    (* Convert bool 0/1 to double 0.0 or 1.0 *)
+                    let i = build_fcmp Fcmp.Ult lhs_val rhs_val "cmptmp" builder in
+                    build_uitofp i double_type "booltmp" builder
+                | _ ->
+                    (* If it wasn't a builtin binary operator, it must be a user defined
+                     * one. Emit a call to it. *)
+                    let callee = "binary" ^ (String.make 1 op) in
+                    let callee =
+                      match lookup_function callee the_module with
+                      | Some callee -> callee
+                      | None -> raise (Error "binary operator not found!")
+                    in
+                    build_call callee [|lhs_val; rhs_val|] "binop" builder
+              end
+          | Ast.Call (callee, args) ->
+              (* Look up the name in the module table. *)
+              let callee =
+                match lookup_function callee the_module with
+                | Some callee -> callee
+                | None -> raise (Error "unknown function referenced")
+              in
+              let params = params callee in
+
+              (* If argument mismatch error. *)
+              if Array.length params == Array.length args then () else
+                raise (Error "incorrect # arguments passed");
+              let args = Array.map codegen_expr args in
+              build_call callee args "calltmp" builder
+          | Ast.If (cond, then_, else_) ->
+              let cond = codegen_expr cond in
+
+              (* Convert condition to a bool by comparing equal to 0.0 *)
+              let zero = const_float double_type 0.0 in
+              let cond_val = build_fcmp Fcmp.One cond zero "ifcond" builder in
+
+              (* Grab the first block so that we might later add the conditional branch
+               * to it at the end of the function. *)
+              let start_bb = insertion_block builder in
+              let the_function = block_parent start_bb in
+
+              let then_bb = append_block context "then" the_function in
+
+              (* Emit 'then' value. *)
+              position_at_end then_bb builder;
+              let then_val = codegen_expr then_ in
+
+              (* Codegen of 'then' can change the current block, update then_bb for the
+               * phi. We create a new name because one is used for the phi node, and the
+               * other is used for the conditional branch. *)
+              let new_then_bb = insertion_block builder in
+
+              (* Emit 'else' value. *)
+              let else_bb = append_block context "else" the_function in
+              position_at_end else_bb builder;
+              let else_val = codegen_expr else_ in
+
+              (* Codegen of 'else' can change the current block, update else_bb for the
+               * phi. *)
+              let new_else_bb = insertion_block builder in
+
+              (* Emit merge block. *)
+              let merge_bb = append_block context "ifcont" the_function in
+              position_at_end merge_bb builder;
+              let incoming = [(then_val, new_then_bb); (else_val, new_else_bb)] in
+              let phi = build_phi incoming "iftmp" builder in
+
+              (* Return to the start block to add the conditional branch. *)
+              position_at_end start_bb builder;
+              ignore (build_cond_br cond_val then_bb else_bb builder);
+
+              (* Set a unconditional branch at the end of the 'then' block and the
+               * 'else' block to the 'merge' block. *)
+              position_at_end new_then_bb builder; ignore (build_br merge_bb builder);
+              position_at_end new_else_bb builder; ignore (build_br merge_bb builder);
+
+              (* Finally, set the builder to the end of the merge block. *)
+              position_at_end merge_bb builder;
+
+              phi
+          | Ast.For (var_name, start, end_, step, body) ->
+              (* Emit the start code first, without 'variable' in scope. *)
+              let start_val = codegen_expr start in
+
+              (* Make the new basic block for the loop header, inserting after current
+               * block. *)
+              let preheader_bb = insertion_block builder in
+              let the_function = block_parent preheader_bb in
+              let loop_bb = append_block context "loop" the_function in
+
+              (* Insert an explicit fall through from the current block to the
+               * loop_bb. *)
+              ignore (build_br loop_bb builder);
+
+              (* Start insertion in loop_bb. *)
+              position_at_end loop_bb builder;
+
+              (* Start the PHI node with an entry for start. *)
+              let variable = build_phi [(start_val, preheader_bb)] var_name builder in
+
+              (* Within the loop, the variable is defined equal to the PHI node. If it
+               * shadows an existing variable, we have to restore it, so save it
+               * now. *)
+              let old_val =
+                try Some (Hashtbl.find named_values var_name) with Not_found -> None
+              in
+              Hashtbl.add named_values var_name variable;
+
+              (* Emit the body of the loop.  This, like any other expr, can change the
+               * current BB.  Note that we ignore the value computed by the body, but
+               * don't allow an error *)
+              ignore (codegen_expr body);
+
+              (* Emit the step value. *)
+              let step_val =
+                match step with
+                | Some step -> codegen_expr step
+                (* If not specified, use 1.0. *)
+                | None -> const_float double_type 1.0
+              in
+
+              let next_var = build_add variable step_val "nextvar" builder in
+
+              (* Compute the end condition. *)
+              let end_cond = codegen_expr end_ in
+
+              (* Convert condition to a bool by comparing equal to 0.0. *)
+              let zero = const_float double_type 0.0 in
+              let end_cond = build_fcmp Fcmp.One end_cond zero "loopcond" builder in
+
+              (* Create the "after loop" block and insert it. *)
+              let loop_end_bb = insertion_block builder in
+              let after_bb = append_block context "afterloop" the_function in
+
+              (* Insert the conditional branch into the end of loop_end_bb. *)
+              ignore (build_cond_br end_cond loop_bb after_bb builder);
+
+              (* Any new code will be inserted in after_bb. *)
+              position_at_end after_bb builder;
+
+              (* Add a new entry to the PHI node for the backedge. *)
+              add_incoming (next_var, loop_end_bb) variable;
+
+              (* Restore the unshadowed variable. *)
+              begin match old_val with
+              | Some old_val -> Hashtbl.add named_values var_name old_val
+              | None -> ()
+              end;
+
+              (* for expr always returns 0.0. *)
+              const_null double_type
+
+        let codegen_proto = function
+          | Ast.Prototype (name, args) | Ast.BinOpPrototype (name, args, _) ->
+              (* Make the function type: double(double,double) etc. *)
+              let doubles = Array.make (Array.length args) double_type in
+              let ft = function_type double_type doubles in
+              let f =
+                match lookup_function name the_module with
+                | None -> declare_function name ft the_module
+
+                (* If 'f' conflicted, there was already something named 'name'. If it
+                 * has a body, don't allow redefinition or reextern. *)
+                | Some f ->
+                    (* If 'f' already has a body, reject this. *)
+                    if block_begin f <> At_end f then
+                      raise (Error "redefinition of function");
+
+                    (* If 'f' took a different number of arguments, reject. *)
+                    if element_type (type_of f) <> ft then
+                      raise (Error "redefinition of function with different # args");
+                    f
+              in
+
+              (* Set names for all arguments. *)
+              Array.iteri (fun i a ->
+                let n = args.(i) in
+                set_value_name n a;
+                Hashtbl.add named_values n a;
+              ) (params f);
+              f
+
+        let codegen_func the_fpm = function
+          | Ast.Function (proto, body) ->
+              Hashtbl.clear named_values;
+              let the_function = codegen_proto proto in
+
+              (* If this is an operator, install it. *)
+              begin match proto with
+              | Ast.BinOpPrototype (name, args, prec) ->
+                  let op = name.[String.length name - 1] in
+                  Hashtbl.add Parser.binop_precedence op prec;
+              | _ -> ()
+              end;
+
+              (* Create a new basic block to start insertion into. *)
+              let bb = append_block context "entry" the_function in
+              position_at_end bb builder;
+
+              try
+                let ret_val = codegen_expr body in
+
+                (* Finish off the function. *)
+                let _ = build_ret ret_val builder in
+
+                (* Validate the generated code, checking for consistency. *)
+                Llvm_analysis.assert_valid_function the_function;
+
+                (* Optimize the function. *)
+                let _ = PassManager.run_function the_function the_fpm in
+
+                the_function
+              with e ->
+                delete_function the_function;
+                raise e
+
+toplevel.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Top-Level parsing and JIT Driver
+         *===----------------------------------------------------------------------===*)
+
+        open Llvm
+        open Llvm_executionengine
+
+        (* top ::= definition | external | expression | ';' *)
+        let rec main_loop the_fpm the_execution_engine stream =
+          match Stream.peek stream with
+          | None -> ()
+
+          (* ignore top-level semicolons. *)
+          | Some (Token.Kwd ';') ->
+              Stream.junk stream;
+              main_loop the_fpm the_execution_engine stream
+
+          | Some token ->
+              begin
+                try match token with
+                | Token.Def ->
+                    let e = Parser.parse_definition stream in
+                    print_endline "parsed a function definition.";
+                    dump_value (Codegen.codegen_func the_fpm e);
+                | Token.Extern ->
+                    let e = Parser.parse_extern stream in
+                    print_endline "parsed an extern.";
+                    dump_value (Codegen.codegen_proto e);
+                | _ ->
+                    (* Evaluate a top-level expression into an anonymous function. *)
+                    let e = Parser.parse_toplevel stream in
+                    print_endline "parsed a top-level expr";
+                    let the_function = Codegen.codegen_func the_fpm e in
+                    dump_value the_function;
+
+                    (* JIT the function, returning a function pointer. *)
+                    let result = ExecutionEngine.run_function the_function [||]
+                      the_execution_engine in
+
+                    print_string "Evaluated to ";
+                    print_float (GenericValue.as_float Codegen.double_type result);
+                    print_newline ();
+                with Stream.Error s | Codegen.Error s ->
+                  (* Skip token for error recovery. *)
+                  Stream.junk stream;
+                  print_endline s;
+              end;
+              print_string "ready> "; flush stdout;
+              main_loop the_fpm the_execution_engine stream
+
+toy.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Main driver code.
+         *===----------------------------------------------------------------------===*)
+
+        open Llvm
+        open Llvm_executionengine
+        open Llvm_target
+        open Llvm_scalar_opts
+
+        let main () =
+          ignore (initialize_native_target ());
+
+          (* Install standard binary operators.
+           * 1 is the lowest precedence. *)
+          Hashtbl.add Parser.binop_precedence '<' 10;
+          Hashtbl.add Parser.binop_precedence '+' 20;
+          Hashtbl.add Parser.binop_precedence '-' 20;
+          Hashtbl.add Parser.binop_precedence '*' 40;    (* highest. *)
+
+          (* Prime the first token. *)
+          print_string "ready> "; flush stdout;
+          let stream = Lexer.lex (Stream.of_channel stdin) in
+
+          (* Create the JIT. *)
+          let the_execution_engine = ExecutionEngine.create Codegen.the_module in
+          let the_fpm = PassManager.create_function Codegen.the_module in
+
+          (* Set up the optimizer pipeline.  Start with registering info about how the
+           * target lays out data structures. *)
+          DataLayout.add (ExecutionEngine.target_data the_execution_engine) the_fpm;
+
+          (* Do simple "peephole" optimizations and bit-twiddling optzn. *)
+          add_instruction_combination the_fpm;
+
+          (* reassociate expressions. *)
+          add_reassociation the_fpm;
+
+          (* Eliminate Common SubExpressions. *)
+          add_gvn the_fpm;
+
+          (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
+          add_cfg_simplification the_fpm;
+
+          ignore (PassManager.initialize the_fpm);
+
+          (* Run the main "interpreter loop" now. *)
+          Toplevel.main_loop the_fpm the_execution_engine stream;
+
+          (* Print out all the generated code. *)
+          dump_module Codegen.the_module
+        ;;
+
+        main ()
+
+bindings.c
+    .. code-block:: c
+
+        #include <stdio.h>
+
+        /* putchard - putchar that takes a double and returns 0. */
+        extern double putchard(double X) {
+          putchar((char)X);
+          return 0;
+        }
+
+        /* printd - printf that takes a double prints it as "%f\n", returning 0. */
+        extern double printd(double X) {
+          printf("%f\n", X);
+          return 0;
+        }
+
+`Next: Extending the language: mutable variables / SSA
+construction <OCamlLangImpl7.html>`_
+

Added: www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl7.txt
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl7.txt?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl7.txt (added)
+++ www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl7.txt Fri Feb 27 12:44:09 2015
@@ -0,0 +1,1723 @@
+=======================================================
+Kaleidoscope: Extending the Language: Mutable Variables
+=======================================================
+
+.. contents::
+   :local:
+
+Chapter 7 Introduction
+======================
+
+Welcome to Chapter 7 of the "`Implementing a language with
+LLVM <index.html>`_" tutorial. In chapters 1 through 6, we've built a
+very respectable, albeit simple, `functional programming
+language <http://en.wikipedia.org/wiki/Functional_programming>`_. In our
+journey, we learned some parsing techniques, how to build and represent
+an AST, how to build LLVM IR, and how to optimize the resultant code as
+well as JIT compile it.
+
+While Kaleidoscope is interesting as a functional language, the fact
+that it is functional makes it "too easy" to generate LLVM IR for it. In
+particular, a functional language makes it very easy to build LLVM IR
+directly in `SSA
+form <http://en.wikipedia.org/wiki/Static_single_assignment_form>`_.
+Since LLVM requires that the input code be in SSA form, this is a very
+nice property and it is often unclear to newcomers how to generate code
+for an imperative language with mutable variables.
+
+The short (and happy) summary of this chapter is that there is no need
+for your front-end to build SSA form: LLVM provides highly tuned and
+well tested support for this, though the way it works is a bit
+unexpected for some.
+
+Why is this a hard problem?
+===========================
+
+To understand why mutable variables cause complexities in SSA
+construction, consider this extremely simple C example:
+
+.. code-block:: c
+
+    int G, H;
+    int test(_Bool Condition) {
+      int X;
+      if (Condition)
+        X = G;
+      else
+        X = H;
+      return X;
+    }
+
+In this case, we have the variable "X", whose value depends on the path
+executed in the program. Because there are two different possible values
+for X before the return instruction, a PHI node is inserted to merge the
+two values. The LLVM IR that we want for this example looks like this:
+
+.. code-block:: llvm
+
+    @G = weak global i32 0   ; type of @G is i32*
+    @H = weak global i32 0   ; type of @H is i32*
+
+    define i32 @test(i1 %Condition) {
+    entry:
+      br i1 %Condition, label %cond_true, label %cond_false
+
+    cond_true:
+      %X.0 = load i32* @G
+      br label %cond_next
+
+    cond_false:
+      %X.1 = load i32* @H
+      br label %cond_next
+
+    cond_next:
+      %X.2 = phi i32 [ %X.1, %cond_false ], [ %X.0, %cond_true ]
+      ret i32 %X.2
+    }
+
+In this example, the loads from the G and H global variables are
+explicit in the LLVM IR, and they live in the then/else branches of the
+if statement (cond\_true/cond\_false). In order to merge the incoming
+values, the X.2 phi node in the cond\_next block selects the right value
+to use based on where control flow is coming from: if control flow comes
+from the cond\_false block, X.2 gets the value of X.1. Alternatively, if
+control flow comes from cond\_true, it gets the value of X.0. The intent
+of this chapter is not to explain the details of SSA form. For more
+information, see one of the many `online
+references <http://en.wikipedia.org/wiki/Static_single_assignment_form>`_.
+
+The question for this article is "who places the phi nodes when lowering
+assignments to mutable variables?". The issue here is that LLVM
+*requires* that its IR be in SSA form: there is no "non-ssa" mode for
+it. However, SSA construction requires non-trivial algorithms and data
+structures, so it is inconvenient and wasteful for every front-end to
+have to reproduce this logic.
+
+Memory in LLVM
+==============
+
+The 'trick' here is that while LLVM does require all register values to
+be in SSA form, it does not require (or permit) memory objects to be in
+SSA form. In the example above, note that the loads from G and H are
+direct accesses to G and H: they are not renamed or versioned. This
+differs from some other compiler systems, which do try to version memory
+objects. In LLVM, instead of encoding dataflow analysis of memory into
+the LLVM IR, it is handled with `Analysis
+Passes <../WritingAnLLVMPass.html>`_ which are computed on demand.
+
+With this in mind, the high-level idea is that we want to make a stack
+variable (which lives in memory, because it is on the stack) for each
+mutable object in a function. To take advantage of this trick, we need
+to talk about how LLVM represents stack variables.
+
+In LLVM, all memory accesses are explicit with load/store instructions,
+and it is carefully designed not to have (or need) an "address-of"
+operator. Notice how the type of the @G/@H global variables is actually
+"i32\*" even though the variable is defined as "i32". What this means is
+that @G defines *space* for an i32 in the global data area, but its
+*name* actually refers to the address for that space. Stack variables
+work the same way, except that instead of being declared with global
+variable definitions, they are declared with the `LLVM alloca
+instruction <../LangRef.html#i_alloca>`_:
+
+.. code-block:: llvm
+
+    define i32 @example() {
+    entry:
+      %X = alloca i32           ; type of %X is i32*.
+      ...
+      %tmp = load i32* %X       ; load the stack value %X from the stack.
+      %tmp2 = add i32 %tmp, 1   ; increment it
+      store i32 %tmp2, i32* %X  ; store it back
+      ...
+
+This code shows an example of how you can declare and manipulate a stack
+variable in the LLVM IR. Stack memory allocated with the alloca
+instruction is fully general: you can pass the address of the stack slot
+to functions, you can store it in other variables, etc. In our example
+above, we could rewrite the example to use the alloca technique to avoid
+using a PHI node:
+
+.. code-block:: llvm
+
+    @G = weak global i32 0   ; type of @G is i32*
+    @H = weak global i32 0   ; type of @H is i32*
+
+    define i32 @test(i1 %Condition) {
+    entry:
+      %X = alloca i32           ; type of %X is i32*.
+      br i1 %Condition, label %cond_true, label %cond_false
+
+    cond_true:
+      %X.0 = load i32* @G
+            store i32 %X.0, i32* %X   ; Update X
+      br label %cond_next
+
+    cond_false:
+      %X.1 = load i32* @H
+            store i32 %X.1, i32* %X   ; Update X
+      br label %cond_next
+
+    cond_next:
+      %X.2 = load i32* %X       ; Read X
+      ret i32 %X.2
+    }
+
+With this, we have discovered a way to handle arbitrary mutable
+variables without the need to create Phi nodes at all:
+
+#. Each mutable variable becomes a stack allocation.
+#. Each read of the variable becomes a load from the stack.
+#. Each update of the variable becomes a store to the stack.
+#. Taking the address of a variable just uses the stack address
+   directly.
+
+While this solution has solved our immediate problem, it introduced
+another one: we have now apparently introduced a lot of stack traffic
+for very simple and common operations, a major performance problem.
+Fortunately for us, the LLVM optimizer has a highly-tuned optimization
+pass named "mem2reg" that handles this case, promoting allocas like this
+into SSA registers, inserting Phi nodes as appropriate. If you run this
+example through the pass, for example, you'll get:
+
+.. code-block:: bash
+
+    $ llvm-as < example.ll | opt -mem2reg | llvm-dis
+    @G = weak global i32 0
+    @H = weak global i32 0
+
+    define i32 @test(i1 %Condition) {
+    entry:
+      br i1 %Condition, label %cond_true, label %cond_false
+
+    cond_true:
+      %X.0 = load i32* @G
+      br label %cond_next
+
+    cond_false:
+      %X.1 = load i32* @H
+      br label %cond_next
+
+    cond_next:
+      %X.01 = phi i32 [ %X.1, %cond_false ], [ %X.0, %cond_true ]
+      ret i32 %X.01
+    }
+
+The mem2reg pass implements the standard "iterated dominance frontier"
+algorithm for constructing SSA form and has a number of optimizations
+that speed up (very common) degenerate cases. The mem2reg optimization
+pass is the answer to dealing with mutable variables, and we highly
+recommend that you depend on it. Note that mem2reg only works on
+variables in certain circumstances:
+
+#. mem2reg is alloca-driven: it looks for allocas and if it can handle
+   them, it promotes them. It does not apply to global variables or heap
+   allocations.
+#. mem2reg only looks for alloca instructions in the entry block of the
+   function. Being in the entry block guarantees that the alloca is only
+   executed once, which makes analysis simpler.
+#. mem2reg only promotes allocas whose uses are direct loads and stores.
+   If the address of the stack object is passed to a function, or if any
+   funny pointer arithmetic is involved, the alloca will not be
+   promoted.
+#. mem2reg only works on allocas of `first
+   class <../LangRef.html#t_classifications>`_ values (such as pointers,
+   scalars and vectors), and only if the array size of the allocation is
+   1 (or missing in the .ll file). mem2reg is not capable of promoting
+   structs or arrays to registers. Note that the "scalarrepl" pass is
+   more powerful and can promote structs, "unions", and arrays in many
+   cases.
+
+All of these properties are easy to satisfy for most imperative
+languages, and we'll illustrate it below with Kaleidoscope. The final
+question you may be asking is: should I bother with this nonsense for my
+front-end? Wouldn't it be better if I just did SSA construction
+directly, avoiding use of the mem2reg optimization pass? In short, we
+strongly recommend that you use this technique for building SSA form,
+unless there is an extremely good reason not to. Using this technique
+is:
+
+-  Proven and well tested: clang uses this technique
+   for local mutable variables. As such, the most common clients of LLVM
+   are using this to handle a bulk of their variables. You can be sure
+   that bugs are found fast and fixed early.
+-  Extremely Fast: mem2reg has a number of special cases that make it
+   fast in common cases as well as fully general. For example, it has
+   fast-paths for variables that are only used in a single block,
+   variables that only have one assignment point, good heuristics to
+   avoid insertion of unneeded phi nodes, etc.
+-  Needed for debug info generation: `Debug information in
+   LLVM <../SourceLevelDebugging.html>`_ relies on having the address of
+   the variable exposed so that debug info can be attached to it. This
+   technique dovetails very naturally with this style of debug info.
+
+If nothing else, this makes it much easier to get your front-end up and
+running, and is very simple to implement. Lets extend Kaleidoscope with
+mutable variables now!
+
+Mutable Variables in Kaleidoscope
+=================================
+
+Now that we know the sort of problem we want to tackle, lets see what
+this looks like in the context of our little Kaleidoscope language.
+We're going to add two features:
+
+#. The ability to mutate variables with the '=' operator.
+#. The ability to define new variables.
+
+While the first item is really what this is about, we only have
+variables for incoming arguments as well as for induction variables, and
+redefining those only goes so far :). Also, the ability to define new
+variables is a useful thing regardless of whether you will be mutating
+them. Here's a motivating example that shows how we could use these:
+
+::
+
+    # Define ':' for sequencing: as a low-precedence operator that ignores operands
+    # and just returns the RHS.
+    def binary : 1 (x y) y;
+
+    # Recursive fib, we could do this before.
+    def fib(x)
+      if (x < 3) then
+        1
+      else
+        fib(x-1)+fib(x-2);
+
+    # Iterative fib.
+    def fibi(x)
+      var a = 1, b = 1, c in
+      (for i = 3, i < x in
+         c = a + b :
+         a = b :
+         b = c) :
+      b;
+
+    # Call it.
+    fibi(10);
+
+In order to mutate variables, we have to change our existing variables
+to use the "alloca trick". Once we have that, we'll add our new
+operator, then extend Kaleidoscope to support new variable definitions.
+
+Adjusting Existing Variables for Mutation
+=========================================
+
+The symbol table in Kaleidoscope is managed at code generation time by
+the '``named_values``' map. This map currently keeps track of the LLVM
+"Value\*" that holds the double value for the named variable. In order
+to support mutation, we need to change this slightly, so that it
+``named_values`` holds the *memory location* of the variable in
+question. Note that this change is a refactoring: it changes the
+structure of the code, but does not (by itself) change the behavior of
+the compiler. All of these changes are isolated in the Kaleidoscope code
+generator.
+
+At this point in Kaleidoscope's development, it only supports variables
+for two things: incoming arguments to functions and the induction
+variable of 'for' loops. For consistency, we'll allow mutation of these
+variables in addition to other user-defined variables. This means that
+these will both need memory locations.
+
+To start our transformation of Kaleidoscope, we'll change the
+``named_values`` map so that it maps to AllocaInst\* instead of Value\*.
+Once we do this, the C++ compiler will tell us what parts of the code we
+need to update:
+
+**Note:** the ocaml bindings currently model both ``Value*``'s and
+``AllocInst*``'s as ``Llvm.llvalue``'s, but this may change in the future
+to be more type safe.
+
+.. code-block:: ocaml
+
+    let named_values:(string, llvalue) Hashtbl.t = Hashtbl.create 10
+
+Also, since we will need to create these alloca's, we'll use a helper
+function that ensures that the allocas are created in the entry block of
+the function:
+
+.. code-block:: ocaml
+
+    (* Create an alloca instruction in the entry block of the function. This
+     * is used for mutable variables etc. *)
+    let create_entry_block_alloca the_function var_name =
+      let builder = builder_at (instr_begin (entry_block the_function)) in
+      build_alloca double_type var_name builder
+
+This funny looking code creates an ``Llvm.llbuilder`` object that is
+pointing at the first instruction of the entry block. It then creates an
+alloca with the expected name and returns it. Because all values in
+Kaleidoscope are doubles, there is no need to pass in a type to use.
+
+With this in place, the first functionality change we want to make is to
+variable references. In our new scheme, variables live on the stack, so
+code generating a reference to them actually needs to produce a load
+from the stack slot:
+
+.. code-block:: ocaml
+
+    let rec codegen_expr = function
+      ...
+      | Ast.Variable name ->
+          let v = try Hashtbl.find named_values name with
+            | Not_found -> raise (Error "unknown variable name")
+          in
+          (* Load the value. *)
+          build_load v name builder
+
+As you can see, this is pretty straightforward. Now we need to update
+the things that define the variables to set up the alloca. We'll start
+with ``codegen_expr Ast.For ...`` (see the `full code listing <#code>`_
+for the unabridged code):
+
+.. code-block:: ocaml
+
+      | Ast.For (var_name, start, end_, step, body) ->
+          let the_function = block_parent (insertion_block builder) in
+
+          (* Create an alloca for the variable in the entry block. *)
+          let alloca = create_entry_block_alloca the_function var_name in
+
+          (* Emit the start code first, without 'variable' in scope. *)
+          let start_val = codegen_expr start in
+
+          (* Store the value into the alloca. *)
+          ignore(build_store start_val alloca builder);
+
+          ...
+
+          (* Within the loop, the variable is defined equal to the PHI node. If it
+           * shadows an existing variable, we have to restore it, so save it
+           * now. *)
+          let old_val =
+            try Some (Hashtbl.find named_values var_name) with Not_found -> None
+          in
+          Hashtbl.add named_values var_name alloca;
+
+          ...
+
+          (* Compute the end condition. *)
+          let end_cond = codegen_expr end_ in
+
+          (* Reload, increment, and restore the alloca. This handles the case where
+           * the body of the loop mutates the variable. *)
+          let cur_var = build_load alloca var_name builder in
+          let next_var = build_add cur_var step_val "nextvar" builder in
+          ignore(build_store next_var alloca builder);
+          ...
+
+This code is virtually identical to the code `before we allowed mutable
+variables <OCamlLangImpl5.html#forcodegen>`_. The big difference is that
+we no longer have to construct a PHI node, and we use load/store to
+access the variable as needed.
+
+To support mutable argument variables, we need to also make allocas for
+them. The code for this is also pretty simple:
+
+.. code-block:: ocaml
+
+    (* Create an alloca for each argument and register the argument in the symbol
+     * table so that references to it will succeed. *)
+    let create_argument_allocas the_function proto =
+      let args = match proto with
+        | Ast.Prototype (_, args) | Ast.BinOpPrototype (_, args, _) -> args
+      in
+      Array.iteri (fun i ai ->
+        let var_name = args.(i) in
+        (* Create an alloca for this variable. *)
+        let alloca = create_entry_block_alloca the_function var_name in
+
+        (* Store the initial value into the alloca. *)
+        ignore(build_store ai alloca builder);
+
+        (* Add arguments to variable symbol table. *)
+        Hashtbl.add named_values var_name alloca;
+      ) (params the_function)
+
+For each argument, we make an alloca, store the input value to the
+function into the alloca, and register the alloca as the memory location
+for the argument. This method gets invoked by ``Codegen.codegen_func``
+right after it sets up the entry block for the function.
+
+The final missing piece is adding the mem2reg pass, which allows us to
+get good codegen once again:
+
+.. code-block:: ocaml
+
+    let main () =
+      ...
+      let the_fpm = PassManager.create_function Codegen.the_module in
+
+      (* Set up the optimizer pipeline.  Start with registering info about how the
+       * target lays out data structures. *)
+      DataLayout.add (ExecutionEngine.target_data the_execution_engine) the_fpm;
+
+      (* Promote allocas to registers. *)
+      add_memory_to_register_promotion the_fpm;
+
+      (* Do simple "peephole" optimizations and bit-twiddling optzn. *)
+      add_instruction_combining the_fpm;
+
+      (* reassociate expressions. *)
+      add_reassociation the_fpm;
+
+It is interesting to see what the code looks like before and after the
+mem2reg optimization runs. For example, this is the before/after code
+for our recursive fib function. Before the optimization:
+
+.. code-block:: llvm
+
+    define double @fib(double %x) {
+    entry:
+      %x1 = alloca double
+      store double %x, double* %x1
+      %x2 = load double* %x1
+      %cmptmp = fcmp ult double %x2, 3.000000e+00
+      %booltmp = uitofp i1 %cmptmp to double
+      %ifcond = fcmp one double %booltmp, 0.000000e+00
+      br i1 %ifcond, label %then, label %else
+
+    then:    ; preds = %entry
+      br label %ifcont
+
+    else:    ; preds = %entry
+      %x3 = load double* %x1
+      %subtmp = fsub double %x3, 1.000000e+00
+      %calltmp = call double @fib(double %subtmp)
+      %x4 = load double* %x1
+      %subtmp5 = fsub double %x4, 2.000000e+00
+      %calltmp6 = call double @fib(double %subtmp5)
+      %addtmp = fadd double %calltmp, %calltmp6
+      br label %ifcont
+
+    ifcont:    ; preds = %else, %then
+      %iftmp = phi double [ 1.000000e+00, %then ], [ %addtmp, %else ]
+      ret double %iftmp
+    }
+
+Here there is only one variable (x, the input argument) but you can
+still see the extremely simple-minded code generation strategy we are
+using. In the entry block, an alloca is created, and the initial input
+value is stored into it. Each reference to the variable does a reload
+from the stack. Also, note that we didn't modify the if/then/else
+expression, so it still inserts a PHI node. While we could make an
+alloca for it, it is actually easier to create a PHI node for it, so we
+still just make the PHI.
+
+Here is the code after the mem2reg pass runs:
+
+.. code-block:: llvm
+
+    define double @fib(double %x) {
+    entry:
+      %cmptmp = fcmp ult double %x, 3.000000e+00
+      %booltmp = uitofp i1 %cmptmp to double
+      %ifcond = fcmp one double %booltmp, 0.000000e+00
+      br i1 %ifcond, label %then, label %else
+
+    then:
+      br label %ifcont
+
+    else:
+      %subtmp = fsub double %x, 1.000000e+00
+      %calltmp = call double @fib(double %subtmp)
+      %subtmp5 = fsub double %x, 2.000000e+00
+      %calltmp6 = call double @fib(double %subtmp5)
+      %addtmp = fadd double %calltmp, %calltmp6
+      br label %ifcont
+
+    ifcont:    ; preds = %else, %then
+      %iftmp = phi double [ 1.000000e+00, %then ], [ %addtmp, %else ]
+      ret double %iftmp
+    }
+
+This is a trivial case for mem2reg, since there are no redefinitions of
+the variable. The point of showing this is to calm your tension about
+inserting such blatent inefficiencies :).
+
+After the rest of the optimizers run, we get:
+
+.. code-block:: llvm
+
+    define double @fib(double %x) {
+    entry:
+      %cmptmp = fcmp ult double %x, 3.000000e+00
+      %booltmp = uitofp i1 %cmptmp to double
+      %ifcond = fcmp ueq double %booltmp, 0.000000e+00
+      br i1 %ifcond, label %else, label %ifcont
+
+    else:
+      %subtmp = fsub double %x, 1.000000e+00
+      %calltmp = call double @fib(double %subtmp)
+      %subtmp5 = fsub double %x, 2.000000e+00
+      %calltmp6 = call double @fib(double %subtmp5)
+      %addtmp = fadd double %calltmp, %calltmp6
+      ret double %addtmp
+
+    ifcont:
+      ret double 1.000000e+00
+    }
+
+Here we see that the simplifycfg pass decided to clone the return
+instruction into the end of the 'else' block. This allowed it to
+eliminate some branches and the PHI node.
+
+Now that all symbol table references are updated to use stack variables,
+we'll add the assignment operator.
+
+New Assignment Operator
+=======================
+
+With our current framework, adding a new assignment operator is really
+simple. We will parse it just like any other binary operator, but handle
+it internally (instead of allowing the user to define it). The first
+step is to set a precedence:
+
+.. code-block:: ocaml
+
+    let main () =
+      (* Install standard binary operators.
+       * 1 is the lowest precedence. *)
+      Hashtbl.add Parser.binop_precedence '=' 2;
+      Hashtbl.add Parser.binop_precedence '<' 10;
+      Hashtbl.add Parser.binop_precedence '+' 20;
+      Hashtbl.add Parser.binop_precedence '-' 20;
+      ...
+
+Now that the parser knows the precedence of the binary operator, it
+takes care of all the parsing and AST generation. We just need to
+implement codegen for the assignment operator. This looks like:
+
+.. code-block:: ocaml
+
+    let rec codegen_expr = function
+          begin match op with
+          | '=' ->
+              (* Special case '=' because we don't want to emit the LHS as an
+               * expression. *)
+              let name =
+                match lhs with
+                | Ast.Variable name -> name
+                | _ -> raise (Error "destination of '=' must be a variable")
+              in
+
+Unlike the rest of the binary operators, our assignment operator doesn't
+follow the "emit LHS, emit RHS, do computation" model. As such, it is
+handled as a special case before the other binary operators are handled.
+The other strange thing is that it requires the LHS to be a variable. It
+is invalid to have "(x+1) = expr" - only things like "x = expr" are
+allowed.
+
+.. code-block:: ocaml
+
+              (* Codegen the rhs. *)
+              let val_ = codegen_expr rhs in
+
+              (* Lookup the name. *)
+              let variable = try Hashtbl.find named_values name with
+              | Not_found -> raise (Error "unknown variable name")
+              in
+              ignore(build_store val_ variable builder);
+              val_
+          | _ ->
+                ...
+
+Once we have the variable, codegen'ing the assignment is
+straightforward: we emit the RHS of the assignment, create a store, and
+return the computed value. Returning a value allows for chained
+assignments like "X = (Y = Z)".
+
+Now that we have an assignment operator, we can mutate loop variables
+and arguments. For example, we can now run code like this:
+
+::
+
+    # Function to print a double.
+    extern printd(x);
+
+    # Define ':' for sequencing: as a low-precedence operator that ignores operands
+    # and just returns the RHS.
+    def binary : 1 (x y) y;
+
+    def test(x)
+      printd(x) :
+      x = 4 :
+      printd(x);
+
+    test(123);
+
+When run, this example prints "123" and then "4", showing that we did
+actually mutate the value! Okay, we have now officially implemented our
+goal: getting this to work requires SSA construction in the general
+case. However, to be really useful, we want the ability to define our
+own local variables, lets add this next!
+
+User-defined Local Variables
+============================
+
+Adding var/in is just like any other other extensions we made to
+Kaleidoscope: we extend the lexer, the parser, the AST and the code
+generator. The first step for adding our new 'var/in' construct is to
+extend the lexer. As before, this is pretty trivial, the code looks like
+this:
+
+.. code-block:: ocaml
+
+    type token =
+      ...
+      (* var definition *)
+      | Var
+
+    ...
+
+    and lex_ident buffer = parser
+          ...
+          | "in" -> [< 'Token.In; stream >]
+          | "binary" -> [< 'Token.Binary; stream >]
+          | "unary" -> [< 'Token.Unary; stream >]
+          | "var" -> [< 'Token.Var; stream >]
+          ...
+
+The next step is to define the AST node that we will construct. For
+var/in, it looks like this:
+
+.. code-block:: ocaml
+
+    type expr =
+      ...
+      (* variant for var/in. *)
+      | Var of (string * expr option) array * expr
+      ...
+
+var/in allows a list of names to be defined all at once, and each name
+can optionally have an initializer value. As such, we capture this
+information in the VarNames vector. Also, var/in has a body, this body
+is allowed to access the variables defined by the var/in.
+
+With this in place, we can define the parser pieces. The first thing we
+do is add it as a primary expression:
+
+.. code-block:: ocaml
+
+    (* primary
+     *   ::= identifier
+     *   ::= numberexpr
+     *   ::= parenexpr
+     *   ::= ifexpr
+     *   ::= forexpr
+     *   ::= varexpr *)
+    let rec parse_primary = parser
+      ...
+      (* varexpr
+       *   ::= 'var' identifier ('=' expression?
+       *             (',' identifier ('=' expression)?)* 'in' expression *)
+      | [< 'Token.Var;
+           (* At least one variable name is required. *)
+           'Token.Ident id ?? "expected identifier after var";
+           init=parse_var_init;
+           var_names=parse_var_names [(id, init)];
+           (* At this point, we have to have 'in'. *)
+           'Token.In ?? "expected 'in' keyword after 'var'";
+           body=parse_expr >] ->
+          Ast.Var (Array.of_list (List.rev var_names), body)
+
+    ...
+
+    and parse_var_init = parser
+      (* read in the optional initializer. *)
+      | [< 'Token.Kwd '='; e=parse_expr >] -> Some e
+      | [< >] -> None
+
+    and parse_var_names accumulator = parser
+      | [< 'Token.Kwd ',';
+           'Token.Ident id ?? "expected identifier list after var";
+           init=parse_var_init;
+           e=parse_var_names ((id, init) :: accumulator) >] -> e
+      | [< >] -> accumulator
+
+Now that we can parse and represent the code, we need to support
+emission of LLVM IR for it. This code starts out with:
+
+.. code-block:: ocaml
+
+    let rec codegen_expr = function
+      ...
+      | Ast.Var (var_names, body)
+          let old_bindings = ref [] in
+
+          let the_function = block_parent (insertion_block builder) in
+
+          (* Register all variables and emit their initializer. *)
+          Array.iter (fun (var_name, init) ->
+
+Basically it loops over all the variables, installing them one at a
+time. For each variable we put into the symbol table, we remember the
+previous value that we replace in OldBindings.
+
+.. code-block:: ocaml
+
+            (* Emit the initializer before adding the variable to scope, this
+             * prevents the initializer from referencing the variable itself, and
+             * permits stuff like this:
+             *   var a = 1 in
+             *     var a = a in ...   # refers to outer 'a'. *)
+            let init_val =
+              match init with
+              | Some init -> codegen_expr init
+              (* If not specified, use 0.0. *)
+              | None -> const_float double_type 0.0
+            in
+
+            let alloca = create_entry_block_alloca the_function var_name in
+            ignore(build_store init_val alloca builder);
+
+            (* Remember the old variable binding so that we can restore the binding
+             * when we unrecurse. *)
+
+            begin
+              try
+                let old_value = Hashtbl.find named_values var_name in
+                old_bindings := (var_name, old_value) :: !old_bindings;
+              with Not_found > ()
+            end;
+
+            (* Remember this binding. *)
+            Hashtbl.add named_values var_name alloca;
+          ) var_names;
+
+There are more comments here than code. The basic idea is that we emit
+the initializer, create the alloca, then update the symbol table to
+point to it. Once all the variables are installed in the symbol table,
+we evaluate the body of the var/in expression:
+
+.. code-block:: ocaml
+
+          (* Codegen the body, now that all vars are in scope. *)
+          let body_val = codegen_expr body in
+
+Finally, before returning, we restore the previous variable bindings:
+
+.. code-block:: ocaml
+
+          (* Pop all our variables from scope. *)
+          List.iter (fun (var_name, old_value) ->
+            Hashtbl.add named_values var_name old_value
+          ) !old_bindings;
+
+          (* Return the body computation. *)
+          body_val
+
+The end result of all of this is that we get properly scoped variable
+definitions, and we even (trivially) allow mutation of them :).
+
+With this, we completed what we set out to do. Our nice iterative fib
+example from the intro compiles and runs just fine. The mem2reg pass
+optimizes all of our stack variables into SSA registers, inserting PHI
+nodes where needed, and our front-end remains simple: no "iterated
+dominance frontier" computation anywhere in sight.
+
+Full Code Listing
+=================
+
+Here is the complete code listing for our running example, enhanced with
+mutable variables and var/in support. To build this example, use:
+
+.. code-block:: bash
+
+    # Compile
+    ocamlbuild toy.byte
+    # Run
+    ./toy.byte
+
+Here is the code:
+
+\_tags:
+    ::
+
+        <{lexer,parser}.ml>: use_camlp4, pp(camlp4of)
+        <*.{byte,native}>: g++, use_llvm, use_llvm_analysis
+        <*.{byte,native}>: use_llvm_executionengine, use_llvm_target
+        <*.{byte,native}>: use_llvm_scalar_opts, use_bindings
+
+myocamlbuild.ml:
+    .. code-block:: ocaml
+
+        open Ocamlbuild_plugin;;
+
+        ocaml_lib ~extern:true "llvm";;
+        ocaml_lib ~extern:true "llvm_analysis";;
+        ocaml_lib ~extern:true "llvm_executionengine";;
+        ocaml_lib ~extern:true "llvm_target";;
+        ocaml_lib ~extern:true "llvm_scalar_opts";;
+
+        flag ["link"; "ocaml"; "g++"] (S[A"-cc"; A"g++"; A"-cclib"; A"-rdynamic"]);;
+        dep ["link"; "ocaml"; "use_bindings"] ["bindings.o"];;
+
+token.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Lexer Tokens
+         *===----------------------------------------------------------------------===*)
+
+        (* The lexer returns these 'Kwd' if it is an unknown character, otherwise one of
+         * these others for known things. *)
+        type token =
+          (* commands *)
+          | Def | Extern
+
+          (* primary *)
+          | Ident of string | Number of float
+
+          (* unknown *)
+          | Kwd of char
+
+          (* control *)
+          | If | Then | Else
+          | For | In
+
+          (* operators *)
+          | Binary | Unary
+
+          (* var definition *)
+          | Var
+
+lexer.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Lexer
+         *===----------------------------------------------------------------------===*)
+
+        let rec lex = parser
+          (* Skip any whitespace. *)
+          | [< ' (' ' | '\n' | '\r' | '\t'); stream >] -> lex stream
+
+          (* identifier: [a-zA-Z][a-zA-Z0-9] *)
+          | [< ' ('A' .. 'Z' | 'a' .. 'z' as c); stream >] ->
+              let buffer = Buffer.create 1 in
+              Buffer.add_char buffer c;
+              lex_ident buffer stream
+
+          (* number: [0-9.]+ *)
+          | [< ' ('0' .. '9' as c); stream >] ->
+              let buffer = Buffer.create 1 in
+              Buffer.add_char buffer c;
+              lex_number buffer stream
+
+          (* Comment until end of line. *)
+          | [< ' ('#'); stream >] ->
+              lex_comment stream
+
+          (* Otherwise, just return the character as its ascii value. *)
+          | [< 'c; stream >] ->
+              [< 'Token.Kwd c; lex stream >]
+
+          (* end of stream. *)
+          | [< >] -> [< >]
+
+        and lex_number buffer = parser
+          | [< ' ('0' .. '9' | '.' as c); stream >] ->
+              Buffer.add_char buffer c;
+              lex_number buffer stream
+          | [< stream=lex >] ->
+              [< 'Token.Number (float_of_string (Buffer.contents buffer)); stream >]
+
+        and lex_ident buffer = parser
+          | [< ' ('A' .. 'Z' | 'a' .. 'z' | '0' .. '9' as c); stream >] ->
+              Buffer.add_char buffer c;
+              lex_ident buffer stream
+          | [< stream=lex >] ->
+              match Buffer.contents buffer with
+              | "def" -> [< 'Token.Def; stream >]
+              | "extern" -> [< 'Token.Extern; stream >]
+              | "if" -> [< 'Token.If; stream >]
+              | "then" -> [< 'Token.Then; stream >]
+              | "else" -> [< 'Token.Else; stream >]
+              | "for" -> [< 'Token.For; stream >]
+              | "in" -> [< 'Token.In; stream >]
+              | "binary" -> [< 'Token.Binary; stream >]
+              | "unary" -> [< 'Token.Unary; stream >]
+              | "var" -> [< 'Token.Var; stream >]
+              | id -> [< 'Token.Ident id; stream >]
+
+        and lex_comment = parser
+          | [< ' ('\n'); stream=lex >] -> stream
+          | [< 'c; e=lex_comment >] -> e
+          | [< >] -> [< >]
+
+ast.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Abstract Syntax Tree (aka Parse Tree)
+         *===----------------------------------------------------------------------===*)
+
+        (* expr - Base type for all expression nodes. *)
+        type expr =
+          (* variant for numeric literals like "1.0". *)
+          | Number of float
+
+          (* variant for referencing a variable, like "a". *)
+          | Variable of string
+
+          (* variant for a unary operator. *)
+          | Unary of char * expr
+
+          (* variant for a binary operator. *)
+          | Binary of char * expr * expr
+
+          (* variant for function calls. *)
+          | Call of string * expr array
+
+          (* variant for if/then/else. *)
+          | If of expr * expr * expr
+
+          (* variant for for/in. *)
+          | For of string * expr * expr * expr option * expr
+
+          (* variant for var/in. *)
+          | Var of (string * expr option) array * expr
+
+        (* proto - This type represents the "prototype" for a function, which captures
+         * its name, and its argument names (thus implicitly the number of arguments the
+         * function takes). *)
+        type proto =
+          | Prototype of string * string array
+          | BinOpPrototype of string * string array * int
+
+        (* func - This type represents a function definition itself. *)
+        type func = Function of proto * expr
+
+parser.ml:
+    .. code-block:: ocaml
+
+        (*===---------------------------------------------------------------------===
+         * Parser
+         *===---------------------------------------------------------------------===*)
+
+        (* binop_precedence - This holds the precedence for each binary operator that is
+         * defined *)
+        let binop_precedence:(char, int) Hashtbl.t = Hashtbl.create 10
+
+        (* precedence - Get the precedence of the pending binary operator token. *)
+        let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1
+
+        (* primary
+         *   ::= identifier
+         *   ::= numberexpr
+         *   ::= parenexpr
+         *   ::= ifexpr
+         *   ::= forexpr
+         *   ::= varexpr *)
+        let rec parse_primary = parser
+          (* numberexpr ::= number *)
+          | [< 'Token.Number n >] -> Ast.Number n
+
+          (* parenexpr ::= '(' expression ')' *)
+          | [< 'Token.Kwd '('; e=parse_expr; 'Token.Kwd ')' ?? "expected ')'" >] -> e
+
+          (* identifierexpr
+           *   ::= identifier
+           *   ::= identifier '(' argumentexpr ')' *)
+          | [< 'Token.Ident id; stream >] ->
+              let rec parse_args accumulator = parser
+                | [< e=parse_expr; stream >] ->
+                    begin parser
+                      | [< 'Token.Kwd ','; e=parse_args (e :: accumulator) >] -> e
+                      | [< >] -> e :: accumulator
+                    end stream
+                | [< >] -> accumulator
+              in
+              let rec parse_ident id = parser
+                (* Call. *)
+                | [< 'Token.Kwd '(';
+                     args=parse_args [];
+                     'Token.Kwd ')' ?? "expected ')'">] ->
+                    Ast.Call (id, Array.of_list (List.rev args))
+
+                (* Simple variable ref. *)
+                | [< >] -> Ast.Variable id
+              in
+              parse_ident id stream
+
+          (* ifexpr ::= 'if' expr 'then' expr 'else' expr *)
+          | [< 'Token.If; c=parse_expr;
+               'Token.Then ?? "expected 'then'"; t=parse_expr;
+               'Token.Else ?? "expected 'else'"; e=parse_expr >] ->
+              Ast.If (c, t, e)
+
+          (* forexpr
+                ::= 'for' identifier '=' expr ',' expr (',' expr)? 'in' expression *)
+          | [< 'Token.For;
+               'Token.Ident id ?? "expected identifier after for";
+               'Token.Kwd '=' ?? "expected '=' after for";
+               stream >] ->
+              begin parser
+                | [<
+                     start=parse_expr;
+                     'Token.Kwd ',' ?? "expected ',' after for";
+                     end_=parse_expr;
+                     stream >] ->
+                    let step =
+                      begin parser
+                      | [< 'Token.Kwd ','; step=parse_expr >] -> Some step
+                      | [< >] -> None
+                      end stream
+                    in
+                    begin parser
+                    | [< 'Token.In; body=parse_expr >] ->
+                        Ast.For (id, start, end_, step, body)
+                    | [< >] ->
+                        raise (Stream.Error "expected 'in' after for")
+                    end stream
+                | [< >] ->
+                    raise (Stream.Error "expected '=' after for")
+              end stream
+
+          (* varexpr
+           *   ::= 'var' identifier ('=' expression?
+           *             (',' identifier ('=' expression)?)* 'in' expression *)
+          | [< 'Token.Var;
+               (* At least one variable name is required. *)
+               'Token.Ident id ?? "expected identifier after var";
+               init=parse_var_init;
+               var_names=parse_var_names [(id, init)];
+               (* At this point, we have to have 'in'. *)
+               'Token.In ?? "expected 'in' keyword after 'var'";
+               body=parse_expr >] ->
+              Ast.Var (Array.of_list (List.rev var_names), body)
+
+          | [< >] -> raise (Stream.Error "unknown token when expecting an expression.")
+
+        (* unary
+         *   ::= primary
+         *   ::= '!' unary *)
+        and parse_unary = parser
+          (* If this is a unary operator, read it. *)
+          | [< 'Token.Kwd op when op != '(' && op != ')'; operand=parse_expr >] ->
+              Ast.Unary (op, operand)
+
+          (* If the current token is not an operator, it must be a primary expr. *)
+          | [< stream >] -> parse_primary stream
+
+        (* binoprhs
+         *   ::= ('+' primary)* *)
+        and parse_bin_rhs expr_prec lhs stream =
+          match Stream.peek stream with
+          (* If this is a binop, find its precedence. *)
+          | Some (Token.Kwd c) when Hashtbl.mem binop_precedence c ->
+              let token_prec = precedence c in
+
+              (* If this is a binop that binds at least as tightly as the current binop,
+               * consume it, otherwise we are done. *)
+              if token_prec < expr_prec then lhs else begin
+                (* Eat the binop. *)
+                Stream.junk stream;
+
+                (* Parse the primary expression after the binary operator. *)
+                let rhs = parse_unary stream in
+
+                (* Okay, we know this is a binop. *)
+                let rhs =
+                  match Stream.peek stream with
+                  | Some (Token.Kwd c2) ->
+                      (* If BinOp binds less tightly with rhs than the operator after
+                       * rhs, let the pending operator take rhs as its lhs. *)
+                      let next_prec = precedence c2 in
+                      if token_prec < next_prec
+                      then parse_bin_rhs (token_prec + 1) rhs stream
+                      else rhs
+                  | _ -> rhs
+                in
+
+                (* Merge lhs/rhs. *)
+                let lhs = Ast.Binary (c, lhs, rhs) in
+                parse_bin_rhs expr_prec lhs stream
+              end
+          | _ -> lhs
+
+        and parse_var_init = parser
+          (* read in the optional initializer. *)
+          | [< 'Token.Kwd '='; e=parse_expr >] -> Some e
+          | [< >] -> None
+
+        and parse_var_names accumulator = parser
+          | [< 'Token.Kwd ',';
+               'Token.Ident id ?? "expected identifier list after var";
+               init=parse_var_init;
+               e=parse_var_names ((id, init) :: accumulator) >] -> e
+          | [< >] -> accumulator
+
+        (* expression
+         *   ::= primary binoprhs *)
+        and parse_expr = parser
+          | [< lhs=parse_unary; stream >] -> parse_bin_rhs 0 lhs stream
+
+        (* prototype
+         *   ::= id '(' id* ')'
+         *   ::= binary LETTER number? (id, id)
+         *   ::= unary LETTER number? (id) *)
+        let parse_prototype =
+          let rec parse_args accumulator = parser
+            | [< 'Token.Ident id; e=parse_args (id::accumulator) >] -> e
+            | [< >] -> accumulator
+          in
+          let parse_operator = parser
+            | [< 'Token.Unary >] -> "unary", 1
+            | [< 'Token.Binary >] -> "binary", 2
+          in
+          let parse_binary_precedence = parser
+            | [< 'Token.Number n >] -> int_of_float n
+            | [< >] -> 30
+          in
+          parser
+          | [< 'Token.Ident id;
+               'Token.Kwd '(' ?? "expected '(' in prototype";
+               args=parse_args [];
+               'Token.Kwd ')' ?? "expected ')' in prototype" >] ->
+              (* success. *)
+              Ast.Prototype (id, Array.of_list (List.rev args))
+          | [< (prefix, kind)=parse_operator;
+               'Token.Kwd op ?? "expected an operator";
+               (* Read the precedence if present. *)
+               binary_precedence=parse_binary_precedence;
+               'Token.Kwd '(' ?? "expected '(' in prototype";
+                args=parse_args [];
+               'Token.Kwd ')' ?? "expected ')' in prototype" >] ->
+              let name = prefix ^ (String.make 1 op) in
+              let args = Array.of_list (List.rev args) in
+
+              (* Verify right number of arguments for operator. *)
+              if Array.length args != kind
+              then raise (Stream.Error "invalid number of operands for operator")
+              else
+                if kind == 1 then
+                  Ast.Prototype (name, args)
+                else
+                  Ast.BinOpPrototype (name, args, binary_precedence)
+          | [< >] ->
+              raise (Stream.Error "expected function name in prototype")
+
+        (* definition ::= 'def' prototype expression *)
+        let parse_definition = parser
+          | [< 'Token.Def; p=parse_prototype; e=parse_expr >] ->
+              Ast.Function (p, e)
+
+        (* toplevelexpr ::= expression *)
+        let parse_toplevel = parser
+          | [< e=parse_expr >] ->
+              (* Make an anonymous proto. *)
+              Ast.Function (Ast.Prototype ("", [||]), e)
+
+        (*  external ::= 'extern' prototype *)
+        let parse_extern = parser
+          | [< 'Token.Extern; e=parse_prototype >] -> e
+
+codegen.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Code Generation
+         *===----------------------------------------------------------------------===*)
+
+        open Llvm
+
+        exception Error of string
+
+        let context = global_context ()
+        let the_module = create_module context "my cool jit"
+        let builder = builder context
+        let named_values:(string, llvalue) Hashtbl.t = Hashtbl.create 10
+        let double_type = double_type context
+
+        (* Create an alloca instruction in the entry block of the function. This
+         * is used for mutable variables etc. *)
+        let create_entry_block_alloca the_function var_name =
+          let builder = builder_at context (instr_begin (entry_block the_function)) in
+          build_alloca double_type var_name builder
+
+        let rec codegen_expr = function
+          | Ast.Number n -> const_float double_type n
+          | Ast.Variable name ->
+              let v = try Hashtbl.find named_values name with
+                | Not_found -> raise (Error "unknown variable name")
+              in
+              (* Load the value. *)
+              build_load v name builder
+          | Ast.Unary (op, operand) ->
+              let operand = codegen_expr operand in
+              let callee = "unary" ^ (String.make 1 op) in
+              let callee =
+                match lookup_function callee the_module with
+                | Some callee -> callee
+                | None -> raise (Error "unknown unary operator")
+              in
+              build_call callee [|operand|] "unop" builder
+          | Ast.Binary (op, lhs, rhs) ->
+              begin match op with
+              | '=' ->
+                  (* Special case '=' because we don't want to emit the LHS as an
+                   * expression. *)
+                  let name =
+                    match lhs with
+                    | Ast.Variable name -> name
+                    | _ -> raise (Error "destination of '=' must be a variable")
+                  in
+
+                  (* Codegen the rhs. *)
+                  let val_ = codegen_expr rhs in
+
+                  (* Lookup the name. *)
+                  let variable = try Hashtbl.find named_values name with
+                  | Not_found -> raise (Error "unknown variable name")
+                  in
+                  ignore(build_store val_ variable builder);
+                  val_
+              | _ ->
+                  let lhs_val = codegen_expr lhs in
+                  let rhs_val = codegen_expr rhs in
+                  begin
+                    match op with
+                    | '+' -> build_add lhs_val rhs_val "addtmp" builder
+                    | '-' -> build_sub lhs_val rhs_val "subtmp" builder
+                    | '*' -> build_mul lhs_val rhs_val "multmp" builder
+                    | '<' ->
+                        (* Convert bool 0/1 to double 0.0 or 1.0 *)
+                        let i = build_fcmp Fcmp.Ult lhs_val rhs_val "cmptmp" builder in
+                        build_uitofp i double_type "booltmp" builder
+                    | _ ->
+                        (* If it wasn't a builtin binary operator, it must be a user defined
+                         * one. Emit a call to it. *)
+                        let callee = "binary" ^ (String.make 1 op) in
+                        let callee =
+                          match lookup_function callee the_module with
+                          | Some callee -> callee
+                          | None -> raise (Error "binary operator not found!")
+                        in
+                        build_call callee [|lhs_val; rhs_val|] "binop" builder
+                  end
+              end
+          | Ast.Call (callee, args) ->
+              (* Look up the name in the module table. *)
+              let callee =
+                match lookup_function callee the_module with
+                | Some callee -> callee
+                | None -> raise (Error "unknown function referenced")
+              in
+              let params = params callee in
+
+              (* If argument mismatch error. *)
+              if Array.length params == Array.length args then () else
+                raise (Error "incorrect # arguments passed");
+              let args = Array.map codegen_expr args in
+              build_call callee args "calltmp" builder
+          | Ast.If (cond, then_, else_) ->
+              let cond = codegen_expr cond in
+
+              (* Convert condition to a bool by comparing equal to 0.0 *)
+              let zero = const_float double_type 0.0 in
+              let cond_val = build_fcmp Fcmp.One cond zero "ifcond" builder in
+
+              (* Grab the first block so that we might later add the conditional branch
+               * to it at the end of the function. *)
+              let start_bb = insertion_block builder in
+              let the_function = block_parent start_bb in
+
+              let then_bb = append_block context "then" the_function in
+
+              (* Emit 'then' value. *)
+              position_at_end then_bb builder;
+              let then_val = codegen_expr then_ in
+
+              (* Codegen of 'then' can change the current block, update then_bb for the
+               * phi. We create a new name because one is used for the phi node, and the
+               * other is used for the conditional branch. *)
+              let new_then_bb = insertion_block builder in
+
+              (* Emit 'else' value. *)
+              let else_bb = append_block context "else" the_function in
+              position_at_end else_bb builder;
+              let else_val = codegen_expr else_ in
+
+              (* Codegen of 'else' can change the current block, update else_bb for the
+               * phi. *)
+              let new_else_bb = insertion_block builder in
+
+              (* Emit merge block. *)
+              let merge_bb = append_block context "ifcont" the_function in
+              position_at_end merge_bb builder;
+              let incoming = [(then_val, new_then_bb); (else_val, new_else_bb)] in
+              let phi = build_phi incoming "iftmp" builder in
+
+              (* Return to the start block to add the conditional branch. *)
+              position_at_end start_bb builder;
+              ignore (build_cond_br cond_val then_bb else_bb builder);
+
+              (* Set a unconditional branch at the end of the 'then' block and the
+               * 'else' block to the 'merge' block. *)
+              position_at_end new_then_bb builder; ignore (build_br merge_bb builder);
+              position_at_end new_else_bb builder; ignore (build_br merge_bb builder);
+
+              (* Finally, set the builder to the end of the merge block. *)
+              position_at_end merge_bb builder;
+
+              phi
+          | Ast.For (var_name, start, end_, step, body) ->
+              (* Output this as:
+               *   var = alloca double
+               *   ...
+               *   start = startexpr
+               *   store start -> var
+               *   goto loop
+               * loop:
+               *   ...
+               *   bodyexpr
+               *   ...
+               * loopend:
+               *   step = stepexpr
+               *   endcond = endexpr
+               *
+               *   curvar = load var
+               *   nextvar = curvar + step
+               *   store nextvar -> var
+               *   br endcond, loop, endloop
+               * outloop: *)
+
+              let the_function = block_parent (insertion_block builder) in
+
+              (* Create an alloca for the variable in the entry block. *)
+              let alloca = create_entry_block_alloca the_function var_name in
+
+              (* Emit the start code first, without 'variable' in scope. *)
+              let start_val = codegen_expr start in
+
+              (* Store the value into the alloca. *)
+              ignore(build_store start_val alloca builder);
+
+              (* Make the new basic block for the loop header, inserting after current
+               * block. *)
+              let loop_bb = append_block context "loop" the_function in
+
+              (* Insert an explicit fall through from the current block to the
+               * loop_bb. *)
+              ignore (build_br loop_bb builder);
+
+              (* Start insertion in loop_bb. *)
+              position_at_end loop_bb builder;
+
+              (* Within the loop, the variable is defined equal to the PHI node. If it
+               * shadows an existing variable, we have to restore it, so save it
+               * now. *)
+              let old_val =
+                try Some (Hashtbl.find named_values var_name) with Not_found -> None
+              in
+              Hashtbl.add named_values var_name alloca;
+
+              (* Emit the body of the loop.  This, like any other expr, can change the
+               * current BB.  Note that we ignore the value computed by the body, but
+               * don't allow an error *)
+              ignore (codegen_expr body);
+
+              (* Emit the step value. *)
+              let step_val =
+                match step with
+                | Some step -> codegen_expr step
+                (* If not specified, use 1.0. *)
+                | None -> const_float double_type 1.0
+              in
+
+              (* Compute the end condition. *)
+              let end_cond = codegen_expr end_ in
+
+              (* Reload, increment, and restore the alloca. This handles the case where
+               * the body of the loop mutates the variable. *)
+              let cur_var = build_load alloca var_name builder in
+              let next_var = build_add cur_var step_val "nextvar" builder in
+              ignore(build_store next_var alloca builder);
+
+              (* Convert condition to a bool by comparing equal to 0.0. *)
+              let zero = const_float double_type 0.0 in
+              let end_cond = build_fcmp Fcmp.One end_cond zero "loopcond" builder in
+
+              (* Create the "after loop" block and insert it. *)
+              let after_bb = append_block context "afterloop" the_function in
+
+              (* Insert the conditional branch into the end of loop_end_bb. *)
+              ignore (build_cond_br end_cond loop_bb after_bb builder);
+
+              (* Any new code will be inserted in after_bb. *)
+              position_at_end after_bb builder;
+
+              (* Restore the unshadowed variable. *)
+              begin match old_val with
+              | Some old_val -> Hashtbl.add named_values var_name old_val
+              | None -> ()
+              end;
+
+              (* for expr always returns 0.0. *)
+              const_null double_type
+          | Ast.Var (var_names, body) ->
+              let old_bindings = ref [] in
+
+              let the_function = block_parent (insertion_block builder) in
+
+              (* Register all variables and emit their initializer. *)
+              Array.iter (fun (var_name, init) ->
+                (* Emit the initializer before adding the variable to scope, this
+                 * prevents the initializer from referencing the variable itself, and
+                 * permits stuff like this:
+                 *   var a = 1 in
+                 *     var a = a in ...   # refers to outer 'a'. *)
+                let init_val =
+                  match init with
+                  | Some init -> codegen_expr init
+                  (* If not specified, use 0.0. *)
+                  | None -> const_float double_type 0.0
+                in
+
+                let alloca = create_entry_block_alloca the_function var_name in
+                ignore(build_store init_val alloca builder);
+
+                (* Remember the old variable binding so that we can restore the binding
+                 * when we unrecurse. *)
+                begin
+                  try
+                    let old_value = Hashtbl.find named_values var_name in
+                    old_bindings := (var_name, old_value) :: !old_bindings;
+                  with Not_found -> ()
+                end;
+
+                (* Remember this binding. *)
+                Hashtbl.add named_values var_name alloca;
+              ) var_names;
+
+              (* Codegen the body, now that all vars are in scope. *)
+              let body_val = codegen_expr body in
+
+              (* Pop all our variables from scope. *)
+              List.iter (fun (var_name, old_value) ->
+                Hashtbl.add named_values var_name old_value
+              ) !old_bindings;
+
+              (* Return the body computation. *)
+              body_val
+
+        let codegen_proto = function
+          | Ast.Prototype (name, args) | Ast.BinOpPrototype (name, args, _) ->
+              (* Make the function type: double(double,double) etc. *)
+              let doubles = Array.make (Array.length args) double_type in
+              let ft = function_type double_type doubles in
+              let f =
+                match lookup_function name the_module with
+                | None -> declare_function name ft the_module
+
+                (* If 'f' conflicted, there was already something named 'name'. If it
+                 * has a body, don't allow redefinition or reextern. *)
+                | Some f ->
+                    (* If 'f' already has a body, reject this. *)
+                    if block_begin f <> At_end f then
+                      raise (Error "redefinition of function");
+
+                    (* If 'f' took a different number of arguments, reject. *)
+                    if element_type (type_of f) <> ft then
+                      raise (Error "redefinition of function with different # args");
+                    f
+              in
+
+              (* Set names for all arguments. *)
+              Array.iteri (fun i a ->
+                let n = args.(i) in
+                set_value_name n a;
+                Hashtbl.add named_values n a;
+              ) (params f);
+              f
+
+        (* Create an alloca for each argument and register the argument in the symbol
+         * table so that references to it will succeed. *)
+        let create_argument_allocas the_function proto =
+          let args = match proto with
+            | Ast.Prototype (_, args) | Ast.BinOpPrototype (_, args, _) -> args
+          in
+          Array.iteri (fun i ai ->
+            let var_name = args.(i) in
+            (* Create an alloca for this variable. *)
+            let alloca = create_entry_block_alloca the_function var_name in
+
+            (* Store the initial value into the alloca. *)
+            ignore(build_store ai alloca builder);
+
+            (* Add arguments to variable symbol table. *)
+            Hashtbl.add named_values var_name alloca;
+          ) (params the_function)
+
+        let codegen_func the_fpm = function
+          | Ast.Function (proto, body) ->
+              Hashtbl.clear named_values;
+              let the_function = codegen_proto proto in
+
+              (* If this is an operator, install it. *)
+              begin match proto with
+              | Ast.BinOpPrototype (name, args, prec) ->
+                  let op = name.[String.length name - 1] in
+                  Hashtbl.add Parser.binop_precedence op prec;
+              | _ -> ()
+              end;
+
+              (* Create a new basic block to start insertion into. *)
+              let bb = append_block context "entry" the_function in
+              position_at_end bb builder;
+
+              try
+                (* Add all arguments to the symbol table and create their allocas. *)
+                create_argument_allocas the_function proto;
+
+                let ret_val = codegen_expr body in
+
+                (* Finish off the function. *)
+                let _ = build_ret ret_val builder in
+
+                (* Validate the generated code, checking for consistency. *)
+                Llvm_analysis.assert_valid_function the_function;
+
+                (* Optimize the function. *)
+                let _ = PassManager.run_function the_function the_fpm in
+
+                the_function
+              with e ->
+                delete_function the_function;
+                raise e
+
+toplevel.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Top-Level parsing and JIT Driver
+         *===----------------------------------------------------------------------===*)
+
+        open Llvm
+        open Llvm_executionengine
+
+        (* top ::= definition | external | expression | ';' *)
+        let rec main_loop the_fpm the_execution_engine stream =
+          match Stream.peek stream with
+          | None -> ()
+
+          (* ignore top-level semicolons. *)
+          | Some (Token.Kwd ';') ->
+              Stream.junk stream;
+              main_loop the_fpm the_execution_engine stream
+
+          | Some token ->
+              begin
+                try match token with
+                | Token.Def ->
+                    let e = Parser.parse_definition stream in
+                    print_endline "parsed a function definition.";
+                    dump_value (Codegen.codegen_func the_fpm e);
+                | Token.Extern ->
+                    let e = Parser.parse_extern stream in
+                    print_endline "parsed an extern.";
+                    dump_value (Codegen.codegen_proto e);
+                | _ ->
+                    (* Evaluate a top-level expression into an anonymous function. *)
+                    let e = Parser.parse_toplevel stream in
+                    print_endline "parsed a top-level expr";
+                    let the_function = Codegen.codegen_func the_fpm e in
+                    dump_value the_function;
+
+                    (* JIT the function, returning a function pointer. *)
+                    let result = ExecutionEngine.run_function the_function [||]
+                      the_execution_engine in
+
+                    print_string "Evaluated to ";
+                    print_float (GenericValue.as_float Codegen.double_type result);
+                    print_newline ();
+                with Stream.Error s | Codegen.Error s ->
+                  (* Skip token for error recovery. *)
+                  Stream.junk stream;
+                  print_endline s;
+              end;
+              print_string "ready> "; flush stdout;
+              main_loop the_fpm the_execution_engine stream
+
+toy.ml:
+    .. code-block:: ocaml
+
+        (*===----------------------------------------------------------------------===
+         * Main driver code.
+         *===----------------------------------------------------------------------===*)
+
+        open Llvm
+        open Llvm_executionengine
+        open Llvm_target
+        open Llvm_scalar_opts
+
+        let main () =
+          ignore (initialize_native_target ());
+
+          (* Install standard binary operators.
+           * 1 is the lowest precedence. *)
+          Hashtbl.add Parser.binop_precedence '=' 2;
+          Hashtbl.add Parser.binop_precedence '<' 10;
+          Hashtbl.add Parser.binop_precedence '+' 20;
+          Hashtbl.add Parser.binop_precedence '-' 20;
+          Hashtbl.add Parser.binop_precedence '*' 40;    (* highest. *)
+
+          (* Prime the first token. *)
+          print_string "ready> "; flush stdout;
+          let stream = Lexer.lex (Stream.of_channel stdin) in
+
+          (* Create the JIT. *)
+          let the_execution_engine = ExecutionEngine.create Codegen.the_module in
+          let the_fpm = PassManager.create_function Codegen.the_module in
+
+          (* Set up the optimizer pipeline.  Start with registering info about how the
+           * target lays out data structures. *)
+          DataLayout.add (ExecutionEngine.target_data the_execution_engine) the_fpm;
+
+          (* Promote allocas to registers. *)
+          add_memory_to_register_promotion the_fpm;
+
+          (* Do simple "peephole" optimizations and bit-twiddling optzn. *)
+          add_instruction_combination the_fpm;
+
+          (* reassociate expressions. *)
+          add_reassociation the_fpm;
+
+          (* Eliminate Common SubExpressions. *)
+          add_gvn the_fpm;
+
+          (* Simplify the control flow graph (deleting unreachable blocks, etc). *)
+          add_cfg_simplification the_fpm;
+
+          ignore (PassManager.initialize the_fpm);
+
+          (* Run the main "interpreter loop" now. *)
+          Toplevel.main_loop the_fpm the_execution_engine stream;
+
+          (* Print out all the generated code. *)
+          dump_module Codegen.the_module
+        ;;
+
+        main ()
+
+bindings.c
+    .. code-block:: c
+
+        #include <stdio.h>
+
+        /* putchard - putchar that takes a double and returns 0. */
+        extern double putchard(double X) {
+          putchar((char)X);
+          return 0;
+        }
+
+        /* printd - printf that takes a double prints it as "%f\n", returning 0. */
+        extern double printd(double X) {
+          printf("%f\n", X);
+          return 0;
+        }
+
+`Next: Conclusion and other useful LLVM tidbits <OCamlLangImpl8.html>`_
+

Added: www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl8.txt
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl8.txt?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl8.txt (added)
+++ www-releases/trunk/3.6.0/docs/_sources/tutorial/OCamlLangImpl8.txt Fri Feb 27 12:44:09 2015
@@ -0,0 +1,267 @@
+======================================================
+Kaleidoscope: Conclusion and other useful LLVM tidbits
+======================================================
+
+.. contents::
+   :local:
+
+Tutorial Conclusion
+===================
+
+Welcome to the final chapter of the "`Implementing a language with
+LLVM <index.html>`_" tutorial. In the course of this tutorial, we have
+grown our little Kaleidoscope language from being a useless toy, to
+being a semi-interesting (but probably still useless) toy. :)
+
+It is interesting to see how far we've come, and how little code it has
+taken. We built the entire lexer, parser, AST, code generator, and an
+interactive run-loop (with a JIT!) by-hand in under 700 lines of
+(non-comment/non-blank) code.
+
+Our little language supports a couple of interesting features: it
+supports user defined binary and unary operators, it uses JIT
+compilation for immediate evaluation, and it supports a few control flow
+constructs with SSA construction.
+
+Part of the idea of this tutorial was to show you how easy and fun it
+can be to define, build, and play with languages. Building a compiler
+need not be a scary or mystical process! Now that you've seen some of
+the basics, I strongly encourage you to take the code and hack on it.
+For example, try adding:
+
+-  **global variables** - While global variables have questional value
+   in modern software engineering, they are often useful when putting
+   together quick little hacks like the Kaleidoscope compiler itself.
+   Fortunately, our current setup makes it very easy to add global
+   variables: just have value lookup check to see if an unresolved
+   variable is in the global variable symbol table before rejecting it.
+   To create a new global variable, make an instance of the LLVM
+   ``GlobalVariable`` class.
+-  **typed variables** - Kaleidoscope currently only supports variables
+   of type double. This gives the language a very nice elegance, because
+   only supporting one type means that you never have to specify types.
+   Different languages have different ways of handling this. The easiest
+   way is to require the user to specify types for every variable
+   definition, and record the type of the variable in the symbol table
+   along with its Value\*.
+-  **arrays, structs, vectors, etc** - Once you add types, you can start
+   extending the type system in all sorts of interesting ways. Simple
+   arrays are very easy and are quite useful for many different
+   applications. Adding them is mostly an exercise in learning how the
+   LLVM `getelementptr <../LangRef.html#i_getelementptr>`_ instruction
+   works: it is so nifty/unconventional, it `has its own
+   FAQ <../GetElementPtr.html>`_! If you add support for recursive types
+   (e.g. linked lists), make sure to read the `section in the LLVM
+   Programmer's Manual <../ProgrammersManual.html#TypeResolve>`_ that
+   describes how to construct them.
+-  **standard runtime** - Our current language allows the user to access
+   arbitrary external functions, and we use it for things like "printd"
+   and "putchard". As you extend the language to add higher-level
+   constructs, often these constructs make the most sense if they are
+   lowered to calls into a language-supplied runtime. For example, if
+   you add hash tables to the language, it would probably make sense to
+   add the routines to a runtime, instead of inlining them all the way.
+-  **memory management** - Currently we can only access the stack in
+   Kaleidoscope. It would also be useful to be able to allocate heap
+   memory, either with calls to the standard libc malloc/free interface
+   or with a garbage collector. If you would like to use garbage
+   collection, note that LLVM fully supports `Accurate Garbage
+   Collection <../GarbageCollection.html>`_ including algorithms that
+   move objects and need to scan/update the stack.
+-  **debugger support** - LLVM supports generation of `DWARF Debug
+   info <../SourceLevelDebugging.html>`_ which is understood by common
+   debuggers like GDB. Adding support for debug info is fairly
+   straightforward. The best way to understand it is to compile some
+   C/C++ code with "``clang -g -O0``" and taking a look at what it
+   produces.
+-  **exception handling support** - LLVM supports generation of `zero
+   cost exceptions <../ExceptionHandling.html>`_ which interoperate with
+   code compiled in other languages. You could also generate code by
+   implicitly making every function return an error value and checking
+   it. You could also make explicit use of setjmp/longjmp. There are
+   many different ways to go here.
+-  **object orientation, generics, database access, complex numbers,
+   geometric programming, ...** - Really, there is no end of crazy
+   features that you can add to the language.
+-  **unusual domains** - We've been talking about applying LLVM to a
+   domain that many people are interested in: building a compiler for a
+   specific language. However, there are many other domains that can use
+   compiler technology that are not typically considered. For example,
+   LLVM has been used to implement OpenGL graphics acceleration,
+   translate C++ code to ActionScript, and many other cute and clever
+   things. Maybe you will be the first to JIT compile a regular
+   expression interpreter into native code with LLVM?
+
+Have fun - try doing something crazy and unusual. Building a language
+like everyone else always has, is much less fun than trying something a
+little crazy or off the wall and seeing how it turns out. If you get
+stuck or want to talk about it, feel free to email the `llvmdev mailing
+list <http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev>`_: it has lots
+of people who are interested in languages and are often willing to help
+out.
+
+Before we end this tutorial, I want to talk about some "tips and tricks"
+for generating LLVM IR. These are some of the more subtle things that
+may not be obvious, but are very useful if you want to take advantage of
+LLVM's capabilities.
+
+Properties of the LLVM IR
+=========================
+
+We have a couple common questions about code in the LLVM IR form - lets
+just get these out of the way right now, shall we?
+
+Target Independence
+-------------------
+
+Kaleidoscope is an example of a "portable language": any program written
+in Kaleidoscope will work the same way on any target that it runs on.
+Many other languages have this property, e.g. lisp, java, haskell,
+javascript, python, etc (note that while these languages are portable,
+not all their libraries are).
+
+One nice aspect of LLVM is that it is often capable of preserving target
+independence in the IR: you can take the LLVM IR for a
+Kaleidoscope-compiled program and run it on any target that LLVM
+supports, even emitting C code and compiling that on targets that LLVM
+doesn't support natively. You can trivially tell that the Kaleidoscope
+compiler generates target-independent code because it never queries for
+any target-specific information when generating code.
+
+The fact that LLVM provides a compact, target-independent,
+representation for code gets a lot of people excited. Unfortunately,
+these people are usually thinking about C or a language from the C
+family when they are asking questions about language portability. I say
+"unfortunately", because there is really no way to make (fully general)
+C code portable, other than shipping the source code around (and of
+course, C source code is not actually portable in general either - ever
+port a really old application from 32- to 64-bits?).
+
+The problem with C (again, in its full generality) is that it is heavily
+laden with target specific assumptions. As one simple example, the
+preprocessor often destructively removes target-independence from the
+code when it processes the input text:
+
+.. code-block:: c
+
+    #ifdef __i386__
+      int X = 1;
+    #else
+      int X = 42;
+    #endif
+
+While it is possible to engineer more and more complex solutions to
+problems like this, it cannot be solved in full generality in a way that
+is better than shipping the actual source code.
+
+That said, there are interesting subsets of C that can be made portable.
+If you are willing to fix primitive types to a fixed size (say int =
+32-bits, and long = 64-bits), don't care about ABI compatibility with
+existing binaries, and are willing to give up some other minor features,
+you can have portable code. This can make sense for specialized domains
+such as an in-kernel language.
+
+Safety Guarantees
+-----------------
+
+Many of the languages above are also "safe" languages: it is impossible
+for a program written in Java to corrupt its address space and crash the
+process (assuming the JVM has no bugs). Safety is an interesting
+property that requires a combination of language design, runtime
+support, and often operating system support.
+
+It is certainly possible to implement a safe language in LLVM, but LLVM
+IR does not itself guarantee safety. The LLVM IR allows unsafe pointer
+casts, use after free bugs, buffer over-runs, and a variety of other
+problems. Safety needs to be implemented as a layer on top of LLVM and,
+conveniently, several groups have investigated this. Ask on the `llvmdev
+mailing list <http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev>`_ if
+you are interested in more details.
+
+Language-Specific Optimizations
+-------------------------------
+
+One thing about LLVM that turns off many people is that it does not
+solve all the world's problems in one system (sorry 'world hunger',
+someone else will have to solve you some other day). One specific
+complaint is that people perceive LLVM as being incapable of performing
+high-level language-specific optimization: LLVM "loses too much
+information".
+
+Unfortunately, this is really not the place to give you a full and
+unified version of "Chris Lattner's theory of compiler design". Instead,
+I'll make a few observations:
+
+First, you're right that LLVM does lose information. For example, as of
+this writing, there is no way to distinguish in the LLVM IR whether an
+SSA-value came from a C "int" or a C "long" on an ILP32 machine (other
+than debug info). Both get compiled down to an 'i32' value and the
+information about what it came from is lost. The more general issue
+here, is that the LLVM type system uses "structural equivalence" instead
+of "name equivalence". Another place this surprises people is if you
+have two types in a high-level language that have the same structure
+(e.g. two different structs that have a single int field): these types
+will compile down into a single LLVM type and it will be impossible to
+tell what it came from.
+
+Second, while LLVM does lose information, LLVM is not a fixed target: we
+continue to enhance and improve it in many different ways. In addition
+to adding new features (LLVM did not always support exceptions or debug
+info), we also extend the IR to capture important information for
+optimization (e.g. whether an argument is sign or zero extended,
+information about pointers aliasing, etc). Many of the enhancements are
+user-driven: people want LLVM to include some specific feature, so they
+go ahead and extend it.
+
+Third, it is *possible and easy* to add language-specific optimizations,
+and you have a number of choices in how to do it. As one trivial
+example, it is easy to add language-specific optimization passes that
+"know" things about code compiled for a language. In the case of the C
+family, there is an optimization pass that "knows" about the standard C
+library functions. If you call "exit(0)" in main(), it knows that it is
+safe to optimize that into "return 0;" because C specifies what the
+'exit' function does.
+
+In addition to simple library knowledge, it is possible to embed a
+variety of other language-specific information into the LLVM IR. If you
+have a specific need and run into a wall, please bring the topic up on
+the llvmdev list. At the very worst, you can always treat LLVM as if it
+were a "dumb code generator" and implement the high-level optimizations
+you desire in your front-end, on the language-specific AST.
+
+Tips and Tricks
+===============
+
+There is a variety of useful tips and tricks that you come to know after
+working on/with LLVM that aren't obvious at first glance. Instead of
+letting everyone rediscover them, this section talks about some of these
+issues.
+
+Implementing portable offsetof/sizeof
+-------------------------------------
+
+One interesting thing that comes up, if you are trying to keep the code
+generated by your compiler "target independent", is that you often need
+to know the size of some LLVM type or the offset of some field in an
+llvm structure. For example, you might need to pass the size of a type
+into a function that allocates memory.
+
+Unfortunately, this can vary widely across targets: for example the
+width of a pointer is trivially target-specific. However, there is a
+`clever way to use the getelementptr
+instruction <http://nondot.org/sabre/LLVMNotes/SizeOf-OffsetOf-VariableSizedStructs.txt>`_
+that allows you to compute this in a portable way.
+
+Garbage Collected Stack Frames
+------------------------------
+
+Some languages want to explicitly manage their stack frames, often so
+that they are garbage collected or to allow easy implementation of
+closures. There are often better ways to implement these features than
+explicit stack frames, but `LLVM does support
+them, <http://nondot.org/sabre/LLVMNotes/ExplicitlyManagedStackFrames.txt>`_
+if you want. It requires your front-end to convert the code into
+`Continuation Passing
+Style <http://en.wikipedia.org/wiki/Continuation-passing_style>`_ and
+the use of tail calls (which LLVM also supports).
+

Added: www-releases/trunk/3.6.0/docs/_sources/tutorial/index.txt
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_sources/tutorial/index.txt?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_sources/tutorial/index.txt (added)
+++ www-releases/trunk/3.6.0/docs/_sources/tutorial/index.txt Fri Feb 27 12:44:09 2015
@@ -0,0 +1,43 @@
+================================
+LLVM Tutorial: Table of Contents
+================================
+
+Kaleidoscope: Implementing a Language with LLVM
+===============================================
+
+.. toctree::
+   :titlesonly:
+   :glob:
+   :numbered:
+
+   LangImpl*
+
+Kaleidoscope: Implementing a Language with LLVM in Objective Caml
+=================================================================
+
+.. toctree::
+   :titlesonly:
+   :glob:
+   :numbered:
+
+   OCamlLangImpl*
+
+External Tutorials
+==================
+
+`Tutorial: Creating an LLVM Backend for the Cpu0 Architecture <http://jonathan2251.github.com/lbd/>`_
+   A step-by-step tutorial for developing an LLVM backend. Under
+   active development at `<https://github.com/Jonathan2251/lbd>`_ (please
+   contribute!).
+
+`Howto: Implementing LLVM Integrated Assembler`_
+   A simple guide for how to implement an LLVM integrated assembler for an
+   architecture.
+
+.. _`Howto: Implementing LLVM Integrated Assembler`: http://www.embecosm.com/appnotes/ean10/ean10-howto-llvmas-1.0.html
+
+Advanced Topics
+===============
+
+#. `Writing an Optimization for LLVM <http://llvm.org/pubs/2004-09-22-LCPCLLVMTutorial.html>`_
+

Added: www-releases/trunk/3.6.0/docs/_sources/yaml2obj.txt
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_sources/yaml2obj.txt?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_sources/yaml2obj.txt (added)
+++ www-releases/trunk/3.6.0/docs/_sources/yaml2obj.txt Fri Feb 27 12:44:09 2015
@@ -0,0 +1,220 @@
+yaml2obj
+========
+
+yaml2obj takes a YAML description of an object file and converts it to a binary
+file.
+
+    $ yaml2obj input-file
+
+.. program:: yaml2obj
+
+Outputs the binary to stdout.
+
+COFF Syntax
+-----------
+
+Here's a sample COFF file.
+
+.. code-block:: yaml
+
+  header:
+    Machine: IMAGE_FILE_MACHINE_I386 # (0x14C)
+
+  sections:
+    - Name: .text
+      Characteristics: [ IMAGE_SCN_CNT_CODE
+                       , IMAGE_SCN_ALIGN_16BYTES
+                       , IMAGE_SCN_MEM_EXECUTE
+                       , IMAGE_SCN_MEM_READ
+                       ] # 0x60500020
+      SectionData:
+        "\x83\xEC\x0C\xC7\x44\x24\x08\x00\x00\x00\x00\xC7\x04\x24\x00\x00\x00\x00\xE8\x00\x00\x00\x00\xE8\x00\x00\x00\x00\x8B\x44\x24\x08\x83\xC4\x0C\xC3" # |....D$.......$...............D$.....|
+
+  symbols:
+    - Name: .text
+      Value: 0
+      SectionNumber: 1
+      SimpleType: IMAGE_SYM_TYPE_NULL # (0)
+      ComplexType: IMAGE_SYM_DTYPE_NULL # (0)
+      StorageClass: IMAGE_SYM_CLASS_STATIC # (3)
+      NumberOfAuxSymbols: 1
+      AuxiliaryData:
+        "\x24\x00\x00\x00\x03\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00" # |$.................|
+
+    - Name: _main
+      Value: 0
+      SectionNumber: 1
+      SimpleType: IMAGE_SYM_TYPE_NULL # (0)
+      ComplexType: IMAGE_SYM_DTYPE_NULL # (0)
+      StorageClass: IMAGE_SYM_CLASS_EXTERNAL # (2)
+
+Here's a simplified Kwalify_ schema with an extension to allow alternate types.
+
+.. _Kwalify: http://www.kuwata-lab.com/kwalify/ruby/users-guide.html
+
+.. code-block:: yaml
+
+  type: map
+    mapping:
+      header:
+        type: map
+        mapping:
+          Machine: [ {type: str, enum:
+                                 [ IMAGE_FILE_MACHINE_UNKNOWN
+                                 , IMAGE_FILE_MACHINE_AM33
+                                 , IMAGE_FILE_MACHINE_AMD64
+                                 , IMAGE_FILE_MACHINE_ARM
+                                 , IMAGE_FILE_MACHINE_ARMNT
+                                 , IMAGE_FILE_MACHINE_EBC
+                                 , IMAGE_FILE_MACHINE_I386
+                                 , IMAGE_FILE_MACHINE_IA64
+                                 , IMAGE_FILE_MACHINE_M32R
+                                 , IMAGE_FILE_MACHINE_MIPS16
+                                 , IMAGE_FILE_MACHINE_MIPSFPU
+                                 , IMAGE_FILE_MACHINE_MIPSFPU16
+                                 , IMAGE_FILE_MACHINE_POWERPC
+                                 , IMAGE_FILE_MACHINE_POWERPCFP
+                                 , IMAGE_FILE_MACHINE_R4000
+                                 , IMAGE_FILE_MACHINE_SH3
+                                 , IMAGE_FILE_MACHINE_SH3DSP
+                                 , IMAGE_FILE_MACHINE_SH4
+                                 , IMAGE_FILE_MACHINE_SH5
+                                 , IMAGE_FILE_MACHINE_THUMB
+                                 , IMAGE_FILE_MACHINE_WCEMIPSV2
+                                 ]}
+                   , {type: int}
+                   ]
+          Characteristics:
+            - type: seq
+              sequence:
+                - type: str
+                  enum: [ IMAGE_FILE_RELOCS_STRIPPED
+                        , IMAGE_FILE_EXECUTABLE_IMAGE
+                        , IMAGE_FILE_LINE_NUMS_STRIPPED
+                        , IMAGE_FILE_LOCAL_SYMS_STRIPPED
+                        , IMAGE_FILE_AGGRESSIVE_WS_TRIM
+                        , IMAGE_FILE_LARGE_ADDRESS_AWARE
+                        , IMAGE_FILE_BYTES_REVERSED_LO
+                        , IMAGE_FILE_32BIT_MACHINE
+                        , IMAGE_FILE_DEBUG_STRIPPED
+                        , IMAGE_FILE_REMOVABLE_RUN_FROM_SWAP
+                        , IMAGE_FILE_NET_RUN_FROM_SWAP
+                        , IMAGE_FILE_SYSTEM
+                        , IMAGE_FILE_DLL
+                        , IMAGE_FILE_UP_SYSTEM_ONLY
+                        , IMAGE_FILE_BYTES_REVERSED_HI
+                        ]
+            - type: int
+      sections:
+        type: seq
+        sequence:
+          - type: map
+            mapping:
+              Name: {type: str}
+              Characteristics:
+                - type: seq
+                  sequence:
+                    - type: str
+                      enum: [ IMAGE_SCN_TYPE_NO_PAD
+                            , IMAGE_SCN_CNT_CODE
+                            , IMAGE_SCN_CNT_INITIALIZED_DATA
+                            , IMAGE_SCN_CNT_UNINITIALIZED_DATA
+                            , IMAGE_SCN_LNK_OTHER
+                            , IMAGE_SCN_LNK_INFO
+                            , IMAGE_SCN_LNK_REMOVE
+                            , IMAGE_SCN_LNK_COMDAT
+                            , IMAGE_SCN_GPREL
+                            , IMAGE_SCN_MEM_PURGEABLE
+                            , IMAGE_SCN_MEM_16BIT
+                            , IMAGE_SCN_MEM_LOCKED
+                            , IMAGE_SCN_MEM_PRELOAD
+                            , IMAGE_SCN_ALIGN_1BYTES
+                            , IMAGE_SCN_ALIGN_2BYTES
+                            , IMAGE_SCN_ALIGN_4BYTES
+                            , IMAGE_SCN_ALIGN_8BYTES
+                            , IMAGE_SCN_ALIGN_16BYTES
+                            , IMAGE_SCN_ALIGN_32BYTES
+                            , IMAGE_SCN_ALIGN_64BYTES
+                            , IMAGE_SCN_ALIGN_128BYTES
+                            , IMAGE_SCN_ALIGN_256BYTES
+                            , IMAGE_SCN_ALIGN_512BYTES
+                            , IMAGE_SCN_ALIGN_1024BYTES
+                            , IMAGE_SCN_ALIGN_2048BYTES
+                            , IMAGE_SCN_ALIGN_4096BYTES
+                            , IMAGE_SCN_ALIGN_8192BYTES
+                            , IMAGE_SCN_LNK_NRELOC_OVFL
+                            , IMAGE_SCN_MEM_DISCARDABLE
+                            , IMAGE_SCN_MEM_NOT_CACHED
+                            , IMAGE_SCN_MEM_NOT_PAGED
+                            , IMAGE_SCN_MEM_SHARED
+                            , IMAGE_SCN_MEM_EXECUTE
+                            , IMAGE_SCN_MEM_READ
+                            , IMAGE_SCN_MEM_WRITE
+                            ]
+                - type: int
+              SectionData: {type: str}
+      symbols:
+        type: seq
+        sequence:
+          - type: map
+            mapping:
+              Name: {type: str}
+              Value: {type: int}
+              SectionNumber: {type: int}
+              SimpleType: [ {type: str, enum: [ IMAGE_SYM_TYPE_NULL
+                                              , IMAGE_SYM_TYPE_VOID
+                                              , IMAGE_SYM_TYPE_CHAR
+                                              , IMAGE_SYM_TYPE_SHORT
+                                              , IMAGE_SYM_TYPE_INT
+                                              , IMAGE_SYM_TYPE_LONG
+                                              , IMAGE_SYM_TYPE_FLOAT
+                                              , IMAGE_SYM_TYPE_DOUBLE
+                                              , IMAGE_SYM_TYPE_STRUCT
+                                              , IMAGE_SYM_TYPE_UNION
+                                              , IMAGE_SYM_TYPE_ENUM
+                                              , IMAGE_SYM_TYPE_MOE
+                                              , IMAGE_SYM_TYPE_BYTE
+                                              , IMAGE_SYM_TYPE_WORD
+                                              , IMAGE_SYM_TYPE_UINT
+                                              , IMAGE_SYM_TYPE_DWORD
+                                              ]}
+                          , {type: int}
+                          ]
+              ComplexType: [ {type: str, enum: [ IMAGE_SYM_DTYPE_NULL
+                                               , IMAGE_SYM_DTYPE_POINTER
+                                               , IMAGE_SYM_DTYPE_FUNCTION
+                                               , IMAGE_SYM_DTYPE_ARRAY
+                                               ]}
+                           , {type: int}
+                           ]
+              StorageClass: [ {type: str, enum:
+                                          [ IMAGE_SYM_CLASS_END_OF_FUNCTION
+                                          , IMAGE_SYM_CLASS_NULL
+                                          , IMAGE_SYM_CLASS_AUTOMATIC
+                                          , IMAGE_SYM_CLASS_EXTERNAL
+                                          , IMAGE_SYM_CLASS_STATIC
+                                          , IMAGE_SYM_CLASS_REGISTER
+                                          , IMAGE_SYM_CLASS_EXTERNAL_DEF
+                                          , IMAGE_SYM_CLASS_LABEL
+                                          , IMAGE_SYM_CLASS_UNDEFINED_LABEL
+                                          , IMAGE_SYM_CLASS_MEMBER_OF_STRUCT
+                                          , IMAGE_SYM_CLASS_ARGUMENT
+                                          , IMAGE_SYM_CLASS_STRUCT_TAG
+                                          , IMAGE_SYM_CLASS_MEMBER_OF_UNION
+                                          , IMAGE_SYM_CLASS_UNION_TAG
+                                          , IMAGE_SYM_CLASS_TYPE_DEFINITION
+                                          , IMAGE_SYM_CLASS_UNDEFINED_STATIC
+                                          , IMAGE_SYM_CLASS_ENUM_TAG
+                                          , IMAGE_SYM_CLASS_MEMBER_OF_ENUM
+                                          , IMAGE_SYM_CLASS_REGISTER_PARAM
+                                          , IMAGE_SYM_CLASS_BIT_FIELD
+                                          , IMAGE_SYM_CLASS_BLOCK
+                                          , IMAGE_SYM_CLASS_FUNCTION
+                                          , IMAGE_SYM_CLASS_END_OF_STRUCT
+                                          , IMAGE_SYM_CLASS_FILE
+                                          , IMAGE_SYM_CLASS_SECTION
+                                          , IMAGE_SYM_CLASS_WEAK_EXTERNAL
+                                          , IMAGE_SYM_CLASS_CLR_TOKEN
+                                          ]}
+                            , {type: int}
+                            ]

Added: www-releases/trunk/3.6.0/docs/_static/ajax-loader.gif
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/ajax-loader.gif?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/ajax-loader.gif
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/basic.css
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/basic.css?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_static/basic.css (added)
+++ www-releases/trunk/3.6.0/docs/_static/basic.css Fri Feb 27 12:44:09 2015
@@ -0,0 +1,537 @@
+/*
+ * basic.css
+ * ~~~~~~~~~
+ *
+ * Sphinx stylesheet -- basic theme.
+ *
+ * :copyright: Copyright 2007-2014 by the Sphinx team, see AUTHORS.
+ * :license: BSD, see LICENSE for details.
+ *
+ */
+
+/* -- main layout ----------------------------------------------------------- */
+
+div.clearer {
+    clear: both;
+}
+
+/* -- relbar ---------------------------------------------------------------- */
+
+div.related {
+    width: 100%;
+    font-size: 90%;
+}
+
+div.related h3 {
+    display: none;
+}
+
+div.related ul {
+    margin: 0;
+    padding: 0 0 0 10px;
+    list-style: none;
+}
+
+div.related li {
+    display: inline;
+}
+
+div.related li.right {
+    float: right;
+    margin-right: 5px;
+}
+
+/* -- sidebar --------------------------------------------------------------- */
+
+div.sphinxsidebarwrapper {
+    padding: 10px 5px 0 10px;
+}
+
+div.sphinxsidebar {
+    float: left;
+    width: 230px;
+    margin-left: -100%;
+    font-size: 90%;
+}
+
+div.sphinxsidebar ul {
+    list-style: none;
+}
+
+div.sphinxsidebar ul ul,
+div.sphinxsidebar ul.want-points {
+    margin-left: 20px;
+    list-style: square;
+}
+
+div.sphinxsidebar ul ul {
+    margin-top: 0;
+    margin-bottom: 0;
+}
+
+div.sphinxsidebar form {
+    margin-top: 10px;
+}
+
+div.sphinxsidebar input {
+    border: 1px solid #98dbcc;
+    font-family: sans-serif;
+    font-size: 1em;
+}
+
+div.sphinxsidebar #searchbox input[type="text"] {
+    width: 170px;
+}
+
+div.sphinxsidebar #searchbox input[type="submit"] {
+    width: 30px;
+}
+
+img {
+    border: 0;
+    max-width: 100%;
+}
+
+/* -- search page ----------------------------------------------------------- */
+
+ul.search {
+    margin: 10px 0 0 20px;
+    padding: 0;
+}
+
+ul.search li {
+    padding: 5px 0 5px 20px;
+    background-image: url(file.png);
+    background-repeat: no-repeat;
+    background-position: 0 7px;
+}
+
+ul.search li a {
+    font-weight: bold;
+}
+
+ul.search li div.context {
+    color: #888;
+    margin: 2px 0 0 30px;
+    text-align: left;
+}
+
+ul.keywordmatches li.goodmatch a {
+    font-weight: bold;
+}
+
+/* -- index page ------------------------------------------------------------ */
+
+table.contentstable {
+    width: 90%;
+}
+
+table.contentstable p.biglink {
+    line-height: 150%;
+}
+
+a.biglink {
+    font-size: 1.3em;
+}
+
+span.linkdescr {
+    font-style: italic;
+    padding-top: 5px;
+    font-size: 90%;
+}
+
+/* -- general index --------------------------------------------------------- */
+
+table.indextable {
+    width: 100%;
+}
+
+table.indextable td {
+    text-align: left;
+    vertical-align: top;
+}
+
+table.indextable dl, table.indextable dd {
+    margin-top: 0;
+    margin-bottom: 0;
+}
+
+table.indextable tr.pcap {
+    height: 10px;
+}
+
+table.indextable tr.cap {
+    margin-top: 10px;
+    background-color: #f2f2f2;
+}
+
+img.toggler {
+    margin-right: 3px;
+    margin-top: 3px;
+    cursor: pointer;
+}
+
+div.modindex-jumpbox {
+    border-top: 1px solid #ddd;
+    border-bottom: 1px solid #ddd;
+    margin: 1em 0 1em 0;
+    padding: 0.4em;
+}
+
+div.genindex-jumpbox {
+    border-top: 1px solid #ddd;
+    border-bottom: 1px solid #ddd;
+    margin: 1em 0 1em 0;
+    padding: 0.4em;
+}
+
+/* -- general body styles --------------------------------------------------- */
+
+a.headerlink {
+    visibility: hidden;
+}
+
+h1:hover > a.headerlink,
+h2:hover > a.headerlink,
+h3:hover > a.headerlink,
+h4:hover > a.headerlink,
+h5:hover > a.headerlink,
+h6:hover > a.headerlink,
+dt:hover > a.headerlink {
+    visibility: visible;
+}
+
+div.body p.caption {
+    text-align: inherit;
+}
+
+div.body td {
+    text-align: left;
+}
+
+.field-list ul {
+    padding-left: 1em;
+}
+
+.first {
+    margin-top: 0 !important;
+}
+
+p.rubric {
+    margin-top: 30px;
+    font-weight: bold;
+}
+
+img.align-left, .figure.align-left, object.align-left {
+    clear: left;
+    float: left;
+    margin-right: 1em;
+}
+
+img.align-right, .figure.align-right, object.align-right {
+    clear: right;
+    float: right;
+    margin-left: 1em;
+}
+
+img.align-center, .figure.align-center, object.align-center {
+  display: block;
+  margin-left: auto;
+  margin-right: auto;
+}
+
+.align-left {
+    text-align: left;
+}
+
+.align-center {
+    text-align: center;
+}
+
+.align-right {
+    text-align: right;
+}
+
+/* -- sidebars -------------------------------------------------------------- */
+
+div.sidebar {
+    margin: 0 0 0.5em 1em;
+    border: 1px solid #ddb;
+    padding: 7px 7px 0 7px;
+    background-color: #ffe;
+    width: 40%;
+    float: right;
+}
+
+p.sidebar-title {
+    font-weight: bold;
+}
+
+/* -- topics ---------------------------------------------------------------- */
+
+div.topic {
+    border: 1px solid #ccc;
+    padding: 7px 7px 0 7px;
+    margin: 10px 0 10px 0;
+}
+
+p.topic-title {
+    font-size: 1.1em;
+    font-weight: bold;
+    margin-top: 10px;
+}
+
+/* -- admonitions ----------------------------------------------------------- */
+
+div.admonition {
+    margin-top: 10px;
+    margin-bottom: 10px;
+    padding: 7px;
+}
+
+div.admonition dt {
+    font-weight: bold;
+}
+
+div.admonition dl {
+    margin-bottom: 0;
+}
+
+p.admonition-title {
+    margin: 0px 10px 5px 0px;
+    font-weight: bold;
+}
+
+div.body p.centered {
+    text-align: center;
+    margin-top: 25px;
+}
+
+/* -- tables ---------------------------------------------------------------- */
+
+table.docutils {
+    border: 0;
+    border-collapse: collapse;
+}
+
+table.docutils td, table.docutils th {
+    padding: 1px 8px 1px 5px;
+    border-top: 0;
+    border-left: 0;
+    border-right: 0;
+    border-bottom: 1px solid #aaa;
+}
+
+table.field-list td, table.field-list th {
+    border: 0 !important;
+}
+
+table.footnote td, table.footnote th {
+    border: 0 !important;
+}
+
+th {
+    text-align: left;
+    padding-right: 5px;
+}
+
+table.citation {
+    border-left: solid 1px gray;
+    margin-left: 1px;
+}
+
+table.citation td {
+    border-bottom: none;
+}
+
+/* -- other body styles ----------------------------------------------------- */
+
+ol.arabic {
+    list-style: decimal;
+}
+
+ol.loweralpha {
+    list-style: lower-alpha;
+}
+
+ol.upperalpha {
+    list-style: upper-alpha;
+}
+
+ol.lowerroman {
+    list-style: lower-roman;
+}
+
+ol.upperroman {
+    list-style: upper-roman;
+}
+
+dl {
+    margin-bottom: 15px;
+}
+
+dd p {
+    margin-top: 0px;
+}
+
+dd ul, dd table {
+    margin-bottom: 10px;
+}
+
+dd {
+    margin-top: 3px;
+    margin-bottom: 10px;
+    margin-left: 30px;
+}
+
+dt:target, .highlighted {
+    background-color: #fbe54e;
+}
+
+dl.glossary dt {
+    font-weight: bold;
+    font-size: 1.1em;
+}
+
+.field-list ul {
+    margin: 0;
+    padding-left: 1em;
+}
+
+.field-list p {
+    margin: 0;
+}
+
+.optional {
+    font-size: 1.3em;
+}
+
+.versionmodified {
+    font-style: italic;
+}
+
+.system-message {
+    background-color: #fda;
+    padding: 5px;
+    border: 3px solid red;
+}
+
+.footnote:target  {
+    background-color: #ffa;
+}
+
+.line-block {
+    display: block;
+    margin-top: 1em;
+    margin-bottom: 1em;
+}
+
+.line-block .line-block {
+    margin-top: 0;
+    margin-bottom: 0;
+    margin-left: 1.5em;
+}
+
+.guilabel, .menuselection {
+    font-family: sans-serif;
+}
+
+.accelerator {
+    text-decoration: underline;
+}
+
+.classifier {
+    font-style: oblique;
+}
+
+abbr, acronym {
+    border-bottom: dotted 1px;
+    cursor: help;
+}
+
+/* -- code displays --------------------------------------------------------- */
+
+pre {
+    overflow: auto;
+    overflow-y: hidden;  /* fixes display issues on Chrome browsers */
+}
+
+td.linenos pre {
+    padding: 5px 0px;
+    border: 0;
+    background-color: transparent;
+    color: #aaa;
+}
+
+table.highlighttable {
+    margin-left: 0.5em;
+}
+
+table.highlighttable td {
+    padding: 0 0.5em 0 0.5em;
+}
+
+tt.descname {
+    background-color: transparent;
+    font-weight: bold;
+    font-size: 1.2em;
+}
+
+tt.descclassname {
+    background-color: transparent;
+}
+
+tt.xref, a tt {
+    background-color: transparent;
+    font-weight: bold;
+}
+
+h1 tt, h2 tt, h3 tt, h4 tt, h5 tt, h6 tt {
+    background-color: transparent;
+}
+
+.viewcode-link {
+    float: right;
+}
+
+.viewcode-back {
+    float: right;
+    font-family: sans-serif;
+}
+
+div.viewcode-block:target {
+    margin: -1px -10px;
+    padding: 0 10px;
+}
+
+/* -- math display ---------------------------------------------------------- */
+
+img.math {
+    vertical-align: middle;
+}
+
+div.body div.math p {
+    text-align: center;
+}
+
+span.eqno {
+    float: right;
+}
+
+/* -- printout stylesheet --------------------------------------------------- */
+
+ at media print {
+    div.document,
+    div.documentwrapper,
+    div.bodywrapper {
+        margin: 0 !important;
+        width: 100%;
+    }
+
+    div.sphinxsidebar,
+    div.related,
+    div.footer,
+    #top-link {
+        display: none;
+    }
+}
\ No newline at end of file

Added: www-releases/trunk/3.6.0/docs/_static/comment-bright.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/comment-bright.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/comment-bright.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/comment-close.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/comment-close.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/comment-close.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/comment.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/comment.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/comment.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/contents.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/contents.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/contents.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/doctools.js
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/doctools.js?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_static/doctools.js (added)
+++ www-releases/trunk/3.6.0/docs/_static/doctools.js Fri Feb 27 12:44:09 2015
@@ -0,0 +1,238 @@
+/*
+ * doctools.js
+ * ~~~~~~~~~~~
+ *
+ * Sphinx JavaScript utilities for all documentation.
+ *
+ * :copyright: Copyright 2007-2014 by the Sphinx team, see AUTHORS.
+ * :license: BSD, see LICENSE for details.
+ *
+ */
+
+/**
+ * select a different prefix for underscore
+ */
+$u = _.noConflict();
+
+/**
+ * make the code below compatible with browsers without
+ * an installed firebug like debugger
+if (!window.console || !console.firebug) {
+  var names = ["log", "debug", "info", "warn", "error", "assert", "dir",
+    "dirxml", "group", "groupEnd", "time", "timeEnd", "count", "trace",
+    "profile", "profileEnd"];
+  window.console = {};
+  for (var i = 0; i < names.length; ++i)
+    window.console[names[i]] = function() {};
+}
+ */
+
+/**
+ * small helper function to urldecode strings
+ */
+jQuery.urldecode = function(x) {
+  return decodeURIComponent(x).replace(/\+/g, ' ');
+};
+
+/**
+ * small helper function to urlencode strings
+ */
+jQuery.urlencode = encodeURIComponent;
+
+/**
+ * This function returns the parsed url parameters of the
+ * current request. Multiple values per key are supported,
+ * it will always return arrays of strings for the value parts.
+ */
+jQuery.getQueryParameters = function(s) {
+  if (typeof s == 'undefined')
+    s = document.location.search;
+  var parts = s.substr(s.indexOf('?') + 1).split('&');
+  var result = {};
+  for (var i = 0; i < parts.length; i++) {
+    var tmp = parts[i].split('=', 2);
+    var key = jQuery.urldecode(tmp[0]);
+    var value = jQuery.urldecode(tmp[1]);
+    if (key in result)
+      result[key].push(value);
+    else
+      result[key] = [value];
+  }
+  return result;
+};
+
+/**
+ * highlight a given string on a jquery object by wrapping it in
+ * span elements with the given class name.
+ */
+jQuery.fn.highlightText = function(text, className) {
+  function highlight(node) {
+    if (node.nodeType == 3) {
+      var val = node.nodeValue;
+      var pos = val.toLowerCase().indexOf(text);
+      if (pos >= 0 && !jQuery(node.parentNode).hasClass(className)) {
+        var span = document.createElement("span");
+        span.className = className;
+        span.appendChild(document.createTextNode(val.substr(pos, text.length)));
+        node.parentNode.insertBefore(span, node.parentNode.insertBefore(
+          document.createTextNode(val.substr(pos + text.length)),
+          node.nextSibling));
+        node.nodeValue = val.substr(0, pos);
+      }
+    }
+    else if (!jQuery(node).is("button, select, textarea")) {
+      jQuery.each(node.childNodes, function() {
+        highlight(this);
+      });
+    }
+  }
+  return this.each(function() {
+    highlight(this);
+  });
+};
+
+/**
+ * Small JavaScript module for the documentation.
+ */
+var Documentation = {
+
+  init : function() {
+    this.fixFirefoxAnchorBug();
+    this.highlightSearchWords();
+    this.initIndexTable();
+  },
+
+  /**
+   * i18n support
+   */
+  TRANSLATIONS : {},
+  PLURAL_EXPR : function(n) { return n == 1 ? 0 : 1; },
+  LOCALE : 'unknown',
+
+  // gettext and ngettext don't access this so that the functions
+  // can safely bound to a different name (_ = Documentation.gettext)
+  gettext : function(string) {
+    var translated = Documentation.TRANSLATIONS[string];
+    if (typeof translated == 'undefined')
+      return string;
+    return (typeof translated == 'string') ? translated : translated[0];
+  },
+
+  ngettext : function(singular, plural, n) {
+    var translated = Documentation.TRANSLATIONS[singular];
+    if (typeof translated == 'undefined')
+      return (n == 1) ? singular : plural;
+    return translated[Documentation.PLURALEXPR(n)];
+  },
+
+  addTranslations : function(catalog) {
+    for (var key in catalog.messages)
+      this.TRANSLATIONS[key] = catalog.messages[key];
+    this.PLURAL_EXPR = new Function('n', 'return +(' + catalog.plural_expr + ')');
+    this.LOCALE = catalog.locale;
+  },
+
+  /**
+   * add context elements like header anchor links
+   */
+  addContextElements : function() {
+    $('div[id] > :header:first').each(function() {
+      $('<a class="headerlink">\u00B6</a>').
+      attr('href', '#' + this.id).
+      attr('title', _('Permalink to this headline')).
+      appendTo(this);
+    });
+    $('dt[id]').each(function() {
+      $('<a class="headerlink">\u00B6</a>').
+      attr('href', '#' + this.id).
+      attr('title', _('Permalink to this definition')).
+      appendTo(this);
+    });
+  },
+
+  /**
+   * workaround a firefox stupidity
+   */
+  fixFirefoxAnchorBug : function() {
+    if (document.location.hash && $.browser.mozilla)
+      window.setTimeout(function() {
+        document.location.href += '';
+      }, 10);
+  },
+
+  /**
+   * highlight the search words provided in the url in the text
+   */
+  highlightSearchWords : function() {
+    var params = $.getQueryParameters();
+    var terms = (params.highlight) ? params.highlight[0].split(/\s+/) : [];
+    if (terms.length) {
+      var body = $('div.body');
+      if (!body.length) {
+        body = $('body');
+      }
+      window.setTimeout(function() {
+        $.each(terms, function() {
+          body.highlightText(this.toLowerCase(), 'highlighted');
+        });
+      }, 10);
+      $('<p class="highlight-link"><a href="javascript:Documentation.' +
+        'hideSearchWords()">' + _('Hide Search Matches') + '</a></p>')
+          .appendTo($('#searchbox'));
+    }
+  },
+
+  /**
+   * init the domain index toggle buttons
+   */
+  initIndexTable : function() {
+    var togglers = $('img.toggler').click(function() {
+      var src = $(this).attr('src');
+      var idnum = $(this).attr('id').substr(7);
+      $('tr.cg-' + idnum).toggle();
+      if (src.substr(-9) == 'minus.png')
+        $(this).attr('src', src.substr(0, src.length-9) + 'plus.png');
+      else
+        $(this).attr('src', src.substr(0, src.length-8) + 'minus.png');
+    }).css('display', '');
+    if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) {
+        togglers.click();
+    }
+  },
+
+  /**
+   * helper function to hide the search marks again
+   */
+  hideSearchWords : function() {
+    $('#searchbox .highlight-link').fadeOut(300);
+    $('span.highlighted').removeClass('highlighted');
+  },
+
+  /**
+   * make the url absolute
+   */
+  makeURL : function(relativeURL) {
+    return DOCUMENTATION_OPTIONS.URL_ROOT + '/' + relativeURL;
+  },
+
+  /**
+   * get the current relative url
+   */
+  getCurrentURL : function() {
+    var path = document.location.pathname;
+    var parts = path.split(/\//);
+    $.each(DOCUMENTATION_OPTIONS.URL_ROOT.split(/\//), function() {
+      if (this == '..')
+        parts.pop();
+    });
+    var url = parts.join('/');
+    return path.substring(url.lastIndexOf('/') + 1, path.length - 1);
+  }
+};
+
+// quick alias for translations
+_ = Documentation.gettext;
+
+$(document).ready(function() {
+  Documentation.init();
+});

Added: www-releases/trunk/3.6.0/docs/_static/down-pressed.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/down-pressed.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/down-pressed.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/down.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/down.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/down.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/file.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/file.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/file.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/jquery.js
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/jquery.js?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_static/jquery.js (added)
+++ www-releases/trunk/3.6.0/docs/_static/jquery.js Fri Feb 27 12:44:09 2015
@@ -0,0 +1,9404 @@
+/*!
+ * jQuery JavaScript Library v1.7.2
+ * http://jquery.com/
+ *
+ * Copyright 2011, John Resig
+ * Dual licensed under the MIT or GPL Version 2 licenses.
+ * http://jquery.org/license
+ *
+ * Includes Sizzle.js
+ * http://sizzlejs.com/
+ * Copyright 2011, The Dojo Foundation
+ * Released under the MIT, BSD, and GPL Licenses.
+ *
+ * Date: Fri Jul  5 14:07:58 UTC 2013
+ */
+(function( window, undefined ) {
+
+// Use the correct document accordingly with window argument (sandbox)
+var document = window.document,
+	navigator = window.navigator,
+	location = window.location;
+var jQuery = (function() {
+
+// Define a local copy of jQuery
+var jQuery = function( selector, context ) {
+		// The jQuery object is actually just the init constructor 'enhanced'
+		return new jQuery.fn.init( selector, context, rootjQuery );
+	},
+
+	// Map over jQuery in case of overwrite
+	_jQuery = window.jQuery,
+
+	// Map over the $ in case of overwrite
+	_$ = window.$,
+
+	// A central reference to the root jQuery(document)
+	rootjQuery,
+
+	// A simple way to check for HTML strings or ID strings
+	// Prioritize #id over <tag> to avoid XSS via location.hash (#9521)
+	quickExpr = /^(?:[^#<]*(<[\w\W]+>)[^>]*$|#([\w\-]*)$)/,
+
+	// Check if a string has a non-whitespace character in it
+	rnotwhite = /\S/,
+
+	// Used for trimming whitespace
+	trimLeft = /^\s+/,
+	trimRight = /\s+$/,
+
+	// Match a standalone tag
+	rsingleTag = /^<(\w+)\s*\/?>(?:<\/\1>)?$/,
+
+	// JSON RegExp
+	rvalidchars = /^[\],:{}\s]*$/,
+	rvalidescape = /\\(?:["\\\/bfnrt]|u[0-9a-fA-F]{4})/g,
+	rvalidtokens = /"[^"\\\n\r]*"|true|false|null|-?\d+(?:\.\d*)?(?:[eE][+\-]?\d+)?/g,
+	rvalidbraces = /(?:^|:|,)(?:\s*\[)+/g,
+
+	// Useragent RegExp
+	rwebkit = /(webkit)[ \/]([\w.]+)/,
+	ropera = /(opera)(?:.*version)?[ \/]([\w.]+)/,
+	rmsie = /(msie) ([\w.]+)/,
+	rmozilla = /(mozilla)(?:.*? rv:([\w.]+))?/,
+
+	// Matches dashed string for camelizing
+	rdashAlpha = /-([a-z]|[0-9])/ig,
+	rmsPrefix = /^-ms-/,
+
+	// Used by jQuery.camelCase as callback to replace()
+	fcamelCase = function( all, letter ) {
+		return ( letter + "" ).toUpperCase();
+	},
+
+	// Keep a UserAgent string for use with jQuery.browser
+	userAgent = navigator.userAgent,
+
+	// For matching the engine and version of the browser
+	browserMatch,
+
+	// The deferred used on DOM ready
+	readyList,
+
+	// The ready event handler
+	DOMContentLoaded,
+
+	// Save a reference to some core methods
+	toString = Object.prototype.toString,
+	hasOwn = Object.prototype.hasOwnProperty,
+	push = Array.prototype.push,
+	slice = Array.prototype.slice,
+	trim = String.prototype.trim,
+	indexOf = Array.prototype.indexOf,
+
+	// [[Class]] -> type pairs
+	class2type = {};
+
+jQuery.fn = jQuery.prototype = {
+	constructor: jQuery,
+	init: function( selector, context, rootjQuery ) {
+		var match, elem, ret, doc;
+
+		// Handle $(""), $(null), or $(undefined)
+		if ( !selector ) {
+			return this;
+		}
+
+		// Handle $(DOMElement)
+		if ( selector.nodeType ) {
+			this.context = this[0] = selector;
+			this.length = 1;
+			return this;
+		}
+
+		// The body element only exists once, optimize finding it
+		if ( selector === "body" && !context && document.body ) {
+			this.context = document;
+			this[0] = document.body;
+			this.selector = selector;
+			this.length = 1;
+			return this;
+		}
+
+		// Handle HTML strings
+		if ( typeof selector === "string" ) {
+			// Are we dealing with HTML string or an ID?
+			if ( selector.charAt(0) === "<" && selector.charAt( selector.length - 1 ) === ">" && selector.length >= 3 ) {
+				// Assume that strings that start and end with <> are HTML and skip the regex check
+				match = [ null, selector, null ];
+
+			} else {
+				match = quickExpr.exec( selector );
+			}
+
+			// Verify a match, and that no context was specified for #id
+			if ( match && (match[1] || !context) ) {
+
+				// HANDLE: $(html) -> $(array)
+				if ( match[1] ) {
+					context = context instanceof jQuery ? context[0] : context;
+					doc = ( context ? context.ownerDocument || context : document );
+
+					// If a single string is passed in and it's a single tag
+					// just do a createElement and skip the rest
+					ret = rsingleTag.exec( selector );
+
+					if ( ret ) {
+						if ( jQuery.isPlainObject( context ) ) {
+							selector = [ document.createElement( ret[1] ) ];
+							jQuery.fn.attr.call( selector, context, true );
+
+						} else {
+							selector = [ doc.createElement( ret[1] ) ];
+						}
+
+					} else {
+						ret = jQuery.buildFragment( [ match[1] ], [ doc ] );
+						selector = ( ret.cacheable ? jQuery.clone(ret.fragment) : ret.fragment ).childNodes;
+					}
+
+					return jQuery.merge( this, selector );
+
+				// HANDLE: $("#id")
+				} else {
+					elem = document.getElementById( match[2] );
+
+					// Check parentNode to catch when Blackberry 4.6 returns
+					// nodes that are no longer in the document #6963
+					if ( elem && elem.parentNode ) {
+						// Handle the case where IE and Opera return items
+						// by name instead of ID
+						if ( elem.id !== match[2] ) {
+							return rootjQuery.find( selector );
+						}
+
+						// Otherwise, we inject the element directly into the jQuery object
+						this.length = 1;
+						this[0] = elem;
+					}
+
+					this.context = document;
+					this.selector = selector;
+					return this;
+				}
+
+			// HANDLE: $(expr, $(...))
+			} else if ( !context || context.jquery ) {
+				return ( context || rootjQuery ).find( selector );
+
+			// HANDLE: $(expr, context)
+			// (which is just equivalent to: $(context).find(expr)
+			} else {
+				return this.constructor( context ).find( selector );
+			}
+
+		// HANDLE: $(function)
+		// Shortcut for document ready
+		} else if ( jQuery.isFunction( selector ) ) {
+			return rootjQuery.ready( selector );
+		}
+
+		if ( selector.selector !== undefined ) {
+			this.selector = selector.selector;
+			this.context = selector.context;
+		}
+
+		return jQuery.makeArray( selector, this );
+	},
+
+	// Start with an empty selector
+	selector: "",
+
+	// The current version of jQuery being used
+	jquery: "1.7.2",
+
+	// The default length of a jQuery object is 0
+	length: 0,
+
+	// The number of elements contained in the matched element set
+	size: function() {
+		return this.length;
+	},
+
+	toArray: function() {
+		return slice.call( this, 0 );
+	},
+
+	// Get the Nth element in the matched element set OR
+	// Get the whole matched element set as a clean array
+	get: function( num ) {
+		return num == null ?
+
+			// Return a 'clean' array
+			this.toArray() :
+
+			// Return just the object
+			( num < 0 ? this[ this.length + num ] : this[ num ] );
+	},
+
+	// Take an array of elements and push it onto the stack
+	// (returning the new matched element set)
+	pushStack: function( elems, name, selector ) {
+		// Build a new jQuery matched element set
+		var ret = this.constructor();
+
+		if ( jQuery.isArray( elems ) ) {
+			push.apply( ret, elems );
+
+		} else {
+			jQuery.merge( ret, elems );
+		}
+
+		// Add the old object onto the stack (as a reference)
+		ret.prevObject = this;
+
+		ret.context = this.context;
+
+		if ( name === "find" ) {
+			ret.selector = this.selector + ( this.selector ? " " : "" ) + selector;
+		} else if ( name ) {
+			ret.selector = this.selector + "." + name + "(" + selector + ")";
+		}
+
+		// Return the newly-formed element set
+		return ret;
+	},
+
+	// Execute a callback for every element in the matched set.
+	// (You can seed the arguments with an array of args, but this is
+	// only used internally.)
+	each: function( callback, args ) {
+		return jQuery.each( this, callback, args );
+	},
+
+	ready: function( fn ) {
+		// Attach the listeners
+		jQuery.bindReady();
+
+		// Add the callback
+		readyList.add( fn );
+
+		return this;
+	},
+
+	eq: function( i ) {
+		i = +i;
+		return i === -1 ?
+			this.slice( i ) :
+			this.slice( i, i + 1 );
+	},
+
+	first: function() {
+		return this.eq( 0 );
+	},
+
+	last: function() {
+		return this.eq( -1 );
+	},
+
+	slice: function() {
+		return this.pushStack( slice.apply( this, arguments ),
+			"slice", slice.call(arguments).join(",") );
+	},
+
+	map: function( callback ) {
+		return this.pushStack( jQuery.map(this, function( elem, i ) {
+			return callback.call( elem, i, elem );
+		}));
+	},
+
+	end: function() {
+		return this.prevObject || this.constructor(null);
+	},
+
+	// For internal use only.
+	// Behaves like an Array's method, not like a jQuery method.
+	push: push,
+	sort: [].sort,
+	splice: [].splice
+};
+
+// Give the init function the jQuery prototype for later instantiation
+jQuery.fn.init.prototype = jQuery.fn;
+
+jQuery.extend = jQuery.fn.extend = function() {
+	var options, name, src, copy, copyIsArray, clone,
+		target = arguments[0] || {},
+		i = 1,
+		length = arguments.length,
+		deep = false;
+
+	// Handle a deep copy situation
+	if ( typeof target === "boolean" ) {
+		deep = target;
+		target = arguments[1] || {};
+		// skip the boolean and the target
+		i = 2;
+	}
+
+	// Handle case when target is a string or something (possible in deep copy)
+	if ( typeof target !== "object" && !jQuery.isFunction(target) ) {
+		target = {};
+	}
+
+	// extend jQuery itself if only one argument is passed
+	if ( length === i ) {
+		target = this;
+		--i;
+	}
+
+	for ( ; i < length; i++ ) {
+		// Only deal with non-null/undefined values
+		if ( (options = arguments[ i ]) != null ) {
+			// Extend the base object
+			for ( name in options ) {
+				src = target[ name ];
+				copy = options[ name ];
+
+				// Prevent never-ending loop
+				if ( target === copy ) {
+					continue;
+				}
+
+				// Recurse if we're merging plain objects or arrays
+				if ( deep && copy && ( jQuery.isPlainObject(copy) || (copyIsArray = jQuery.isArray(copy)) ) ) {
+					if ( copyIsArray ) {
+						copyIsArray = false;
+						clone = src && jQuery.isArray(src) ? src : [];
+
+					} else {
+						clone = src && jQuery.isPlainObject(src) ? src : {};
+					}
+
+					// Never move original objects, clone them
+					target[ name ] = jQuery.extend( deep, clone, copy );
+
+				// Don't bring in undefined values
+				} else if ( copy !== undefined ) {
+					target[ name ] = copy;
+				}
+			}
+		}
+	}
+
+	// Return the modified object
+	return target;
+};
+
+jQuery.extend({
+	noConflict: function( deep ) {
+		if ( window.$ === jQuery ) {
+			window.$ = _$;
+		}
+
+		if ( deep && window.jQuery === jQuery ) {
+			window.jQuery = _jQuery;
+		}
+
+		return jQuery;
+	},
+
+	// Is the DOM ready to be used? Set to true once it occurs.
+	isReady: false,
+
+	// A counter to track how many items to wait for before
+	// the ready event fires. See #6781
+	readyWait: 1,
+
+	// Hold (or release) the ready event
+	holdReady: function( hold ) {
+		if ( hold ) {
+			jQuery.readyWait++;
+		} else {
+			jQuery.ready( true );
+		}
+	},
+
+	// Handle when the DOM is ready
+	ready: function( wait ) {
+		// Either a released hold or an DOMready/load event and not yet ready
+		if ( (wait === true && !--jQuery.readyWait) || (wait !== true && !jQuery.isReady) ) {
+			// Make sure body exists, at least, in case IE gets a little overzealous (ticket #5443).
+			if ( !document.body ) {
+				return setTimeout( jQuery.ready, 1 );
+			}
+
+			// Remember that the DOM is ready
+			jQuery.isReady = true;
+
+			// If a normal DOM Ready event fired, decrement, and wait if need be
+			if ( wait !== true && --jQuery.readyWait > 0 ) {
+				return;
+			}
+
+			// If there are functions bound, to execute
+			readyList.fireWith( document, [ jQuery ] );
+
+			// Trigger any bound ready events
+			if ( jQuery.fn.trigger ) {
+				jQuery( document ).trigger( "ready" ).off( "ready" );
+			}
+		}
+	},
+
+	bindReady: function() {
+		if ( readyList ) {
+			return;
+		}
+
+		readyList = jQuery.Callbacks( "once memory" );
+
+		// Catch cases where $(document).ready() is called after the
+		// browser event has already occurred.
+		if ( document.readyState === "complete" ) {
+			// Handle it asynchronously to allow scripts the opportunity to delay ready
+			return setTimeout( jQuery.ready, 1 );
+		}
+
+		// Mozilla, Opera and webkit nightlies currently support this event
+		if ( document.addEventListener ) {
+			// Use the handy event callback
+			document.addEventListener( "DOMContentLoaded", DOMContentLoaded, false );
+
+			// A fallback to window.onload, that will always work
+			window.addEventListener( "load", jQuery.ready, false );
+
+		// If IE event model is used
+		} else if ( document.attachEvent ) {
+			// ensure firing before onload,
+			// maybe late but safe also for iframes
+			document.attachEvent( "onreadystatechange", DOMContentLoaded );
+
+			// A fallback to window.onload, that will always work
+			window.attachEvent( "onload", jQuery.ready );
+
+			// If IE and not a frame
+			// continually check to see if the document is ready
+			var toplevel = false;
+
+			try {
+				toplevel = window.frameElement == null;
+			} catch(e) {}
+
+			if ( document.documentElement.doScroll && toplevel ) {
+				doScrollCheck();
+			}
+		}
+	},
+
+	// See test/unit/core.js for details concerning isFunction.
+	// Since version 1.3, DOM methods and functions like alert
+	// aren't supported. They return false on IE (#2968).
+	isFunction: function( obj ) {
+		return jQuery.type(obj) === "function";
+	},
+
+	isArray: Array.isArray || function( obj ) {
+		return jQuery.type(obj) === "array";
+	},
+
+	isWindow: function( obj ) {
+		return obj != null && obj == obj.window;
+	},
+
+	isNumeric: function( obj ) {
+		return !isNaN( parseFloat(obj) ) && isFinite( obj );
+	},
+
+	type: function( obj ) {
+		return obj == null ?
+			String( obj ) :
+			class2type[ toString.call(obj) ] || "object";
+	},
+
+	isPlainObject: function( obj ) {
+		// Must be an Object.
+		// Because of IE, we also have to check the presence of the constructor property.
+		// Make sure that DOM nodes and window objects don't pass through, as well
+		if ( !obj || jQuery.type(obj) !== "object" || obj.nodeType || jQuery.isWindow( obj ) ) {
+			return false;
+		}
+
+		try {
+			// Not own constructor property must be Object
+			if ( obj.constructor &&
+				!hasOwn.call(obj, "constructor") &&
+				!hasOwn.call(obj.constructor.prototype, "isPrototypeOf") ) {
+				return false;
+			}
+		} catch ( e ) {
+			// IE8,9 Will throw exceptions on certain host objects #9897
+			return false;
+		}
+
+		// Own properties are enumerated firstly, so to speed up,
+		// if last one is own, then all properties are own.
+
+		var key;
+		for ( key in obj ) {}
+
+		return key === undefined || hasOwn.call( obj, key );
+	},
+
+	isEmptyObject: function( obj ) {
+		for ( var name in obj ) {
+			return false;
+		}
+		return true;
+	},
+
+	error: function( msg ) {
+		throw new Error( msg );
+	},
+
+	parseJSON: function( data ) {
+		if ( typeof data !== "string" || !data ) {
+			return null;
+		}
+
+		// Make sure leading/trailing whitespace is removed (IE can't handle it)
+		data = jQuery.trim( data );
+
+		// Attempt to parse using the native JSON parser first
+		if ( window.JSON && window.JSON.parse ) {
+			return window.JSON.parse( data );
+		}
+
+		// Make sure the incoming data is actual JSON
+		// Logic borrowed from http://json.org/json2.js
+		if ( rvalidchars.test( data.replace( rvalidescape, "@" )
+			.replace( rvalidtokens, "]" )
+			.replace( rvalidbraces, "")) ) {
+
+			return ( new Function( "return " + data ) )();
+
+		}
+		jQuery.error( "Invalid JSON: " + data );
+	},
+
+	// Cross-browser xml parsing
+	parseXML: function( data ) {
+		if ( typeof data !== "string" || !data ) {
+			return null;
+		}
+		var xml, tmp;
+		try {
+			if ( window.DOMParser ) { // Standard
+				tmp = new DOMParser();
+				xml = tmp.parseFromString( data , "text/xml" );
+			} else { // IE
+				xml = new ActiveXObject( "Microsoft.XMLDOM" );
+				xml.async = "false";
+				xml.loadXML( data );
+			}
+		} catch( e ) {
+			xml = undefined;
+		}
+		if ( !xml || !xml.documentElement || xml.getElementsByTagName( "parsererror" ).length ) {
+			jQuery.error( "Invalid XML: " + data );
+		}
+		return xml;
+	},
+
+	noop: function() {},
+
+	// Evaluates a script in a global context
+	// Workarounds based on findings by Jim Driscoll
+	// http://weblogs.java.net/blog/driscoll/archive/2009/09/08/eval-javascript-global-context
+	globalEval: function( data ) {
+		if ( data && rnotwhite.test( data ) ) {
+			// We use execScript on Internet Explorer
+			// We use an anonymous function so that context is window
+			// rather than jQuery in Firefox
+			( window.execScript || function( data ) {
+				window[ "eval" ].call( window, data );
+			} )( data );
+		}
+	},
+
+	// Convert dashed to camelCase; used by the css and data modules
+	// Microsoft forgot to hump their vendor prefix (#9572)
+	camelCase: function( string ) {
+		return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase );
+	},
+
+	nodeName: function( elem, name ) {
+		return elem.nodeName && elem.nodeName.toUpperCase() === name.toUpperCase();
+	},
+
+	// args is for internal usage only
+	each: function( object, callback, args ) {
+		var name, i = 0,
+			length = object.length,
+			isObj = length === undefined || jQuery.isFunction( object );
+
+		if ( args ) {
+			if ( isObj ) {
+				for ( name in object ) {
+					if ( callback.apply( object[ name ], args ) === false ) {
+						break;
+					}
+				}
+			} else {
+				for ( ; i < length; ) {
+					if ( callback.apply( object[ i++ ], args ) === false ) {
+						break;
+					}
+				}
+			}
+
+		// A special, fast, case for the most common use of each
+		} else {
+			if ( isObj ) {
+				for ( name in object ) {
+					if ( callback.call( object[ name ], name, object[ name ] ) === false ) {
+						break;
+					}
+				}
+			} else {
+				for ( ; i < length; ) {
+					if ( callback.call( object[ i ], i, object[ i++ ] ) === false ) {
+						break;
+					}
+				}
+			}
+		}
+
+		return object;
+	},
+
+	// Use native String.trim function wherever possible
+	trim: trim ?
+		function( text ) {
+			return text == null ?
+				"" :
+				trim.call( text );
+		} :
+
+		// Otherwise use our own trimming functionality
+		function( text ) {
+			return text == null ?
+				"" :
+				text.toString().replace( trimLeft, "" ).replace( trimRight, "" );
+		},
+
+	// results is for internal usage only
+	makeArray: function( array, results ) {
+		var ret = results || [];
+
+		if ( array != null ) {
+			// The window, strings (and functions) also have 'length'
+			// Tweaked logic slightly to handle Blackberry 4.7 RegExp issues #6930
+			var type = jQuery.type( array );
+
+			if ( array.length == null || type === "string" || type === "function" || type === "regexp" || jQuery.isWindow( array ) ) {
+				push.call( ret, array );
+			} else {
+				jQuery.merge( ret, array );
+			}
+		}
+
+		return ret;
+	},
+
+	inArray: function( elem, array, i ) {
+		var len;
+
+		if ( array ) {
+			if ( indexOf ) {
+				return indexOf.call( array, elem, i );
+			}
+
+			len = array.length;
+			i = i ? i < 0 ? Math.max( 0, len + i ) : i : 0;
+
+			for ( ; i < len; i++ ) {
+				// Skip accessing in sparse arrays
+				if ( i in array && array[ i ] === elem ) {
+					return i;
+				}
+			}
+		}
+
+		return -1;
+	},
+
+	merge: function( first, second ) {
+		var i = first.length,
+			j = 0;
+
+		if ( typeof second.length === "number" ) {
+			for ( var l = second.length; j < l; j++ ) {
+				first[ i++ ] = second[ j ];
+			}
+
+		} else {
+			while ( second[j] !== undefined ) {
+				first[ i++ ] = second[ j++ ];
+			}
+		}
+
+		first.length = i;
+
+		return first;
+	},
+
+	grep: function( elems, callback, inv ) {
+		var ret = [], retVal;
+		inv = !!inv;
+
+		// Go through the array, only saving the items
+		// that pass the validator function
+		for ( var i = 0, length = elems.length; i < length; i++ ) {
+			retVal = !!callback( elems[ i ], i );
+			if ( inv !== retVal ) {
+				ret.push( elems[ i ] );
+			}
+		}
+
+		return ret;
+	},
+
+	// arg is for internal usage only
+	map: function( elems, callback, arg ) {
+		var value, key, ret = [],
+			i = 0,
+			length = elems.length,
+			// jquery objects are treated as arrays
+			isArray = elems instanceof jQuery || length !== undefined && typeof length === "number" && ( ( length > 0 && elems[ 0 ] && elems[ length -1 ] ) || length === 0 || jQuery.isArray( elems ) ) ;
+
+		// Go through the array, translating each of the items to their
+		if ( isArray ) {
+			for ( ; i < length; i++ ) {
+				value = callback( elems[ i ], i, arg );
+
+				if ( value != null ) {
+					ret[ ret.length ] = value;
+				}
+			}
+
+		// Go through every key on the object,
+		} else {
+			for ( key in elems ) {
+				value = callback( elems[ key ], key, arg );
+
+				if ( value != null ) {
+					ret[ ret.length ] = value;
+				}
+			}
+		}
+
+		// Flatten any nested arrays
+		return ret.concat.apply( [], ret );
+	},
+
+	// A global GUID counter for objects
+	guid: 1,
+
+	// Bind a function to a context, optionally partially applying any
+	// arguments.
+	proxy: function( fn, context ) {
+		if ( typeof context === "string" ) {
+			var tmp = fn[ context ];
+			context = fn;
+			fn = tmp;
+		}
+
+		// Quick check to determine if target is callable, in the spec
+		// this throws a TypeError, but we will just return undefined.
+		if ( !jQuery.isFunction( fn ) ) {
+			return undefined;
+		}
+
+		// Simulated bind
+		var args = slice.call( arguments, 2 ),
+			proxy = function() {
+				return fn.apply( context, args.concat( slice.call( arguments ) ) );
+			};
+
+		// Set the guid of unique handler to the same of original handler, so it can be removed
+		proxy.guid = fn.guid = fn.guid || proxy.guid || jQuery.guid++;
+
+		return proxy;
+	},
+
+	// Mutifunctional method to get and set values to a collection
+	// The value/s can optionally be executed if it's a function
+	access: function( elems, fn, key, value, chainable, emptyGet, pass ) {
+		var exec,
+			bulk = key == null,
+			i = 0,
+			length = elems.length;
+
+		// Sets many values
+		if ( key && typeof key === "object" ) {
+			for ( i in key ) {
+				jQuery.access( elems, fn, i, key[i], 1, emptyGet, value );
+			}
+			chainable = 1;
+
+		// Sets one value
+		} else if ( value !== undefined ) {
+			// Optionally, function values get executed if exec is true
+			exec = pass === undefined && jQuery.isFunction( value );
+
+			if ( bulk ) {
+				// Bulk operations only iterate when executing function values
+				if ( exec ) {
+					exec = fn;
+					fn = function( elem, key, value ) {
+						return exec.call( jQuery( elem ), value );
+					};
+
+				// Otherwise they run against the entire set
+				} else {
+					fn.call( elems, value );
+					fn = null;
+				}
+			}
+
+			if ( fn ) {
+				for (; i < length; i++ ) {
+					fn( elems[i], key, exec ? value.call( elems[i], i, fn( elems[i], key ) ) : value, pass );
+				}
+			}
+
+			chainable = 1;
+		}
+
+		return chainable ?
+			elems :
+
+			// Gets
+			bulk ?
+				fn.call( elems ) :
+				length ? fn( elems[0], key ) : emptyGet;
+	},
+
+	now: function() {
+		return ( new Date() ).getTime();
+	},
+
+	// Use of jQuery.browser is frowned upon.
+	// More details: http://docs.jquery.com/Utilities/jQuery.browser
+	uaMatch: function( ua ) {
+		ua = ua.toLowerCase();
+
+		var match = rwebkit.exec( ua ) ||
+			ropera.exec( ua ) ||
+			rmsie.exec( ua ) ||
+			ua.indexOf("compatible") < 0 && rmozilla.exec( ua ) ||
+			[];
+
+		return { browser: match[1] || "", version: match[2] || "0" };
+	},
+
+	sub: function() {
+		function jQuerySub( selector, context ) {
+			return new jQuerySub.fn.init( selector, context );
+		}
+		jQuery.extend( true, jQuerySub, this );
+		jQuerySub.superclass = this;
+		jQuerySub.fn = jQuerySub.prototype = this();
+		jQuerySub.fn.constructor = jQuerySub;
+		jQuerySub.sub = this.sub;
+		jQuerySub.fn.init = function init( selector, context ) {
+			if ( context && context instanceof jQuery && !(context instanceof jQuerySub) ) {
+				context = jQuerySub( context );
+			}
+
+			return jQuery.fn.init.call( this, selector, context, rootjQuerySub );
+		};
+		jQuerySub.fn.init.prototype = jQuerySub.fn;
+		var rootjQuerySub = jQuerySub(document);
+		return jQuerySub;
+	},
+
+	browser: {}
+});
+
+// Populate the class2type map
+jQuery.each("Boolean Number String Function Array Date RegExp Object".split(" "), function(i, name) {
+	class2type[ "[object " + name + "]" ] = name.toLowerCase();
+});
+
+browserMatch = jQuery.uaMatch( userAgent );
+if ( browserMatch.browser ) {
+	jQuery.browser[ browserMatch.browser ] = true;
+	jQuery.browser.version = browserMatch.version;
+}
+
+// Deprecated, use jQuery.browser.webkit instead
+if ( jQuery.browser.webkit ) {
+	jQuery.browser.safari = true;
+}
+
+// IE doesn't match non-breaking spaces with \s
+if ( rnotwhite.test( "\xA0" ) ) {
+	trimLeft = /^[\s\xA0]+/;
+	trimRight = /[\s\xA0]+$/;
+}
+
+// All jQuery objects should point back to these
+rootjQuery = jQuery(document);
+
+// Cleanup functions for the document ready method
+if ( document.addEventListener ) {
+	DOMContentLoaded = function() {
+		document.removeEventListener( "DOMContentLoaded", DOMContentLoaded, false );
+		jQuery.ready();
+	};
+
+} else if ( document.attachEvent ) {
+	DOMContentLoaded = function() {
+		// Make sure body exists, at least, in case IE gets a little overzealous (ticket #5443).
+		if ( document.readyState === "complete" ) {
+			document.detachEvent( "onreadystatechange", DOMContentLoaded );
+			jQuery.ready();
+		}
+	};
+}
+
+// The DOM ready check for Internet Explorer
+function doScrollCheck() {
+	if ( jQuery.isReady ) {
+		return;
+	}
+
+	try {
+		// If IE is used, use the trick by Diego Perini
+		// http://javascript.nwbox.com/IEContentLoaded/
+		document.documentElement.doScroll("left");
+	} catch(e) {
+		setTimeout( doScrollCheck, 1 );
+		return;
+	}
+
+	// and execute any waiting functions
+	jQuery.ready();
+}
+
+return jQuery;
+
+})();
+
+
+// String to Object flags format cache
+var flagsCache = {};
+
+// Convert String-formatted flags into Object-formatted ones and store in cache
+function createFlags( flags ) {
+	var object = flagsCache[ flags ] = {},
+		i, length;
+	flags = flags.split( /\s+/ );
+	for ( i = 0, length = flags.length; i < length; i++ ) {
+		object[ flags[i] ] = true;
+	}
+	return object;
+}
+
+/*
+ * Create a callback list using the following parameters:
+ *
+ *	flags:	an optional list of space-separated flags that will change how
+ *			the callback list behaves
+ *
+ * By default a callback list will act like an event callback list and can be
+ * "fired" multiple times.
+ *
+ * Possible flags:
+ *
+ *	once:			will ensure the callback list can only be fired once (like a Deferred)
+ *
+ *	memory:			will keep track of previous values and will call any callback added
+ *					after the list has been fired right away with the latest "memorized"
+ *					values (like a Deferred)
+ *
+ *	unique:			will ensure a callback can only be added once (no duplicate in the list)
+ *
+ *	stopOnFalse:	interrupt callings when a callback returns false
+ *
+ */
+jQuery.Callbacks = function( flags ) {
+
+	// Convert flags from String-formatted to Object-formatted
+	// (we check in cache first)
+	flags = flags ? ( flagsCache[ flags ] || createFlags( flags ) ) : {};
+
+	var // Actual callback list
+		list = [],
+		// Stack of fire calls for repeatable lists
+		stack = [],
+		// Last fire value (for non-forgettable lists)
+		memory,
+		// Flag to know if list was already fired
+		fired,
+		// Flag to know if list is currently firing
+		firing,
+		// First callback to fire (used internally by add and fireWith)
+		firingStart,
+		// End of the loop when firing
+		firingLength,
+		// Index of currently firing callback (modified by remove if needed)
+		firingIndex,
+		// Add one or several callbacks to the list
+		add = function( args ) {
+			var i,
+				length,
+				elem,
+				type,
+				actual;
+			for ( i = 0, length = args.length; i < length; i++ ) {
+				elem = args[ i ];
+				type = jQuery.type( elem );
+				if ( type === "array" ) {
+					// Inspect recursively
+					add( elem );
+				} else if ( type === "function" ) {
+					// Add if not in unique mode and callback is not in
+					if ( !flags.unique || !self.has( elem ) ) {
+						list.push( elem );
+					}
+				}
+			}
+		},
+		// Fire callbacks
+		fire = function( context, args ) {
+			args = args || [];
+			memory = !flags.memory || [ context, args ];
+			fired = true;
+			firing = true;
+			firingIndex = firingStart || 0;
+			firingStart = 0;
+			firingLength = list.length;
+			for ( ; list && firingIndex < firingLength; firingIndex++ ) {
+				if ( list[ firingIndex ].apply( context, args ) === false && flags.stopOnFalse ) {
+					memory = true; // Mark as halted
+					break;
+				}
+			}
+			firing = false;
+			if ( list ) {
+				if ( !flags.once ) {
+					if ( stack && stack.length ) {
+						memory = stack.shift();
+						self.fireWith( memory[ 0 ], memory[ 1 ] );
+					}
+				} else if ( memory === true ) {
+					self.disable();
+				} else {
+					list = [];
+				}
+			}
+		},
+		// Actual Callbacks object
+		self = {
+			// Add a callback or a collection of callbacks to the list
+			add: function() {
+				if ( list ) {
+					var length = list.length;
+					add( arguments );
+					// Do we need to add the callbacks to the
+					// current firing batch?
+					if ( firing ) {
+						firingLength = list.length;
+					// With memory, if we're not firing then
+					// we should call right away, unless previous
+					// firing was halted (stopOnFalse)
+					} else if ( memory && memory !== true ) {
+						firingStart = length;
+						fire( memory[ 0 ], memory[ 1 ] );
+					}
+				}
+				return this;
+			},
+			// Remove a callback from the list
+			remove: function() {
+				if ( list ) {
+					var args = arguments,
+						argIndex = 0,
+						argLength = args.length;
+					for ( ; argIndex < argLength ; argIndex++ ) {
+						for ( var i = 0; i < list.length; i++ ) {
+							if ( args[ argIndex ] === list[ i ] ) {
+								// Handle firingIndex and firingLength
+								if ( firing ) {
+									if ( i <= firingLength ) {
+										firingLength--;
+										if ( i <= firingIndex ) {
+											firingIndex--;
+										}
+									}
+								}
+								// Remove the element
+								list.splice( i--, 1 );
+								// If we have some unicity property then
+								// we only need to do this once
+								if ( flags.unique ) {
+									break;
+								}
+							}
+						}
+					}
+				}
+				return this;
+			},
+			// Control if a given callback is in the list
+			has: function( fn ) {
+				if ( list ) {
+					var i = 0,
+						length = list.length;
+					for ( ; i < length; i++ ) {
+						if ( fn === list[ i ] ) {
+							return true;
+						}
+					}
+				}
+				return false;
+			},
+			// Remove all callbacks from the list
+			empty: function() {
+				list = [];
+				return this;
+			},
+			// Have the list do nothing anymore
+			disable: function() {
+				list = stack = memory = undefined;
+				return this;
+			},
+			// Is it disabled?
+			disabled: function() {
+				return !list;
+			},
+			// Lock the list in its current state
+			lock: function() {
+				stack = undefined;
+				if ( !memory || memory === true ) {
+					self.disable();
+				}
+				return this;
+			},
+			// Is it locked?
+			locked: function() {
+				return !stack;
+			},
+			// Call all callbacks with the given context and arguments
+			fireWith: function( context, args ) {
+				if ( stack ) {
+					if ( firing ) {
+						if ( !flags.once ) {
+							stack.push( [ context, args ] );
+						}
+					} else if ( !( flags.once && memory ) ) {
+						fire( context, args );
+					}
+				}
+				return this;
+			},
+			// Call all the callbacks with the given arguments
+			fire: function() {
+				self.fireWith( this, arguments );
+				return this;
+			},
+			// To know if the callbacks have already been called at least once
+			fired: function() {
+				return !!fired;
+			}
+		};
+
+	return self;
+};
+
+
+
+
+var // Static reference to slice
+	sliceDeferred = [].slice;
+
+jQuery.extend({
+
+	Deferred: function( func ) {
+		var doneList = jQuery.Callbacks( "once memory" ),
+			failList = jQuery.Callbacks( "once memory" ),
+			progressList = jQuery.Callbacks( "memory" ),
+			state = "pending",
+			lists = {
+				resolve: doneList,
+				reject: failList,
+				notify: progressList
+			},
+			promise = {
+				done: doneList.add,
+				fail: failList.add,
+				progress: progressList.add,
+
+				state: function() {
+					return state;
+				},
+
+				// Deprecated
+				isResolved: doneList.fired,
+				isRejected: failList.fired,
+
+				then: function( doneCallbacks, failCallbacks, progressCallbacks ) {
+					deferred.done( doneCallbacks ).fail( failCallbacks ).progress( progressCallbacks );
+					return this;
+				},
+				always: function() {
+					deferred.done.apply( deferred, arguments ).fail.apply( deferred, arguments );
+					return this;
+				},
+				pipe: function( fnDone, fnFail, fnProgress ) {
+					return jQuery.Deferred(function( newDefer ) {
+						jQuery.each( {
+							done: [ fnDone, "resolve" ],
+							fail: [ fnFail, "reject" ],
+							progress: [ fnProgress, "notify" ]
+						}, function( handler, data ) {
+							var fn = data[ 0 ],
+								action = data[ 1 ],
+								returned;
+							if ( jQuery.isFunction( fn ) ) {
+								deferred[ handler ](function() {
+									returned = fn.apply( this, arguments );
+									if ( returned && jQuery.isFunction( returned.promise ) ) {
+										returned.promise().then( newDefer.resolve, newDefer.reject, newDefer.notify );
+									} else {
+										newDefer[ action + "With" ]( this === deferred ? newDefer : this, [ returned ] );
+									}
+								});
+							} else {
+								deferred[ handler ]( newDefer[ action ] );
+							}
+						});
+					}).promise();
+				},
+				// Get a promise for this deferred
+				// If obj is provided, the promise aspect is added to the object
+				promise: function( obj ) {
+					if ( obj == null ) {
+						obj = promise;
+					} else {
+						for ( var key in promise ) {
+							obj[ key ] = promise[ key ];
+						}
+					}
+					return obj;
+				}
+			},
+			deferred = promise.promise({}),
+			key;
+
+		for ( key in lists ) {
+			deferred[ key ] = lists[ key ].fire;
+			deferred[ key + "With" ] = lists[ key ].fireWith;
+		}
+
+		// Handle state
+		deferred.done( function() {
+			state = "resolved";
+		}, failList.disable, progressList.lock ).fail( function() {
+			state = "rejected";
+		}, doneList.disable, progressList.lock );
+
+		// Call given func if any
+		if ( func ) {
+			func.call( deferred, deferred );
+		}
+
+		// All done!
+		return deferred;
+	},
+
+	// Deferred helper
+	when: function( firstParam ) {
+		var args = sliceDeferred.call( arguments, 0 ),
+			i = 0,
+			length = args.length,
+			pValues = new Array( length ),
+			count = length,
+			pCount = length,
+			deferred = length <= 1 && firstParam && jQuery.isFunction( firstParam.promise ) ?
+				firstParam :
+				jQuery.Deferred(),
+			promise = deferred.promise();
+		function resolveFunc( i ) {
+			return function( value ) {
+				args[ i ] = arguments.length > 1 ? sliceDeferred.call( arguments, 0 ) : value;
+				if ( !( --count ) ) {
+					deferred.resolveWith( deferred, args );
+				}
+			};
+		}
+		function progressFunc( i ) {
+			return function( value ) {
+				pValues[ i ] = arguments.length > 1 ? sliceDeferred.call( arguments, 0 ) : value;
+				deferred.notifyWith( promise, pValues );
+			};
+		}
+		if ( length > 1 ) {
+			for ( ; i < length; i++ ) {
+				if ( args[ i ] && args[ i ].promise && jQuery.isFunction( args[ i ].promise ) ) {
+					args[ i ].promise().then( resolveFunc(i), deferred.reject, progressFunc(i) );
+				} else {
+					--count;
+				}
+			}
+			if ( !count ) {
+				deferred.resolveWith( deferred, args );
+			}
+		} else if ( deferred !== firstParam ) {
+			deferred.resolveWith( deferred, length ? [ firstParam ] : [] );
+		}
+		return promise;
+	}
+});
+
+
+
+
+jQuery.support = (function() {
+
+	var support,
+		all,
+		a,
+		select,
+		opt,
+		input,
+		fragment,
+		tds,
+		events,
+		eventName,
+		i,
+		isSupported,
+		div = document.createElement( "div" ),
+		documentElement = document.documentElement;
+
+	// Preliminary tests
+	div.setAttribute("className", "t");
+	div.innerHTML = "   <link/><table></table><a href='/a' style='top:1px;float:left;opacity:.55;'>a</a><input type='checkbox'/>";
+
+	all = div.getElementsByTagName( "*" );
+	a = div.getElementsByTagName( "a" )[ 0 ];
+
+	// Can't get basic test support
+	if ( !all || !all.length || !a ) {
+		return {};
+	}
+
+	// First batch of supports tests
+	select = document.createElement( "select" );
+	opt = select.appendChild( document.createElement("option") );
+	input = div.getElementsByTagName( "input" )[ 0 ];
+
+	support = {
+		// IE strips leading whitespace when .innerHTML is used
+		leadingWhitespace: ( div.firstChild.nodeType === 3 ),
+
+		// Make sure that tbody elements aren't automatically inserted
+		// IE will insert them into empty tables
+		tbody: !div.getElementsByTagName("tbody").length,
+
+		// Make sure that link elements get serialized correctly by innerHTML
+		// This requires a wrapper element in IE
+		htmlSerialize: !!div.getElementsByTagName("link").length,
+
+		// Get the style information from getAttribute
+		// (IE uses .cssText instead)
+		style: /top/.test( a.getAttribute("style") ),
+
+		// Make sure that URLs aren't manipulated
+		// (IE normalizes it by default)
+		hrefNormalized: ( a.getAttribute("href") === "/a" ),
+
+		// Make sure that element opacity exists
+		// (IE uses filter instead)
+		// Use a regex to work around a WebKit issue. See #5145
+		opacity: /^0.55/.test( a.style.opacity ),
+
+		// Verify style float existence
+		// (IE uses styleFloat instead of cssFloat)
+		cssFloat: !!a.style.cssFloat,
+
+		// Make sure that if no value is specified for a checkbox
+		// that it defaults to "on".
+		// (WebKit defaults to "" instead)
+		checkOn: ( input.value === "on" ),
+
+		// Make sure that a selected-by-default option has a working selected property.
+		// (WebKit defaults to false instead of true, IE too, if it's in an optgroup)
+		optSelected: opt.selected,
+
+		// Test setAttribute on camelCase class. If it works, we need attrFixes when doing get/setAttribute (ie6/7)
+		getSetAttribute: div.className !== "t",
+
+		// Tests for enctype support on a form(#6743)
+		enctype: !!document.createElement("form").enctype,
+
+		// Makes sure cloning an html5 element does not cause problems
+		// Where outerHTML is undefined, this still works
+		html5Clone: document.createElement("nav").cloneNode( true ).outerHTML !== "<:nav></:nav>",
+
+		// Will be defined later
+		submitBubbles: true,
+		changeBubbles: true,
+		focusinBubbles: false,
+		deleteExpando: true,
+		noCloneEvent: true,
+		inlineBlockNeedsLayout: false,
+		shrinkWrapBlocks: false,
+		reliableMarginRight: true,
+		pixelMargin: true
+	};
+
+	// jQuery.boxModel DEPRECATED in 1.3, use jQuery.support.boxModel instead
+	jQuery.boxModel = support.boxModel = (document.compatMode === "CSS1Compat");
+
+	// Make sure checked status is properly cloned
+	input.checked = true;
+	support.noCloneChecked = input.cloneNode( true ).checked;
+
+	// Make sure that the options inside disabled selects aren't marked as disabled
+	// (WebKit marks them as disabled)
+	select.disabled = true;
+	support.optDisabled = !opt.disabled;
+
+	// Test to see if it's possible to delete an expando from an element
+	// Fails in Internet Explorer
+	try {
+		delete div.test;
+	} catch( e ) {
+		support.deleteExpando = false;
+	}
+
+	if ( !div.addEventListener && div.attachEvent && div.fireEvent ) {
+		div.attachEvent( "onclick", function() {
+			// Cloning a node shouldn't copy over any
+			// bound event handlers (IE does this)
+			support.noCloneEvent = false;
+		});
+		div.cloneNode( true ).fireEvent( "onclick" );
+	}
+
+	// Check if a radio maintains its value
+	// after being appended to the DOM
+	input = document.createElement("input");
+	input.value = "t";
+	input.setAttribute("type", "radio");
+	support.radioValue = input.value === "t";
+
+	input.setAttribute("checked", "checked");
+
+	// #11217 - WebKit loses check when the name is after the checked attribute
+	input.setAttribute( "name", "t" );
+
+	div.appendChild( input );
+	fragment = document.createDocumentFragment();
+	fragment.appendChild( div.lastChild );
+
+	// WebKit doesn't clone checked state correctly in fragments
+	support.checkClone = fragment.cloneNode( true ).cloneNode( true ).lastChild.checked;
+
+	// Check if a disconnected checkbox will retain its checked
+	// value of true after appended to the DOM (IE6/7)
+	support.appendChecked = input.checked;
+
+	fragment.removeChild( input );
+	fragment.appendChild( div );
+
+	// Technique from Juriy Zaytsev
+	// http://perfectionkills.com/detecting-event-support-without-browser-sniffing/
+	// We only care about the case where non-standard event systems
+	// are used, namely in IE. Short-circuiting here helps us to
+	// avoid an eval call (in setAttribute) which can cause CSP
+	// to go haywire. See: https://developer.mozilla.org/en/Security/CSP
+	if ( div.attachEvent ) {
+		for ( i in {
+			submit: 1,
+			change: 1,
+			focusin: 1
+		}) {
+			eventName = "on" + i;
+			isSupported = ( eventName in div );
+			if ( !isSupported ) {
+				div.setAttribute( eventName, "return;" );
+				isSupported = ( typeof div[ eventName ] === "function" );
+			}
+			support[ i + "Bubbles" ] = isSupported;
+		}
+	}
+
+	fragment.removeChild( div );
+
+	// Null elements to avoid leaks in IE
+	fragment = select = opt = div = input = null;
+
+	// Run tests that need a body at doc ready
+	jQuery(function() {
+		var container, outer, inner, table, td, offsetSupport,
+			marginDiv, conMarginTop, style, html, positionTopLeftWidthHeight,
+			paddingMarginBorderVisibility, paddingMarginBorder,
+			body = document.getElementsByTagName("body")[0];
+
+		if ( !body ) {
+			// Return for frameset docs that don't have a body
+			return;
+		}
+
+		conMarginTop = 1;
+		paddingMarginBorder = "padding:0;margin:0;border:";
+		positionTopLeftWidthHeight = "position:absolute;top:0;left:0;width:1px;height:1px;";
+		paddingMarginBorderVisibility = paddingMarginBorder + "0;visibility:hidden;";
+		style = "style='" + positionTopLeftWidthHeight + paddingMarginBorder + "5px solid #000;";
+		html = "<div " + style + "display:block;'><div style='" + paddingMarginBorder + "0;display:block;overflow:hidden;'></div></div>" +
+			"<table " + style + "' cellpadding='0' cellspacing='0'>" +
+			"<tr><td></td></tr></table>";
+
+		container = document.createElement("div");
+		container.style.cssText = paddingMarginBorderVisibility + "width:0;height:0;position:static;top:0;margin-top:" + conMarginTop + "px";
+		body.insertBefore( container, body.firstChild );
+
+		// Construct the test element
+		div = document.createElement("div");
+		container.appendChild( div );
+
+		// Check if table cells still have offsetWidth/Height when they are set
+		// to display:none and there are still other visible table cells in a
+		// table row; if so, offsetWidth/Height are not reliable for use when
+		// determining if an element has been hidden directly using
+		// display:none (it is still safe to use offsets if a parent element is
+		// hidden; don safety goggles and see bug #4512 for more information).
+		// (only IE 8 fails this test)
+		div.innerHTML = "<table><tr><td style='" + paddingMarginBorder + "0;display:none'></td><td>t</td></tr></table>";
+		tds = div.getElementsByTagName( "td" );
+		isSupported = ( tds[ 0 ].offsetHeight === 0 );
+
+		tds[ 0 ].style.display = "";
+		tds[ 1 ].style.display = "none";
+
+		// Check if empty table cells still have offsetWidth/Height
+		// (IE <= 8 fail this test)
+		support.reliableHiddenOffsets = isSupported && ( tds[ 0 ].offsetHeight === 0 );
+
+		// Check if div with explicit width and no margin-right incorrectly
+		// gets computed margin-right based on width of container. For more
+		// info see bug #3333
+		// Fails in WebKit before Feb 2011 nightlies
+		// WebKit Bug 13343 - getComputedStyle returns wrong value for margin-right
+		if ( window.getComputedStyle ) {
+			div.innerHTML = "";
+			marginDiv = document.createElement( "div" );
+			marginDiv.style.width = "0";
+			marginDiv.style.marginRight = "0";
+			div.style.width = "2px";
+			div.appendChild( marginDiv );
+			support.reliableMarginRight =
+				( parseInt( ( window.getComputedStyle( marginDiv, null ) || { marginRight: 0 } ).marginRight, 10 ) || 0 ) === 0;
+		}
+
+		if ( typeof div.style.zoom !== "undefined" ) {
+			// Check if natively block-level elements act like inline-block
+			// elements when setting their display to 'inline' and giving
+			// them layout
+			// (IE < 8 does this)
+			div.innerHTML = "";
+			div.style.width = div.style.padding = "1px";
+			div.style.border = 0;
+			div.style.overflow = "hidden";
+			div.style.display = "inline";
+			div.style.zoom = 1;
+			support.inlineBlockNeedsLayout = ( div.offsetWidth === 3 );
+
+			// Check if elements with layout shrink-wrap their children
+			// (IE 6 does this)
+			div.style.display = "block";
+			div.style.overflow = "visible";
+			div.innerHTML = "<div style='width:5px;'></div>";
+			support.shrinkWrapBlocks = ( div.offsetWidth !== 3 );
+		}
+
+		div.style.cssText = positionTopLeftWidthHeight + paddingMarginBorderVisibility;
+		div.innerHTML = html;
+
+		outer = div.firstChild;
+		inner = outer.firstChild;
+		td = outer.nextSibling.firstChild.firstChild;
+
+		offsetSupport = {
+			doesNotAddBorder: ( inner.offsetTop !== 5 ),
+			doesAddBorderForTableAndCells: ( td.offsetTop === 5 )
+		};
+
+		inner.style.position = "fixed";
+		inner.style.top = "20px";
+
+		// safari subtracts parent border width here which is 5px
+		offsetSupport.fixedPosition = ( inner.offsetTop === 20 || inner.offsetTop === 15 );
+		inner.style.position = inner.style.top = "";
+
+		outer.style.overflow = "hidden";
+		outer.style.position = "relative";
+
+		offsetSupport.subtractsBorderForOverflowNotVisible = ( inner.offsetTop === -5 );
+		offsetSupport.doesNotIncludeMarginInBodyOffset = ( body.offsetTop !== conMarginTop );
+
+		if ( window.getComputedStyle ) {
+			div.style.marginTop = "1%";
+			support.pixelMargin = ( window.getComputedStyle( div, null ) || { marginTop: 0 } ).marginTop !== "1%";
+		}
+
+		if ( typeof container.style.zoom !== "undefined" ) {
+			container.style.zoom = 1;
+		}
+
+		body.removeChild( container );
+		marginDiv = div = container = null;
+
+		jQuery.extend( support, offsetSupport );
+	});
+
+	return support;
+})();
+
+
+
+
+var rbrace = /^(?:\{.*\}|\[.*\])$/,
+	rmultiDash = /([A-Z])/g;
+
+jQuery.extend({
+	cache: {},
+
+	// Please use with caution
+	uuid: 0,
+
+	// Unique for each copy of jQuery on the page
+	// Non-digits removed to match rinlinejQuery
+	expando: "jQuery" + ( jQuery.fn.jquery + Math.random() ).replace( /\D/g, "" ),
+
+	// The following elements throw uncatchable exceptions if you
+	// attempt to add expando properties to them.
+	noData: {
+		"embed": true,
+		// Ban all objects except for Flash (which handle expandos)
+		"object": "clsid:D27CDB6E-AE6D-11cf-96B8-444553540000",
+		"applet": true
+	},
+
+	hasData: function( elem ) {
+		elem = elem.nodeType ? jQuery.cache[ elem[jQuery.expando] ] : elem[ jQuery.expando ];
+		return !!elem && !isEmptyDataObject( elem );
+	},
+
+	data: function( elem, name, data, pvt /* Internal Use Only */ ) {
+		if ( !jQuery.acceptData( elem ) ) {
+			return;
+		}
+
+		var privateCache, thisCache, ret,
+			internalKey = jQuery.expando,
+			getByName = typeof name === "string",
+
+			// We have to handle DOM nodes and JS objects differently because IE6-7
+			// can't GC object references properly across the DOM-JS boundary
+			isNode = elem.nodeType,
+
+			// Only DOM nodes need the global jQuery cache; JS object data is
+			// attached directly to the object so GC can occur automatically
+			cache = isNode ? jQuery.cache : elem,
+
+			// Only defining an ID for JS objects if its cache already exists allows
+			// the code to shortcut on the same path as a DOM node with no cache
+			id = isNode ? elem[ internalKey ] : elem[ internalKey ] && internalKey,
+			isEvents = name === "events";
+
+		// Avoid doing any more work than we need to when trying to get data on an
+		// object that has no data at all
+		if ( (!id || !cache[id] || (!isEvents && !pvt && !cache[id].data)) && getByName && data === undefined ) {
+			return;
+		}
+
+		if ( !id ) {
+			// Only DOM nodes need a new unique ID for each element since their data
+			// ends up in the global cache
+			if ( isNode ) {
+				elem[ internalKey ] = id = ++jQuery.uuid;
+			} else {
+				id = internalKey;
+			}
+		}
+
+		if ( !cache[ id ] ) {
+			cache[ id ] = {};
+
+			// Avoids exposing jQuery metadata on plain JS objects when the object
+			// is serialized using JSON.stringify
+			if ( !isNode ) {
+				cache[ id ].toJSON = jQuery.noop;
+			}
+		}
+
+		// An object can be passed to jQuery.data instead of a key/value pair; this gets
+		// shallow copied over onto the existing cache
+		if ( typeof name === "object" || typeof name === "function" ) {
+			if ( pvt ) {
+				cache[ id ] = jQuery.extend( cache[ id ], name );
+			} else {
+				cache[ id ].data = jQuery.extend( cache[ id ].data, name );
+			}
+		}
+
+		privateCache = thisCache = cache[ id ];
+
+		// jQuery data() is stored in a separate object inside the object's internal data
+		// cache in order to avoid key collisions between internal data and user-defined
+		// data.
+		if ( !pvt ) {
+			if ( !thisCache.data ) {
+				thisCache.data = {};
+			}
+
+			thisCache = thisCache.data;
+		}
+
+		if ( data !== undefined ) {
+			thisCache[ jQuery.camelCase( name ) ] = data;
+		}
+
+		// Users should not attempt to inspect the internal events object using jQuery.data,
+		// it is undocumented and subject to change. But does anyone listen? No.
+		if ( isEvents && !thisCache[ name ] ) {
+			return privateCache.events;
+		}
+
+		// Check for both converted-to-camel and non-converted data property names
+		// If a data property was specified
+		if ( getByName ) {
+
+			// First Try to find as-is property data
+			ret = thisCache[ name ];
+
+			// Test for null|undefined property data
+			if ( ret == null ) {
+
+				// Try to find the camelCased property
+				ret = thisCache[ jQuery.camelCase( name ) ];
+			}
+		} else {
+			ret = thisCache;
+		}
+
+		return ret;
+	},
+
+	removeData: function( elem, name, pvt /* Internal Use Only */ ) {
+		if ( !jQuery.acceptData( elem ) ) {
+			return;
+		}
+
+		var thisCache, i, l,
+
+			// Reference to internal data cache key
+			internalKey = jQuery.expando,
+
+			isNode = elem.nodeType,
+
+			// See jQuery.data for more information
+			cache = isNode ? jQuery.cache : elem,
+
+			// See jQuery.data for more information
+			id = isNode ? elem[ internalKey ] : internalKey;
+
+		// If there is already no cache entry for this object, there is no
+		// purpose in continuing
+		if ( !cache[ id ] ) {
+			return;
+		}
+
+		if ( name ) {
+
+			thisCache = pvt ? cache[ id ] : cache[ id ].data;
+
+			if ( thisCache ) {
+
+				// Support array or space separated string names for data keys
+				if ( !jQuery.isArray( name ) ) {
+
+					// try the string as a key before any manipulation
+					if ( name in thisCache ) {
+						name = [ name ];
+					} else {
+
+						// split the camel cased version by spaces unless a key with the spaces exists
+						name = jQuery.camelCase( name );
+						if ( name in thisCache ) {
+							name = [ name ];
+						} else {
+							name = name.split( " " );
+						}
+					}
+				}
+
+				for ( i = 0, l = name.length; i < l; i++ ) {
+					delete thisCache[ name[i] ];
+				}
+
+				// If there is no data left in the cache, we want to continue
+				// and let the cache object itself get destroyed
+				if ( !( pvt ? isEmptyDataObject : jQuery.isEmptyObject )( thisCache ) ) {
+					return;
+				}
+			}
+		}
+
+		// See jQuery.data for more information
+		if ( !pvt ) {
+			delete cache[ id ].data;
+
+			// Don't destroy the parent cache unless the internal data object
+			// had been the only thing left in it
+			if ( !isEmptyDataObject(cache[ id ]) ) {
+				return;
+			}
+		}
+
+		// Browsers that fail expando deletion also refuse to delete expandos on
+		// the window, but it will allow it on all other JS objects; other browsers
+		// don't care
+		// Ensure that `cache` is not a window object #10080
+		if ( jQuery.support.deleteExpando || !cache.setInterval ) {
+			delete cache[ id ];
+		} else {
+			cache[ id ] = null;
+		}
+
+		// We destroyed the cache and need to eliminate the expando on the node to avoid
+		// false lookups in the cache for entries that no longer exist
+		if ( isNode ) {
+			// IE does not allow us to delete expando properties from nodes,
+			// nor does it have a removeAttribute function on Document nodes;
+			// we must handle all of these cases
+			if ( jQuery.support.deleteExpando ) {
+				delete elem[ internalKey ];
+			} else if ( elem.removeAttribute ) {
+				elem.removeAttribute( internalKey );
+			} else {
+				elem[ internalKey ] = null;
+			}
+		}
+	},
+
+	// For internal use only.
+	_data: function( elem, name, data ) {
+		return jQuery.data( elem, name, data, true );
+	},
+
+	// A method for determining if a DOM node can handle the data expando
+	acceptData: function( elem ) {
+		if ( elem.nodeName ) {
+			var match = jQuery.noData[ elem.nodeName.toLowerCase() ];
+
+			if ( match ) {
+				return !(match === true || elem.getAttribute("classid") !== match);
+			}
+		}
+
+		return true;
+	}
+});
+
+jQuery.fn.extend({
+	data: function( key, value ) {
+		var parts, part, attr, name, l,
+			elem = this[0],
+			i = 0,
+			data = null;
+
+		// Gets all values
+		if ( key === undefined ) {
+			if ( this.length ) {
+				data = jQuery.data( elem );
+
+				if ( elem.nodeType === 1 && !jQuery._data( elem, "parsedAttrs" ) ) {
+					attr = elem.attributes;
+					for ( l = attr.length; i < l; i++ ) {
+						name = attr[i].name;
+
+						if ( name.indexOf( "data-" ) === 0 ) {
+							name = jQuery.camelCase( name.substring(5) );
+
+							dataAttr( elem, name, data[ name ] );
+						}
+					}
+					jQuery._data( elem, "parsedAttrs", true );
+				}
+			}
+
+			return data;
+		}
+
+		// Sets multiple values
+		if ( typeof key === "object" ) {
+			return this.each(function() {
+				jQuery.data( this, key );
+			});
+		}
+
+		parts = key.split( ".", 2 );
+		parts[1] = parts[1] ? "." + parts[1] : "";
+		part = parts[1] + "!";
+
+		return jQuery.access( this, function( value ) {
+
+			if ( value === undefined ) {
+				data = this.triggerHandler( "getData" + part, [ parts[0] ] );
+
+				// Try to fetch any internally stored data first
+				if ( data === undefined && elem ) {
+					data = jQuery.data( elem, key );
+					data = dataAttr( elem, key, data );
+				}
+
+				return data === undefined && parts[1] ?
+					this.data( parts[0] ) :
+					data;
+			}
+
+			parts[1] = value;
+			this.each(function() {
+				var self = jQuery( this );
+
+				self.triggerHandler( "setData" + part, parts );
+				jQuery.data( this, key, value );
+				self.triggerHandler( "changeData" + part, parts );
+			});
+		}, null, value, arguments.length > 1, null, false );
+	},
+
+	removeData: function( key ) {
+		return this.each(function() {
+			jQuery.removeData( this, key );
+		});
+	}
+});
+
+function dataAttr( elem, key, data ) {
+	// If nothing was found internally, try to fetch any
+	// data from the HTML5 data-* attribute
+	if ( data === undefined && elem.nodeType === 1 ) {
+
+		var name = "data-" + key.replace( rmultiDash, "-$1" ).toLowerCase();
+
+		data = elem.getAttribute( name );
+
+		if ( typeof data === "string" ) {
+			try {
+				data = data === "true" ? true :
+				data === "false" ? false :
+				data === "null" ? null :
+				jQuery.isNumeric( data ) ? +data :
+					rbrace.test( data ) ? jQuery.parseJSON( data ) :
+					data;
+			} catch( e ) {}
+
+			// Make sure we set the data so it isn't changed later
+			jQuery.data( elem, key, data );
+
+		} else {
+			data = undefined;
+		}
+	}
+
+	return data;
+}
+
+// checks a cache object for emptiness
+function isEmptyDataObject( obj ) {
+	for ( var name in obj ) {
+
+		// if the public data object is empty, the private is still empty
+		if ( name === "data" && jQuery.isEmptyObject( obj[name] ) ) {
+			continue;
+		}
+		if ( name !== "toJSON" ) {
+			return false;
+		}
+	}
+
+	return true;
+}
+
+
+
+
+function handleQueueMarkDefer( elem, type, src ) {
+	var deferDataKey = type + "defer",
+		queueDataKey = type + "queue",
+		markDataKey = type + "mark",
+		defer = jQuery._data( elem, deferDataKey );
+	if ( defer &&
+		( src === "queue" || !jQuery._data(elem, queueDataKey) ) &&
+		( src === "mark" || !jQuery._data(elem, markDataKey) ) ) {
+		// Give room for hard-coded callbacks to fire first
+		// and eventually mark/queue something else on the element
+		setTimeout( function() {
+			if ( !jQuery._data( elem, queueDataKey ) &&
+				!jQuery._data( elem, markDataKey ) ) {
+				jQuery.removeData( elem, deferDataKey, true );
+				defer.fire();
+			}
+		}, 0 );
+	}
+}
+
+jQuery.extend({
+
+	_mark: function( elem, type ) {
+		if ( elem ) {
+			type = ( type || "fx" ) + "mark";
+			jQuery._data( elem, type, (jQuery._data( elem, type ) || 0) + 1 );
+		}
+	},
+
+	_unmark: function( force, elem, type ) {
+		if ( force !== true ) {
+			type = elem;
+			elem = force;
+			force = false;
+		}
+		if ( elem ) {
+			type = type || "fx";
+			var key = type + "mark",
+				count = force ? 0 : ( (jQuery._data( elem, key ) || 1) - 1 );
+			if ( count ) {
+				jQuery._data( elem, key, count );
+			} else {
+				jQuery.removeData( elem, key, true );
+				handleQueueMarkDefer( elem, type, "mark" );
+			}
+		}
+	},
+
+	queue: function( elem, type, data ) {
+		var q;
+		if ( elem ) {
+			type = ( type || "fx" ) + "queue";
+			q = jQuery._data( elem, type );
+
+			// Speed up dequeue by getting out quickly if this is just a lookup
+			if ( data ) {
+				if ( !q || jQuery.isArray(data) ) {
+					q = jQuery._data( elem, type, jQuery.makeArray(data) );
+				} else {
+					q.push( data );
+				}
+			}
+			return q || [];
+		}
+	},
+
+	dequeue: function( elem, type ) {
+		type = type || "fx";
+
+		var queue = jQuery.queue( elem, type ),
+			fn = queue.shift(),
+			hooks = {};
+
+		// If the fx queue is dequeued, always remove the progress sentinel
+		if ( fn === "inprogress" ) {
+			fn = queue.shift();
+		}
+
+		if ( fn ) {
+			// Add a progress sentinel to prevent the fx queue from being
+			// automatically dequeued
+			if ( type === "fx" ) {
+				queue.unshift( "inprogress" );
+			}
+
+			jQuery._data( elem, type + ".run", hooks );
+			fn.call( elem, function() {
+				jQuery.dequeue( elem, type );
+			}, hooks );
+		}
+
+		if ( !queue.length ) {
+			jQuery.removeData( elem, type + "queue " + type + ".run", true );
+			handleQueueMarkDefer( elem, type, "queue" );
+		}
+	}
+});
+
+jQuery.fn.extend({
+	queue: function( type, data ) {
+		var setter = 2;
+
+		if ( typeof type !== "string" ) {
+			data = type;
+			type = "fx";
+			setter--;
+		}
+
+		if ( arguments.length < setter ) {
+			return jQuery.queue( this[0], type );
+		}
+
+		return data === undefined ?
+			this :
+			this.each(function() {
+				var queue = jQuery.queue( this, type, data );
+
+				if ( type === "fx" && queue[0] !== "inprogress" ) {
+					jQuery.dequeue( this, type );
+				}
+			});
+	},
+	dequeue: function( type ) {
+		return this.each(function() {
+			jQuery.dequeue( this, type );
+		});
+	},
+	// Based off of the plugin by Clint Helfers, with permission.
+	// http://blindsignals.com/index.php/2009/07/jquery-delay/
+	delay: function( time, type ) {
+		time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time;
+		type = type || "fx";
+
+		return this.queue( type, function( next, hooks ) {
+			var timeout = setTimeout( next, time );
+			hooks.stop = function() {
+				clearTimeout( timeout );
+			};
+		});
+	},
+	clearQueue: function( type ) {
+		return this.queue( type || "fx", [] );
+	},
+	// Get a promise resolved when queues of a certain type
+	// are emptied (fx is the type by default)
+	promise: function( type, object ) {
+		if ( typeof type !== "string" ) {
+			object = type;
+			type = undefined;
+		}
+		type = type || "fx";
+		var defer = jQuery.Deferred(),
+			elements = this,
+			i = elements.length,
+			count = 1,
+			deferDataKey = type + "defer",
+			queueDataKey = type + "queue",
+			markDataKey = type + "mark",
+			tmp;
+		function resolve() {
+			if ( !( --count ) ) {
+				defer.resolveWith( elements, [ elements ] );
+			}
+		}
+		while( i-- ) {
+			if (( tmp = jQuery.data( elements[ i ], deferDataKey, undefined, true ) ||
+					( jQuery.data( elements[ i ], queueDataKey, undefined, true ) ||
+						jQuery.data( elements[ i ], markDataKey, undefined, true ) ) &&
+					jQuery.data( elements[ i ], deferDataKey, jQuery.Callbacks( "once memory" ), true ) )) {
+				count++;
+				tmp.add( resolve );
+			}
+		}
+		resolve();
+		return defer.promise( object );
+	}
+});
+
+
+
+
+var rclass = /[\n\t\r]/g,
+	rspace = /\s+/,
+	rreturn = /\r/g,
+	rtype = /^(?:button|input)$/i,
+	rfocusable = /^(?:button|input|object|select|textarea)$/i,
+	rclickable = /^a(?:rea)?$/i,
+	rboolean = /^(?:autofocus|autoplay|async|checked|controls|defer|disabled|hidden|loop|multiple|open|readonly|required|scoped|selected)$/i,
+	getSetAttribute = jQuery.support.getSetAttribute,
+	nodeHook, boolHook, fixSpecified;
+
+jQuery.fn.extend({
+	attr: function( name, value ) {
+		return jQuery.access( this, jQuery.attr, name, value, arguments.length > 1 );
+	},
+
+	removeAttr: function( name ) {
+		return this.each(function() {
+			jQuery.removeAttr( this, name );
+		});
+	},
+
+	prop: function( name, value ) {
+		return jQuery.access( this, jQuery.prop, name, value, arguments.length > 1 );
+	},
+
+	removeProp: function( name ) {
+		name = jQuery.propFix[ name ] || name;
+		return this.each(function() {
+			// try/catch handles cases where IE balks (such as removing a property on window)
+			try {
+				this[ name ] = undefined;
+				delete this[ name ];
+			} catch( e ) {}
+		});
+	},
+
+	addClass: function( value ) {
+		var classNames, i, l, elem,
+			setClass, c, cl;
+
+		if ( jQuery.isFunction( value ) ) {
+			return this.each(function( j ) {
+				jQuery( this ).addClass( value.call(this, j, this.className) );
+			});
+		}
+
+		if ( value && typeof value === "string" ) {
+			classNames = value.split( rspace );
+
+			for ( i = 0, l = this.length; i < l; i++ ) {
+				elem = this[ i ];
+
+				if ( elem.nodeType === 1 ) {
+					if ( !elem.className && classNames.length === 1 ) {
+						elem.className = value;
+
+					} else {
+						setClass = " " + elem.className + " ";
+
+						for ( c = 0, cl = classNames.length; c < cl; c++ ) {
+							if ( !~setClass.indexOf( " " + classNames[ c ] + " " ) ) {
+								setClass += classNames[ c ] + " ";
+							}
+						}
+						elem.className = jQuery.trim( setClass );
+					}
+				}
+			}
+		}
+
+		return this;
+	},
+
+	removeClass: function( value ) {
+		var classNames, i, l, elem, className, c, cl;
+
+		if ( jQuery.isFunction( value ) ) {
+			return this.each(function( j ) {
+				jQuery( this ).removeClass( value.call(this, j, this.className) );
+			});
+		}
+
+		if ( (value && typeof value === "string") || value === undefined ) {
+			classNames = ( value || "" ).split( rspace );
+
+			for ( i = 0, l = this.length; i < l; i++ ) {
+				elem = this[ i ];
+
+				if ( elem.nodeType === 1 && elem.className ) {
+					if ( value ) {
+						className = (" " + elem.className + " ").replace( rclass, " " );
+						for ( c = 0, cl = classNames.length; c < cl; c++ ) {
+							className = className.replace(" " + classNames[ c ] + " ", " ");
+						}
+						elem.className = jQuery.trim( className );
+
+					} else {
+						elem.className = "";
+					}
+				}
+			}
+		}
+
+		return this;
+	},
+
+	toggleClass: function( value, stateVal ) {
+		var type = typeof value,
+			isBool = typeof stateVal === "boolean";
+
+		if ( jQuery.isFunction( value ) ) {
+			return this.each(function( i ) {
+				jQuery( this ).toggleClass( value.call(this, i, this.className, stateVal), stateVal );
+			});
+		}
+
+		return this.each(function() {
+			if ( type === "string" ) {
+				// toggle individual class names
+				var className,
+					i = 0,
+					self = jQuery( this ),
+					state = stateVal,
+					classNames = value.split( rspace );
+
+				while ( (className = classNames[ i++ ]) ) {
+					// check each className given, space seperated list
+					state = isBool ? state : !self.hasClass( className );
+					self[ state ? "addClass" : "removeClass" ]( className );
+				}
+
+			} else if ( type === "undefined" || type === "boolean" ) {
+				if ( this.className ) {
+					// store className if set
+					jQuery._data( this, "__className__", this.className );
+				}
+
+				// toggle whole className
+				this.className = this.className || value === false ? "" : jQuery._data( this, "__className__" ) || "";
+			}
+		});
+	},
+
+	hasClass: function( selector ) {
+		var className = " " + selector + " ",
+			i = 0,
+			l = this.length;
+		for ( ; i < l; i++ ) {
+			if ( this[i].nodeType === 1 && (" " + this[i].className + " ").replace(rclass, " ").indexOf( className ) > -1 ) {
+				return true;
+			}
+		}
+
+		return false;
+	},
+
+	val: function( value ) {
+		var hooks, ret, isFunction,
+			elem = this[0];
+
+		if ( !arguments.length ) {
+			if ( elem ) {
+				hooks = jQuery.valHooks[ elem.type ] || jQuery.valHooks[ elem.nodeName.toLowerCase() ];
+
+				if ( hooks && "get" in hooks && (ret = hooks.get( elem, "value" )) !== undefined ) {
+					return ret;
+				}
+
+				ret = elem.value;
+
+				return typeof ret === "string" ?
+					// handle most common string cases
+					ret.replace(rreturn, "") :
+					// handle cases where value is null/undef or number
+					ret == null ? "" : ret;
+			}
+
+			return;
+		}
+
+		isFunction = jQuery.isFunction( value );
+
+		return this.each(function( i ) {
+			var self = jQuery(this), val;
+
+			if ( this.nodeType !== 1 ) {
+				return;
+			}
+
+			if ( isFunction ) {
+				val = value.call( this, i, self.val() );
+			} else {
+				val = value;
+			}
+
+			// Treat null/undefined as ""; convert numbers to string
+			if ( val == null ) {
+				val = "";
+			} else if ( typeof val === "number" ) {
+				val += "";
+			} else if ( jQuery.isArray( val ) ) {
+				val = jQuery.map(val, function ( value ) {
+					return value == null ? "" : value + "";
+				});
+			}
+
+			hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ];
+
+			// If set returns undefined, fall back to normal setting
+			if ( !hooks || !("set" in hooks) || hooks.set( this, val, "value" ) === undefined ) {
+				this.value = val;
+			}
+		});
+	}
+});
+
+jQuery.extend({
+	valHooks: {
+		option: {
+			get: function( elem ) {
+				// attributes.value is undefined in Blackberry 4.7 but
+				// uses .value. See #6932
+				var val = elem.attributes.value;
+				return !val || val.specified ? elem.value : elem.text;
+			}
+		},
+		select: {
+			get: function( elem ) {
+				var value, i, max, option,
+					index = elem.selectedIndex,
+					values = [],
+					options = elem.options,
+					one = elem.type === "select-one";
+
+				// Nothing was selected
+				if ( index < 0 ) {
+					return null;
+				}
+
+				// Loop through all the selected options
+				i = one ? index : 0;
+				max = one ? index + 1 : options.length;
+				for ( ; i < max; i++ ) {
+					option = options[ i ];
+
+					// Don't return options that are disabled or in a disabled optgroup
+					if ( option.selected && (jQuery.support.optDisabled ? !option.disabled : option.getAttribute("disabled") === null) &&
+							(!option.parentNode.disabled || !jQuery.nodeName( option.parentNode, "optgroup" )) ) {
+
+						// Get the specific value for the option
+						value = jQuery( option ).val();
+
+						// We don't need an array for one selects
+						if ( one ) {
+							return value;
+						}
+
+						// Multi-Selects return an array
+						values.push( value );
+					}
+				}
+
+				// Fixes Bug #2551 -- select.val() broken in IE after form.reset()
+				if ( one && !values.length && options.length ) {
+					return jQuery( options[ index ] ).val();
+				}
+
+				return values;
+			},
+
+			set: function( elem, value ) {
+				var values = jQuery.makeArray( value );
+
+				jQuery(elem).find("option").each(function() {
+					this.selected = jQuery.inArray( jQuery(this).val(), values ) >= 0;
+				});
+
+				if ( !values.length ) {
+					elem.selectedIndex = -1;
+				}
+				return values;
+			}
+		}
+	},
+
+	attrFn: {
+		val: true,
+		css: true,
+		html: true,
+		text: true,
+		data: true,
+		width: true,
+		height: true,
+		offset: true
+	},
+
+	attr: function( elem, name, value, pass ) {
+		var ret, hooks, notxml,
+			nType = elem.nodeType;
+
+		// don't get/set attributes on text, comment and attribute nodes
+		if ( !elem || nType === 3 || nType === 8 || nType === 2 ) {
+			return;
+		}
+
+		if ( pass && name in jQuery.attrFn ) {
+			return jQuery( elem )[ name ]( value );
+		}
+
+		// Fallback to prop when attributes are not supported
+		if ( typeof elem.getAttribute === "undefined" ) {
+			return jQuery.prop( elem, name, value );
+		}
+
+		notxml = nType !== 1 || !jQuery.isXMLDoc( elem );
+
+		// All attributes are lowercase
+		// Grab necessary hook if one is defined
+		if ( notxml ) {
+			name = name.toLowerCase();
+			hooks = jQuery.attrHooks[ name ] || ( rboolean.test( name ) ? boolHook : nodeHook );
+		}
+
+		if ( value !== undefined ) {
+
+			if ( value === null ) {
+				jQuery.removeAttr( elem, name );
+				return;
+
+			} else if ( hooks && "set" in hooks && notxml && (ret = hooks.set( elem, value, name )) !== undefined ) {
+				return ret;
+
+			} else {
+				elem.setAttribute( name, "" + value );
+				return value;
+			}
+
+		} else if ( hooks && "get" in hooks && notxml && (ret = hooks.get( elem, name )) !== null ) {
+			return ret;
+
+		} else {
+
+			ret = elem.getAttribute( name );
+
+			// Non-existent attributes return null, we normalize to undefined
+			return ret === null ?
+				undefined :
+				ret;
+		}
+	},
+
+	removeAttr: function( elem, value ) {
+		var propName, attrNames, name, l, isBool,
+			i = 0;
+
+		if ( value && elem.nodeType === 1 ) {
+			attrNames = value.toLowerCase().split( rspace );
+			l = attrNames.length;
+
+			for ( ; i < l; i++ ) {
+				name = attrNames[ i ];
+
+				if ( name ) {
+					propName = jQuery.propFix[ name ] || name;
+					isBool = rboolean.test( name );
+
+					// See #9699 for explanation of this approach (setting first, then removal)
+					// Do not do this for boolean attributes (see #10870)
+					if ( !isBool ) {
+						jQuery.attr( elem, name, "" );
+					}
+					elem.removeAttribute( getSetAttribute ? name : propName );
+
+					// Set corresponding property to false for boolean attributes
+					if ( isBool && propName in elem ) {
+						elem[ propName ] = false;
+					}
+				}
+			}
+		}
+	},
+
+	attrHooks: {
+		type: {
+			set: function( elem, value ) {
+				// We can't allow the type property to be changed (since it causes problems in IE)
+				if ( rtype.test( elem.nodeName ) && elem.parentNode ) {
+					jQuery.error( "type property can't be changed" );
+				} else if ( !jQuery.support.radioValue && value === "radio" && jQuery.nodeName(elem, "input") ) {
+					// Setting the type on a radio button after the value resets the value in IE6-9
+					// Reset value to it's default in case type is set after value
+					// This is for element creation
+					var val = elem.value;
+					elem.setAttribute( "type", value );
+					if ( val ) {
+						elem.value = val;
+					}
+					return value;
+				}
+			}
+		},
+		// Use the value property for back compat
+		// Use the nodeHook for button elements in IE6/7 (#1954)
+		value: {
+			get: function( elem, name ) {
+				if ( nodeHook && jQuery.nodeName( elem, "button" ) ) {
+					return nodeHook.get( elem, name );
+				}
+				return name in elem ?
+					elem.value :
+					null;
+			},
+			set: function( elem, value, name ) {
+				if ( nodeHook && jQuery.nodeName( elem, "button" ) ) {
+					return nodeHook.set( elem, value, name );
+				}
+				// Does not return so that setAttribute is also used
+				elem.value = value;
+			}
+		}
+	},
+
+	propFix: {
+		tabindex: "tabIndex",
+		readonly: "readOnly",
+		"for": "htmlFor",
+		"class": "className",
+		maxlength: "maxLength",
+		cellspacing: "cellSpacing",
+		cellpadding: "cellPadding",
+		rowspan: "rowSpan",
+		colspan: "colSpan",
+		usemap: "useMap",
+		frameborder: "frameBorder",
+		contenteditable: "contentEditable"
+	},
+
+	prop: function( elem, name, value ) {
+		var ret, hooks, notxml,
+			nType = elem.nodeType;
+
+		// don't get/set properties on text, comment and attribute nodes
+		if ( !elem || nType === 3 || nType === 8 || nType === 2 ) {
+			return;
+		}
+
+		notxml = nType !== 1 || !jQuery.isXMLDoc( elem );
+
+		if ( notxml ) {
+			// Fix name and attach hooks
+			name = jQuery.propFix[ name ] || name;
+			hooks = jQuery.propHooks[ name ];
+		}
+
+		if ( value !== undefined ) {
+			if ( hooks && "set" in hooks && (ret = hooks.set( elem, value, name )) !== undefined ) {
+				return ret;
+
+			} else {
+				return ( elem[ name ] = value );
+			}
+
+		} else {
+			if ( hooks && "get" in hooks && (ret = hooks.get( elem, name )) !== null ) {
+				return ret;
+
+			} else {
+				return elem[ name ];
+			}
+		}
+	},
+
+	propHooks: {
+		tabIndex: {
+			get: function( elem ) {
+				// elem.tabIndex doesn't always return the correct value when it hasn't been explicitly set
+				// http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/
+				var attributeNode = elem.getAttributeNode("tabindex");
+
+				return attributeNode && attributeNode.specified ?
+					parseInt( attributeNode.value, 10 ) :
+					rfocusable.test( elem.nodeName ) || rclickable.test( elem.nodeName ) && elem.href ?
+						0 :
+						undefined;
+			}
+		}
+	}
+});
+
+// Add the tabIndex propHook to attrHooks for back-compat (different case is intentional)
+jQuery.attrHooks.tabindex = jQuery.propHooks.tabIndex;
+
+// Hook for boolean attributes
+boolHook = {
+	get: function( elem, name ) {
+		// Align boolean attributes with corresponding properties
+		// Fall back to attribute presence where some booleans are not supported
+		var attrNode,
+			property = jQuery.prop( elem, name );
+		return property === true || typeof property !== "boolean" && ( attrNode = elem.getAttributeNode(name) ) && attrNode.nodeValue !== false ?
+			name.toLowerCase() :
+			undefined;
+	},
+	set: function( elem, value, name ) {
+		var propName;
+		if ( value === false ) {
+			// Remove boolean attributes when set to false
+			jQuery.removeAttr( elem, name );
+		} else {
+			// value is true since we know at this point it's type boolean and not false
+			// Set boolean attributes to the same name and set the DOM property
+			propName = jQuery.propFix[ name ] || name;
+			if ( propName in elem ) {
+				// Only set the IDL specifically if it already exists on the element
+				elem[ propName ] = true;
+			}
+
+			elem.setAttribute( name, name.toLowerCase() );
+		}
+		return name;
+	}
+};
+
+// IE6/7 do not support getting/setting some attributes with get/setAttribute
+if ( !getSetAttribute ) {
+
+	fixSpecified = {
+		name: true,
+		id: true,
+		coords: true
+	};
+
+	// Use this for any attribute in IE6/7
+	// This fixes almost every IE6/7 issue
+	nodeHook = jQuery.valHooks.button = {
+		get: function( elem, name ) {
+			var ret;
+			ret = elem.getAttributeNode( name );
+			return ret && ( fixSpecified[ name ] ? ret.nodeValue !== "" : ret.specified ) ?
+				ret.nodeValue :
+				undefined;
+		},
+		set: function( elem, value, name ) {
+			// Set the existing or create a new attribute node
+			var ret = elem.getAttributeNode( name );
+			if ( !ret ) {
+				ret = document.createAttribute( name );
+				elem.setAttributeNode( ret );
+			}
+			return ( ret.nodeValue = value + "" );
+		}
+	};
+
+	// Apply the nodeHook to tabindex
+	jQuery.attrHooks.tabindex.set = nodeHook.set;
+
+	// Set width and height to auto instead of 0 on empty string( Bug #8150 )
+	// This is for removals
+	jQuery.each([ "width", "height" ], function( i, name ) {
+		jQuery.attrHooks[ name ] = jQuery.extend( jQuery.attrHooks[ name ], {
+			set: function( elem, value ) {
+				if ( value === "" ) {
+					elem.setAttribute( name, "auto" );
+					return value;
+				}
+			}
+		});
+	});
+
+	// Set contenteditable to false on removals(#10429)
+	// Setting to empty string throws an error as an invalid value
+	jQuery.attrHooks.contenteditable = {
+		get: nodeHook.get,
+		set: function( elem, value, name ) {
+			if ( value === "" ) {
+				value = "false";
+			}
+			nodeHook.set( elem, value, name );
+		}
+	};
+}
+
+
+// Some attributes require a special call on IE
+if ( !jQuery.support.hrefNormalized ) {
+	jQuery.each([ "href", "src", "width", "height" ], function( i, name ) {
+		jQuery.attrHooks[ name ] = jQuery.extend( jQuery.attrHooks[ name ], {
+			get: function( elem ) {
+				var ret = elem.getAttribute( name, 2 );
+				return ret === null ? undefined : ret;
+			}
+		});
+	});
+}
+
+if ( !jQuery.support.style ) {
+	jQuery.attrHooks.style = {
+		get: function( elem ) {
+			// Return undefined in the case of empty string
+			// Normalize to lowercase since IE uppercases css property names
+			return elem.style.cssText.toLowerCase() || undefined;
+		},
+		set: function( elem, value ) {
+			return ( elem.style.cssText = "" + value );
+		}
+	};
+}
+
+// Safari mis-reports the default selected property of an option
+// Accessing the parent's selectedIndex property fixes it
+if ( !jQuery.support.optSelected ) {
+	jQuery.propHooks.selected = jQuery.extend( jQuery.propHooks.selected, {
+		get: function( elem ) {
+			var parent = elem.parentNode;
+
+			if ( parent ) {
+				parent.selectedIndex;
+
+				// Make sure that it also works with optgroups, see #5701
+				if ( parent.parentNode ) {
+					parent.parentNode.selectedIndex;
+				}
+			}
+			return null;
+		}
+	});
+}
+
+// IE6/7 call enctype encoding
+if ( !jQuery.support.enctype ) {
+	jQuery.propFix.enctype = "encoding";
+}
+
+// Radios and checkboxes getter/setter
+if ( !jQuery.support.checkOn ) {
+	jQuery.each([ "radio", "checkbox" ], function() {
+		jQuery.valHooks[ this ] = {
+			get: function( elem ) {
+				// Handle the case where in Webkit "" is returned instead of "on" if a value isn't specified
+				return elem.getAttribute("value") === null ? "on" : elem.value;
+			}
+		};
+	});
+}
+jQuery.each([ "radio", "checkbox" ], function() {
+	jQuery.valHooks[ this ] = jQuery.extend( jQuery.valHooks[ this ], {
+		set: function( elem, value ) {
+			if ( jQuery.isArray( value ) ) {
+				return ( elem.checked = jQuery.inArray( jQuery(elem).val(), value ) >= 0 );
+			}
+		}
+	});
+});
+
+
+
+
+var rformElems = /^(?:textarea|input|select)$/i,
+	rtypenamespace = /^([^\.]*)?(?:\.(.+))?$/,
+	rhoverHack = /(?:^|\s)hover(\.\S+)?\b/,
+	rkeyEvent = /^key/,
+	rmouseEvent = /^(?:mouse|contextmenu)|click/,
+	rfocusMorph = /^(?:focusinfocus|focusoutblur)$/,
+	rquickIs = /^(\w*)(?:#([\w\-]+))?(?:\.([\w\-]+))?$/,
+	quickParse = function( selector ) {
+		var quick = rquickIs.exec( selector );
+		if ( quick ) {
+			//   0  1    2   3
+			// [ _, tag, id, class ]
+			quick[1] = ( quick[1] || "" ).toLowerCase();
+			quick[3] = quick[3] && new RegExp( "(?:^|\\s)" + quick[3] + "(?:\\s|$)" );
+		}
+		return quick;
+	},
+	quickIs = function( elem, m ) {
+		var attrs = elem.attributes || {};
+		return (
+			(!m[1] || elem.nodeName.toLowerCase() === m[1]) &&
+			(!m[2] || (attrs.id || {}).value === m[2]) &&
+			(!m[3] || m[3].test( (attrs[ "class" ] || {}).value ))
+		);
+	},
+	hoverHack = function( events ) {
+		return jQuery.event.special.hover ? events : events.replace( rhoverHack, "mouseenter$1 mouseleave$1" );
+	};
+
+/*
+ * Helper functions for managing events -- not part of the public interface.
+ * Props to Dean Edwards' addEvent library for many of the ideas.
+ */
+jQuery.event = {
+
+	add: function( elem, types, handler, data, selector ) {
+
+		var elemData, eventHandle, events,
+			t, tns, type, namespaces, handleObj,
+			handleObjIn, quick, handlers, special;
+
+		// Don't attach events to noData or text/comment nodes (allow plain objects tho)
+		if ( elem.nodeType === 3 || elem.nodeType === 8 || !types || !handler || !(elemData = jQuery._data( elem )) ) {
+			return;
+		}
+
+		// Caller can pass in an object of custom data in lieu of the handler
+		if ( handler.handler ) {
+			handleObjIn = handler;
+			handler = handleObjIn.handler;
+			selector = handleObjIn.selector;
+		}
+
+		// Make sure that the handler has a unique ID, used to find/remove it later
+		if ( !handler.guid ) {
+			handler.guid = jQuery.guid++;
+		}
+
+		// Init the element's event structure and main handler, if this is the first
+		events = elemData.events;
+		if ( !events ) {
+			elemData.events = events = {};
+		}
+		eventHandle = elemData.handle;
+		if ( !eventHandle ) {
+			elemData.handle = eventHandle = function( e ) {
+				// Discard the second event of a jQuery.event.trigger() and
+				// when an event is called after a page has unloaded
+				return typeof jQuery !== "undefined" && (!e || jQuery.event.triggered !== e.type) ?
+					jQuery.event.dispatch.apply( eventHandle.elem, arguments ) :
+					undefined;
+			};
+			// Add elem as a property of the handle fn to prevent a memory leak with IE non-native events
+			eventHandle.elem = elem;
+		}
+
+		// Handle multiple events separated by a space
+		// jQuery(...).bind("mouseover mouseout", fn);
+		types = jQuery.trim( hoverHack(types) ).split( " " );
+		for ( t = 0; t < types.length; t++ ) {
+
+			tns = rtypenamespace.exec( types[t] ) || [];
+			type = tns[1];
+			namespaces = ( tns[2] || "" ).split( "." ).sort();
+
+			// If event changes its type, use the special event handlers for the changed type
+			special = jQuery.event.special[ type ] || {};
+
+			// If selector defined, determine special event api type, otherwise given type
+			type = ( selector ? special.delegateType : special.bindType ) || type;
+
+			// Update special based on newly reset type
+			special = jQuery.event.special[ type ] || {};
+
+			// handleObj is passed to all event handlers
+			handleObj = jQuery.extend({
+				type: type,
+				origType: tns[1],
+				data: data,
+				handler: handler,
+				guid: handler.guid,
+				selector: selector,
+				quick: selector && quickParse( selector ),
+				namespace: namespaces.join(".")
+			}, handleObjIn );
+
+			// Init the event handler queue if we're the first
+			handlers = events[ type ];
+			if ( !handlers ) {
+				handlers = events[ type ] = [];
+				handlers.delegateCount = 0;
+
+				// Only use addEventListener/attachEvent if the special events handler returns false
+				if ( !special.setup || special.setup.call( elem, data, namespaces, eventHandle ) === false ) {
+					// Bind the global event handler to the element
+					if ( elem.addEventListener ) {
+						elem.addEventListener( type, eventHandle, false );
+
+					} else if ( elem.attachEvent ) {
+						elem.attachEvent( "on" + type, eventHandle );
+					}
+				}
+			}
+
+			if ( special.add ) {
+				special.add.call( elem, handleObj );
+
+				if ( !handleObj.handler.guid ) {
+					handleObj.handler.guid = handler.guid;
+				}
+			}
+
+			// Add to the element's handler list, delegates in front
+			if ( selector ) {
+				handlers.splice( handlers.delegateCount++, 0, handleObj );
+			} else {
+				handlers.push( handleObj );
+			}
+
+			// Keep track of which events have ever been used, for event optimization
+			jQuery.event.global[ type ] = true;
+		}
+
+		// Nullify elem to prevent memory leaks in IE
+		elem = null;
+	},
+
+	global: {},
+
+	// Detach an event or set of events from an element
+	remove: function( elem, types, handler, selector, mappedTypes ) {
+
+		var elemData = jQuery.hasData( elem ) && jQuery._data( elem ),
+			t, tns, type, origType, namespaces, origCount,
+			j, events, special, handle, eventType, handleObj;
+
+		if ( !elemData || !(events = elemData.events) ) {
+			return;
+		}
+
+		// Once for each type.namespace in types; type may be omitted
+		types = jQuery.trim( hoverHack( types || "" ) ).split(" ");
+		for ( t = 0; t < types.length; t++ ) {
+			tns = rtypenamespace.exec( types[t] ) || [];
+			type = origType = tns[1];
+			namespaces = tns[2];
+
+			// Unbind all events (on this namespace, if provided) for the element
+			if ( !type ) {
+				for ( type in events ) {
+					jQuery.event.remove( elem, type + types[ t ], handler, selector, true );
+				}
+				continue;
+			}
+
+			special = jQuery.event.special[ type ] || {};
+			type = ( selector? special.delegateType : special.bindType ) || type;
+			eventType = events[ type ] || [];
+			origCount = eventType.length;
+			namespaces = namespaces ? new RegExp("(^|\\.)" + namespaces.split(".").sort().join("\\.(?:.*\\.)?") + "(\\.|$)") : null;
+
+			// Remove matching events
+			for ( j = 0; j < eventType.length; j++ ) {
+				handleObj = eventType[ j ];
+
+				if ( ( mappedTypes || origType === handleObj.origType ) &&
+					 ( !handler || handler.guid === handleObj.guid ) &&
+					 ( !namespaces || namespaces.test( handleObj.namespace ) ) &&
+					 ( !selector || selector === handleObj.selector || selector === "**" && handleObj.selector ) ) {
+					eventType.splice( j--, 1 );
+
+					if ( handleObj.selector ) {
+						eventType.delegateCount--;
+					}
+					if ( special.remove ) {
+						special.remove.call( elem, handleObj );
+					}
+				}
+			}
+
+			// Remove generic event handler if we removed something and no more handlers exist
+			// (avoids potential for endless recursion during removal of special event handlers)
+			if ( eventType.length === 0 && origCount !== eventType.length ) {
+				if ( !special.teardown || special.teardown.call( elem, namespaces ) === false ) {
+					jQuery.removeEvent( elem, type, elemData.handle );
+				}
+
+				delete events[ type ];
+			}
+		}
+
+		// Remove the expando if it's no longer used
+		if ( jQuery.isEmptyObject( events ) ) {
+			handle = elemData.handle;
+			if ( handle ) {
+				handle.elem = null;
+			}
+
+			// removeData also checks for emptiness and clears the expando if empty
+			// so use it instead of delete
+			jQuery.removeData( elem, [ "events", "handle" ], true );
+		}
+	},
+
+	// Events that are safe to short-circuit if no handlers are attached.
+	// Native DOM events should not be added, they may have inline handlers.
+	customEvent: {
+		"getData": true,
+		"setData": true,
+		"changeData": true
+	},
+
+	trigger: function( event, data, elem, onlyHandlers ) {
+		// Don't do events on text and comment nodes
+		if ( elem && (elem.nodeType === 3 || elem.nodeType === 8) ) {
+			return;
+		}
+
+		// Event object or event type
+		var type = event.type || event,
+			namespaces = [],
+			cache, exclusive, i, cur, old, ontype, special, handle, eventPath, bubbleType;
+
+		// focus/blur morphs to focusin/out; ensure we're not firing them right now
+		if ( rfocusMorph.test( type + jQuery.event.triggered ) ) {
+			return;
+		}
+
+		if ( type.indexOf( "!" ) >= 0 ) {
+			// Exclusive events trigger only for the exact event (no namespaces)
+			type = type.slice(0, -1);
+			exclusive = true;
+		}
+
+		if ( type.indexOf( "." ) >= 0 ) {
+			// Namespaced trigger; create a regexp to match event type in handle()
+			namespaces = type.split(".");
+			type = namespaces.shift();
+			namespaces.sort();
+		}
+
+		if ( (!elem || jQuery.event.customEvent[ type ]) && !jQuery.event.global[ type ] ) {
+			// No jQuery handlers for this event type, and it can't have inline handlers
+			return;
+		}
+
+		// Caller can pass in an Event, Object, or just an event type string
+		event = typeof event === "object" ?
+			// jQuery.Event object
+			event[ jQuery.expando ] ? event :
+			// Object literal
+			new jQuery.Event( type, event ) :
+			// Just the event type (string)
+			new jQuery.Event( type );
+
+		event.type = type;
+		event.isTrigger = true;
+		event.exclusive = exclusive;
+		event.namespace = namespaces.join( "." );
+		event.namespace_re = event.namespace? new RegExp("(^|\\.)" + namespaces.join("\\.(?:.*\\.)?") + "(\\.|$)") : null;
+		ontype = type.indexOf( ":" ) < 0 ? "on" + type : "";
+
+		// Handle a global trigger
+		if ( !elem ) {
+
+			// TODO: Stop taunting the data cache; remove global events and always attach to document
+			cache = jQuery.cache;
+			for ( i in cache ) {
+				if ( cache[ i ].events && cache[ i ].events[ type ] ) {
+					jQuery.event.trigger( event, data, cache[ i ].handle.elem, true );
+				}
+			}
+			return;
+		}
+
+		// Clean up the event in case it is being reused
+		event.result = undefined;
+		if ( !event.target ) {
+			event.target = elem;
+		}
+
+		// Clone any incoming data and prepend the event, creating the handler arg list
+		data = data != null ? jQuery.makeArray( data ) : [];
+		data.unshift( event );
+
+		// Allow special events to draw outside the lines
+		special = jQuery.event.special[ type ] || {};
+		if ( special.trigger && special.trigger.apply( elem, data ) === false ) {
+			return;
+		}
+
+		// Determine event propagation path in advance, per W3C events spec (#9951)
+		// Bubble up to document, then to window; watch for a global ownerDocument var (#9724)
+		eventPath = [[ elem, special.bindType || type ]];
+		if ( !onlyHandlers && !special.noBubble && !jQuery.isWindow( elem ) ) {
+
+			bubbleType = special.delegateType || type;
+			cur = rfocusMorph.test( bubbleType + type ) ? elem : elem.parentNode;
+			old = null;
+			for ( ; cur; cur = cur.parentNode ) {
+				eventPath.push([ cur, bubbleType ]);
+				old = cur;
+			}
+
+			// Only add window if we got to document (e.g., not plain obj or detached DOM)
+			if ( old && old === elem.ownerDocument ) {
+				eventPath.push([ old.defaultView || old.parentWindow || window, bubbleType ]);
+			}
+		}
+
+		// Fire handlers on the event path
+		for ( i = 0; i < eventPath.length && !event.isPropagationStopped(); i++ ) {
+
+			cur = eventPath[i][0];
+			event.type = eventPath[i][1];
+
+			handle = ( jQuery._data( cur, "events" ) || {} )[ event.type ] && jQuery._data( cur, "handle" );
+			if ( handle ) {
+				handle.apply( cur, data );
+			}
+			// Note that this is a bare JS function and not a jQuery handler
+			handle = ontype && cur[ ontype ];
+			if ( handle && jQuery.acceptData( cur ) && handle.apply( cur, data ) === false ) {
+				event.preventDefault();
+			}
+		}
+		event.type = type;
+
+		// If nobody prevented the default action, do it now
+		if ( !onlyHandlers && !event.isDefaultPrevented() ) {
+
+			if ( (!special._default || special._default.apply( elem.ownerDocument, data ) === false) &&
+				!(type === "click" && jQuery.nodeName( elem, "a" )) && jQuery.acceptData( elem ) ) {
+
+				// Call a native DOM method on the target with the same name name as the event.
+				// Can't use an .isFunction() check here because IE6/7 fails that test.
+				// Don't do default actions on window, that's where global variables be (#6170)
+				// IE<9 dies on focus/blur to hidden element (#1486)
+				if ( ontype && elem[ type ] && ((type !== "focus" && type !== "blur") || event.target.offsetWidth !== 0) && !jQuery.isWindow( elem ) ) {
+
+					// Don't re-trigger an onFOO event when we call its FOO() method
+					old = elem[ ontype ];
+
+					if ( old ) {
+						elem[ ontype ] = null;
+					}
+
+					// Prevent re-triggering of the same event, since we already bubbled it above
+					jQuery.event.triggered = type;
+					elem[ type ]();
+					jQuery.event.triggered = undefined;
+
+					if ( old ) {
+						elem[ ontype ] = old;
+					}
+				}
+			}
+		}
+
+		return event.result;
+	},
+
+	dispatch: function( event ) {
+
+		// Make a writable jQuery.Event from the native event object
+		event = jQuery.event.fix( event || window.event );
+
+		var handlers = ( (jQuery._data( this, "events" ) || {} )[ event.type ] || []),
+			delegateCount = handlers.delegateCount,
+			args = [].slice.call( arguments, 0 ),
+			run_all = !event.exclusive && !event.namespace,
+			special = jQuery.event.special[ event.type ] || {},
+			handlerQueue = [],
+			i, j, cur, jqcur, ret, selMatch, matched, matches, handleObj, sel, related;
+
+		// Use the fix-ed jQuery.Event rather than the (read-only) native event
+		args[0] = event;
+		event.delegateTarget = this;
+
+		// Call the preDispatch hook for the mapped type, and let it bail if desired
+		if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) {
+			return;
+		}
+
+		// Determine handlers that should run if there are delegated events
+		// Avoid non-left-click bubbling in Firefox (#3861)
+		if ( delegateCount && !(event.button && event.type === "click") ) {
+
+			// Pregenerate a single jQuery object for reuse with .is()
+			jqcur = jQuery(this);
+			jqcur.context = this.ownerDocument || this;
+
+			for ( cur = event.target; cur != this; cur = cur.parentNode || this ) {
+
+				// Don't process events on disabled elements (#6911, #8165)
+				if ( cur.disabled !== true ) {
+					selMatch = {};
+					matches = [];
+					jqcur[0] = cur;
+					for ( i = 0; i < delegateCount; i++ ) {
+						handleObj = handlers[ i ];
+						sel = handleObj.selector;
+
+						if ( selMatch[ sel ] === undefined ) {
+							selMatch[ sel ] = (
+								handleObj.quick ? quickIs( cur, handleObj.quick ) : jqcur.is( sel )
+							);
+						}
+						if ( selMatch[ sel ] ) {
+							matches.push( handleObj );
+						}
+					}
+					if ( matches.length ) {
+						handlerQueue.push({ elem: cur, matches: matches });
+					}
+				}
+			}
+		}
+
+		// Add the remaining (directly-bound) handlers
+		if ( handlers.length > delegateCount ) {
+			handlerQueue.push({ elem: this, matches: handlers.slice( delegateCount ) });
+		}
+
+		// Run delegates first; they may want to stop propagation beneath us
+		for ( i = 0; i < handlerQueue.length && !event.isPropagationStopped(); i++ ) {
+			matched = handlerQueue[ i ];
+			event.currentTarget = matched.elem;
+
+			for ( j = 0; j < matched.matches.length && !event.isImmediatePropagationStopped(); j++ ) {
+				handleObj = matched.matches[ j ];
+
+				// Triggered event must either 1) be non-exclusive and have no namespace, or
+				// 2) have namespace(s) a subset or equal to those in the bound event (both can have no namespace).
+				if ( run_all || (!event.namespace && !handleObj.namespace) || event.namespace_re && event.namespace_re.test( handleObj.namespace ) ) {
+
+					event.data = handleObj.data;
+					event.handleObj = handleObj;
+
+					ret = ( (jQuery.event.special[ handleObj.origType ] || {}).handle || handleObj.handler )
+							.apply( matched.elem, args );
+
+					if ( ret !== undefined ) {
+						event.result = ret;
+						if ( ret === false ) {
+							event.preventDefault();
+							event.stopPropagation();
+						}
+					}
+				}
+			}
+		}
+
+		// Call the postDispatch hook for the mapped type
+		if ( special.postDispatch ) {
+			special.postDispatch.call( this, event );
+		}
+
+		return event.result;
+	},
+
+	// Includes some event props shared by KeyEvent and MouseEvent
+	// *** attrChange attrName relatedNode srcElement  are not normalized, non-W3C, deprecated, will be removed in 1.8 ***
+	props: "attrChange attrName relatedNode srcElement altKey bubbles cancelable ctrlKey currentTarget eventPhase metaKey relatedTarget shiftKey target timeStamp view which".split(" "),
+
+	fixHooks: {},
+
+	keyHooks: {
+		props: "char charCode key keyCode".split(" "),
+		filter: function( event, original ) {
+
+			// Add which for key events
+			if ( event.which == null ) {
+				event.which = original.charCode != null ? original.charCode : original.keyCode;
+			}
+
+			return event;
+		}
+	},
+
+	mouseHooks: {
+		props: "button buttons clientX clientY fromElement offsetX offsetY pageX pageY screenX screenY toElement".split(" "),
+		filter: function( event, original ) {
+			var eventDoc, doc, body,
+				button = original.button,
+				fromElement = original.fromElement;
+
+			// Calculate pageX/Y if missing and clientX/Y available
+			if ( event.pageX == null && original.clientX != null ) {
+				eventDoc = event.target.ownerDocument || document;
+				doc = eventDoc.documentElement;
+				body = eventDoc.body;
+
+				event.pageX = original.clientX + ( doc && doc.scrollLeft || body && body.scrollLeft || 0 ) - ( doc && doc.clientLeft || body && body.clientLeft || 0 );
+				event.pageY = original.clientY + ( doc && doc.scrollTop  || body && body.scrollTop  || 0 ) - ( doc && doc.clientTop  || body && body.clientTop  || 0 );
+			}
+
+			// Add relatedTarget, if necessary
+			if ( !event.relatedTarget && fromElement ) {
+				event.relatedTarget = fromElement === event.target ? original.toElement : fromElement;
+			}
+
+			// Add which for click: 1 === left; 2 === middle; 3 === right
+			// Note: button is not normalized, so don't use it
+			if ( !event.which && button !== undefined ) {
+				event.which = ( button & 1 ? 1 : ( button & 2 ? 3 : ( button & 4 ? 2 : 0 ) ) );
+			}
+
+			return event;
+		}
+	},
+
+	fix: function( event ) {
+		if ( event[ jQuery.expando ] ) {
+			return event;
+		}
+
+		// Create a writable copy of the event object and normalize some properties
+		var i, prop,
+			originalEvent = event,
+			fixHook = jQuery.event.fixHooks[ event.type ] || {},
+			copy = fixHook.props ? this.props.concat( fixHook.props ) : this.props;
+
+		event = jQuery.Event( originalEvent );
+
+		for ( i = copy.length; i; ) {
+			prop = copy[ --i ];
+			event[ prop ] = originalEvent[ prop ];
+		}
+
+		// Fix target property, if necessary (#1925, IE 6/7/8 & Safari2)
+		if ( !event.target ) {
+			event.target = originalEvent.srcElement || document;
+		}
+
+		// Target should not be a text node (#504, Safari)
+		if ( event.target.nodeType === 3 ) {
+			event.target = event.target.parentNode;
+		}
+
+		// For mouse/key events; add metaKey if it's not there (#3368, IE6/7/8)
+		if ( event.metaKey === undefined ) {
+			event.metaKey = event.ctrlKey;
+		}
+
+		return fixHook.filter? fixHook.filter( event, originalEvent ) : event;
+	},
+
+	special: {
+		ready: {
+			// Make sure the ready event is setup
+			setup: jQuery.bindReady
+		},
+
+		load: {
+			// Prevent triggered image.load events from bubbling to window.load
+			noBubble: true
+		},
+
+		focus: {
+			delegateType: "focusin"
+		},
+		blur: {
+			delegateType: "focusout"
+		},
+
+		beforeunload: {
+			setup: function( data, namespaces, eventHandle ) {
+				// We only want to do this special case on windows
+				if ( jQuery.isWindow( this ) ) {
+					this.onbeforeunload = eventHandle;
+				}
+			},
+
+			teardown: function( namespaces, eventHandle ) {
+				if ( this.onbeforeunload === eventHandle ) {
+					this.onbeforeunload = null;
+				}
+			}
+		}
+	},
+
+	simulate: function( type, elem, event, bubble ) {
+		// Piggyback on a donor event to simulate a different one.
+		// Fake originalEvent to avoid donor's stopPropagation, but if the
+		// simulated event prevents default then we do the same on the donor.
+		var e = jQuery.extend(
+			new jQuery.Event(),
+			event,
+			{ type: type,
+				isSimulated: true,
+				originalEvent: {}
+			}
+		);
+		if ( bubble ) {
+			jQuery.event.trigger( e, null, elem );
+		} else {
+			jQuery.event.dispatch.call( elem, e );
+		}
+		if ( e.isDefaultPrevented() ) {
+			event.preventDefault();
+		}
+	}
+};
+
+// Some plugins are using, but it's undocumented/deprecated and will be removed.
+// The 1.7 special event interface should provide all the hooks needed now.
+jQuery.event.handle = jQuery.event.dispatch;
+
+jQuery.removeEvent = document.removeEventListener ?
+	function( elem, type, handle ) {
+		if ( elem.removeEventListener ) {
+			elem.removeEventListener( type, handle, false );
+		}
+	} :
+	function( elem, type, handle ) {
+		if ( elem.detachEvent ) {
+			elem.detachEvent( "on" + type, handle );
+		}
+	};
+
+jQuery.Event = function( src, props ) {
+	// Allow instantiation without the 'new' keyword
+	if ( !(this instanceof jQuery.Event) ) {
+		return new jQuery.Event( src, props );
+	}
+
+	// Event object
+	if ( src && src.type ) {
+		this.originalEvent = src;
+		this.type = src.type;
+
+		// Events bubbling up the document may have been marked as prevented
+		// by a handler lower down the tree; reflect the correct value.
+		this.isDefaultPrevented = ( src.defaultPrevented || src.returnValue === false ||
+			src.getPreventDefault && src.getPreventDefault() ) ? returnTrue : returnFalse;
+
+	// Event type
+	} else {
+		this.type = src;
+	}
+
+	// Put explicitly provided properties onto the event object
+	if ( props ) {
+		jQuery.extend( this, props );
+	}
+
+	// Create a timestamp if incoming event doesn't have one
+	this.timeStamp = src && src.timeStamp || jQuery.now();
+
+	// Mark it as fixed
+	this[ jQuery.expando ] = true;
+};
+
+function returnFalse() {
+	return false;
+}
+function returnTrue() {
+	return true;
+}
+
+// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding
+// http://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html
+jQuery.Event.prototype = {
+	preventDefault: function() {
+		this.isDefaultPrevented = returnTrue;
+
+		var e = this.originalEvent;
+		if ( !e ) {
+			return;
+		}
+
+		// if preventDefault exists run it on the original event
+		if ( e.preventDefault ) {
+			e.preventDefault();
+
+		// otherwise set the returnValue property of the original event to false (IE)
+		} else {
+			e.returnValue = false;
+		}
+	},
+	stopPropagation: function() {
+		this.isPropagationStopped = returnTrue;
+
+		var e = this.originalEvent;
+		if ( !e ) {
+			return;
+		}
+		// if stopPropagation exists run it on the original event
+		if ( e.stopPropagation ) {
+			e.stopPropagation();
+		}
+		// otherwise set the cancelBubble property of the original event to true (IE)
+		e.cancelBubble = true;
+	},
+	stopImmediatePropagation: function() {
+		this.isImmediatePropagationStopped = returnTrue;
+		this.stopPropagation();
+	},
+	isDefaultPrevented: returnFalse,
+	isPropagationStopped: returnFalse,
+	isImmediatePropagationStopped: returnFalse
+};
+
+// Create mouseenter/leave events using mouseover/out and event-time checks
+jQuery.each({
+	mouseenter: "mouseover",
+	mouseleave: "mouseout"
+}, function( orig, fix ) {
+	jQuery.event.special[ orig ] = {
+		delegateType: fix,
+		bindType: fix,
+
+		handle: function( event ) {
+			var target = this,
+				related = event.relatedTarget,
+				handleObj = event.handleObj,
+				selector = handleObj.selector,
+				ret;
+
+			// For mousenter/leave call the handler if related is outside the target.
+			// NB: No relatedTarget if the mouse left/entered the browser window
+			if ( !related || (related !== target && !jQuery.contains( target, related )) ) {
+				event.type = handleObj.origType;
+				ret = handleObj.handler.apply( this, arguments );
+				event.type = fix;
+			}
+			return ret;
+		}
+	};
+});
+
+// IE submit delegation
+if ( !jQuery.support.submitBubbles ) {
+
+	jQuery.event.special.submit = {
+		setup: function() {
+			// Only need this for delegated form submit events
+			if ( jQuery.nodeName( this, "form" ) ) {
+				return false;
+			}
+
+			// Lazy-add a submit handler when a descendant form may potentially be submitted
+			jQuery.event.add( this, "click._submit keypress._submit", function( e ) {
+				// Node name check avoids a VML-related crash in IE (#9807)
+				var elem = e.target,
+					form = jQuery.nodeName( elem, "input" ) || jQuery.nodeName( elem, "button" ) ? elem.form : undefined;
+				if ( form && !form._submit_attached ) {
+					jQuery.event.add( form, "submit._submit", function( event ) {
+						event._submit_bubble = true;
+					});
+					form._submit_attached = true;
+				}
+			});
+			// return undefined since we don't need an event listener
+		},
+		
+		postDispatch: function( event ) {
+			// If form was submitted by the user, bubble the event up the tree
+			if ( event._submit_bubble ) {
+				delete event._submit_bubble;
+				if ( this.parentNode && !event.isTrigger ) {
+					jQuery.event.simulate( "submit", this.parentNode, event, true );
+				}
+			}
+		},
+
+		teardown: function() {
+			// Only need this for delegated form submit events
+			if ( jQuery.nodeName( this, "form" ) ) {
+				return false;
+			}
+
+			// Remove delegated handlers; cleanData eventually reaps submit handlers attached above
+			jQuery.event.remove( this, "._submit" );
+		}
+	};
+}
+
+// IE change delegation and checkbox/radio fix
+if ( !jQuery.support.changeBubbles ) {
+
+	jQuery.event.special.change = {
+
+		setup: function() {
+
+			if ( rformElems.test( this.nodeName ) ) {
+				// IE doesn't fire change on a check/radio until blur; trigger it on click
+				// after a propertychange. Eat the blur-change in special.change.handle.
+				// This still fires onchange a second time for check/radio after blur.
+				if ( this.type === "checkbox" || this.type === "radio" ) {
+					jQuery.event.add( this, "propertychange._change", function( event ) {
+						if ( event.originalEvent.propertyName === "checked" ) {
+							this._just_changed = true;
+						}
+					});
+					jQuery.event.add( this, "click._change", function( event ) {
+						if ( this._just_changed && !event.isTrigger ) {
+							this._just_changed = false;
+							jQuery.event.simulate( "change", this, event, true );
+						}
+					});
+				}
+				return false;
+			}
+			// Delegated event; lazy-add a change handler on descendant inputs
+			jQuery.event.add( this, "beforeactivate._change", function( e ) {
+				var elem = e.target;
+
+				if ( rformElems.test( elem.nodeName ) && !elem._change_attached ) {
+					jQuery.event.add( elem, "change._change", function( event ) {
+						if ( this.parentNode && !event.isSimulated && !event.isTrigger ) {
+							jQuery.event.simulate( "change", this.parentNode, event, true );
+						}
+					});
+					elem._change_attached = true;
+				}
+			});
+		},
+
+		handle: function( event ) {
+			var elem = event.target;
+
+			// Swallow native change events from checkbox/radio, we already triggered them above
+			if ( this !== elem || event.isSimulated || event.isTrigger || (elem.type !== "radio" && elem.type !== "checkbox") ) {
+				return event.handleObj.handler.apply( this, arguments );
+			}
+		},
+
+		teardown: function() {
+			jQuery.event.remove( this, "._change" );
+
+			return rformElems.test( this.nodeName );
+		}
+	};
+}
+
+// Create "bubbling" focus and blur events
+if ( !jQuery.support.focusinBubbles ) {
+	jQuery.each({ focus: "focusin", blur: "focusout" }, function( orig, fix ) {
+
+		// Attach a single capturing handler while someone wants focusin/focusout
+		var attaches = 0,
+			handler = function( event ) {
+				jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ), true );
+			};
+
+		jQuery.event.special[ fix ] = {
+			setup: function() {
+				if ( attaches++ === 0 ) {
+					document.addEventListener( orig, handler, true );
+				}
+			},
+			teardown: function() {
+				if ( --attaches === 0 ) {
+					document.removeEventListener( orig, handler, true );
+				}
+			}
+		};
+	});
+}
+
+jQuery.fn.extend({
+
+	on: function( types, selector, data, fn, /*INTERNAL*/ one ) {
+		var origFn, type;
+
+		// Types can be a map of types/handlers
+		if ( typeof types === "object" ) {
+			// ( types-Object, selector, data )
+			if ( typeof selector !== "string" ) { // && selector != null
+				// ( types-Object, data )
+				data = data || selector;
+				selector = undefined;
+			}
+			for ( type in types ) {
+				this.on( type, selector, data, types[ type ], one );
+			}
+			return this;
+		}
+
+		if ( data == null && fn == null ) {
+			// ( types, fn )
+			fn = selector;
+			data = selector = undefined;
+		} else if ( fn == null ) {
+			if ( typeof selector === "string" ) {
+				// ( types, selector, fn )
+				fn = data;
+				data = undefined;
+			} else {
+				// ( types, data, fn )
+				fn = data;
+				data = selector;
+				selector = undefined;
+			}
+		}
+		if ( fn === false ) {
+			fn = returnFalse;
+		} else if ( !fn ) {
+			return this;
+		}
+
+		if ( one === 1 ) {
+			origFn = fn;
+			fn = function( event ) {
+				// Can use an empty set, since event contains the info
+				jQuery().off( event );
+				return origFn.apply( this, arguments );
+			};
+			// Use same guid so caller can remove using origFn
+			fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ );
+		}
+		return this.each( function() {
+			jQuery.event.add( this, types, fn, data, selector );
+		});
+	},
+	one: function( types, selector, data, fn ) {
+		return this.on( types, selector, data, fn, 1 );
+	},
+	off: function( types, selector, fn ) {
+		if ( types && types.preventDefault && types.handleObj ) {
+			// ( event )  dispatched jQuery.Event
+			var handleObj = types.handleObj;
+			jQuery( types.delegateTarget ).off(
+				handleObj.namespace ? handleObj.origType + "." + handleObj.namespace : handleObj.origType,
+				handleObj.selector,
+				handleObj.handler
+			);
+			return this;
+		}
+		if ( typeof types === "object" ) {
+			// ( types-object [, selector] )
+			for ( var type in types ) {
+				this.off( type, selector, types[ type ] );
+			}
+			return this;
+		}
+		if ( selector === false || typeof selector === "function" ) {
+			// ( types [, fn] )
+			fn = selector;
+			selector = undefined;
+		}
+		if ( fn === false ) {
+			fn = returnFalse;
+		}
+		return this.each(function() {
+			jQuery.event.remove( this, types, fn, selector );
+		});
+	},
+
+	bind: function( types, data, fn ) {
+		return this.on( types, null, data, fn );
+	},
+	unbind: function( types, fn ) {
+		return this.off( types, null, fn );
+	},
+
+	live: function( types, data, fn ) {
+		jQuery( this.context ).on( types, this.selector, data, fn );
+		return this;
+	},
+	die: function( types, fn ) {
+		jQuery( this.context ).off( types, this.selector || "**", fn );
+		return this;
+	},
+
+	delegate: function( selector, types, data, fn ) {
+		return this.on( types, selector, data, fn );
+	},
+	undelegate: function( selector, types, fn ) {
+		// ( namespace ) or ( selector, types [, fn] )
+		return arguments.length == 1? this.off( selector, "**" ) : this.off( types, selector, fn );
+	},
+
+	trigger: function( type, data ) {
+		return this.each(function() {
+			jQuery.event.trigger( type, data, this );
+		});
+	},
+	triggerHandler: function( type, data ) {
+		if ( this[0] ) {
+			return jQuery.event.trigger( type, data, this[0], true );
+		}
+	},
+
+	toggle: function( fn ) {
+		// Save reference to arguments for access in closure
+		var args = arguments,
+			guid = fn.guid || jQuery.guid++,
+			i = 0,
+			toggler = function( event ) {
+				// Figure out which function to execute
+				var lastToggle = ( jQuery._data( this, "lastToggle" + fn.guid ) || 0 ) % i;
+				jQuery._data( this, "lastToggle" + fn.guid, lastToggle + 1 );
+
+				// Make sure that clicks stop
+				event.preventDefault();
+
+				// and execute the function
+				return args[ lastToggle ].apply( this, arguments ) || false;
+			};
+
+		// link all the functions, so any of them can unbind this click handler
+		toggler.guid = guid;
+		while ( i < args.length ) {
+			args[ i++ ].guid = guid;
+		}
+
+		return this.click( toggler );
+	},
+
+	hover: function( fnOver, fnOut ) {
+		return this.mouseenter( fnOver ).mouseleave( fnOut || fnOver );
+	}
+});
+
+jQuery.each( ("blur focus focusin focusout load resize scroll unload click dblclick " +
+	"mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave " +
+	"change select submit keydown keypress keyup error contextmenu").split(" "), function( i, name ) {
+
+	// Handle event binding
+	jQuery.fn[ name ] = function( data, fn ) {
+		if ( fn == null ) {
+			fn = data;
+			data = null;
+		}
+
+		return arguments.length > 0 ?
+			this.on( name, null, data, fn ) :
+			this.trigger( name );
+	};
+
+	if ( jQuery.attrFn ) {
+		jQuery.attrFn[ name ] = true;
+	}
+
+	if ( rkeyEvent.test( name ) ) {
+		jQuery.event.fixHooks[ name ] = jQuery.event.keyHooks;
+	}
+
+	if ( rmouseEvent.test( name ) ) {
+		jQuery.event.fixHooks[ name ] = jQuery.event.mouseHooks;
+	}
+});
+
+
+
+/*!
+ * Sizzle CSS Selector Engine
+ *  Copyright 2011, The Dojo Foundation
+ *  Released under the MIT, BSD, and GPL Licenses.
+ *  More information: http://sizzlejs.com/
+ */
+(function(){
+
+var chunker = /((?:\((?:\([^()]+\)|[^()]+)+\)|\[(?:\[[^\[\]]*\]|['"][^'"]*['"]|[^\[\]'"]+)+\]|\\.|[^ >+~,(\[\\]+)+|[>+~])(\s*,\s*)?((?:.|\r|\n)*)/g,
+	expando = "sizcache" + (Math.random() + '').replace('.', ''),
+	done = 0,
+	toString = Object.prototype.toString,
+	hasDuplicate = false,
+	baseHasDuplicate = true,
+	rBackslash = /\\/g,
+	rReturn = /\r\n/g,
+	rNonWord = /\W/;
+
+// Here we check if the JavaScript engine is using some sort of
+// optimization where it does not always call our comparision
+// function. If that is the case, discard the hasDuplicate value.
+//   Thus far that includes Google Chrome.
+[0, 0].sort(function() {
+	baseHasDuplicate = false;
+	return 0;
+});
+
+var Sizzle = function( selector, context, results, seed ) {
+	results = results || [];
+	context = context || document;
+
+	var origContext = context;
+
+	if ( context.nodeType !== 1 && context.nodeType !== 9 ) {
+		return [];
+	}
+
+	if ( !selector || typeof selector !== "string" ) {
+		return results;
+	}
+
+	var m, set, checkSet, extra, ret, cur, pop, i,
+		prune = true,
+		contextXML = Sizzle.isXML( context ),
+		parts = [],
+		soFar = selector;
+
+	// Reset the position of the chunker regexp (start from head)
+	do {
+		chunker.exec( "" );
+		m = chunker.exec( soFar );
+
+		if ( m ) {
+			soFar = m[3];
+
+			parts.push( m[1] );
+
+			if ( m[2] ) {
+				extra = m[3];
+				break;
+			}
+		}
+	} while ( m );
+
+	if ( parts.length > 1 && origPOS.exec( selector ) ) {
+
+		if ( parts.length === 2 && Expr.relative[ parts[0] ] ) {
+			set = posProcess( parts[0] + parts[1], context, seed );
+
+		} else {
+			set = Expr.relative[ parts[0] ] ?
+				[ context ] :
+				Sizzle( parts.shift(), context );
+
+			while ( parts.length ) {
+				selector = parts.shift();
+
+				if ( Expr.relative[ selector ] ) {
+					selector += parts.shift();
+				}
+
+				set = posProcess( selector, set, seed );
+			}
+		}
+
+	} else {
+		// Take a shortcut and set the context if the root selector is an ID
+		// (but not if it'll be faster if the inner selector is an ID)
+		if ( !seed && parts.length > 1 && context.nodeType === 9 && !contextXML &&
+				Expr.match.ID.test(parts[0]) && !Expr.match.ID.test(parts[parts.length - 1]) ) {
+
+			ret = Sizzle.find( parts.shift(), context, contextXML );
+			context = ret.expr ?
+				Sizzle.filter( ret.expr, ret.set )[0] :
+				ret.set[0];
+		}
+
+		if ( context ) {
+			ret = seed ?
+				{ expr: parts.pop(), set: makeArray(seed) } :
+				Sizzle.find( parts.pop(), parts.length === 1 && (parts[0] === "~" || parts[0] === "+") && context.parentNode ? context.parentNode : context, contextXML );
+
+			set = ret.expr ?
+				Sizzle.filter( ret.expr, ret.set ) :
+				ret.set;
+
+			if ( parts.length > 0 ) {
+				checkSet = makeArray( set );
+
+			} else {
+				prune = false;
+			}
+
+			while ( parts.length ) {
+				cur = parts.pop();
+				pop = cur;
+
+				if ( !Expr.relative[ cur ] ) {
+					cur = "";
+				} else {
+					pop = parts.pop();
+				}
+
+				if ( pop == null ) {
+					pop = context;
+				}
+
+				Expr.relative[ cur ]( checkSet, pop, contextXML );
+			}
+
+		} else {
+			checkSet = parts = [];
+		}
+	}
+
+	if ( !checkSet ) {
+		checkSet = set;
+	}
+
+	if ( !checkSet ) {
+		Sizzle.error( cur || selector );
+	}
+
+	if ( toString.call(checkSet) === "[object Array]" ) {
+		if ( !prune ) {
+			results.push.apply( results, checkSet );
+
+		} else if ( context && context.nodeType === 1 ) {
+			for ( i = 0; checkSet[i] != null; i++ ) {
+				if ( checkSet[i] && (checkSet[i] === true || checkSet[i].nodeType === 1 && Sizzle.contains(context, checkSet[i])) ) {
+					results.push( set[i] );
+				}
+			}
+
+		} else {
+			for ( i = 0; checkSet[i] != null; i++ ) {
+				if ( checkSet[i] && checkSet[i].nodeType === 1 ) {
+					results.push( set[i] );
+				}
+			}
+		}
+
+	} else {
+		makeArray( checkSet, results );
+	}
+
+	if ( extra ) {
+		Sizzle( extra, origContext, results, seed );
+		Sizzle.uniqueSort( results );
+	}
+
+	return results;
+};
+
+Sizzle.uniqueSort = function( results ) {
+	if ( sortOrder ) {
+		hasDuplicate = baseHasDuplicate;
+		results.sort( sortOrder );
+
+		if ( hasDuplicate ) {
+			for ( var i = 1; i < results.length; i++ ) {
+				if ( results[i] === results[ i - 1 ] ) {
+					results.splice( i--, 1 );
+				}
+			}
+		}
+	}
+
+	return results;
+};
+
+Sizzle.matches = function( expr, set ) {
+	return Sizzle( expr, null, null, set );
+};
+
+Sizzle.matchesSelector = function( node, expr ) {
+	return Sizzle( expr, null, null, [node] ).length > 0;
+};
+
+Sizzle.find = function( expr, context, isXML ) {
+	var set, i, len, match, type, left;
+
+	if ( !expr ) {
+		return [];
+	}
+
+	for ( i = 0, len = Expr.order.length; i < len; i++ ) {
+		type = Expr.order[i];
+
+		if ( (match = Expr.leftMatch[ type ].exec( expr )) ) {
+			left = match[1];
+			match.splice( 1, 1 );
+
+			if ( left.substr( left.length - 1 ) !== "\\" ) {
+				match[1] = (match[1] || "").replace( rBackslash, "" );
+				set = Expr.find[ type ]( match, context, isXML );
+
+				if ( set != null ) {
+					expr = expr.replace( Expr.match[ type ], "" );
+					break;
+				}
+			}
+		}
+	}
+
+	if ( !set ) {
+		set = typeof context.getElementsByTagName !== "undefined" ?
+			context.getElementsByTagName( "*" ) :
+			[];
+	}
+
+	return { set: set, expr: expr };
+};
+
+Sizzle.filter = function( expr, set, inplace, not ) {
+	var match, anyFound,
+		type, found, item, filter, left,
+		i, pass,
+		old = expr,
+		result = [],
+		curLoop = set,
+		isXMLFilter = set && set[0] && Sizzle.isXML( set[0] );
+
+	while ( expr && set.length ) {
+		for ( type in Expr.filter ) {
+			if ( (match = Expr.leftMatch[ type ].exec( expr )) != null && match[2] ) {
+				filter = Expr.filter[ type ];
+				left = match[1];
+
+				anyFound = false;
+
+				match.splice(1,1);
+
+				if ( left.substr( left.length - 1 ) === "\\" ) {
+					continue;
+				}
+
+				if ( curLoop === result ) {
+					result = [];
+				}
+
+				if ( Expr.preFilter[ type ] ) {
+					match = Expr.preFilter[ type ]( match, curLoop, inplace, result, not, isXMLFilter );
+
+					if ( !match ) {
+						anyFound = found = true;
+
+					} else if ( match === true ) {
+						continue;
+					}
+				}
+
+				if ( match ) {
+					for ( i = 0; (item = curLoop[i]) != null; i++ ) {
+						if ( item ) {
+							found = filter( item, match, i, curLoop );
+							pass = not ^ found;
+
+							if ( inplace && found != null ) {
+								if ( pass ) {
+									anyFound = true;
+
+								} else {
+									curLoop[i] = false;
+								}
+
+							} else if ( pass ) {
+								result.push( item );
+								anyFound = true;
+							}
+						}
+					}
+				}
+
+				if ( found !== undefined ) {
+					if ( !inplace ) {
+						curLoop = result;
+					}
+
+					expr = expr.replace( Expr.match[ type ], "" );
+
+					if ( !anyFound ) {
+						return [];
+					}
+
+					break;
+				}
+			}
+		}
+
+		// Improper expression
+		if ( expr === old ) {
+			if ( anyFound == null ) {
+				Sizzle.error( expr );
+
+			} else {
+				break;
+			}
+		}
+
+		old = expr;
+	}
+
+	return curLoop;
+};
+
+Sizzle.error = function( msg ) {
+	throw new Error( "Syntax error, unrecognized expression: " + msg );
+};
+
+/**
+ * Utility function for retreiving the text value of an array of DOM nodes
+ * @param {Array|Element} elem
+ */
+var getText = Sizzle.getText = function( elem ) {
+    var i, node,
+		nodeType = elem.nodeType,
+		ret = "";
+
+	if ( nodeType ) {
+		if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) {
+			// Use textContent || innerText for elements
+			if ( typeof elem.textContent === 'string' ) {
+				return elem.textContent;
+			} else if ( typeof elem.innerText === 'string' ) {
+				// Replace IE's carriage returns
+				return elem.innerText.replace( rReturn, '' );
+			} else {
+				// Traverse it's children
+				for ( elem = elem.firstChild; elem; elem = elem.nextSibling) {
+					ret += getText( elem );
+				}
+			}
+		} else if ( nodeType === 3 || nodeType === 4 ) {
+			return elem.nodeValue;
+		}
+	} else {
+
+		// If no nodeType, this is expected to be an array
+		for ( i = 0; (node = elem[i]); i++ ) {
+			// Do not traverse comment nodes
+			if ( node.nodeType !== 8 ) {
+				ret += getText( node );
+			}
+		}
+	}
+	return ret;
+};
+
+var Expr = Sizzle.selectors = {
+	order: [ "ID", "NAME", "TAG" ],
+
+	match: {
+		ID: /#((?:[\w\u00c0-\uFFFF\-]|\\.)+)/,
+		CLASS: /\.((?:[\w\u00c0-\uFFFF\-]|\\.)+)/,
+		NAME: /\[name=['"]*((?:[\w\u00c0-\uFFFF\-]|\\.)+)['"]*\]/,
+		ATTR: /\[\s*((?:[\w\u00c0-\uFFFF\-]|\\.)+)\s*(?:(\S?=)\s*(?:(['"])(.*?)\3|(#?(?:[\w\u00c0-\uFFFF\-]|\\.)*)|)|)\s*\]/,
+		TAG: /^((?:[\w\u00c0-\uFFFF\*\-]|\\.)+)/,
+		CHILD: /:(only|nth|last|first)-child(?:\(\s*(even|odd|(?:[+\-]?\d+|(?:[+\-]?\d*)?n\s*(?:[+\-]\s*\d+)?))\s*\))?/,
+		POS: /:(nth|eq|gt|lt|first|last|even|odd)(?:\((\d*)\))?(?=[^\-]|$)/,
+		PSEUDO: /:((?:[\w\u00c0-\uFFFF\-]|\\.)+)(?:\((['"]?)((?:\([^\)]+\)|[^\(\)]*)+)\2\))?/
+	},
+
+	leftMatch: {},
+
+	attrMap: {
+		"class": "className",
+		"for": "htmlFor"
+	},
+
+	attrHandle: {
+		href: function( elem ) {
+			return elem.getAttribute( "href" );
+		},
+		type: function( elem ) {
+			return elem.getAttribute( "type" );
+		}
+	},
+
+	relative: {
+		"+": function(checkSet, part){
+			var isPartStr = typeof part === "string",
+				isTag = isPartStr && !rNonWord.test( part ),
+				isPartStrNotTag = isPartStr && !isTag;
+
+			if ( isTag ) {
+				part = part.toLowerCase();
+			}
+
+			for ( var i = 0, l = checkSet.length, elem; i < l; i++ ) {
+				if ( (elem = checkSet[i]) ) {
+					while ( (elem = elem.previousSibling) && elem.nodeType !== 1 ) {}
+
+					checkSet[i] = isPartStrNotTag || elem && elem.nodeName.toLowerCase() === part ?
+						elem || false :
+						elem === part;
+				}
+			}
+
+			if ( isPartStrNotTag ) {
+				Sizzle.filter( part, checkSet, true );
+			}
+		},
+
+		">": function( checkSet, part ) {
+			var elem,
+				isPartStr = typeof part === "string",
+				i = 0,
+				l = checkSet.length;
+
+			if ( isPartStr && !rNonWord.test( part ) ) {
+				part = part.toLowerCase();
+
+				for ( ; i < l; i++ ) {
+					elem = checkSet[i];
+
+					if ( elem ) {
+						var parent = elem.parentNode;
+						checkSet[i] = parent.nodeName.toLowerCase() === part ? parent : false;
+					}
+				}
+
+			} else {
+				for ( ; i < l; i++ ) {
+					elem = checkSet[i];
+
+					if ( elem ) {
+						checkSet[i] = isPartStr ?
+							elem.parentNode :
+							elem.parentNode === part;
+					}
+				}
+
+				if ( isPartStr ) {
+					Sizzle.filter( part, checkSet, true );
+				}
+			}
+		},
+
+		"": function(checkSet, part, isXML){
+			var nodeCheck,
+				doneName = done++,
+				checkFn = dirCheck;
+
+			if ( typeof part === "string" && !rNonWord.test( part ) ) {
+				part = part.toLowerCase();
+				nodeCheck = part;
+				checkFn = dirNodeCheck;
+			}
+
+			checkFn( "parentNode", part, doneName, checkSet, nodeCheck, isXML );
+		},
+
+		"~": function( checkSet, part, isXML ) {
+			var nodeCheck,
+				doneName = done++,
+				checkFn = dirCheck;
+
+			if ( typeof part === "string" && !rNonWord.test( part ) ) {
+				part = part.toLowerCase();
+				nodeCheck = part;
+				checkFn = dirNodeCheck;
+			}
+
+			checkFn( "previousSibling", part, doneName, checkSet, nodeCheck, isXML );
+		}
+	},
+
+	find: {
+		ID: function( match, context, isXML ) {
+			if ( typeof context.getElementById !== "undefined" && !isXML ) {
+				var m = context.getElementById(match[1]);
+				// Check parentNode to catch when Blackberry 4.6 returns
+				// nodes that are no longer in the document #6963
+				return m && m.parentNode ? [m] : [];
+			}
+		},
+
+		NAME: function( match, context ) {
+			if ( typeof context.getElementsByName !== "undefined" ) {
+				var ret = [],
+					results = context.getElementsByName( match[1] );
+
+				for ( var i = 0, l = results.length; i < l; i++ ) {
+					if ( results[i].getAttribute("name") === match[1] ) {
+						ret.push( results[i] );
+					}
+				}
+
+				return ret.length === 0 ? null : ret;
+			}
+		},
+
+		TAG: function( match, context ) {
+			if ( typeof context.getElementsByTagName !== "undefined" ) {
+				return context.getElementsByTagName( match[1] );
+			}
+		}
+	},
+	preFilter: {
+		CLASS: function( match, curLoop, inplace, result, not, isXML ) {
+			match = " " + match[1].replace( rBackslash, "" ) + " ";
+
+			if ( isXML ) {
+				return match;
+			}
+
+			for ( var i = 0, elem; (elem = curLoop[i]) != null; i++ ) {
+				if ( elem ) {
+					if ( not ^ (elem.className && (" " + elem.className + " ").replace(/[\t\n\r]/g, " ").indexOf(match) >= 0) ) {
+						if ( !inplace ) {
+							result.push( elem );
+						}
+
+					} else if ( inplace ) {
+						curLoop[i] = false;
+					}
+				}
+			}
+
+			return false;
+		},
+
+		ID: function( match ) {
+			return match[1].replace( rBackslash, "" );
+		},
+
+		TAG: function( match, curLoop ) {
+			return match[1].replace( rBackslash, "" ).toLowerCase();
+		},
+
+		CHILD: function( match ) {
+			if ( match[1] === "nth" ) {
+				if ( !match[2] ) {
+					Sizzle.error( match[0] );
+				}
+
+				match[2] = match[2].replace(/^\+|\s*/g, '');
+
+				// parse equations like 'even', 'odd', '5', '2n', '3n+2', '4n-1', '-n+6'
+				var test = /(-?)(\d*)(?:n([+\-]?\d*))?/.exec(
+					match[2] === "even" && "2n" || match[2] === "odd" && "2n+1" ||
+					!/\D/.test( match[2] ) && "0n+" + match[2] || match[2]);
+
+				// calculate the numbers (first)n+(last) including if they are negative
+				match[2] = (test[1] + (test[2] || 1)) - 0;
+				match[3] = test[3] - 0;
+			}
+			else if ( match[2] ) {
+				Sizzle.error( match[0] );
+			}
+
+			// TODO: Move to normal caching system
+			match[0] = done++;
+
+			return match;
+		},
+
+		ATTR: function( match, curLoop, inplace, result, not, isXML ) {
+			var name = match[1] = match[1].replace( rBackslash, "" );
+
+			if ( !isXML && Expr.attrMap[name] ) {
+				match[1] = Expr.attrMap[name];
+			}
+
+			// Handle if an un-quoted value was used
+			match[4] = ( match[4] || match[5] || "" ).replace( rBackslash, "" );
+
+			if ( match[2] === "~=" ) {
+				match[4] = " " + match[4] + " ";
+			}
+
+			return match;
+		},
+
+		PSEUDO: function( match, curLoop, inplace, result, not ) {
+			if ( match[1] === "not" ) {
+				// If we're dealing with a complex expression, or a simple one
+				if ( ( chunker.exec(match[3]) || "" ).length > 1 || /^\w/.test(match[3]) ) {
+					match[3] = Sizzle(match[3], null, null, curLoop);
+
+				} else {
+					var ret = Sizzle.filter(match[3], curLoop, inplace, true ^ not);
+
+					if ( !inplace ) {
+						result.push.apply( result, ret );
+					}
+
+					return false;
+				}
+
+			} else if ( Expr.match.POS.test( match[0] ) || Expr.match.CHILD.test( match[0] ) ) {
+				return true;
+			}
+
+			return match;
+		},
+
+		POS: function( match ) {
+			match.unshift( true );
+
+			return match;
+		}
+	},
+
+	filters: {
+		enabled: function( elem ) {
+			return elem.disabled === false && elem.type !== "hidden";
+		},
+
+		disabled: function( elem ) {
+			return elem.disabled === true;
+		},
+
+		checked: function( elem ) {
+			return elem.checked === true;
+		},
+
+		selected: function( elem ) {
+			// Accessing this property makes selected-by-default
+			// options in Safari work properly
+			if ( elem.parentNode ) {
+				elem.parentNode.selectedIndex;
+			}
+
+			return elem.selected === true;
+		},
+
+		parent: function( elem ) {
+			return !!elem.firstChild;
+		},
+
+		empty: function( elem ) {
+			return !elem.firstChild;
+		},
+
+		has: function( elem, i, match ) {
+			return !!Sizzle( match[3], elem ).length;
+		},
+
+		header: function( elem ) {
+			return (/h\d/i).test( elem.nodeName );
+		},
+
+		text: function( elem ) {
+			var attr = elem.getAttribute( "type" ), type = elem.type;
+			// IE6 and 7 will map elem.type to 'text' for new HTML5 types (search, etc)
+			// use getAttribute instead to test this case
+			return elem.nodeName.toLowerCase() === "input" && "text" === type && ( attr === type || attr === null );
+		},
+
+		radio: function( elem ) {
+			return elem.nodeName.toLowerCase() === "input" && "radio" === elem.type;
+		},
+
+		checkbox: function( elem ) {
+			return elem.nodeName.toLowerCase() === "input" && "checkbox" === elem.type;
+		},
+
+		file: function( elem ) {
+			return elem.nodeName.toLowerCase() === "input" && "file" === elem.type;
+		},
+
+		password: function( elem ) {
+			return elem.nodeName.toLowerCase() === "input" && "password" === elem.type;
+		},
+
+		submit: function( elem ) {
+			var name = elem.nodeName.toLowerCase();
+			return (name === "input" || name === "button") && "submit" === elem.type;
+		},
+
+		image: function( elem ) {
+			return elem.nodeName.toLowerCase() === "input" && "image" === elem.type;
+		},
+
+		reset: function( elem ) {
+			var name = elem.nodeName.toLowerCase();
+			return (name === "input" || name === "button") && "reset" === elem.type;
+		},
+
+		button: function( elem ) {
+			var name = elem.nodeName.toLowerCase();
+			return name === "input" && "button" === elem.type || name === "button";
+		},
+
+		input: function( elem ) {
+			return (/input|select|textarea|button/i).test( elem.nodeName );
+		},
+
+		focus: function( elem ) {
+			return elem === elem.ownerDocument.activeElement;
+		}
+	},
+	setFilters: {
+		first: function( elem, i ) {
+			return i === 0;
+		},
+
+		last: function( elem, i, match, array ) {
+			return i === array.length - 1;
+		},
+
+		even: function( elem, i ) {
+			return i % 2 === 0;
+		},
+
+		odd: function( elem, i ) {
+			return i % 2 === 1;
+		},
+
+		lt: function( elem, i, match ) {
+			return i < match[3] - 0;
+		},
+
+		gt: function( elem, i, match ) {
+			return i > match[3] - 0;
+		},
+
+		nth: function( elem, i, match ) {
+			return match[3] - 0 === i;
+		},
+
+		eq: function( elem, i, match ) {
+			return match[3] - 0 === i;
+		}
+	},
+	filter: {
+		PSEUDO: function( elem, match, i, array ) {
+			var name = match[1],
+				filter = Expr.filters[ name ];
+
+			if ( filter ) {
+				return filter( elem, i, match, array );
+
+			} else if ( name === "contains" ) {
+				return (elem.textContent || elem.innerText || getText([ elem ]) || "").indexOf(match[3]) >= 0;
+
+			} else if ( name === "not" ) {
+				var not = match[3];
+
+				for ( var j = 0, l = not.length; j < l; j++ ) {
+					if ( not[j] === elem ) {
+						return false;
+					}
+				}
+
+				return true;
+
+			} else {
+				Sizzle.error( name );
+			}
+		},
+
+		CHILD: function( elem, match ) {
+			var first, last,
+				doneName, parent, cache,
+				count, diff,
+				type = match[1],
+				node = elem;
+
+			switch ( type ) {
+				case "only":
+				case "first":
+					while ( (node = node.previousSibling) ) {
+						if ( node.nodeType === 1 ) {
+							return false;
+						}
+					}
+
+					if ( type === "first" ) {
+						return true;
+					}
+
+					node = elem;
+
+					/* falls through */
+				case "last":
+					while ( (node = node.nextSibling) ) {
+						if ( node.nodeType === 1 ) {
+							return false;
+						}
+					}
+
+					return true;
+
+				case "nth":
+					first = match[2];
+					last = match[3];
+
+					if ( first === 1 && last === 0 ) {
+						return true;
+					}
+
+					doneName = match[0];
+					parent = elem.parentNode;
+
+					if ( parent && (parent[ expando ] !== doneName || !elem.nodeIndex) ) {
+						count = 0;
+
+						for ( node = parent.firstChild; node; node = node.nextSibling ) {
+							if ( node.nodeType === 1 ) {
+								node.nodeIndex = ++count;
+							}
+						}
+
+						parent[ expando ] = doneName;
+					}
+
+					diff = elem.nodeIndex - last;
+
+					if ( first === 0 ) {
+						return diff === 0;
+
+					} else {
+						return ( diff % first === 0 && diff / first >= 0 );
+					}
+			}
+		},
+
+		ID: function( elem, match ) {
+			return elem.nodeType === 1 && elem.getAttribute("id") === match;
+		},
+
+		TAG: function( elem, match ) {
+			return (match === "*" && elem.nodeType === 1) || !!elem.nodeName && elem.nodeName.toLowerCase() === match;
+		},
+
+		CLASS: function( elem, match ) {
+			return (" " + (elem.className || elem.getAttribute("class")) + " ")
+				.indexOf( match ) > -1;
+		},
+
+		ATTR: function( elem, match ) {
+			var name = match[1],
+				result = Sizzle.attr ?
+					Sizzle.attr( elem, name ) :
+					Expr.attrHandle[ name ] ?
+					Expr.attrHandle[ name ]( elem ) :
+					elem[ name ] != null ?
+						elem[ name ] :
+						elem.getAttribute( name ),
+				value = result + "",
+				type = match[2],
+				check = match[4];
+
+			return result == null ?
+				type === "!=" :
+				!type && Sizzle.attr ?
+				result != null :
+				type === "=" ?
+				value === check :
+				type === "*=" ?
+				value.indexOf(check) >= 0 :
+				type === "~=" ?
+				(" " + value + " ").indexOf(check) >= 0 :
+				!check ?
+				value && result !== false :
+				type === "!=" ?
+				value !== check :
+				type === "^=" ?
+				value.indexOf(check) === 0 :
+				type === "$=" ?
+				value.substr(value.length - check.length) === check :
+				type === "|=" ?
+				value === check || value.substr(0, check.length + 1) === check + "-" :
+				false;
+		},
+
+		POS: function( elem, match, i, array ) {
+			var name = match[2],
+				filter = Expr.setFilters[ name ];
+
+			if ( filter ) {
+				return filter( elem, i, match, array );
+			}
+		}
+	}
+};
+
+var origPOS = Expr.match.POS,
+	fescape = function(all, num){
+		return "\\" + (num - 0 + 1);
+	};
+
+for ( var type in Expr.match ) {
+	Expr.match[ type ] = new RegExp( Expr.match[ type ].source + (/(?![^\[]*\])(?![^\(]*\))/.source) );
+	Expr.leftMatch[ type ] = new RegExp( /(^(?:.|\r|\n)*?)/.source + Expr.match[ type ].source.replace(/\\(\d+)/g, fescape) );
+}
+// Expose origPOS
+// "global" as in regardless of relation to brackets/parens
+Expr.match.globalPOS = origPOS;
+
+var makeArray = function( array, results ) {
+	array = Array.prototype.slice.call( array, 0 );
+
+	if ( results ) {
+		results.push.apply( results, array );
+		return results;
+	}
+
+	return array;
+};
+
+// Perform a simple check to determine if the browser is capable of
+// converting a NodeList to an array using builtin methods.
+// Also verifies that the returned array holds DOM nodes
+// (which is not the case in the Blackberry browser)
+try {
+	Array.prototype.slice.call( document.documentElement.childNodes, 0 )[0].nodeType;
+
+// Provide a fallback method if it does not work
+} catch( e ) {
+	makeArray = function( array, results ) {
+		var i = 0,
+			ret = results || [];
+
+		if ( toString.call(array) === "[object Array]" ) {
+			Array.prototype.push.apply( ret, array );
+
+		} else {
+			if ( typeof array.length === "number" ) {
+				for ( var l = array.length; i < l; i++ ) {
+					ret.push( array[i] );
+				}
+
+			} else {
+				for ( ; array[i]; i++ ) {
+					ret.push( array[i] );
+				}
+			}
+		}
+
+		return ret;
+	};
+}
+
+var sortOrder, siblingCheck;
+
+if ( document.documentElement.compareDocumentPosition ) {
+	sortOrder = function( a, b ) {
+		if ( a === b ) {
+			hasDuplicate = true;
+			return 0;
+		}
+
+		if ( !a.compareDocumentPosition || !b.compareDocumentPosition ) {
+			return a.compareDocumentPosition ? -1 : 1;
+		}
+
+		return a.compareDocumentPosition(b) & 4 ? -1 : 1;
+	};
+
+} else {
+	sortOrder = function( a, b ) {
+		// The nodes are identical, we can exit early
+		if ( a === b ) {
+			hasDuplicate = true;
+			return 0;
+
+		// Fallback to using sourceIndex (in IE) if it's available on both nodes
+		} else if ( a.sourceIndex && b.sourceIndex ) {
+			return a.sourceIndex - b.sourceIndex;
+		}
+
+		var al, bl,
+			ap = [],
+			bp = [],
+			aup = a.parentNode,
+			bup = b.parentNode,
+			cur = aup;
+
+		// If the nodes are siblings (or identical) we can do a quick check
+		if ( aup === bup ) {
+			return siblingCheck( a, b );
+
+		// If no parents were found then the nodes are disconnected
+		} else if ( !aup ) {
+			return -1;
+
+		} else if ( !bup ) {
+			return 1;
+		}
+
+		// Otherwise they're somewhere else in the tree so we need
+		// to build up a full list of the parentNodes for comparison
+		while ( cur ) {
+			ap.unshift( cur );
+			cur = cur.parentNode;
+		}
+
+		cur = bup;
+
+		while ( cur ) {
+			bp.unshift( cur );
+			cur = cur.parentNode;
+		}
+
+		al = ap.length;
+		bl = bp.length;
+
+		// Start walking down the tree looking for a discrepancy
+		for ( var i = 0; i < al && i < bl; i++ ) {
+			if ( ap[i] !== bp[i] ) {
+				return siblingCheck( ap[i], bp[i] );
+			}
+		}
+
+		// We ended someplace up the tree so do a sibling check
+		return i === al ?
+			siblingCheck( a, bp[i], -1 ) :
+			siblingCheck( ap[i], b, 1 );
+	};
+
+	siblingCheck = function( a, b, ret ) {
+		if ( a === b ) {
+			return ret;
+		}
+
+		var cur = a.nextSibling;
+
+		while ( cur ) {
+			if ( cur === b ) {
+				return -1;
+			}
+
+			cur = cur.nextSibling;
+		}
+
+		return 1;
+	};
+}
+
+// Check to see if the browser returns elements by name when
+// querying by getElementById (and provide a workaround)
+(function(){
+	// We're going to inject a fake input element with a specified name
+	var form = document.createElement("div"),
+		id = "script" + (new Date()).getTime(),
+		root = document.documentElement;
+
+	form.innerHTML = "<a name='" + id + "'/>";
+
+	// Inject it into the root element, check its status, and remove it quickly
+	root.insertBefore( form, root.firstChild );
+
+	// The workaround has to do additional checks after a getElementById
+	// Which slows things down for other browsers (hence the branching)
+	if ( document.getElementById( id ) ) {
+		Expr.find.ID = function( match, context, isXML ) {
+			if ( typeof context.getElementById !== "undefined" && !isXML ) {
+				var m = context.getElementById(match[1]);
+
+				return m ?
+					m.id === match[1] || typeof m.getAttributeNode !== "undefined" && m.getAttributeNode("id").nodeValue === match[1] ?
+						[m] :
+						undefined :
+					[];
+			}
+		};
+
+		Expr.filter.ID = function( elem, match ) {
+			var node = typeof elem.getAttributeNode !== "undefined" && elem.getAttributeNode("id");
+
+			return elem.nodeType === 1 && node && node.nodeValue === match;
+		};
+	}
+
+	root.removeChild( form );
+
+	// release memory in IE
+	root = form = null;
+})();
+
+(function(){
+	// Check to see if the browser returns only elements
+	// when doing getElementsByTagName("*")
+
+	// Create a fake element
+	var div = document.createElement("div");
+	div.appendChild( document.createComment("") );
+
+	// Make sure no comments are found
+	if ( div.getElementsByTagName("*").length > 0 ) {
+		Expr.find.TAG = function( match, context ) {
+			var results = context.getElementsByTagName( match[1] );
+
+			// Filter out possible comments
+			if ( match[1] === "*" ) {
+				var tmp = [];
+
+				for ( var i = 0; results[i]; i++ ) {
+					if ( results[i].nodeType === 1 ) {
+						tmp.push( results[i] );
+					}
+				}
+
+				results = tmp;
+			}
+
+			return results;
+		};
+	}
+
+	// Check to see if an attribute returns normalized href attributes
+	div.innerHTML = "<a href='#'></a>";
+
+	if ( div.firstChild && typeof div.firstChild.getAttribute !== "undefined" &&
+			div.firstChild.getAttribute("href") !== "#" ) {
+
+		Expr.attrHandle.href = function( elem ) {
+			return elem.getAttribute( "href", 2 );
+		};
+	}
+
+	// release memory in IE
+	div = null;
+})();
+
+if ( document.querySelectorAll ) {
+	(function(){
+		var oldSizzle = Sizzle,
+			div = document.createElement("div"),
+			id = "__sizzle__";
+
+		div.innerHTML = "<p class='TEST'></p>";
+
+		// Safari can't handle uppercase or unicode characters when
+		// in quirks mode.
+		if ( div.querySelectorAll && div.querySelectorAll(".TEST").length === 0 ) {
+			return;
+		}
+
+		Sizzle = function( query, context, extra, seed ) {
+			context = context || document;
+
+			// Only use querySelectorAll on non-XML documents
+			// (ID selectors don't work in non-HTML documents)
+			if ( !seed && !Sizzle.isXML(context) ) {
+				// See if we find a selector to speed up
+				var match = /^(\w+$)|^\.([\w\-]+$)|^#([\w\-]+$)/.exec( query );
+
+				if ( match && (context.nodeType === 1 || context.nodeType === 9) ) {
+					// Speed-up: Sizzle("TAG")
+					if ( match[1] ) {
+						return makeArray( context.getElementsByTagName( query ), extra );
+
+					// Speed-up: Sizzle(".CLASS")
+					} else if ( match[2] && Expr.find.CLASS && context.getElementsByClassName ) {
+						return makeArray( context.getElementsByClassName( match[2] ), extra );
+					}
+				}
+
+				if ( context.nodeType === 9 ) {
+					// Speed-up: Sizzle("body")
+					// The body element only exists once, optimize finding it
+					if ( query === "body" && context.body ) {
+						return makeArray( [ context.body ], extra );
+
+					// Speed-up: Sizzle("#ID")
+					} else if ( match && match[3] ) {
+						var elem = context.getElementById( match[3] );
+
+						// Check parentNode to catch when Blackberry 4.6 returns
+						// nodes that are no longer in the document #6963
+						if ( elem && elem.parentNode ) {
+							// Handle the case where IE and Opera return items
+							// by name instead of ID
+							if ( elem.id === match[3] ) {
+								return makeArray( [ elem ], extra );
+							}
+
+						} else {
+							return makeArray( [], extra );
+						}
+					}
+
+					try {
+						return makeArray( context.querySelectorAll(query), extra );
+					} catch(qsaError) {}
+
+				// qSA works strangely on Element-rooted queries
+				// We can work around this by specifying an extra ID on the root
+				// and working up from there (Thanks to Andrew Dupont for the technique)
+				// IE 8 doesn't work on object elements
+				} else if ( context.nodeType === 1 && context.nodeName.toLowerCase() !== "object" ) {
+					var oldContext = context,
+						old = context.getAttribute( "id" ),
+						nid = old || id,
+						hasParent = context.parentNode,
+						relativeHierarchySelector = /^\s*[+~]/.test( query );
+
+					if ( !old ) {
+						context.setAttribute( "id", nid );
+					} else {
+						nid = nid.replace( /'/g, "\\$&" );
+					}
+					if ( relativeHierarchySelector && hasParent ) {
+						context = context.parentNode;
+					}
+
+					try {
+						if ( !relativeHierarchySelector || hasParent ) {
+							return makeArray( context.querySelectorAll( "[id='" + nid + "'] " + query ), extra );
+						}
+
+					} catch(pseudoError) {
+					} finally {
+						if ( !old ) {
+							oldContext.removeAttribute( "id" );
+						}
+					}
+				}
+			}
+
+			return oldSizzle(query, context, extra, seed);
+		};
+
+		for ( var prop in oldSizzle ) {
+			Sizzle[ prop ] = oldSizzle[ prop ];
+		}
+
+		// release memory in IE
+		div = null;
+	})();
+}
+
+(function(){
+	var html = document.documentElement,
+		matches = html.matchesSelector || html.mozMatchesSelector || html.webkitMatchesSelector || html.msMatchesSelector;
+
+	if ( matches ) {
+		// Check to see if it's possible to do matchesSelector
+		// on a disconnected node (IE 9 fails this)
+		var disconnectedMatch = !matches.call( document.createElement( "div" ), "div" ),
+			pseudoWorks = false;
+
+		try {
+			// This should fail with an exception
+			// Gecko does not error, returns false instead
+			matches.call( document.documentElement, "[test!='']:sizzle" );
+
+		} catch( pseudoError ) {
+			pseudoWorks = true;
+		}
+
+		Sizzle.matchesSelector = function( node, expr ) {
+			// Make sure that attribute selectors are quoted
+			expr = expr.replace(/\=\s*([^'"\]]*)\s*\]/g, "='$1']");
+
+			if ( !Sizzle.isXML( node ) ) {
+				try {
+					if ( pseudoWorks || !Expr.match.PSEUDO.test( expr ) && !/!=/.test( expr ) ) {
+						var ret = matches.call( node, expr );
+
+						// IE 9's matchesSelector returns false on disconnected nodes
+						if ( ret || !disconnectedMatch ||
+								// As well, disconnected nodes are said to be in a document
+								// fragment in IE 9, so check for that
+								node.document && node.document.nodeType !== 11 ) {
+							return ret;
+						}
+					}
+				} catch(e) {}
+			}
+
+			return Sizzle(expr, null, null, [node]).length > 0;
+		};
+	}
+})();
+
+(function(){
+	var div = document.createElement("div");
+
+	div.innerHTML = "<div class='test e'></div><div class='test'></div>";
+
+	// Opera can't find a second classname (in 9.6)
+	// Also, make sure that getElementsByClassName actually exists
+	if ( !div.getElementsByClassName || div.getElementsByClassName("e").length === 0 ) {
+		return;
+	}
+
+	// Safari caches class attributes, doesn't catch changes (in 3.2)
+	div.lastChild.className = "e";
+
+	if ( div.getElementsByClassName("e").length === 1 ) {
+		return;
+	}
+
+	Expr.order.splice(1, 0, "CLASS");
+	Expr.find.CLASS = function( match, context, isXML ) {
+		if ( typeof context.getElementsByClassName !== "undefined" && !isXML ) {
+			return context.getElementsByClassName(match[1]);
+		}
+	};
+
+	// release memory in IE
+	div = null;
+})();
+
+function dirNodeCheck( dir, cur, doneName, checkSet, nodeCheck, isXML ) {
+	for ( var i = 0, l = checkSet.length; i < l; i++ ) {
+		var elem = checkSet[i];
+
+		if ( elem ) {
+			var match = false;
+
+			elem = elem[dir];
+
+			while ( elem ) {
+				if ( elem[ expando ] === doneName ) {
+					match = checkSet[elem.sizset];
+					break;
+				}
+
+				if ( elem.nodeType === 1 && !isXML ){
+					elem[ expando ] = doneName;
+					elem.sizset = i;
+				}
+
+				if ( elem.nodeName.toLowerCase() === cur ) {
+					match = elem;
+					break;
+				}
+
+				elem = elem[dir];
+			}
+
+			checkSet[i] = match;
+		}
+	}
+}
+
+function dirCheck( dir, cur, doneName, checkSet, nodeCheck, isXML ) {
+	for ( var i = 0, l = checkSet.length; i < l; i++ ) {
+		var elem = checkSet[i];
+
+		if ( elem ) {
+			var match = false;
+
+			elem = elem[dir];
+
+			while ( elem ) {
+				if ( elem[ expando ] === doneName ) {
+					match = checkSet[elem.sizset];
+					break;
+				}
+
+				if ( elem.nodeType === 1 ) {
+					if ( !isXML ) {
+						elem[ expando ] = doneName;
+						elem.sizset = i;
+					}
+
+					if ( typeof cur !== "string" ) {
+						if ( elem === cur ) {
+							match = true;
+							break;
+						}
+
+					} else if ( Sizzle.filter( cur, [elem] ).length > 0 ) {
+						match = elem;
+						break;
+					}
+				}
+
+				elem = elem[dir];
+			}
+
+			checkSet[i] = match;
+		}
+	}
+}
+
+if ( document.documentElement.contains ) {
+	Sizzle.contains = function( a, b ) {
+		return a !== b && (a.contains ? a.contains(b) : true);
+	};
+
+} else if ( document.documentElement.compareDocumentPosition ) {
+	Sizzle.contains = function( a, b ) {
+		return !!(a.compareDocumentPosition(b) & 16);
+	};
+
+} else {
+	Sizzle.contains = function() {
+		return false;
+	};
+}
+
+Sizzle.isXML = function( elem ) {
+	// documentElement is verified for cases where it doesn't yet exist
+	// (such as loading iframes in IE - #4833)
+	var documentElement = (elem ? elem.ownerDocument || elem : 0).documentElement;
+
+	return documentElement ? documentElement.nodeName !== "HTML" : false;
+};
+
+var posProcess = function( selector, context, seed ) {
+	var match,
+		tmpSet = [],
+		later = "",
+		root = context.nodeType ? [context] : context;
+
+	// Position selectors must be done after the filter
+	// And so must :not(positional) so we move all PSEUDOs to the end
+	while ( (match = Expr.match.PSEUDO.exec( selector )) ) {
+		later += match[0];
+		selector = selector.replace( Expr.match.PSEUDO, "" );
+	}
+
+	selector = Expr.relative[selector] ? selector + "*" : selector;
+
+	for ( var i = 0, l = root.length; i < l; i++ ) {
+		Sizzle( selector, root[i], tmpSet, seed );
+	}
+
+	return Sizzle.filter( later, tmpSet );
+};
+
+// EXPOSE
+// Override sizzle attribute retrieval
+Sizzle.attr = jQuery.attr;
+Sizzle.selectors.attrMap = {};
+jQuery.find = Sizzle;
+jQuery.expr = Sizzle.selectors;
+jQuery.expr[":"] = jQuery.expr.filters;
+jQuery.unique = Sizzle.uniqueSort;
+jQuery.text = Sizzle.getText;
+jQuery.isXMLDoc = Sizzle.isXML;
+jQuery.contains = Sizzle.contains;
+
+
+})();
+
+
+var runtil = /Until$/,
+	rparentsprev = /^(?:parents|prevUntil|prevAll)/,
+	// Note: This RegExp should be improved, or likely pulled from Sizzle
+	rmultiselector = /,/,
+	isSimple = /^.[^:#\[\.,]*$/,
+	slice = Array.prototype.slice,
+	POS = jQuery.expr.match.globalPOS,
+	// methods guaranteed to produce a unique set when starting from a unique set
+	guaranteedUnique = {
+		children: true,
+		contents: true,
+		next: true,
+		prev: true
+	};
+
+jQuery.fn.extend({
+	find: function( selector ) {
+		var self = this,
+			i, l;
+
+		if ( typeof selector !== "string" ) {
+			return jQuery( selector ).filter(function() {
+				for ( i = 0, l = self.length; i < l; i++ ) {
+					if ( jQuery.contains( self[ i ], this ) ) {
+						return true;
+					}
+				}
+			});
+		}
+
+		var ret = this.pushStack( "", "find", selector ),
+			length, n, r;
+
+		for ( i = 0, l = this.length; i < l; i++ ) {
+			length = ret.length;
+			jQuery.find( selector, this[i], ret );
+
+			if ( i > 0 ) {
+				// Make sure that the results are unique
+				for ( n = length; n < ret.length; n++ ) {
+					for ( r = 0; r < length; r++ ) {
+						if ( ret[r] === ret[n] ) {
+							ret.splice(n--, 1);
+							break;
+						}
+					}
+				}
+			}
+		}
+
+		return ret;
+	},
+
+	has: function( target ) {
+		var targets = jQuery( target );
+		return this.filter(function() {
+			for ( var i = 0, l = targets.length; i < l; i++ ) {
+				if ( jQuery.contains( this, targets[i] ) ) {
+					return true;
+				}
+			}
+		});
+	},
+
+	not: function( selector ) {
+		return this.pushStack( winnow(this, selector, false), "not", selector);
+	},
+
+	filter: function( selector ) {
+		return this.pushStack( winnow(this, selector, true), "filter", selector );
+	},
+
+	is: function( selector ) {
+		return !!selector && (
+			typeof selector === "string" ?
+				// If this is a positional selector, check membership in the returned set
+				// so $("p:first").is("p:last") won't return true for a doc with two "p".
+				POS.test( selector ) ?
+					jQuery( selector, this.context ).index( this[0] ) >= 0 :
+					jQuery.filter( selector, this ).length > 0 :
+				this.filter( selector ).length > 0 );
+	},
+
+	closest: function( selectors, context ) {
+		var ret = [], i, l, cur = this[0];
+
+		// Array (deprecated as of jQuery 1.7)
+		if ( jQuery.isArray( selectors ) ) {
+			var level = 1;
+
+			while ( cur && cur.ownerDocument && cur !== context ) {
+				for ( i = 0; i < selectors.length; i++ ) {
+
+					if ( jQuery( cur ).is( selectors[ i ] ) ) {
+						ret.push({ selector: selectors[ i ], elem: cur, level: level });
+					}
+				}
+
+				cur = cur.parentNode;
+				level++;
+			}
+
+			return ret;
+		}
+
+		// String
+		var pos = POS.test( selectors ) || typeof selectors !== "string" ?
+				jQuery( selectors, context || this.context ) :
+				0;
+
+		for ( i = 0, l = this.length; i < l; i++ ) {
+			cur = this[i];
+
+			while ( cur ) {
+				if ( pos ? pos.index(cur) > -1 : jQuery.find.matchesSelector(cur, selectors) ) {
+					ret.push( cur );
+					break;
+
+				} else {
+					cur = cur.parentNode;
+					if ( !cur || !cur.ownerDocument || cur === context || cur.nodeType === 11 ) {
+						break;
+					}
+				}
+			}
+		}
+
+		ret = ret.length > 1 ? jQuery.unique( ret ) : ret;
+
+		return this.pushStack( ret, "closest", selectors );
+	},
+
+	// Determine the position of an element within
+	// the matched set of elements
+	index: function( elem ) {
+
+		// No argument, return index in parent
+		if ( !elem ) {
+			return ( this[0] && this[0].parentNode ) ? this.prevAll().length : -1;
+		}
+
+		// index in selector
+		if ( typeof elem === "string" ) {
+			return jQuery.inArray( this[0], jQuery( elem ) );
+		}
+
+		// Locate the position of the desired element
+		return jQuery.inArray(
+			// If it receives a jQuery object, the first element is used
+			elem.jquery ? elem[0] : elem, this );
+	},
+
+	add: function( selector, context ) {
+		var set = typeof selector === "string" ?
+				jQuery( selector, context ) :
+				jQuery.makeArray( selector && selector.nodeType ? [ selector ] : selector ),
+			all = jQuery.merge( this.get(), set );
+
+		return this.pushStack( isDisconnected( set[0] ) || isDisconnected( all[0] ) ?
+			all :
+			jQuery.unique( all ) );
+	},
+
+	andSelf: function() {
+		return this.add( this.prevObject );
+	}
+});
+
+// A painfully simple check to see if an element is disconnected
+// from a document (should be improved, where feasible).
+function isDisconnected( node ) {
+	return !node || !node.parentNode || node.parentNode.nodeType === 11;
+}
+
+jQuery.each({
+	parent: function( elem ) {
+		var parent = elem.parentNode;
+		return parent && parent.nodeType !== 11 ? parent : null;
+	},
+	parents: function( elem ) {
+		return jQuery.dir( elem, "parentNode" );
+	},
+	parentsUntil: function( elem, i, until ) {
+		return jQuery.dir( elem, "parentNode", until );
+	},
+	next: function( elem ) {
+		return jQuery.nth( elem, 2, "nextSibling" );
+	},
+	prev: function( elem ) {
+		return jQuery.nth( elem, 2, "previousSibling" );
+	},
+	nextAll: function( elem ) {
+		return jQuery.dir( elem, "nextSibling" );
+	},
+	prevAll: function( elem ) {
+		return jQuery.dir( elem, "previousSibling" );
+	},
+	nextUntil: function( elem, i, until ) {
+		return jQuery.dir( elem, "nextSibling", until );
+	},
+	prevUntil: function( elem, i, until ) {
+		return jQuery.dir( elem, "previousSibling", until );
+	},
+	siblings: function( elem ) {
+		return jQuery.sibling( ( elem.parentNode || {} ).firstChild, elem );
+	},
+	children: function( elem ) {
+		return jQuery.sibling( elem.firstChild );
+	},
+	contents: function( elem ) {
+		return jQuery.nodeName( elem, "iframe" ) ?
+			elem.contentDocument || elem.contentWindow.document :
+			jQuery.makeArray( elem.childNodes );
+	}
+}, function( name, fn ) {
+	jQuery.fn[ name ] = function( until, selector ) {
+		var ret = jQuery.map( this, fn, until );
+
+		if ( !runtil.test( name ) ) {
+			selector = until;
+		}
+
+		if ( selector && typeof selector === "string" ) {
+			ret = jQuery.filter( selector, ret );
+		}
+
+		ret = this.length > 1 && !guaranteedUnique[ name ] ? jQuery.unique( ret ) : ret;
+
+		if ( (this.length > 1 || rmultiselector.test( selector )) && rparentsprev.test( name ) ) {
+			ret = ret.reverse();
+		}
+
+		return this.pushStack( ret, name, slice.call( arguments ).join(",") );
+	};
+});
+
+jQuery.extend({
+	filter: function( expr, elems, not ) {
+		if ( not ) {
+			expr = ":not(" + expr + ")";
+		}
+
+		return elems.length === 1 ?
+			jQuery.find.matchesSelector(elems[0], expr) ? [ elems[0] ] : [] :
+			jQuery.find.matches(expr, elems);
+	},
+
+	dir: function( elem, dir, until ) {
+		var matched = [],
+			cur = elem[ dir ];
+
+		while ( cur && cur.nodeType !== 9 && (until === undefined || cur.nodeType !== 1 || !jQuery( cur ).is( until )) ) {
+			if ( cur.nodeType === 1 ) {
+				matched.push( cur );
+			}
+			cur = cur[dir];
+		}
+		return matched;
+	},
+
+	nth: function( cur, result, dir, elem ) {
+		result = result || 1;
+		var num = 0;
+
+		for ( ; cur; cur = cur[dir] ) {
+			if ( cur.nodeType === 1 && ++num === result ) {
+				break;
+			}
+		}
+
+		return cur;
+	},
+
+	sibling: function( n, elem ) {
+		var r = [];
+
+		for ( ; n; n = n.nextSibling ) {
+			if ( n.nodeType === 1 && n !== elem ) {
+				r.push( n );
+			}
+		}
+
+		return r;
+	}
+});
+
+// Implement the identical functionality for filter and not
+function winnow( elements, qualifier, keep ) {
+
+	// Can't pass null or undefined to indexOf in Firefox 4
+	// Set to 0 to skip string check
+	qualifier = qualifier || 0;
+
+	if ( jQuery.isFunction( qualifier ) ) {
+		return jQuery.grep(elements, function( elem, i ) {
+			var retVal = !!qualifier.call( elem, i, elem );
+			return retVal === keep;
+		});
+
+	} else if ( qualifier.nodeType ) {
+		return jQuery.grep(elements, function( elem, i ) {
+			return ( elem === qualifier ) === keep;
+		});
+
+	} else if ( typeof qualifier === "string" ) {
+		var filtered = jQuery.grep(elements, function( elem ) {
+			return elem.nodeType === 1;
+		});
+
+		if ( isSimple.test( qualifier ) ) {
+			return jQuery.filter(qualifier, filtered, !keep);
+		} else {
+			qualifier = jQuery.filter( qualifier, filtered );
+		}
+	}
+
+	return jQuery.grep(elements, function( elem, i ) {
+		return ( jQuery.inArray( elem, qualifier ) >= 0 ) === keep;
+	});
+}
+
+
+
+
+function createSafeFragment( document ) {
+	var list = nodeNames.split( "|" ),
+	safeFrag = document.createDocumentFragment();
+
+	if ( safeFrag.createElement ) {
+		while ( list.length ) {
+			safeFrag.createElement(
+				list.pop()
+			);
+		}
+	}
+	return safeFrag;
+}
+
+var nodeNames = "abbr|article|aside|audio|bdi|canvas|data|datalist|details|figcaption|figure|footer|" +
+		"header|hgroup|mark|meter|nav|output|progress|section|summary|time|video",
+	rinlinejQuery = / jQuery\d+="(?:\d+|null)"/g,
+	rleadingWhitespace = /^\s+/,
+	rxhtmlTag = /<(?!area|br|col|embed|hr|img|input|link|meta|param)(([\w:]+)[^>]*)\/>/ig,
+	rtagName = /<([\w:]+)/,
+	rtbody = /<tbody/i,
+	rhtml = /<|&#?\w+;/,
+	rnoInnerhtml = /<(?:script|style)/i,
+	rnocache = /<(?:script|object|embed|option|style)/i,
+	rnoshimcache = new RegExp("<(?:" + nodeNames + ")[\\s/>]", "i"),
+	// checked="checked" or checked
+	rchecked = /checked\s*(?:[^=]|=\s*.checked.)/i,
+	rscriptType = /\/(java|ecma)script/i,
+	rcleanScript = /^\s*<!(?:\[CDATA\[|\-\-)/,
+	wrapMap = {
+		option: [ 1, "<select multiple='multiple'>", "</select>" ],
+		legend: [ 1, "<fieldset>", "</fieldset>" ],
+		thead: [ 1, "<table>", "</table>" ],
+		tr: [ 2, "<table><tbody>", "</tbody></table>" ],
+		td: [ 3, "<table><tbody><tr>", "</tr></tbody></table>" ],
+		col: [ 2, "<table><tbody></tbody><colgroup>", "</colgroup></table>" ],
+		area: [ 1, "<map>", "</map>" ],
+		_default: [ 0, "", "" ]
+	},
+	safeFragment = createSafeFragment( document );
+
+wrapMap.optgroup = wrapMap.option;
+wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead;
+wrapMap.th = wrapMap.td;
+
+// IE can't serialize <link> and <script> tags normally
+if ( !jQuery.support.htmlSerialize ) {
+	wrapMap._default = [ 1, "div<div>", "</div>" ];
+}
+
+jQuery.fn.extend({
+	text: function( value ) {
+		return jQuery.access( this, function( value ) {
+			return value === undefined ?
+				jQuery.text( this ) :
+				this.empty().append( ( this[0] && this[0].ownerDocument || document ).createTextNode( value ) );
+		}, null, value, arguments.length );
+	},
+
+	wrapAll: function( html ) {
+		if ( jQuery.isFunction( html ) ) {
+			return this.each(function(i) {
+				jQuery(this).wrapAll( html.call(this, i) );
+			});
+		}
+
+		if ( this[0] ) {
+			// The elements to wrap the target around
+			var wrap = jQuery( html, this[0].ownerDocument ).eq(0).clone(true);
+
+			if ( this[0].parentNode ) {
+				wrap.insertBefore( this[0] );
+			}
+
+			wrap.map(function() {
+				var elem = this;
+
+				while ( elem.firstChild && elem.firstChild.nodeType === 1 ) {
+					elem = elem.firstChild;
+				}
+
+				return elem;
+			}).append( this );
+		}
+
+		return this;
+	},
+
+	wrapInner: function( html ) {
+		if ( jQuery.isFunction( html ) ) {
+			return this.each(function(i) {
+				jQuery(this).wrapInner( html.call(this, i) );
+			});
+		}
+
+		return this.each(function() {
+			var self = jQuery( this ),
+				contents = self.contents();
+
+			if ( contents.length ) {
+				contents.wrapAll( html );
+
+			} else {
+				self.append( html );
+			}
+		});
+	},
+
+	wrap: function( html ) {
+		var isFunction = jQuery.isFunction( html );
+
+		return this.each(function(i) {
+			jQuery( this ).wrapAll( isFunction ? html.call(this, i) : html );
+		});
+	},
+
+	unwrap: function() {
+		return this.parent().each(function() {
+			if ( !jQuery.nodeName( this, "body" ) ) {
+				jQuery( this ).replaceWith( this.childNodes );
+			}
+		}).end();
+	},
+
+	append: function() {
+		return this.domManip(arguments, true, function( elem ) {
+			if ( this.nodeType === 1 ) {
+				this.appendChild( elem );
+			}
+		});
+	},
+
+	prepend: function() {
+		return this.domManip(arguments, true, function( elem ) {
+			if ( this.nodeType === 1 ) {
+				this.insertBefore( elem, this.firstChild );
+			}
+		});
+	},
+
+	before: function() {
+		if ( this[0] && this[0].parentNode ) {
+			return this.domManip(arguments, false, function( elem ) {
+				this.parentNode.insertBefore( elem, this );
+			});
+		} else if ( arguments.length ) {
+			var set = jQuery.clean( arguments );
+			set.push.apply( set, this.toArray() );
+			return this.pushStack( set, "before", arguments );
+		}
+	},
+
+	after: function() {
+		if ( this[0] && this[0].parentNode ) {
+			return this.domManip(arguments, false, function( elem ) {
+				this.parentNode.insertBefore( elem, this.nextSibling );
+			});
+		} else if ( arguments.length ) {
+			var set = this.pushStack( this, "after", arguments );
+			set.push.apply( set, jQuery.clean(arguments) );
+			return set;
+		}
+	},
+
+	// keepData is for internal use only--do not document
+	remove: function( selector, keepData ) {
+		for ( var i = 0, elem; (elem = this[i]) != null; i++ ) {
+			if ( !selector || jQuery.filter( selector, [ elem ] ).length ) {
+				if ( !keepData && elem.nodeType === 1 ) {
+					jQuery.cleanData( elem.getElementsByTagName("*") );
+					jQuery.cleanData( [ elem ] );
+				}
+
+				if ( elem.parentNode ) {
+					elem.parentNode.removeChild( elem );
+				}
+			}
+		}
+
+		return this;
+	},
+
+	empty: function() {
+		for ( var i = 0, elem; (elem = this[i]) != null; i++ ) {
+			// Remove element nodes and prevent memory leaks
+			if ( elem.nodeType === 1 ) {
+				jQuery.cleanData( elem.getElementsByTagName("*") );
+			}
+
+			// Remove any remaining nodes
+			while ( elem.firstChild ) {
+				elem.removeChild( elem.firstChild );
+			}
+		}
+
+		return this;
+	},
+
+	clone: function( dataAndEvents, deepDataAndEvents ) {
+		dataAndEvents = dataAndEvents == null ? false : dataAndEvents;
+		deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents;
+
+		return this.map( function () {
+			return jQuery.clone( this, dataAndEvents, deepDataAndEvents );
+		});
+	},
+
+	html: function( value ) {
+		return jQuery.access( this, function( value ) {
+			var elem = this[0] || {},
+				i = 0,
+				l = this.length;
+
+			if ( value === undefined ) {
+				return elem.nodeType === 1 ?
+					elem.innerHTML.replace( rinlinejQuery, "" ) :
+					null;
+			}
+
+
+			if ( typeof value === "string" && !rnoInnerhtml.test( value ) &&
+				( jQuery.support.leadingWhitespace || !rleadingWhitespace.test( value ) ) &&
+				!wrapMap[ ( rtagName.exec( value ) || ["", ""] )[1].toLowerCase() ] ) {
+
+				value = value.replace( rxhtmlTag, "<$1></$2>" );
+
+				try {
+					for (; i < l; i++ ) {
+						// Remove element nodes and prevent memory leaks
+						elem = this[i] || {};
+						if ( elem.nodeType === 1 ) {
+							jQuery.cleanData( elem.getElementsByTagName( "*" ) );
+							elem.innerHTML = value;
+						}
+					}
+
+					elem = 0;
+
+				// If using innerHTML throws an exception, use the fallback method
+				} catch(e) {}
+			}
+
+			if ( elem ) {
+				this.empty().append( value );
+			}
+		}, null, value, arguments.length );
+	},
+
+	replaceWith: function( value ) {
+		if ( this[0] && this[0].parentNode ) {
+			// Make sure that the elements are removed from the DOM before they are inserted
+			// this can help fix replacing a parent with child elements
+			if ( jQuery.isFunction( value ) ) {
+				return this.each(function(i) {
+					var self = jQuery(this), old = self.html();
+					self.replaceWith( value.call( this, i, old ) );
+				});
+			}
+
+			if ( typeof value !== "string" ) {
+				value = jQuery( value ).detach();
+			}
+
+			return this.each(function() {
+				var next = this.nextSibling,
+					parent = this.parentNode;
+
+				jQuery( this ).remove();
+
+				if ( next ) {
+					jQuery(next).before( value );
+				} else {
+					jQuery(parent).append( value );
+				}
+			});
+		} else {
+			return this.length ?
+				this.pushStack( jQuery(jQuery.isFunction(value) ? value() : value), "replaceWith", value ) :
+				this;
+		}
+	},
+
+	detach: function( selector ) {
+		return this.remove( selector, true );
+	},
+
+	domManip: function( args, table, callback ) {
+		var results, first, fragment, parent,
+			value = args[0],
+			scripts = [];
+
+		// We can't cloneNode fragments that contain checked, in WebKit
+		if ( !jQuery.support.checkClone && arguments.length === 3 && typeof value === "string" && rchecked.test( value ) ) {
+			return this.each(function() {
+				jQuery(this).domManip( args, table, callback, true );
+			});
+		}
+
+		if ( jQuery.isFunction(value) ) {
+			return this.each(function(i) {
+				var self = jQuery(this);
+				args[0] = value.call(this, i, table ? self.html() : undefined);
+				self.domManip( args, table, callback );
+			});
+		}
+
+		if ( this[0] ) {
+			parent = value && value.parentNode;
+
+			// If we're in a fragment, just use that instead of building a new one
+			if ( jQuery.support.parentNode && parent && parent.nodeType === 11 && parent.childNodes.length === this.length ) {
+				results = { fragment: parent };
+
+			} else {
+				results = jQuery.buildFragment( args, this, scripts );
+			}
+
+			fragment = results.fragment;
+
+			if ( fragment.childNodes.length === 1 ) {
+				first = fragment = fragment.firstChild;
+			} else {
+				first = fragment.firstChild;
+			}
+
+			if ( first ) {
+				table = table && jQuery.nodeName( first, "tr" );
+
+				for ( var i = 0, l = this.length, lastIndex = l - 1; i < l; i++ ) {
+					callback.call(
+						table ?
+							root(this[i], first) :
+							this[i],
+						// Make sure that we do not leak memory by inadvertently discarding
+						// the original fragment (which might have attached data) instead of
+						// using it; in addition, use the original fragment object for the last
+						// item instead of first because it can end up being emptied incorrectly
+						// in certain situations (Bug #8070).
+						// Fragments from the fragment cache must always be cloned and never used
+						// in place.
+						results.cacheable || ( l > 1 && i < lastIndex ) ?
+							jQuery.clone( fragment, true, true ) :
+							fragment
+					);
+				}
+			}
+
+			if ( scripts.length ) {
+				jQuery.each( scripts, function( i, elem ) {
+					if ( elem.src ) {
+						jQuery.ajax({
+							type: "GET",
+							global: false,
+							url: elem.src,
+							async: false,
+							dataType: "script"
+						});
+					} else {
+						jQuery.globalEval( ( elem.text || elem.textContent || elem.innerHTML || "" ).replace( rcleanScript, "/*$0*/" ) );
+					}
+
+					if ( elem.parentNode ) {
+						elem.parentNode.removeChild( elem );
+					}
+				});
+			}
+		}
+
+		return this;
+	}
+});
+
+function root( elem, cur ) {
+	return jQuery.nodeName(elem, "table") ?
+		(elem.getElementsByTagName("tbody")[0] ||
+		elem.appendChild(elem.ownerDocument.createElement("tbody"))) :
+		elem;
+}
+
+function cloneCopyEvent( src, dest ) {
+
+	if ( dest.nodeType !== 1 || !jQuery.hasData( src ) ) {
+		return;
+	}
+
+	var type, i, l,
+		oldData = jQuery._data( src ),
+		curData = jQuery._data( dest, oldData ),
+		events = oldData.events;
+
+	if ( events ) {
+		delete curData.handle;
+		curData.events = {};
+
+		for ( type in events ) {
+			for ( i = 0, l = events[ type ].length; i < l; i++ ) {
+				jQuery.event.add( dest, type, events[ type ][ i ] );
+			}
+		}
+	}
+
+	// make the cloned public data object a copy from the original
+	if ( curData.data ) {
+		curData.data = jQuery.extend( {}, curData.data );
+	}
+}
+
+function cloneFixAttributes( src, dest ) {
+	var nodeName;
+
+	// We do not need to do anything for non-Elements
+	if ( dest.nodeType !== 1 ) {
+		return;
+	}
+
+	// clearAttributes removes the attributes, which we don't want,
+	// but also removes the attachEvent events, which we *do* want
+	if ( dest.clearAttributes ) {
+		dest.clearAttributes();
+	}
+
+	// mergeAttributes, in contrast, only merges back on the
+	// original attributes, not the events
+	if ( dest.mergeAttributes ) {
+		dest.mergeAttributes( src );
+	}
+
+	nodeName = dest.nodeName.toLowerCase();
+
+	// IE6-8 fail to clone children inside object elements that use
+	// the proprietary classid attribute value (rather than the type
+	// attribute) to identify the type of content to display
+	if ( nodeName === "object" ) {
+		dest.outerHTML = src.outerHTML;
+
+	} else if ( nodeName === "input" && (src.type === "checkbox" || src.type === "radio") ) {
+		// IE6-8 fails to persist the checked state of a cloned checkbox
+		// or radio button. Worse, IE6-7 fail to give the cloned element
+		// a checked appearance if the defaultChecked value isn't also set
+		if ( src.checked ) {
+			dest.defaultChecked = dest.checked = src.checked;
+		}
+
+		// IE6-7 get confused and end up setting the value of a cloned
+		// checkbox/radio button to an empty string instead of "on"
+		if ( dest.value !== src.value ) {
+			dest.value = src.value;
+		}
+
+	// IE6-8 fails to return the selected option to the default selected
+	// state when cloning options
+	} else if ( nodeName === "option" ) {
+		dest.selected = src.defaultSelected;
+
+	// IE6-8 fails to set the defaultValue to the correct value when
+	// cloning other types of input fields
+	} else if ( nodeName === "input" || nodeName === "textarea" ) {
+		dest.defaultValue = src.defaultValue;
+
+	// IE blanks contents when cloning scripts
+	} else if ( nodeName === "script" && dest.text !== src.text ) {
+		dest.text = src.text;
+	}
+
+	// Event data gets referenced instead of copied if the expando
+	// gets copied too
+	dest.removeAttribute( jQuery.expando );
+
+	// Clear flags for bubbling special change/submit events, they must
+	// be reattached when the newly cloned events are first activated
+	dest.removeAttribute( "_submit_attached" );
+	dest.removeAttribute( "_change_attached" );
+}
+
+jQuery.buildFragment = function( args, nodes, scripts ) {
+	var fragment, cacheable, cacheresults, doc,
+	first = args[ 0 ];
+
+	// nodes may contain either an explicit document object,
+	// a jQuery collection or context object.
+	// If nodes[0] contains a valid object to assign to doc
+	if ( nodes && nodes[0] ) {
+		doc = nodes[0].ownerDocument || nodes[0];
+	}
+
+	// Ensure that an attr object doesn't incorrectly stand in as a document object
+	// Chrome and Firefox seem to allow this to occur and will throw exception
+	// Fixes #8950
+	if ( !doc.createDocumentFragment ) {
+		doc = document;
+	}
+
+	// Only cache "small" (1/2 KB) HTML strings that are associated with the main document
+	// Cloning options loses the selected state, so don't cache them
+	// IE 6 doesn't like it when you put <object> or <embed> elements in a fragment
+	// Also, WebKit does not clone 'checked' attributes on cloneNode, so don't cache
+	// Lastly, IE6,7,8 will not correctly reuse cached fragments that were created from unknown elems #10501
+	if ( args.length === 1 && typeof first === "string" && first.length < 512 && doc === document &&
+		first.charAt(0) === "<" && !rnocache.test( first ) &&
+		(jQuery.support.checkClone || !rchecked.test( first )) &&
+		(jQuery.support.html5Clone || !rnoshimcache.test( first )) ) {
+
+		cacheable = true;
+
+		cacheresults = jQuery.fragments[ first ];
+		if ( cacheresults && cacheresults !== 1 ) {
+			fragment = cacheresults;
+		}
+	}
+
+	if ( !fragment ) {
+		fragment = doc.createDocumentFragment();
+		jQuery.clean( args, doc, fragment, scripts );
+	}
+
+	if ( cacheable ) {
+		jQuery.fragments[ first ] = cacheresults ? fragment : 1;
+	}
+
+	return { fragment: fragment, cacheable: cacheable };
+};
+
+jQuery.fragments = {};
+
+jQuery.each({
+	appendTo: "append",
+	prependTo: "prepend",
+	insertBefore: "before",
+	insertAfter: "after",
+	replaceAll: "replaceWith"
+}, function( name, original ) {
+	jQuery.fn[ name ] = function( selector ) {
+		var ret = [],
+			insert = jQuery( selector ),
+			parent = this.length === 1 && this[0].parentNode;
+
+		if ( parent && parent.nodeType === 11 && parent.childNodes.length === 1 && insert.length === 1 ) {
+			insert[ original ]( this[0] );
+			return this;
+
+		} else {
+			for ( var i = 0, l = insert.length; i < l; i++ ) {
+				var elems = ( i > 0 ? this.clone(true) : this ).get();
+				jQuery( insert[i] )[ original ]( elems );
+				ret = ret.concat( elems );
+			}
+
+			return this.pushStack( ret, name, insert.selector );
+		}
+	};
+});
+
+function getAll( elem ) {
+	if ( typeof elem.getElementsByTagName !== "undefined" ) {
+		return elem.getElementsByTagName( "*" );
+
+	} else if ( typeof elem.querySelectorAll !== "undefined" ) {
+		return elem.querySelectorAll( "*" );
+
+	} else {
+		return [];
+	}
+}
+
+// Used in clean, fixes the defaultChecked property
+function fixDefaultChecked( elem ) {
+	if ( elem.type === "checkbox" || elem.type === "radio" ) {
+		elem.defaultChecked = elem.checked;
+	}
+}
+// Finds all inputs and passes them to fixDefaultChecked
+function findInputs( elem ) {
+	var nodeName = ( elem.nodeName || "" ).toLowerCase();
+	if ( nodeName === "input" ) {
+		fixDefaultChecked( elem );
+	// Skip scripts, get other children
+	} else if ( nodeName !== "script" && typeof elem.getElementsByTagName !== "undefined" ) {
+		jQuery.grep( elem.getElementsByTagName("input"), fixDefaultChecked );
+	}
+}
+
+// Derived From: http://www.iecss.com/shimprove/javascript/shimprove.1-0-1.js
+function shimCloneNode( elem ) {
+	var div = document.createElement( "div" );
+	safeFragment.appendChild( div );
+
+	div.innerHTML = elem.outerHTML;
+	return div.firstChild;
+}
+
+jQuery.extend({
+	clone: function( elem, dataAndEvents, deepDataAndEvents ) {
+		var srcElements,
+			destElements,
+			i,
+			// IE<=8 does not properly clone detached, unknown element nodes
+			clone = jQuery.support.html5Clone || jQuery.isXMLDoc(elem) || !rnoshimcache.test( "<" + elem.nodeName + ">" ) ?
+				elem.cloneNode( true ) :
+				shimCloneNode( elem );
+
+		if ( (!jQuery.support.noCloneEvent || !jQuery.support.noCloneChecked) &&
+				(elem.nodeType === 1 || elem.nodeType === 11) && !jQuery.isXMLDoc(elem) ) {
+			// IE copies events bound via attachEvent when using cloneNode.
+			// Calling detachEvent on the clone will also remove the events
+			// from the original. In order to get around this, we use some
+			// proprietary methods to clear the events. Thanks to MooTools
+			// guys for this hotness.
+
+			cloneFixAttributes( elem, clone );
+
+			// Using Sizzle here is crazy slow, so we use getElementsByTagName instead
+			srcElements = getAll( elem );
+			destElements = getAll( clone );
+
+			// Weird iteration because IE will replace the length property
+			// with an element if you are cloning the body and one of the
+			// elements on the page has a name or id of "length"
+			for ( i = 0; srcElements[i]; ++i ) {
+				// Ensure that the destination node is not null; Fixes #9587
+				if ( destElements[i] ) {
+					cloneFixAttributes( srcElements[i], destElements[i] );
+				}
+			}
+		}
+
+		// Copy the events from the original to the clone
+		if ( dataAndEvents ) {
+			cloneCopyEvent( elem, clone );
+
+			if ( deepDataAndEvents ) {
+				srcElements = getAll( elem );
+				destElements = getAll( clone );
+
+				for ( i = 0; srcElements[i]; ++i ) {
+					cloneCopyEvent( srcElements[i], destElements[i] );
+				}
+			}
+		}
+
+		srcElements = destElements = null;
+
+		// Return the cloned set
+		return clone;
+	},
+
+	clean: function( elems, context, fragment, scripts ) {
+		var checkScriptType, script, j,
+				ret = [];
+
+		context = context || document;
+
+		// !context.createElement fails in IE with an error but returns typeof 'object'
+		if ( typeof context.createElement === "undefined" ) {
+			context = context.ownerDocument || context[0] && context[0].ownerDocument || document;
+		}
+
+		for ( var i = 0, elem; (elem = elems[i]) != null; i++ ) {
+			if ( typeof elem === "number" ) {
+				elem += "";
+			}
+
+			if ( !elem ) {
+				continue;
+			}
+
+			// Convert html string into DOM nodes
+			if ( typeof elem === "string" ) {
+				if ( !rhtml.test( elem ) ) {
+					elem = context.createTextNode( elem );
+				} else {
+					// Fix "XHTML"-style tags in all browsers
+					elem = elem.replace(rxhtmlTag, "<$1></$2>");
+
+					// Trim whitespace, otherwise indexOf won't work as expected
+					var tag = ( rtagName.exec( elem ) || ["", ""] )[1].toLowerCase(),
+						wrap = wrapMap[ tag ] || wrapMap._default,
+						depth = wrap[0],
+						div = context.createElement("div"),
+						safeChildNodes = safeFragment.childNodes,
+						remove;
+
+					// Append wrapper element to unknown element safe doc fragment
+					if ( context === document ) {
+						// Use the fragment we've already created for this document
+						safeFragment.appendChild( div );
+					} else {
+						// Use a fragment created with the owner document
+						createSafeFragment( context ).appendChild( div );
+					}
+
+					// Go to html and back, then peel off extra wrappers
+					div.innerHTML = wrap[1] + elem + wrap[2];
+
+					// Move to the right depth
+					while ( depth-- ) {
+						div = div.lastChild;
+					}
+
+					// Remove IE's autoinserted <tbody> from table fragments
+					if ( !jQuery.support.tbody ) {
+
+						// String was a <table>, *may* have spurious <tbody>
+						var hasBody = rtbody.test(elem),
+							tbody = tag === "table" && !hasBody ?
+								div.firstChild && div.firstChild.childNodes :
+
+								// String was a bare <thead> or <tfoot>
+								wrap[1] === "<table>" && !hasBody ?
+									div.childNodes :
+									[];
+
+						for ( j = tbody.length - 1; j >= 0 ; --j ) {
+							if ( jQuery.nodeName( tbody[ j ], "tbody" ) && !tbody[ j ].childNodes.length ) {
+								tbody[ j ].parentNode.removeChild( tbody[ j ] );
+							}
+						}
+					}
+
+					// IE completely kills leading whitespace when innerHTML is used
+					if ( !jQuery.support.leadingWhitespace && rleadingWhitespace.test( elem ) ) {
+						div.insertBefore( context.createTextNode( rleadingWhitespace.exec(elem)[0] ), div.firstChild );
+					}
+
+					elem = div.childNodes;
+
+					// Clear elements from DocumentFragment (safeFragment or otherwise)
+					// to avoid hoarding elements. Fixes #11356
+					if ( div ) {
+						div.parentNode.removeChild( div );
+
+						// Guard against -1 index exceptions in FF3.6
+						if ( safeChildNodes.length > 0 ) {
+							remove = safeChildNodes[ safeChildNodes.length - 1 ];
+
+							if ( remove && remove.parentNode ) {
+								remove.parentNode.removeChild( remove );
+							}
+						}
+					}
+				}
+			}
+
+			// Resets defaultChecked for any radios and checkboxes
+			// about to be appended to the DOM in IE 6/7 (#8060)
+			var len;
+			if ( !jQuery.support.appendChecked ) {
+				if ( elem[0] && typeof (len = elem.length) === "number" ) {
+					for ( j = 0; j < len; j++ ) {
+						findInputs( elem[j] );
+					}
+				} else {
+					findInputs( elem );
+				}
+			}
+
+			if ( elem.nodeType ) {
+				ret.push( elem );
+			} else {
+				ret = jQuery.merge( ret, elem );
+			}
+		}
+
+		if ( fragment ) {
+			checkScriptType = function( elem ) {
+				return !elem.type || rscriptType.test( elem.type );
+			};
+			for ( i = 0; ret[i]; i++ ) {
+				script = ret[i];
+				if ( scripts && jQuery.nodeName( script, "script" ) && (!script.type || rscriptType.test( script.type )) ) {
+					scripts.push( script.parentNode ? script.parentNode.removeChild( script ) : script );
+
+				} else {
+					if ( script.nodeType === 1 ) {
+						var jsTags = jQuery.grep( script.getElementsByTagName( "script" ), checkScriptType );
+
+						ret.splice.apply( ret, [i + 1, 0].concat( jsTags ) );
+					}
+					fragment.appendChild( script );
+				}
+			}
+		}
+
+		return ret;
+	},
+
+	cleanData: function( elems ) {
+		var data, id,
+			cache = jQuery.cache,
+			special = jQuery.event.special,
+			deleteExpando = jQuery.support.deleteExpando;
+
+		for ( var i = 0, elem; (elem = elems[i]) != null; i++ ) {
+			if ( elem.nodeName && jQuery.noData[elem.nodeName.toLowerCase()] ) {
+				continue;
+			}
+
+			id = elem[ jQuery.expando ];
+
+			if ( id ) {
+				data = cache[ id ];
+
+				if ( data && data.events ) {
+					for ( var type in data.events ) {
+						if ( special[ type ] ) {
+							jQuery.event.remove( elem, type );
+
+						// This is a shortcut to avoid jQuery.event.remove's overhead
+						} else {
+							jQuery.removeEvent( elem, type, data.handle );
+						}
+					}
+
+					// Null the DOM reference to avoid IE6/7/8 leak (#7054)
+					if ( data.handle ) {
+						data.handle.elem = null;
+					}
+				}
+
+				if ( deleteExpando ) {
+					delete elem[ jQuery.expando ];
+
+				} else if ( elem.removeAttribute ) {
+					elem.removeAttribute( jQuery.expando );
+				}
+
+				delete cache[ id ];
+			}
+		}
+	}
+});
+
+
+
+
+var ralpha = /alpha\([^)]*\)/i,
+	ropacity = /opacity=([^)]*)/,
+	// fixed for IE9, see #8346
+	rupper = /([A-Z]|^ms)/g,
+	rnum = /^[\-+]?(?:\d*\.)?\d+$/i,
+	rnumnonpx = /^-?(?:\d*\.)?\d+(?!px)[^\d\s]+$/i,
+	rrelNum = /^([\-+])=([\-+.\de]+)/,
+	rmargin = /^margin/,
+
+	cssShow = { position: "absolute", visibility: "hidden", display: "block" },
+
+	// order is important!
+	cssExpand = [ "Top", "Right", "Bottom", "Left" ],
+
+	curCSS,
+
+	getComputedStyle,
+	currentStyle;
+
+jQuery.fn.css = function( name, value ) {
+	return jQuery.access( this, function( elem, name, value ) {
+		return value !== undefined ?
+			jQuery.style( elem, name, value ) :
+			jQuery.css( elem, name );
+	}, name, value, arguments.length > 1 );
+};
+
+jQuery.extend({
+	// Add in style property hooks for overriding the default
+	// behavior of getting and setting a style property
+	cssHooks: {
+		opacity: {
+			get: function( elem, computed ) {
+				if ( computed ) {
+					// We should always get a number back from opacity
+					var ret = curCSS( elem, "opacity" );
+					return ret === "" ? "1" : ret;
+
+				} else {
+					return elem.style.opacity;
+				}
+			}
+		}
+	},
+
+	// Exclude the following css properties to add px
+	cssNumber: {
+		"fillOpacity": true,
+		"fontWeight": true,
+		"lineHeight": true,
+		"opacity": true,
+		"orphans": true,
+		"widows": true,
+		"zIndex": true,
+		"zoom": true
+	},
+
+	// Add in properties whose names you wish to fix before
+	// setting or getting the value
+	cssProps: {
+		// normalize float css property
+		"float": jQuery.support.cssFloat ? "cssFloat" : "styleFloat"
+	},
+
+	// Get and set the style property on a DOM Node
+	style: function( elem, name, value, extra ) {
+		// Don't set styles on text and comment nodes
+		if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) {
+			return;
+		}
+
+		// Make sure that we're working with the right name
+		var ret, type, origName = jQuery.camelCase( name ),
+			style = elem.style, hooks = jQuery.cssHooks[ origName ];
+
+		name = jQuery.cssProps[ origName ] || origName;
+
+		// Check if we're setting a value
+		if ( value !== undefined ) {
+			type = typeof value;
+
+			// convert relative number strings (+= or -=) to relative numbers. #7345
+			if ( type === "string" && (ret = rrelNum.exec( value )) ) {
+				value = ( +( ret[1] + 1) * +ret[2] ) + parseFloat( jQuery.css( elem, name ) );
+				// Fixes bug #9237
+				type = "number";
+			}
+
+			// Make sure that NaN and null values aren't set. See: #7116
+			if ( value == null || type === "number" && isNaN( value ) ) {
+				return;
+			}
+
+			// If a number was passed in, add 'px' to the (except for certain CSS properties)
+			if ( type === "number" && !jQuery.cssNumber[ origName ] ) {
+				value += "px";
+			}
+
+			// If a hook was provided, use that value, otherwise just set the specified value
+			if ( !hooks || !("set" in hooks) || (value = hooks.set( elem, value )) !== undefined ) {
+				// Wrapped to prevent IE from throwing errors when 'invalid' values are provided
+				// Fixes bug #5509
+				try {
+					style[ name ] = value;
+				} catch(e) {}
+			}
+
+		} else {
+			// If a hook was provided get the non-computed value from there
+			if ( hooks && "get" in hooks && (ret = hooks.get( elem, false, extra )) !== undefined ) {
+				return ret;
+			}
+
+			// Otherwise just get the value from the style object
+			return style[ name ];
+		}
+	},
+
+	css: function( elem, name, extra ) {
+		var ret, hooks;
+
+		// Make sure that we're working with the right name
+		name = jQuery.camelCase( name );
+		hooks = jQuery.cssHooks[ name ];
+		name = jQuery.cssProps[ name ] || name;
+
+		// cssFloat needs a special treatment
+		if ( name === "cssFloat" ) {
+			name = "float";
+		}
+
+		// If a hook was provided get the computed value from there
+		if ( hooks && "get" in hooks && (ret = hooks.get( elem, true, extra )) !== undefined ) {
+			return ret;
+
+		// Otherwise, if a way to get the computed value exists, use that
+		} else if ( curCSS ) {
+			return curCSS( elem, name );
+		}
+	},
+
+	// A method for quickly swapping in/out CSS properties to get correct calculations
+	swap: function( elem, options, callback ) {
+		var old = {},
+			ret, name;
+
+		// Remember the old values, and insert the new ones
+		for ( name in options ) {
+			old[ name ] = elem.style[ name ];
+			elem.style[ name ] = options[ name ];
+		}
+
+		ret = callback.call( elem );
+
+		// Revert the old values
+		for ( name in options ) {
+			elem.style[ name ] = old[ name ];
+		}
+
+		return ret;
+	}
+});
+
+// DEPRECATED in 1.3, Use jQuery.css() instead
+jQuery.curCSS = jQuery.css;
+
+if ( document.defaultView && document.defaultView.getComputedStyle ) {
+	getComputedStyle = function( elem, name ) {
+		var ret, defaultView, computedStyle, width,
+			style = elem.style;
+
+		name = name.replace( rupper, "-$1" ).toLowerCase();
+
+		if ( (defaultView = elem.ownerDocument.defaultView) &&
+				(computedStyle = defaultView.getComputedStyle( elem, null )) ) {
+
+			ret = computedStyle.getPropertyValue( name );
+			if ( ret === "" && !jQuery.contains( elem.ownerDocument.documentElement, elem ) ) {
+				ret = jQuery.style( elem, name );
+			}
+		}
+
+		// A tribute to the "awesome hack by Dean Edwards"
+		// WebKit uses "computed value (percentage if specified)" instead of "used value" for margins
+		// which is against the CSSOM draft spec: http://dev.w3.org/csswg/cssom/#resolved-values
+		if ( !jQuery.support.pixelMargin && computedStyle && rmargin.test( name ) && rnumnonpx.test( ret ) ) {
+			width = style.width;
+			style.width = ret;
+			ret = computedStyle.width;
+			style.width = width;
+		}
+
+		return ret;
+	};
+}
+
+if ( document.documentElement.currentStyle ) {
+	currentStyle = function( elem, name ) {
+		var left, rsLeft, uncomputed,
+			ret = elem.currentStyle && elem.currentStyle[ name ],
+			style = elem.style;
+
+		// Avoid setting ret to empty string here
+		// so we don't default to auto
+		if ( ret == null && style && (uncomputed = style[ name ]) ) {
+			ret = uncomputed;
+		}
+
+		// From the awesome hack by Dean Edwards
+		// http://erik.eae.net/archives/2007/07/27/18.54.15/#comment-102291
+
+		// If we're not dealing with a regular pixel number
+		// but a number that has a weird ending, we need to convert it to pixels
+		if ( rnumnonpx.test( ret ) ) {
+
+			// Remember the original values
+			left = style.left;
+			rsLeft = elem.runtimeStyle && elem.runtimeStyle.left;
+
+			// Put in the new values to get a computed value out
+			if ( rsLeft ) {
+				elem.runtimeStyle.left = elem.currentStyle.left;
+			}
+			style.left = name === "fontSize" ? "1em" : ret;
+			ret = style.pixelLeft + "px";
+
+			// Revert the changed values
+			style.left = left;
+			if ( rsLeft ) {
+				elem.runtimeStyle.left = rsLeft;
+			}
+		}
+
+		return ret === "" ? "auto" : ret;
+	};
+}
+
+curCSS = getComputedStyle || currentStyle;
+
+function getWidthOrHeight( elem, name, extra ) {
+
+	// Start with offset property
+	var val = name === "width" ? elem.offsetWidth : elem.offsetHeight,
+		i = name === "width" ? 1 : 0,
+		len = 4;
+
+	if ( val > 0 ) {
+		if ( extra !== "border" ) {
+			for ( ; i < len; i += 2 ) {
+				if ( !extra ) {
+					val -= parseFloat( jQuery.css( elem, "padding" + cssExpand[ i ] ) ) || 0;
+				}
+				if ( extra === "margin" ) {
+					val += parseFloat( jQuery.css( elem, extra + cssExpand[ i ] ) ) || 0;
+				} else {
+					val -= parseFloat( jQuery.css( elem, "border" + cssExpand[ i ] + "Width" ) ) || 0;
+				}
+			}
+		}
+
+		return val + "px";
+	}
+
+	// Fall back to computed then uncomputed css if necessary
+	val = curCSS( elem, name );
+	if ( val < 0 || val == null ) {
+		val = elem.style[ name ];
+	}
+
+	// Computed unit is not pixels. Stop here and return.
+	if ( rnumnonpx.test(val) ) {
+		return val;
+	}
+
+	// Normalize "", auto, and prepare for extra
+	val = parseFloat( val ) || 0;
+
+	// Add padding, border, margin
+	if ( extra ) {
+		for ( ; i < len; i += 2 ) {
+			val += parseFloat( jQuery.css( elem, "padding" + cssExpand[ i ] ) ) || 0;
+			if ( extra !== "padding" ) {
+				val += parseFloat( jQuery.css( elem, "border" + cssExpand[ i ] + "Width" ) ) || 0;
+			}
+			if ( extra === "margin" ) {
+				val += parseFloat( jQuery.css( elem, extra + cssExpand[ i ]) ) || 0;
+			}
+		}
+	}
+
+	return val + "px";
+}
+
+jQuery.each([ "height", "width" ], function( i, name ) {
+	jQuery.cssHooks[ name ] = {
+		get: function( elem, computed, extra ) {
+			if ( computed ) {
+				if ( elem.offsetWidth !== 0 ) {
+					return getWidthOrHeight( elem, name, extra );
+				} else {
+					return jQuery.swap( elem, cssShow, function() {
+						return getWidthOrHeight( elem, name, extra );
+					});
+				}
+			}
+		},
+
+		set: function( elem, value ) {
+			return rnum.test( value ) ?
+				value + "px" :
+				value;
+		}
+	};
+});
+
+if ( !jQuery.support.opacity ) {
+	jQuery.cssHooks.opacity = {
+		get: function( elem, computed ) {
+			// IE uses filters for opacity
+			return ropacity.test( (computed && elem.currentStyle ? elem.currentStyle.filter : elem.style.filter) || "" ) ?
+				( parseFloat( RegExp.$1 ) / 100 ) + "" :
+				computed ? "1" : "";
+		},
+
+		set: function( elem, value ) {
+			var style = elem.style,
+				currentStyle = elem.currentStyle,
+				opacity = jQuery.isNumeric( value ) ? "alpha(opacity=" + value * 100 + ")" : "",
+				filter = currentStyle && currentStyle.filter || style.filter || "";
+
+			// IE has trouble with opacity if it does not have layout
+			// Force it by setting the zoom level
+			style.zoom = 1;
+
+			// if setting opacity to 1, and no other filters exist - attempt to remove filter attribute #6652
+			if ( value >= 1 && jQuery.trim( filter.replace( ralpha, "" ) ) === "" ) {
+
+				// Setting style.filter to null, "" & " " still leave "filter:" in the cssText
+				// if "filter:" is present at all, clearType is disabled, we want to avoid this
+				// style.removeAttribute is IE Only, but so apparently is this code path...
+				style.removeAttribute( "filter" );
+
+				// if there there is no filter style applied in a css rule, we are done
+				if ( currentStyle && !currentStyle.filter ) {
+					return;
+				}
+			}
+
+			// otherwise, set new filter values
+			style.filter = ralpha.test( filter ) ?
+				filter.replace( ralpha, opacity ) :
+				filter + " " + opacity;
+		}
+	};
+}
+
+jQuery(function() {
+	// This hook cannot be added until DOM ready because the support test
+	// for it is not run until after DOM ready
+	if ( !jQuery.support.reliableMarginRight ) {
+		jQuery.cssHooks.marginRight = {
+			get: function( elem, computed ) {
+				// WebKit Bug 13343 - getComputedStyle returns wrong value for margin-right
+				// Work around by temporarily setting element display to inline-block
+				return jQuery.swap( elem, { "display": "inline-block" }, function() {
+					if ( computed ) {
+						return curCSS( elem, "margin-right" );
+					} else {
+						return elem.style.marginRight;
+					}
+				});
+			}
+		};
+	}
+});
+
+if ( jQuery.expr && jQuery.expr.filters ) {
+	jQuery.expr.filters.hidden = function( elem ) {
+		var width = elem.offsetWidth,
+			height = elem.offsetHeight;
+
+		return ( width === 0 && height === 0 ) || (!jQuery.support.reliableHiddenOffsets && ((elem.style && elem.style.display) || jQuery.css( elem, "display" )) === "none");
+	};
+
+	jQuery.expr.filters.visible = function( elem ) {
+		return !jQuery.expr.filters.hidden( elem );
+	};
+}
+
+// These hooks are used by animate to expand properties
+jQuery.each({
+	margin: "",
+	padding: "",
+	border: "Width"
+}, function( prefix, suffix ) {
+
+	jQuery.cssHooks[ prefix + suffix ] = {
+		expand: function( value ) {
+			var i,
+
+				// assumes a single number if not a string
+				parts = typeof value === "string" ? value.split(" ") : [ value ],
+				expanded = {};
+
+			for ( i = 0; i < 4; i++ ) {
+				expanded[ prefix + cssExpand[ i ] + suffix ] =
+					parts[ i ] || parts[ i - 2 ] || parts[ 0 ];
+			}
+
+			return expanded;
+		}
+	};
+});
+
+
+
+
+var r20 = /%20/g,
+	rbracket = /\[\]$/,
+	rCRLF = /\r?\n/g,
+	rhash = /#.*$/,
+	rheaders = /^(.*?):[ \t]*([^\r\n]*)\r?$/mg, // IE leaves an \r character at EOL
+	rinput = /^(?:color|date|datetime|datetime-local|email|hidden|month|number|password|range|search|tel|text|time|url|week)$/i,
+	// #7653, #8125, #8152: local protocol detection
+	rlocalProtocol = /^(?:about|app|app\-storage|.+\-extension|file|res|widget):$/,
+	rnoContent = /^(?:GET|HEAD)$/,
+	rprotocol = /^\/\//,
+	rquery = /\?/,
+	rscript = /<script\b[^<]*(?:(?!<\/script>)<[^<]*)*<\/script>/gi,
+	rselectTextarea = /^(?:select|textarea)/i,
+	rspacesAjax = /\s+/,
+	rts = /([?&])_=[^&]*/,
+	rurl = /^([\w\+\.\-]+:)(?:\/\/([^\/?#:]*)(?::(\d+))?)?/,
+
+	// Keep a copy of the old load method
+	_load = jQuery.fn.load,
+
+	/* Prefilters
+	 * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example)
+	 * 2) These are called:
+	 *    - BEFORE asking for a transport
+	 *    - AFTER param serialization (s.data is a string if s.processData is true)
+	 * 3) key is the dataType
+	 * 4) the catchall symbol "*" can be used
+	 * 5) execution will start with transport dataType and THEN continue down to "*" if needed
+	 */
+	prefilters = {},
+
+	/* Transports bindings
+	 * 1) key is the dataType
+	 * 2) the catchall symbol "*" can be used
+	 * 3) selection will start with transport dataType and THEN go to "*" if needed
+	 */
+	transports = {},
+
+	// Document location
+	ajaxLocation,
+
+	// Document location segments
+	ajaxLocParts,
+
+	// Avoid comment-prolog char sequence (#10098); must appease lint and evade compression
+	allTypes = ["*/"] + ["*"];
+
+// #8138, IE may throw an exception when accessing
+// a field from window.location if document.domain has been set
+try {
+	ajaxLocation = location.href;
+} catch( e ) {
+	// Use the href attribute of an A element
+	// since IE will modify it given document.location
+	ajaxLocation = document.createElement( "a" );
+	ajaxLocation.href = "";
+	ajaxLocation = ajaxLocation.href;
+}
+
+// Segment location into parts
+ajaxLocParts = rurl.exec( ajaxLocation.toLowerCase() ) || [];
+
+// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport
+function addToPrefiltersOrTransports( structure ) {
+
+	// dataTypeExpression is optional and defaults to "*"
+	return function( dataTypeExpression, func ) {
+
+		if ( typeof dataTypeExpression !== "string" ) {
+			func = dataTypeExpression;
+			dataTypeExpression = "*";
+		}
+
+		if ( jQuery.isFunction( func ) ) {
+			var dataTypes = dataTypeExpression.toLowerCase().split( rspacesAjax ),
+				i = 0,
+				length = dataTypes.length,
+				dataType,
+				list,
+				placeBefore;
+
+			// For each dataType in the dataTypeExpression
+			for ( ; i < length; i++ ) {
+				dataType = dataTypes[ i ];
+				// We control if we're asked to add before
+				// any existing element
+				placeBefore = /^\+/.test( dataType );
+				if ( placeBefore ) {
+					dataType = dataType.substr( 1 ) || "*";
+				}
+				list = structure[ dataType ] = structure[ dataType ] || [];
+				// then we add to the structure accordingly
+				list[ placeBefore ? "unshift" : "push" ]( func );
+			}
+		}
+	};
+}
+
+// Base inspection function for prefilters and transports
+function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR,
+		dataType /* internal */, inspected /* internal */ ) {
+
+	dataType = dataType || options.dataTypes[ 0 ];
+	inspected = inspected || {};
+
+	inspected[ dataType ] = true;
+
+	var list = structure[ dataType ],
+		i = 0,
+		length = list ? list.length : 0,
+		executeOnly = ( structure === prefilters ),
+		selection;
+
+	for ( ; i < length && ( executeOnly || !selection ); i++ ) {
+		selection = list[ i ]( options, originalOptions, jqXHR );
+		// If we got redirected to another dataType
+		// we try there if executing only and not done already
+		if ( typeof selection === "string" ) {
+			if ( !executeOnly || inspected[ selection ] ) {
+				selection = undefined;
+			} else {
+				options.dataTypes.unshift( selection );
+				selection = inspectPrefiltersOrTransports(
+						structure, options, originalOptions, jqXHR, selection, inspected );
+			}
+		}
+	}
+	// If we're only executing or nothing was selected
+	// we try the catchall dataType if not done already
+	if ( ( executeOnly || !selection ) && !inspected[ "*" ] ) {
+		selection = inspectPrefiltersOrTransports(
+				structure, options, originalOptions, jqXHR, "*", inspected );
+	}
+	// unnecessary when only executing (prefilters)
+	// but it'll be ignored by the caller in that case
+	return selection;
+}
+
+// A special extend for ajax options
+// that takes "flat" options (not to be deep extended)
+// Fixes #9887
+function ajaxExtend( target, src ) {
+	var key, deep,
+		flatOptions = jQuery.ajaxSettings.flatOptions || {};
+	for ( key in src ) {
+		if ( src[ key ] !== undefined ) {
+			( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ];
+		}
+	}
+	if ( deep ) {
+		jQuery.extend( true, target, deep );
+	}
+}
+
+jQuery.fn.extend({
+	load: function( url, params, callback ) {
+		if ( typeof url !== "string" && _load ) {
+			return _load.apply( this, arguments );
+
+		// Don't do a request if no elements are being requested
+		} else if ( !this.length ) {
+			return this;
+		}
+
+		var off = url.indexOf( " " );
+		if ( off >= 0 ) {
+			var selector = url.slice( off, url.length );
+			url = url.slice( 0, off );
+		}
+
+		// Default to a GET request
+		var type = "GET";
+
+		// If the second parameter was provided
+		if ( params ) {
+			// If it's a function
+			if ( jQuery.isFunction( params ) ) {
+				// We assume that it's the callback
+				callback = params;
+				params = undefined;
+
+			// Otherwise, build a param string
+			} else if ( typeof params === "object" ) {
+				params = jQuery.param( params, jQuery.ajaxSettings.traditional );
+				type = "POST";
+			}
+		}
+
+		var self = this;
+
+		// Request the remote document
+		jQuery.ajax({
+			url: url,
+			type: type,
+			dataType: "html",
+			data: params,
+			// Complete callback (responseText is used internally)
+			complete: function( jqXHR, status, responseText ) {
+				// Store the response as specified by the jqXHR object
+				responseText = jqXHR.responseText;
+				// If successful, inject the HTML into all the matched elements
+				if ( jqXHR.isResolved() ) {
+					// #4825: Get the actual response in case
+					// a dataFilter is present in ajaxSettings
+					jqXHR.done(function( r ) {
+						responseText = r;
+					});
+					// See if a selector was specified
+					self.html( selector ?
+						// Create a dummy div to hold the results
+						jQuery("<div>")
+							// inject the contents of the document in, removing the scripts
+							// to avoid any 'Permission Denied' errors in IE
+							.append(responseText.replace(rscript, ""))
+
+							// Locate the specified elements
+							.find(selector) :
+
+						// If not, just inject the full result
+						responseText );
+				}
+
+				if ( callback ) {
+					self.each( callback, [ responseText, status, jqXHR ] );
+				}
+			}
+		});
+
+		return this;
+	},
+
+	serialize: function() {
+		return jQuery.param( this.serializeArray() );
+	},
+
+	serializeArray: function() {
+		return this.map(function(){
+			return this.elements ? jQuery.makeArray( this.elements ) : this;
+		})
+		.filter(function(){
+			return this.name && !this.disabled &&
+				( this.checked || rselectTextarea.test( this.nodeName ) ||
+					rinput.test( this.type ) );
+		})
+		.map(function( i, elem ){
+			var val = jQuery( this ).val();
+
+			return val == null ?
+				null :
+				jQuery.isArray( val ) ?
+					jQuery.map( val, function( val, i ){
+						return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
+					}) :
+					{ name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
+		}).get();
+	}
+});
+
+// Attach a bunch of functions for handling common AJAX events
+jQuery.each( "ajaxStart ajaxStop ajaxComplete ajaxError ajaxSuccess ajaxSend".split( " " ), function( i, o ){
+	jQuery.fn[ o ] = function( f ){
+		return this.on( o, f );
+	};
+});
+
+jQuery.each( [ "get", "post" ], function( i, method ) {
+	jQuery[ method ] = function( url, data, callback, type ) {
+		// shift arguments if data argument was omitted
+		if ( jQuery.isFunction( data ) ) {
+			type = type || callback;
+			callback = data;
+			data = undefined;
+		}
+
+		return jQuery.ajax({
+			type: method,
+			url: url,
+			data: data,
+			success: callback,
+			dataType: type
+		});
+	};
+});
+
+jQuery.extend({
+
+	getScript: function( url, callback ) {
+		return jQuery.get( url, undefined, callback, "script" );
+	},
+
+	getJSON: function( url, data, callback ) {
+		return jQuery.get( url, data, callback, "json" );
+	},
+
+	// Creates a full fledged settings object into target
+	// with both ajaxSettings and settings fields.
+	// If target is omitted, writes into ajaxSettings.
+	ajaxSetup: function( target, settings ) {
+		if ( settings ) {
+			// Building a settings object
+			ajaxExtend( target, jQuery.ajaxSettings );
+		} else {
+			// Extending ajaxSettings
+			settings = target;
+			target = jQuery.ajaxSettings;
+		}
+		ajaxExtend( target, settings );
+		return target;
+	},
+
+	ajaxSettings: {
+		url: ajaxLocation,
+		isLocal: rlocalProtocol.test( ajaxLocParts[ 1 ] ),
+		global: true,
+		type: "GET",
+		contentType: "application/x-www-form-urlencoded; charset=UTF-8",
+		processData: true,
+		async: true,
+		/*
+		timeout: 0,
+		data: null,
+		dataType: null,
+		username: null,
+		password: null,
+		cache: null,
+		traditional: false,
+		headers: {},
+		*/
+
+		accepts: {
+			xml: "application/xml, text/xml",
+			html: "text/html",
+			text: "text/plain",
+			json: "application/json, text/javascript",
+			"*": allTypes
+		},
+
+		contents: {
+			xml: /xml/,
+			html: /html/,
+			json: /json/
+		},
+
+		responseFields: {
+			xml: "responseXML",
+			text: "responseText"
+		},
+
+		// List of data converters
+		// 1) key format is "source_type destination_type" (a single space in-between)
+		// 2) the catchall symbol "*" can be used for source_type
+		converters: {
+
+			// Convert anything to text
+			"* text": window.String,
+
+			// Text to html (true = no transformation)
+			"text html": true,
+
+			// Evaluate text as a json expression
+			"text json": jQuery.parseJSON,
+
+			// Parse text as xml
+			"text xml": jQuery.parseXML
+		},
+
+		// For options that shouldn't be deep extended:
+		// you can add your own custom options here if
+		// and when you create one that shouldn't be
+		// deep extended (see ajaxExtend)
+		flatOptions: {
+			context: true,
+			url: true
+		}
+	},
+
+	ajaxPrefilter: addToPrefiltersOrTransports( prefilters ),
+	ajaxTransport: addToPrefiltersOrTransports( transports ),
+
+	// Main method
+	ajax: function( url, options ) {
+
+		// If url is an object, simulate pre-1.5 signature
+		if ( typeof url === "object" ) {
+			options = url;
+			url = undefined;
+		}
+
+		// Force options to be an object
+		options = options || {};
+
+		var // Create the final options object
+			s = jQuery.ajaxSetup( {}, options ),
+			// Callbacks context
+			callbackContext = s.context || s,
+			// Context for global events
+			// It's the callbackContext if one was provided in the options
+			// and if it's a DOM node or a jQuery collection
+			globalEventContext = callbackContext !== s &&
+				( callbackContext.nodeType || callbackContext instanceof jQuery ) ?
+						jQuery( callbackContext ) : jQuery.event,
+			// Deferreds
+			deferred = jQuery.Deferred(),
+			completeDeferred = jQuery.Callbacks( "once memory" ),
+			// Status-dependent callbacks
+			statusCode = s.statusCode || {},
+			// ifModified key
+			ifModifiedKey,
+			// Headers (they are sent all at once)
+			requestHeaders = {},
+			requestHeadersNames = {},
+			// Response headers
+			responseHeadersString,
+			responseHeaders,
+			// transport
+			transport,
+			// timeout handle
+			timeoutTimer,
+			// Cross-domain detection vars
+			parts,
+			// The jqXHR state
+			state = 0,
+			// To know if global events are to be dispatched
+			fireGlobals,
+			// Loop variable
+			i,
+			// Fake xhr
+			jqXHR = {
+
+				readyState: 0,
+
+				// Caches the header
+				setRequestHeader: function( name, value ) {
+					if ( !state ) {
+						var lname = name.toLowerCase();
+						name = requestHeadersNames[ lname ] = requestHeadersNames[ lname ] || name;
+						requestHeaders[ name ] = value;
+					}
+					return this;
+				},
+
+				// Raw string
+				getAllResponseHeaders: function() {
+					return state === 2 ? responseHeadersString : null;
+				},
+
+				// Builds headers hashtable if needed
+				getResponseHeader: function( key ) {
+					var match;
+					if ( state === 2 ) {
+						if ( !responseHeaders ) {
+							responseHeaders = {};
+							while( ( match = rheaders.exec( responseHeadersString ) ) ) {
+								responseHeaders[ match[1].toLowerCase() ] = match[ 2 ];
+							}
+						}
+						match = responseHeaders[ key.toLowerCase() ];
+					}
+					return match === undefined ? null : match;
+				},
+
+				// Overrides response content-type header
+				overrideMimeType: function( type ) {
+					if ( !state ) {
+						s.mimeType = type;
+					}
+					return this;
+				},
+
+				// Cancel the request
+				abort: function( statusText ) {
+					statusText = statusText || "abort";
+					if ( transport ) {
+						transport.abort( statusText );
+					}
+					done( 0, statusText );
+					return this;
+				}
+			};
+
+		// Callback for when everything is done
+		// It is defined here because jslint complains if it is declared
+		// at the end of the function (which would be more logical and readable)
+		function done( status, nativeStatusText, responses, headers ) {
+
+			// Called once
+			if ( state === 2 ) {
+				return;
+			}
+
+			// State is "done" now
+			state = 2;
+
+			// Clear timeout if it exists
+			if ( timeoutTimer ) {
+				clearTimeout( timeoutTimer );
+			}
+
+			// Dereference transport for early garbage collection
+			// (no matter how long the jqXHR object will be used)
+			transport = undefined;
+
+			// Cache response headers
+			responseHeadersString = headers || "";
+
+			// Set readyState
+			jqXHR.readyState = status > 0 ? 4 : 0;
+
+			var isSuccess,
+				success,
+				error,
+				statusText = nativeStatusText,
+				response = responses ? ajaxHandleResponses( s, jqXHR, responses ) : undefined,
+				lastModified,
+				etag;
+
+			// If successful, handle type chaining
+			if ( status >= 200 && status < 300 || status === 304 ) {
+
+				// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
+				if ( s.ifModified ) {
+
+					if ( ( lastModified = jqXHR.getResponseHeader( "Last-Modified" ) ) ) {
+						jQuery.lastModified[ ifModifiedKey ] = lastModified;
+					}
+					if ( ( etag = jqXHR.getResponseHeader( "Etag" ) ) ) {
+						jQuery.etag[ ifModifiedKey ] = etag;
+					}
+				}
+
+				// If not modified
+				if ( status === 304 ) {
+
+					statusText = "notmodified";
+					isSuccess = true;
+
+				// If we have data
+				} else {
+
+					try {
+						success = ajaxConvert( s, response );
+						statusText = "success";
+						isSuccess = true;
+					} catch(e) {
+						// We have a parsererror
+						statusText = "parsererror";
+						error = e;
+					}
+				}
+			} else {
+				// We extract error from statusText
+				// then normalize statusText and status for non-aborts
+				error = statusText;
+				if ( !statusText || status ) {
+					statusText = "error";
+					if ( status < 0 ) {
+						status = 0;
+					}
+				}
+			}
+
+			// Set data for the fake xhr object
+			jqXHR.status = status;
+			jqXHR.statusText = "" + ( nativeStatusText || statusText );
+
+			// Success/Error
+			if ( isSuccess ) {
+				deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] );
+			} else {
+				deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] );
+			}
+
+			// Status-dependent callbacks
+			jqXHR.statusCode( statusCode );
+			statusCode = undefined;
+
+			if ( fireGlobals ) {
+				globalEventContext.trigger( "ajax" + ( isSuccess ? "Success" : "Error" ),
+						[ jqXHR, s, isSuccess ? success : error ] );
+			}
+
+			// Complete
+			completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] );
+
+			if ( fireGlobals ) {
+				globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] );
+				// Handle the global AJAX counter
+				if ( !( --jQuery.active ) ) {
+					jQuery.event.trigger( "ajaxStop" );
+				}
+			}
+		}
+
+		// Attach deferreds
+		deferred.promise( jqXHR );
+		jqXHR.success = jqXHR.done;
+		jqXHR.error = jqXHR.fail;
+		jqXHR.complete = completeDeferred.add;
+
+		// Status-dependent callbacks
+		jqXHR.statusCode = function( map ) {
+			if ( map ) {
+				var tmp;
+				if ( state < 2 ) {
+					for ( tmp in map ) {
+						statusCode[ tmp ] = [ statusCode[tmp], map[tmp] ];
+					}
+				} else {
+					tmp = map[ jqXHR.status ];
+					jqXHR.then( tmp, tmp );
+				}
+			}
+			return this;
+		};
+
+		// Remove hash character (#7531: and string promotion)
+		// Add protocol if not provided (#5866: IE7 issue with protocol-less urls)
+		// We also use the url parameter if available
+		s.url = ( ( url || s.url ) + "" ).replace( rhash, "" ).replace( rprotocol, ajaxLocParts[ 1 ] + "//" );
+
+		// Extract dataTypes list
+		s.dataTypes = jQuery.trim( s.dataType || "*" ).toLowerCase().split( rspacesAjax );
+
+		// Determine if a cross-domain request is in order
+		if ( s.crossDomain == null ) {
+			parts = rurl.exec( s.url.toLowerCase() );
+			s.crossDomain = !!( parts &&
+				( parts[ 1 ] != ajaxLocParts[ 1 ] || parts[ 2 ] != ajaxLocParts[ 2 ] ||
+					( parts[ 3 ] || ( parts[ 1 ] === "http:" ? 80 : 443 ) ) !=
+						( ajaxLocParts[ 3 ] || ( ajaxLocParts[ 1 ] === "http:" ? 80 : 443 ) ) )
+			);
+		}
+
+		// Convert data if not already a string
+		if ( s.data && s.processData && typeof s.data !== "string" ) {
+			s.data = jQuery.param( s.data, s.traditional );
+		}
+
+		// Apply prefilters
+		inspectPrefiltersOrTransports( prefilters, s, options, jqXHR );
+
+		// If request was aborted inside a prefilter, stop there
+		if ( state === 2 ) {
+			return false;
+		}
+
+		// We can fire global events as of now if asked to
+		fireGlobals = s.global;
+
+		// Uppercase the type
+		s.type = s.type.toUpperCase();
+
+		// Determine if request has content
+		s.hasContent = !rnoContent.test( s.type );
+
+		// Watch for a new set of requests
+		if ( fireGlobals && jQuery.active++ === 0 ) {
+			jQuery.event.trigger( "ajaxStart" );
+		}
+
+		// More options handling for requests with no content
+		if ( !s.hasContent ) {
+
+			// If data is available, append data to url
+			if ( s.data ) {
+				s.url += ( rquery.test( s.url ) ? "&" : "?" ) + s.data;
+				// #9682: remove data so that it's not used in an eventual retry
+				delete s.data;
+			}
+
+			// Get ifModifiedKey before adding the anti-cache parameter
+			ifModifiedKey = s.url;
+
+			// Add anti-cache in url if needed
+			if ( s.cache === false ) {
+
+				var ts = jQuery.now(),
+					// try replacing _= if it is there
+					ret = s.url.replace( rts, "$1_=" + ts );
+
+				// if nothing was replaced, add timestamp to the end
+				s.url = ret + ( ( ret === s.url ) ? ( rquery.test( s.url ) ? "&" : "?" ) + "_=" + ts : "" );
+			}
+		}
+
+		// Set the correct header, if data is being sent
+		if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) {
+			jqXHR.setRequestHeader( "Content-Type", s.contentType );
+		}
+
+		// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
+		if ( s.ifModified ) {
+			ifModifiedKey = ifModifiedKey || s.url;
+			if ( jQuery.lastModified[ ifModifiedKey ] ) {
+				jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ ifModifiedKey ] );
+			}
+			if ( jQuery.etag[ ifModifiedKey ] ) {
+				jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ ifModifiedKey ] );
+			}
+		}
+
+		// Set the Accepts header for the server, depending on the dataType
+		jqXHR.setRequestHeader(
+			"Accept",
+			s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[0] ] ?
+				s.accepts[ s.dataTypes[0] ] + ( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) :
+				s.accepts[ "*" ]
+		);
+
+		// Check for headers option
+		for ( i in s.headers ) {
+			jqXHR.setRequestHeader( i, s.headers[ i ] );
+		}
+
+		// Allow custom headers/mimetypes and early abort
+		if ( s.beforeSend && ( s.beforeSend.call( callbackContext, jqXHR, s ) === false || state === 2 ) ) {
+				// Abort if not done already
+				jqXHR.abort();
+				return false;
+
+		}
+
+		// Install callbacks on deferreds
+		for ( i in { success: 1, error: 1, complete: 1 } ) {
+			jqXHR[ i ]( s[ i ] );
+		}
+
+		// Get transport
+		transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR );
+
+		// If no transport, we auto-abort
+		if ( !transport ) {
+			done( -1, "No Transport" );
+		} else {
+			jqXHR.readyState = 1;
+			// Send global event
+			if ( fireGlobals ) {
+				globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] );
+			}
+			// Timeout
+			if ( s.async && s.timeout > 0 ) {
+				timeoutTimer = setTimeout( function(){
+					jqXHR.abort( "timeout" );
+				}, s.timeout );
+			}
+
+			try {
+				state = 1;
+				transport.send( requestHeaders, done );
+			} catch (e) {
+				// Propagate exception as error if not done
+				if ( state < 2 ) {
+					done( -1, e );
+				// Simply rethrow otherwise
+				} else {
+					throw e;
+				}
+			}
+		}
+
+		return jqXHR;
+	},
+
+	// Serialize an array of form elements or a set of
+	// key/values into a query string
+	param: function( a, traditional ) {
+		var s = [],
+			add = function( key, value ) {
+				// If value is a function, invoke it and return its value
+				value = jQuery.isFunction( value ) ? value() : value;
+				s[ s.length ] = encodeURIComponent( key ) + "=" + encodeURIComponent( value );
+			};
+
+		// Set traditional to true for jQuery <= 1.3.2 behavior.
+		if ( traditional === undefined ) {
+			traditional = jQuery.ajaxSettings.traditional;
+		}
+
+		// If an array was passed in, assume that it is an array of form elements.
+		if ( jQuery.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) {
+			// Serialize the form elements
+			jQuery.each( a, function() {
+				add( this.name, this.value );
+			});
+
+		} else {
+			// If traditional, encode the "old" way (the way 1.3.2 or older
+			// did it), otherwise encode params recursively.
+			for ( var prefix in a ) {
+				buildParams( prefix, a[ prefix ], traditional, add );
+			}
+		}
+
+		// Return the resulting serialization
+		return s.join( "&" ).replace( r20, "+" );
+	}
+});
+
+function buildParams( prefix, obj, traditional, add ) {
+	if ( jQuery.isArray( obj ) ) {
+		// Serialize array item.
+		jQuery.each( obj, function( i, v ) {
+			if ( traditional || rbracket.test( prefix ) ) {
+				// Treat each array item as a scalar.
+				add( prefix, v );
+
+			} else {
+				// If array item is non-scalar (array or object), encode its
+				// numeric index to resolve deserialization ambiguity issues.
+				// Note that rack (as of 1.0.0) can't currently deserialize
+				// nested arrays properly, and attempting to do so may cause
+				// a server error. Possible fixes are to modify rack's
+				// deserialization algorithm or to provide an option or flag
+				// to force array serialization to be shallow.
+				buildParams( prefix + "[" + ( typeof v === "object" ? i : "" ) + "]", v, traditional, add );
+			}
+		});
+
+	} else if ( !traditional && jQuery.type( obj ) === "object" ) {
+		// Serialize object item.
+		for ( var name in obj ) {
+			buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add );
+		}
+
+	} else {
+		// Serialize scalar item.
+		add( prefix, obj );
+	}
+}
+
+// This is still on the jQuery object... for now
+// Want to move this to jQuery.ajax some day
+jQuery.extend({
+
+	// Counter for holding the number of active queries
+	active: 0,
+
+	// Last-Modified header cache for next request
+	lastModified: {},
+	etag: {}
+
+});
+
+/* Handles responses to an ajax request:
+ * - sets all responseXXX fields accordingly
+ * - finds the right dataType (mediates between content-type and expected dataType)
+ * - returns the corresponding response
+ */
+function ajaxHandleResponses( s, jqXHR, responses ) {
+
+	var contents = s.contents,
+		dataTypes = s.dataTypes,
+		responseFields = s.responseFields,
+		ct,
+		type,
+		finalDataType,
+		firstDataType;
+
+	// Fill responseXXX fields
+	for ( type in responseFields ) {
+		if ( type in responses ) {
+			jqXHR[ responseFields[type] ] = responses[ type ];
+		}
+	}
+
+	// Remove auto dataType and get content-type in the process
+	while( dataTypes[ 0 ] === "*" ) {
+		dataTypes.shift();
+		if ( ct === undefined ) {
+			ct = s.mimeType || jqXHR.getResponseHeader( "content-type" );
+		}
+	}
+
+	// Check if we're dealing with a known content-type
+	if ( ct ) {
+		for ( type in contents ) {
+			if ( contents[ type ] && contents[ type ].test( ct ) ) {
+				dataTypes.unshift( type );
+				break;
+			}
+		}
+	}
+
+	// Check to see if we have a response for the expected dataType
+	if ( dataTypes[ 0 ] in responses ) {
+		finalDataType = dataTypes[ 0 ];
+	} else {
+		// Try convertible dataTypes
+		for ( type in responses ) {
+			if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[0] ] ) {
+				finalDataType = type;
+				break;
+			}
+			if ( !firstDataType ) {
+				firstDataType = type;
+			}
+		}
+		// Or just use first one
+		finalDataType = finalDataType || firstDataType;
+	}
+
+	// If we found a dataType
+	// We add the dataType to the list if needed
+	// and return the corresponding response
+	if ( finalDataType ) {
+		if ( finalDataType !== dataTypes[ 0 ] ) {
+			dataTypes.unshift( finalDataType );
+		}
+		return responses[ finalDataType ];
+	}
+}
+
+// Chain conversions given the request and the original response
+function ajaxConvert( s, response ) {
+
+	// Apply the dataFilter if provided
+	if ( s.dataFilter ) {
+		response = s.dataFilter( response, s.dataType );
+	}
+
+	var dataTypes = s.dataTypes,
+		converters = {},
+		i,
+		key,
+		length = dataTypes.length,
+		tmp,
+		// Current and previous dataTypes
+		current = dataTypes[ 0 ],
+		prev,
+		// Conversion expression
+		conversion,
+		// Conversion function
+		conv,
+		// Conversion functions (transitive conversion)
+		conv1,
+		conv2;
+
+	// For each dataType in the chain
+	for ( i = 1; i < length; i++ ) {
+
+		// Create converters map
+		// with lowercased keys
+		if ( i === 1 ) {
+			for ( key in s.converters ) {
+				if ( typeof key === "string" ) {
+					converters[ key.toLowerCase() ] = s.converters[ key ];
+				}
+			}
+		}
+
+		// Get the dataTypes
+		prev = current;
+		current = dataTypes[ i ];
+
+		// If current is auto dataType, update it to prev
+		if ( current === "*" ) {
+			current = prev;
+		// If no auto and dataTypes are actually different
+		} else if ( prev !== "*" && prev !== current ) {
+
+			// Get the converter
+			conversion = prev + " " + current;
+			conv = converters[ conversion ] || converters[ "* " + current ];
+
+			// If there is no direct converter, search transitively
+			if ( !conv ) {
+				conv2 = undefined;
+				for ( conv1 in converters ) {
+					tmp = conv1.split( " " );
+					if ( tmp[ 0 ] === prev || tmp[ 0 ] === "*" ) {
+						conv2 = converters[ tmp[1] + " " + current ];
+						if ( conv2 ) {
+							conv1 = converters[ conv1 ];
+							if ( conv1 === true ) {
+								conv = conv2;
+							} else if ( conv2 === true ) {
+								conv = conv1;
+							}
+							break;
+						}
+					}
+				}
+			}
+			// If we found no converter, dispatch an error
+			if ( !( conv || conv2 ) ) {
+				jQuery.error( "No conversion from " + conversion.replace(" "," to ") );
+			}
+			// If found converter is not an equivalence
+			if ( conv !== true ) {
+				// Convert with 1 or 2 converters accordingly
+				response = conv ? conv( response ) : conv2( conv1(response) );
+			}
+		}
+	}
+	return response;
+}
+
+
+
+
+var jsc = jQuery.now(),
+	jsre = /(\=)\?(&|$)|\?\?/i;
+
+// Default jsonp settings
+jQuery.ajaxSetup({
+	jsonp: "callback",
+	jsonpCallback: function() {
+		return jQuery.expando + "_" + ( jsc++ );
+	}
+});
+
+// Detect, normalize options and install callbacks for jsonp requests
+jQuery.ajaxPrefilter( "json jsonp", function( s, originalSettings, jqXHR ) {
+
+	var inspectData = ( typeof s.data === "string" ) && /^application\/x\-www\-form\-urlencoded/.test( s.contentType );
+
+	if ( s.dataTypes[ 0 ] === "jsonp" ||
+		s.jsonp !== false && ( jsre.test( s.url ) ||
+				inspectData && jsre.test( s.data ) ) ) {
+
+		var responseContainer,
+			jsonpCallback = s.jsonpCallback =
+				jQuery.isFunction( s.jsonpCallback ) ? s.jsonpCallback() : s.jsonpCallback,
+			previous = window[ jsonpCallback ],
+			url = s.url,
+			data = s.data,
+			replace = "$1" + jsonpCallback + "$2";
+
+		if ( s.jsonp !== false ) {
+			url = url.replace( jsre, replace );
+			if ( s.url === url ) {
+				if ( inspectData ) {
+					data = data.replace( jsre, replace );
+				}
+				if ( s.data === data ) {
+					// Add callback manually
+					url += (/\?/.test( url ) ? "&" : "?") + s.jsonp + "=" + jsonpCallback;
+				}
+			}
+		}
+
+		s.url = url;
+		s.data = data;
+
+		// Install callback
+		window[ jsonpCallback ] = function( response ) {
+			responseContainer = [ response ];
+		};
+
+		// Clean-up function
+		jqXHR.always(function() {
+			// Set callback back to previous value
+			window[ jsonpCallback ] = previous;
+			// Call if it was a function and we have a response
+			if ( responseContainer && jQuery.isFunction( previous ) ) {
+				window[ jsonpCallback ]( responseContainer[ 0 ] );
+			}
+		});
+
+		// Use data converter to retrieve json after script execution
+		s.converters["script json"] = function() {
+			if ( !responseContainer ) {
+				jQuery.error( jsonpCallback + " was not called" );
+			}
+			return responseContainer[ 0 ];
+		};
+
+		// force json dataType
+		s.dataTypes[ 0 ] = "json";
+
+		// Delegate to script
+		return "script";
+	}
+});
+
+
+
+
+// Install script dataType
+jQuery.ajaxSetup({
+	accepts: {
+		script: "text/javascript, application/javascript, application/ecmascript, application/x-ecmascript"
+	},
+	contents: {
+		script: /javascript|ecmascript/
+	},
+	converters: {
+		"text script": function( text ) {
+			jQuery.globalEval( text );
+			return text;
+		}
+	}
+});
+
+// Handle cache's special case and global
+jQuery.ajaxPrefilter( "script", function( s ) {
+	if ( s.cache === undefined ) {
+		s.cache = false;
+	}
+	if ( s.crossDomain ) {
+		s.type = "GET";
+		s.global = false;
+	}
+});
+
+// Bind script tag hack transport
+jQuery.ajaxTransport( "script", function(s) {
+
+	// This transport only deals with cross domain requests
+	if ( s.crossDomain ) {
+
+		var script,
+			head = document.head || document.getElementsByTagName( "head" )[0] || document.documentElement;
+
+		return {
+
+			send: function( _, callback ) {
+
+				script = document.createElement( "script" );
+
+				script.async = "async";
+
+				if ( s.scriptCharset ) {
+					script.charset = s.scriptCharset;
+				}
+
+				script.src = s.url;
+
+				// Attach handlers for all browsers
+				script.onload = script.onreadystatechange = function( _, isAbort ) {
+
+					if ( isAbort || !script.readyState || /loaded|complete/.test( script.readyState ) ) {
+
+						// Handle memory leak in IE
+						script.onload = script.onreadystatechange = null;
+
+						// Remove the script
+						if ( head && script.parentNode ) {
+							head.removeChild( script );
+						}
+
+						// Dereference the script
+						script = undefined;
+
+						// Callback if not abort
+						if ( !isAbort ) {
+							callback( 200, "success" );
+						}
+					}
+				};
+				// Use insertBefore instead of appendChild  to circumvent an IE6 bug.
+				// This arises when a base node is used (#2709 and #4378).
+				head.insertBefore( script, head.firstChild );
+			},
+
+			abort: function() {
+				if ( script ) {
+					script.onload( 0, 1 );
+				}
+			}
+		};
+	}
+});
+
+
+
+
+var // #5280: Internet Explorer will keep connections alive if we don't abort on unload
+	xhrOnUnloadAbort = window.ActiveXObject ? function() {
+		// Abort all pending requests
+		for ( var key in xhrCallbacks ) {
+			xhrCallbacks[ key ]( 0, 1 );
+		}
+	} : false,
+	xhrId = 0,
+	xhrCallbacks;
+
+// Functions to create xhrs
+function createStandardXHR() {
+	try {
+		return new window.XMLHttpRequest();
+	} catch( e ) {}
+}
+
+function createActiveXHR() {
+	try {
+		return new window.ActiveXObject( "Microsoft.XMLHTTP" );
+	} catch( e ) {}
+}
+
+// Create the request object
+// (This is still attached to ajaxSettings for backward compatibility)
+jQuery.ajaxSettings.xhr = window.ActiveXObject ?
+	/* Microsoft failed to properly
+	 * implement the XMLHttpRequest in IE7 (can't request local files),
+	 * so we use the ActiveXObject when it is available
+	 * Additionally XMLHttpRequest can be disabled in IE7/IE8 so
+	 * we need a fallback.
+	 */
+	function() {
+		return !this.isLocal && createStandardXHR() || createActiveXHR();
+	} :
+	// For all other browsers, use the standard XMLHttpRequest object
+	createStandardXHR;
+
+// Determine support properties
+(function( xhr ) {
+	jQuery.extend( jQuery.support, {
+		ajax: !!xhr,
+		cors: !!xhr && ( "withCredentials" in xhr )
+	});
+})( jQuery.ajaxSettings.xhr() );
+
+// Create transport if the browser can provide an xhr
+if ( jQuery.support.ajax ) {
+
+	jQuery.ajaxTransport(function( s ) {
+		// Cross domain only allowed if supported through XMLHttpRequest
+		if ( !s.crossDomain || jQuery.support.cors ) {
+
+			var callback;
+
+			return {
+				send: function( headers, complete ) {
+
+					// Get a new xhr
+					var xhr = s.xhr(),
+						handle,
+						i;
+
+					// Open the socket
+					// Passing null username, generates a login popup on Opera (#2865)
+					if ( s.username ) {
+						xhr.open( s.type, s.url, s.async, s.username, s.password );
+					} else {
+						xhr.open( s.type, s.url, s.async );
+					}
+
+					// Apply custom fields if provided
+					if ( s.xhrFields ) {
+						for ( i in s.xhrFields ) {
+							xhr[ i ] = s.xhrFields[ i ];
+						}
+					}
+
+					// Override mime type if needed
+					if ( s.mimeType && xhr.overrideMimeType ) {
+						xhr.overrideMimeType( s.mimeType );
+					}
+
+					// X-Requested-With header
+					// For cross-domain requests, seeing as conditions for a preflight are
+					// akin to a jigsaw puzzle, we simply never set it to be sure.
+					// (it can always be set on a per-request basis or even using ajaxSetup)
+					// For same-domain requests, won't change header if already provided.
+					if ( !s.crossDomain && !headers["X-Requested-With"] ) {
+						headers[ "X-Requested-With" ] = "XMLHttpRequest";
+					}
+
+					// Need an extra try/catch for cross domain requests in Firefox 3
+					try {
+						for ( i in headers ) {
+							xhr.setRequestHeader( i, headers[ i ] );
+						}
+					} catch( _ ) {}
+
+					// Do send the request
+					// This may raise an exception which is actually
+					// handled in jQuery.ajax (so no try/catch here)
+					xhr.send( ( s.hasContent && s.data ) || null );
+
+					// Listener
+					callback = function( _, isAbort ) {
+
+						var status,
+							statusText,
+							responseHeaders,
+							responses,
+							xml;
+
+						// Firefox throws exceptions when accessing properties
+						// of an xhr when a network error occured
+						// http://helpful.knobs-dials.com/index.php/Component_returned_failure_code:_0x80040111_(NS_ERROR_NOT_AVAILABLE)
+						try {
+
+							// Was never called and is aborted or complete
+							if ( callback && ( isAbort || xhr.readyState === 4 ) ) {
+
+								// Only called once
+								callback = undefined;
+
+								// Do not keep as active anymore
+								if ( handle ) {
+									xhr.onreadystatechange = jQuery.noop;
+									if ( xhrOnUnloadAbort ) {
+										delete xhrCallbacks[ handle ];
+									}
+								}
+
+								// If it's an abort
+								if ( isAbort ) {
+									// Abort it manually if needed
+									if ( xhr.readyState !== 4 ) {
+										xhr.abort();
+									}
+								} else {
+									status = xhr.status;
+									responseHeaders = xhr.getAllResponseHeaders();
+									responses = {};
+									xml = xhr.responseXML;
+
+									// Construct response list
+									if ( xml && xml.documentElement /* #4958 */ ) {
+										responses.xml = xml;
+									}
+
+									// When requesting binary data, IE6-9 will throw an exception
+									// on any attempt to access responseText (#11426)
+									try {
+										responses.text = xhr.responseText;
+									} catch( _ ) {
+									}
+
+									// Firefox throws an exception when accessing
+									// statusText for faulty cross-domain requests
+									try {
+										statusText = xhr.statusText;
+									} catch( e ) {
+										// We normalize with Webkit giving an empty statusText
+										statusText = "";
+									}
+
+									// Filter status for non standard behaviors
+
+									// If the request is local and we have data: assume a success
+									// (success with no data won't get notified, that's the best we
+									// can do given current implementations)
+									if ( !status && s.isLocal && !s.crossDomain ) {
+										status = responses.text ? 200 : 404;
+									// IE - #1450: sometimes returns 1223 when it should be 204
+									} else if ( status === 1223 ) {
+										status = 204;
+									}
+								}
+							}
+						} catch( firefoxAccessException ) {
+							if ( !isAbort ) {
+								complete( -1, firefoxAccessException );
+							}
+						}
+
+						// Call complete if needed
+						if ( responses ) {
+							complete( status, statusText, responses, responseHeaders );
+						}
+					};
+
+					// if we're in sync mode or it's in cache
+					// and has been retrieved directly (IE6 & IE7)
+					// we need to manually fire the callback
+					if ( !s.async || xhr.readyState === 4 ) {
+						callback();
+					} else {
+						handle = ++xhrId;
+						if ( xhrOnUnloadAbort ) {
+							// Create the active xhrs callbacks list if needed
+							// and attach the unload handler
+							if ( !xhrCallbacks ) {
+								xhrCallbacks = {};
+								jQuery( window ).unload( xhrOnUnloadAbort );
+							}
+							// Add to list of active xhrs callbacks
+							xhrCallbacks[ handle ] = callback;
+						}
+						xhr.onreadystatechange = callback;
+					}
+				},
+
+				abort: function() {
+					if ( callback ) {
+						callback(0,1);
+					}
+				}
+			};
+		}
+	});
+}
+
+
+
+
+var elemdisplay = {},
+	iframe, iframeDoc,
+	rfxtypes = /^(?:toggle|show|hide)$/,
+	rfxnum = /^([+\-]=)?([\d+.\-]+)([a-z%]*)$/i,
+	timerId,
+	fxAttrs = [
+		// height animations
+		[ "height", "marginTop", "marginBottom", "paddingTop", "paddingBottom" ],
+		// width animations
+		[ "width", "marginLeft", "marginRight", "paddingLeft", "paddingRight" ],
+		// opacity animations
+		[ "opacity" ]
+	],
+	fxNow;
+
+jQuery.fn.extend({
+	show: function( speed, easing, callback ) {
+		var elem, display;
+
+		if ( speed || speed === 0 ) {
+			return this.animate( genFx("show", 3), speed, easing, callback );
+
+		} else {
+			for ( var i = 0, j = this.length; i < j; i++ ) {
+				elem = this[ i ];
+
+				if ( elem.style ) {
+					display = elem.style.display;
+
+					// Reset the inline display of this element to learn if it is
+					// being hidden by cascaded rules or not
+					if ( !jQuery._data(elem, "olddisplay") && display === "none" ) {
+						display = elem.style.display = "";
+					}
+
+					// Set elements which have been overridden with display: none
+					// in a stylesheet to whatever the default browser style is
+					// for such an element
+					if ( (display === "" && jQuery.css(elem, "display") === "none") ||
+						!jQuery.contains( elem.ownerDocument.documentElement, elem ) ) {
+						jQuery._data( elem, "olddisplay", defaultDisplay(elem.nodeName) );
+					}
+				}
+			}
+
+			// Set the display of most of the elements in a second loop
+			// to avoid the constant reflow
+			for ( i = 0; i < j; i++ ) {
+				elem = this[ i ];
+
+				if ( elem.style ) {
+					display = elem.style.display;
+
+					if ( display === "" || display === "none" ) {
+						elem.style.display = jQuery._data( elem, "olddisplay" ) || "";
+					}
+				}
+			}
+
+			return this;
+		}
+	},
+
+	hide: function( speed, easing, callback ) {
+		if ( speed || speed === 0 ) {
+			return this.animate( genFx("hide", 3), speed, easing, callback);
+
+		} else {
+			var elem, display,
+				i = 0,
+				j = this.length;
+
+			for ( ; i < j; i++ ) {
+				elem = this[i];
+				if ( elem.style ) {
+					display = jQuery.css( elem, "display" );
+
+					if ( display !== "none" && !jQuery._data( elem, "olddisplay" ) ) {
+						jQuery._data( elem, "olddisplay", display );
+					}
+				}
+			}
+
+			// Set the display of the elements in a second loop
+			// to avoid the constant reflow
+			for ( i = 0; i < j; i++ ) {
+				if ( this[i].style ) {
+					this[i].style.display = "none";
+				}
+			}
+
+			return this;
+		}
+	},
+
+	// Save the old toggle function
+	_toggle: jQuery.fn.toggle,
+
+	toggle: function( fn, fn2, callback ) {
+		var bool = typeof fn === "boolean";
+
+		if ( jQuery.isFunction(fn) && jQuery.isFunction(fn2) ) {
+			this._toggle.apply( this, arguments );
+
+		} else if ( fn == null || bool ) {
+			this.each(function() {
+				var state = bool ? fn : jQuery(this).is(":hidden");
+				jQuery(this)[ state ? "show" : "hide" ]();
+			});
+
+		} else {
+			this.animate(genFx("toggle", 3), fn, fn2, callback);
+		}
+
+		return this;
+	},
+
+	fadeTo: function( speed, to, easing, callback ) {
+		return this.filter(":hidden").css("opacity", 0).show().end()
+					.animate({opacity: to}, speed, easing, callback);
+	},
+
+	animate: function( prop, speed, easing, callback ) {
+		var optall = jQuery.speed( speed, easing, callback );
+
+		if ( jQuery.isEmptyObject( prop ) ) {
+			return this.each( optall.complete, [ false ] );
+		}
+
+		// Do not change referenced properties as per-property easing will be lost
+		prop = jQuery.extend( {}, prop );
+
+		function doAnimation() {
+			// XXX 'this' does not always have a nodeName when running the
+			// test suite
+
+			if ( optall.queue === false ) {
+				jQuery._mark( this );
+			}
+
+			var opt = jQuery.extend( {}, optall ),
+				isElement = this.nodeType === 1,
+				hidden = isElement && jQuery(this).is(":hidden"),
+				name, val, p, e, hooks, replace,
+				parts, start, end, unit,
+				method;
+
+			// will store per property easing and be used to determine when an animation is complete
+			opt.animatedProperties = {};
+
+			// first pass over propertys to expand / normalize
+			for ( p in prop ) {
+				name = jQuery.camelCase( p );
+				if ( p !== name ) {
+					prop[ name ] = prop[ p ];
+					delete prop[ p ];
+				}
+
+				if ( ( hooks = jQuery.cssHooks[ name ] ) && "expand" in hooks ) {
+					replace = hooks.expand( prop[ name ] );
+					delete prop[ name ];
+
+					// not quite $.extend, this wont overwrite keys already present.
+					// also - reusing 'p' from above because we have the correct "name"
+					for ( p in replace ) {
+						if ( ! ( p in prop ) ) {
+							prop[ p ] = replace[ p ];
+						}
+					}
+				}
+			}
+
+			for ( name in prop ) {
+				val = prop[ name ];
+				// easing resolution: per property > opt.specialEasing > opt.easing > 'swing' (default)
+				if ( jQuery.isArray( val ) ) {
+					opt.animatedProperties[ name ] = val[ 1 ];
+					val = prop[ name ] = val[ 0 ];
+				} else {
+					opt.animatedProperties[ name ] = opt.specialEasing && opt.specialEasing[ name ] || opt.easing || 'swing';
+				}
+
+				if ( val === "hide" && hidden || val === "show" && !hidden ) {
+					return opt.complete.call( this );
+				}
+
+				if ( isElement && ( name === "height" || name === "width" ) ) {
+					// Make sure that nothing sneaks out
+					// Record all 3 overflow attributes because IE does not
+					// change the overflow attribute when overflowX and
+					// overflowY are set to the same value
+					opt.overflow = [ this.style.overflow, this.style.overflowX, this.style.overflowY ];
+
+					// Set display property to inline-block for height/width
+					// animations on inline elements that are having width/height animated
+					if ( jQuery.css( this, "display" ) === "inline" &&
+							jQuery.css( this, "float" ) === "none" ) {
+
+						// inline-level elements accept inline-block;
+						// block-level elements need to be inline with layout
+						if ( !jQuery.support.inlineBlockNeedsLayout || defaultDisplay( this.nodeName ) === "inline" ) {
+							this.style.display = "inline-block";
+
+						} else {
+							this.style.zoom = 1;
+						}
+					}
+				}
+			}
+
+			if ( opt.overflow != null ) {
+				this.style.overflow = "hidden";
+			}
+
+			for ( p in prop ) {
+				e = new jQuery.fx( this, opt, p );
+				val = prop[ p ];
+
+				if ( rfxtypes.test( val ) ) {
+
+					// Tracks whether to show or hide based on private
+					// data attached to the element
+					method = jQuery._data( this, "toggle" + p ) || ( val === "toggle" ? hidden ? "show" : "hide" : 0 );
+					if ( method ) {
+						jQuery._data( this, "toggle" + p, method === "show" ? "hide" : "show" );
+						e[ method ]();
+					} else {
+						e[ val ]();
+					}
+
+				} else {
+					parts = rfxnum.exec( val );
+					start = e.cur();
+
+					if ( parts ) {
+						end = parseFloat( parts[2] );
+						unit = parts[3] || ( jQuery.cssNumber[ p ] ? "" : "px" );
+
+						// We need to compute starting value
+						if ( unit !== "px" ) {
+							jQuery.style( this, p, (end || 1) + unit);
+							start = ( (end || 1) / e.cur() ) * start;
+							jQuery.style( this, p, start + unit);
+						}
+
+						// If a +=/-= token was provided, we're doing a relative animation
+						if ( parts[1] ) {
+							end = ( (parts[ 1 ] === "-=" ? -1 : 1) * end ) + start;
+						}
+
+						e.custom( start, end, unit );
+
+					} else {
+						e.custom( start, val, "" );
+					}
+				}
+			}
+
+			// For JS strict compliance
+			return true;
+		}
+
+		return optall.queue === false ?
+			this.each( doAnimation ) :
+			this.queue( optall.queue, doAnimation );
+	},
+
+	stop: function( type, clearQueue, gotoEnd ) {
+		if ( typeof type !== "string" ) {
+			gotoEnd = clearQueue;
+			clearQueue = type;
+			type = undefined;
+		}
+		if ( clearQueue && type !== false ) {
+			this.queue( type || "fx", [] );
+		}
+
+		return this.each(function() {
+			var index,
+				hadTimers = false,
+				timers = jQuery.timers,
+				data = jQuery._data( this );
+
+			// clear marker counters if we know they won't be
+			if ( !gotoEnd ) {
+				jQuery._unmark( true, this );
+			}
+
+			function stopQueue( elem, data, index ) {
+				var hooks = data[ index ];
+				jQuery.removeData( elem, index, true );
+				hooks.stop( gotoEnd );
+			}
+
+			if ( type == null ) {
+				for ( index in data ) {
+					if ( data[ index ] && data[ index ].stop && index.indexOf(".run") === index.length - 4 ) {
+						stopQueue( this, data, index );
+					}
+				}
+			} else if ( data[ index = type + ".run" ] && data[ index ].stop ){
+				stopQueue( this, data, index );
+			}
+
+			for ( index = timers.length; index--; ) {
+				if ( timers[ index ].elem === this && (type == null || timers[ index ].queue === type) ) {
+					if ( gotoEnd ) {
+
+						// force the next step to be the last
+						timers[ index ]( true );
+					} else {
+						timers[ index ].saveState();
+					}
+					hadTimers = true;
+					timers.splice( index, 1 );
+				}
+			}
+
+			// start the next in the queue if the last step wasn't forced
+			// timers currently will call their complete callbacks, which will dequeue
+			// but only if they were gotoEnd
+			if ( !( gotoEnd && hadTimers ) ) {
+				jQuery.dequeue( this, type );
+			}
+		});
+	}
+
+});
+
+// Animations created synchronously will run synchronously
+function createFxNow() {
+	setTimeout( clearFxNow, 0 );
+	return ( fxNow = jQuery.now() );
+}
+
+function clearFxNow() {
+	fxNow = undefined;
+}
+
+// Generate parameters to create a standard animation
+function genFx( type, num ) {
+	var obj = {};
+
+	jQuery.each( fxAttrs.concat.apply([], fxAttrs.slice( 0, num )), function() {
+		obj[ this ] = type;
+	});
+
+	return obj;
+}
+
+// Generate shortcuts for custom animations
+jQuery.each({
+	slideDown: genFx( "show", 1 ),
+	slideUp: genFx( "hide", 1 ),
+	slideToggle: genFx( "toggle", 1 ),
+	fadeIn: { opacity: "show" },
+	fadeOut: { opacity: "hide" },
+	fadeToggle: { opacity: "toggle" }
+}, function( name, props ) {
+	jQuery.fn[ name ] = function( speed, easing, callback ) {
+		return this.animate( props, speed, easing, callback );
+	};
+});
+
+jQuery.extend({
+	speed: function( speed, easing, fn ) {
+		var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : {
+			complete: fn || !fn && easing ||
+				jQuery.isFunction( speed ) && speed,
+			duration: speed,
+			easing: fn && easing || easing && !jQuery.isFunction( easing ) && easing
+		};
+
+		opt.duration = jQuery.fx.off ? 0 : typeof opt.duration === "number" ? opt.duration :
+			opt.duration in jQuery.fx.speeds ? jQuery.fx.speeds[ opt.duration ] : jQuery.fx.speeds._default;
+
+		// normalize opt.queue - true/undefined/null -> "fx"
+		if ( opt.queue == null || opt.queue === true ) {
+			opt.queue = "fx";
+		}
+
+		// Queueing
+		opt.old = opt.complete;
+
+		opt.complete = function( noUnmark ) {
+			if ( jQuery.isFunction( opt.old ) ) {
+				opt.old.call( this );
+			}
+
+			if ( opt.queue ) {
+				jQuery.dequeue( this, opt.queue );
+			} else if ( noUnmark !== false ) {
+				jQuery._unmark( this );
+			}
+		};
+
+		return opt;
+	},
+
+	easing: {
+		linear: function( p ) {
+			return p;
+		},
+		swing: function( p ) {
+			return ( -Math.cos( p*Math.PI ) / 2 ) + 0.5;
+		}
+	},
+
+	timers: [],
+
+	fx: function( elem, options, prop ) {
+		this.options = options;
+		this.elem = elem;
+		this.prop = prop;
+
+		options.orig = options.orig || {};
+	}
+
+});
+
+jQuery.fx.prototype = {
+	// Simple function for setting a style value
+	update: function() {
+		if ( this.options.step ) {
+			this.options.step.call( this.elem, this.now, this );
+		}
+
+		( jQuery.fx.step[ this.prop ] || jQuery.fx.step._default )( this );
+	},
+
+	// Get the current size
+	cur: function() {
+		if ( this.elem[ this.prop ] != null && (!this.elem.style || this.elem.style[ this.prop ] == null) ) {
+			return this.elem[ this.prop ];
+		}
+
+		var parsed,
+			r = jQuery.css( this.elem, this.prop );
+		// Empty strings, null, undefined and "auto" are converted to 0,
+		// complex values such as "rotate(1rad)" are returned as is,
+		// simple values such as "10px" are parsed to Float.
+		return isNaN( parsed = parseFloat( r ) ) ? !r || r === "auto" ? 0 : r : parsed;
+	},
+
+	// Start an animation from one number to another
+	custom: function( from, to, unit ) {
+		var self = this,
+			fx = jQuery.fx;
+
+		this.startTime = fxNow || createFxNow();
+		this.end = to;
+		this.now = this.start = from;
+		this.pos = this.state = 0;
+		this.unit = unit || this.unit || ( jQuery.cssNumber[ this.prop ] ? "" : "px" );
+
+		function t( gotoEnd ) {
+			return self.step( gotoEnd );
+		}
+
+		t.queue = this.options.queue;
+		t.elem = this.elem;
+		t.saveState = function() {
+			if ( jQuery._data( self.elem, "fxshow" + self.prop ) === undefined ) {
+				if ( self.options.hide ) {
+					jQuery._data( self.elem, "fxshow" + self.prop, self.start );
+				} else if ( self.options.show ) {
+					jQuery._data( self.elem, "fxshow" + self.prop, self.end );
+				}
+			}
+		};
+
+		if ( t() && jQuery.timers.push(t) && !timerId ) {
+			timerId = setInterval( fx.tick, fx.interval );
+		}
+	},
+
+	// Simple 'show' function
+	show: function() {
+		var dataShow = jQuery._data( this.elem, "fxshow" + this.prop );
+
+		// Remember where we started, so that we can go back to it later
+		this.options.orig[ this.prop ] = dataShow || jQuery.style( this.elem, this.prop );
+		this.options.show = true;
+
+		// Begin the animation
+		// Make sure that we start at a small width/height to avoid any flash of content
+		if ( dataShow !== undefined ) {
+			// This show is picking up where a previous hide or show left off
+			this.custom( this.cur(), dataShow );
+		} else {
+			this.custom( this.prop === "width" || this.prop === "height" ? 1 : 0, this.cur() );
+		}
+
+		// Start by showing the element
+		jQuery( this.elem ).show();
+	},
+
+	// Simple 'hide' function
+	hide: function() {
+		// Remember where we started, so that we can go back to it later
+		this.options.orig[ this.prop ] = jQuery._data( this.elem, "fxshow" + this.prop ) || jQuery.style( this.elem, this.prop );
+		this.options.hide = true;
+
+		// Begin the animation
+		this.custom( this.cur(), 0 );
+	},
+
+	// Each step of an animation
+	step: function( gotoEnd ) {
+		var p, n, complete,
+			t = fxNow || createFxNow(),
+			done = true,
+			elem = this.elem,
+			options = this.options;
+
+		if ( gotoEnd || t >= options.duration + this.startTime ) {
+			this.now = this.end;
+			this.pos = this.state = 1;
+			this.update();
+
+			options.animatedProperties[ this.prop ] = true;
+
+			for ( p in options.animatedProperties ) {
+				if ( options.animatedProperties[ p ] !== true ) {
+					done = false;
+				}
+			}
+
+			if ( done ) {
+				// Reset the overflow
+				if ( options.overflow != null && !jQuery.support.shrinkWrapBlocks ) {
+
+					jQuery.each( [ "", "X", "Y" ], function( index, value ) {
+						elem.style[ "overflow" + value ] = options.overflow[ index ];
+					});
+				}
+
+				// Hide the element if the "hide" operation was done
+				if ( options.hide ) {
+					jQuery( elem ).hide();
+				}
+
+				// Reset the properties, if the item has been hidden or shown
+				if ( options.hide || options.show ) {
+					for ( p in options.animatedProperties ) {
+						jQuery.style( elem, p, options.orig[ p ] );
+						jQuery.removeData( elem, "fxshow" + p, true );
+						// Toggle data is no longer needed
+						jQuery.removeData( elem, "toggle" + p, true );
+					}
+				}
+
+				// Execute the complete function
+				// in the event that the complete function throws an exception
+				// we must ensure it won't be called twice. #5684
+
+				complete = options.complete;
+				if ( complete ) {
+
+					options.complete = false;
+					complete.call( elem );
+				}
+			}
+
+			return false;
+
+		} else {
+			// classical easing cannot be used with an Infinity duration
+			if ( options.duration == Infinity ) {
+				this.now = t;
+			} else {
+				n = t - this.startTime;
+				this.state = n / options.duration;
+
+				// Perform the easing function, defaults to swing
+				this.pos = jQuery.easing[ options.animatedProperties[this.prop] ]( this.state, n, 0, 1, options.duration );
+				this.now = this.start + ( (this.end - this.start) * this.pos );
+			}
+			// Perform the next step of the animation
+			this.update();
+		}
+
+		return true;
+	}
+};
+
+jQuery.extend( jQuery.fx, {
+	tick: function() {
+		var timer,
+			timers = jQuery.timers,
+			i = 0;
+
+		for ( ; i < timers.length; i++ ) {
+			timer = timers[ i ];
+			// Checks the timer has not already been removed
+			if ( !timer() && timers[ i ] === timer ) {
+				timers.splice( i--, 1 );
+			}
+		}
+
+		if ( !timers.length ) {
+			jQuery.fx.stop();
+		}
+	},
+
+	interval: 13,
+
+	stop: function() {
+		clearInterval( timerId );
+		timerId = null;
+	},
+
+	speeds: {
+		slow: 600,
+		fast: 200,
+		// Default speed
+		_default: 400
+	},
+
+	step: {
+		opacity: function( fx ) {
+			jQuery.style( fx.elem, "opacity", fx.now );
+		},
+
+		_default: function( fx ) {
+			if ( fx.elem.style && fx.elem.style[ fx.prop ] != null ) {
+				fx.elem.style[ fx.prop ] = fx.now + fx.unit;
+			} else {
+				fx.elem[ fx.prop ] = fx.now;
+			}
+		}
+	}
+});
+
+// Ensure props that can't be negative don't go there on undershoot easing
+jQuery.each( fxAttrs.concat.apply( [], fxAttrs ), function( i, prop ) {
+	// exclude marginTop, marginLeft, marginBottom and marginRight from this list
+	if ( prop.indexOf( "margin" ) ) {
+		jQuery.fx.step[ prop ] = function( fx ) {
+			jQuery.style( fx.elem, prop, Math.max(0, fx.now) + fx.unit );
+		};
+	}
+});
+
+if ( jQuery.expr && jQuery.expr.filters ) {
+	jQuery.expr.filters.animated = function( elem ) {
+		return jQuery.grep(jQuery.timers, function( fn ) {
+			return elem === fn.elem;
+		}).length;
+	};
+}
+
+// Try to restore the default display value of an element
+function defaultDisplay( nodeName ) {
+
+	if ( !elemdisplay[ nodeName ] ) {
+
+		var body = document.body,
+			elem = jQuery( "<" + nodeName + ">" ).appendTo( body ),
+			display = elem.css( "display" );
+		elem.remove();
+
+		// If the simple way fails,
+		// get element's real default display by attaching it to a temp iframe
+		if ( display === "none" || display === "" ) {
+			// No iframe to use yet, so create it
+			if ( !iframe ) {
+				iframe = document.createElement( "iframe" );
+				iframe.frameBorder = iframe.width = iframe.height = 0;
+			}
+
+			body.appendChild( iframe );
+
+			// Create a cacheable copy of the iframe document on first call.
+			// IE and Opera will allow us to reuse the iframeDoc without re-writing the fake HTML
+			// document to it; WebKit & Firefox won't allow reusing the iframe document.
+			if ( !iframeDoc || !iframe.createElement ) {
+				iframeDoc = ( iframe.contentWindow || iframe.contentDocument ).document;
+				iframeDoc.write( ( jQuery.support.boxModel ? "<!doctype html>" : "" ) + "<html><body>" );
+				iframeDoc.close();
+			}
+
+			elem = iframeDoc.createElement( nodeName );
+
+			iframeDoc.body.appendChild( elem );
+
+			display = jQuery.css( elem, "display" );
+			body.removeChild( iframe );
+		}
+
+		// Store the correct default display
+		elemdisplay[ nodeName ] = display;
+	}
+
+	return elemdisplay[ nodeName ];
+}
+
+
+
+
+var getOffset,
+	rtable = /^t(?:able|d|h)$/i,
+	rroot = /^(?:body|html)$/i;
+
+if ( "getBoundingClientRect" in document.documentElement ) {
+	getOffset = function( elem, doc, docElem, box ) {
+		try {
+			box = elem.getBoundingClientRect();
+		} catch(e) {}
+
+		// Make sure we're not dealing with a disconnected DOM node
+		if ( !box || !jQuery.contains( docElem, elem ) ) {
+			return box ? { top: box.top, left: box.left } : { top: 0, left: 0 };
+		}
+
+		var body = doc.body,
+			win = getWindow( doc ),
+			clientTop  = docElem.clientTop  || body.clientTop  || 0,
+			clientLeft = docElem.clientLeft || body.clientLeft || 0,
+			scrollTop  = win.pageYOffset || jQuery.support.boxModel && docElem.scrollTop  || body.scrollTop,
+			scrollLeft = win.pageXOffset || jQuery.support.boxModel && docElem.scrollLeft || body.scrollLeft,
+			top  = box.top  + scrollTop  - clientTop,
+			left = box.left + scrollLeft - clientLeft;
+
+		return { top: top, left: left };
+	};
+
+} else {
+	getOffset = function( elem, doc, docElem ) {
+		var computedStyle,
+			offsetParent = elem.offsetParent,
+			prevOffsetParent = elem,
+			body = doc.body,
+			defaultView = doc.defaultView,
+			prevComputedStyle = defaultView ? defaultView.getComputedStyle( elem, null ) : elem.currentStyle,
+			top = elem.offsetTop,
+			left = elem.offsetLeft;
+
+		while ( (elem = elem.parentNode) && elem !== body && elem !== docElem ) {
+			if ( jQuery.support.fixedPosition && prevComputedStyle.position === "fixed" ) {
+				break;
+			}
+
+			computedStyle = defaultView ? defaultView.getComputedStyle(elem, null) : elem.currentStyle;
+			top  -= elem.scrollTop;
+			left -= elem.scrollLeft;
+
+			if ( elem === offsetParent ) {
+				top  += elem.offsetTop;
+				left += elem.offsetLeft;
+
+				if ( jQuery.support.doesNotAddBorder && !(jQuery.support.doesAddBorderForTableAndCells && rtable.test(elem.nodeName)) ) {
+					top  += parseFloat( computedStyle.borderTopWidth  ) || 0;
+					left += parseFloat( computedStyle.borderLeftWidth ) || 0;
+				}
+
+				prevOffsetParent = offsetParent;
+				offsetParent = elem.offsetParent;
+			}
+
+			if ( jQuery.support.subtractsBorderForOverflowNotVisible && computedStyle.overflow !== "visible" ) {
+				top  += parseFloat( computedStyle.borderTopWidth  ) || 0;
+				left += parseFloat( computedStyle.borderLeftWidth ) || 0;
+			}
+
+			prevComputedStyle = computedStyle;
+		}
+
+		if ( prevComputedStyle.position === "relative" || prevComputedStyle.position === "static" ) {
+			top  += body.offsetTop;
+			left += body.offsetLeft;
+		}
+
+		if ( jQuery.support.fixedPosition && prevComputedStyle.position === "fixed" ) {
+			top  += Math.max( docElem.scrollTop, body.scrollTop );
+			left += Math.max( docElem.scrollLeft, body.scrollLeft );
+		}
+
+		return { top: top, left: left };
+	};
+}
+
+jQuery.fn.offset = function( options ) {
+	if ( arguments.length ) {
+		return options === undefined ?
+			this :
+			this.each(function( i ) {
+				jQuery.offset.setOffset( this, options, i );
+			});
+	}
+
+	var elem = this[0],
+		doc = elem && elem.ownerDocument;
+
+	if ( !doc ) {
+		return null;
+	}
+
+	if ( elem === doc.body ) {
+		return jQuery.offset.bodyOffset( elem );
+	}
+
+	return getOffset( elem, doc, doc.documentElement );
+};
+
+jQuery.offset = {
+
+	bodyOffset: function( body ) {
+		var top = body.offsetTop,
+			left = body.offsetLeft;
+
+		if ( jQuery.support.doesNotIncludeMarginInBodyOffset ) {
+			top  += parseFloat( jQuery.css(body, "marginTop") ) || 0;
+			left += parseFloat( jQuery.css(body, "marginLeft") ) || 0;
+		}
+
+		return { top: top, left: left };
+	},
+
+	setOffset: function( elem, options, i ) {
+		var position = jQuery.css( elem, "position" );
+
+		// set position first, in-case top/left are set even on static elem
+		if ( position === "static" ) {
+			elem.style.position = "relative";
+		}
+
+		var curElem = jQuery( elem ),
+			curOffset = curElem.offset(),
+			curCSSTop = jQuery.css( elem, "top" ),
+			curCSSLeft = jQuery.css( elem, "left" ),
+			calculatePosition = ( position === "absolute" || position === "fixed" ) && jQuery.inArray("auto", [curCSSTop, curCSSLeft]) > -1,
+			props = {}, curPosition = {}, curTop, curLeft;
+
+		// need to be able to calculate position if either top or left is auto and position is either absolute or fixed
+		if ( calculatePosition ) {
+			curPosition = curElem.position();
+			curTop = curPosition.top;
+			curLeft = curPosition.left;
+		} else {
+			curTop = parseFloat( curCSSTop ) || 0;
+			curLeft = parseFloat( curCSSLeft ) || 0;
+		}
+
+		if ( jQuery.isFunction( options ) ) {
+			options = options.call( elem, i, curOffset );
+		}
+
+		if ( options.top != null ) {
+			props.top = ( options.top - curOffset.top ) + curTop;
+		}
+		if ( options.left != null ) {
+			props.left = ( options.left - curOffset.left ) + curLeft;
+		}
+
+		if ( "using" in options ) {
+			options.using.call( elem, props );
+		} else {
+			curElem.css( props );
+		}
+	}
+};
+
+
+jQuery.fn.extend({
+
+	position: function() {
+		if ( !this[0] ) {
+			return null;
+		}
+
+		var elem = this[0],
+
+		// Get *real* offsetParent
+		offsetParent = this.offsetParent(),
+
+		// Get correct offsets
+		offset       = this.offset(),
+		parentOffset = rroot.test(offsetParent[0].nodeName) ? { top: 0, left: 0 } : offsetParent.offset();
+
+		// Subtract element margins
+		// note: when an element has margin: auto the offsetLeft and marginLeft
+		// are the same in Safari causing offset.left to incorrectly be 0
+		offset.top  -= parseFloat( jQuery.css(elem, "marginTop") ) || 0;
+		offset.left -= parseFloat( jQuery.css(elem, "marginLeft") ) || 0;
+
+		// Add offsetParent borders
+		parentOffset.top  += parseFloat( jQuery.css(offsetParent[0], "borderTopWidth") ) || 0;
+		parentOffset.left += parseFloat( jQuery.css(offsetParent[0], "borderLeftWidth") ) || 0;
+
+		// Subtract the two offsets
+		return {
+			top:  offset.top  - parentOffset.top,
+			left: offset.left - parentOffset.left
+		};
+	},
+
+	offsetParent: function() {
+		return this.map(function() {
+			var offsetParent = this.offsetParent || document.body;
+			while ( offsetParent && (!rroot.test(offsetParent.nodeName) && jQuery.css(offsetParent, "position") === "static") ) {
+				offsetParent = offsetParent.offsetParent;
+			}
+			return offsetParent;
+		});
+	}
+});
+
+
+// Create scrollLeft and scrollTop methods
+jQuery.each( {scrollLeft: "pageXOffset", scrollTop: "pageYOffset"}, function( method, prop ) {
+	var top = /Y/.test( prop );
+
+	jQuery.fn[ method ] = function( val ) {
+		return jQuery.access( this, function( elem, method, val ) {
+			var win = getWindow( elem );
+
+			if ( val === undefined ) {
+				return win ? (prop in win) ? win[ prop ] :
+					jQuery.support.boxModel && win.document.documentElement[ method ] ||
+						win.document.body[ method ] :
+					elem[ method ];
+			}
+
+			if ( win ) {
+				win.scrollTo(
+					!top ? val : jQuery( win ).scrollLeft(),
+					 top ? val : jQuery( win ).scrollTop()
+				);
+
+			} else {
+				elem[ method ] = val;
+			}
+		}, method, val, arguments.length, null );
+	};
+});
+
+function getWindow( elem ) {
+	return jQuery.isWindow( elem ) ?
+		elem :
+		elem.nodeType === 9 ?
+			elem.defaultView || elem.parentWindow :
+			false;
+}
+
+
+
+
+// Create width, height, innerHeight, innerWidth, outerHeight and outerWidth methods
+jQuery.each( { Height: "height", Width: "width" }, function( name, type ) {
+	var clientProp = "client" + name,
+		scrollProp = "scroll" + name,
+		offsetProp = "offset" + name;
+
+	// innerHeight and innerWidth
+	jQuery.fn[ "inner" + name ] = function() {
+		var elem = this[0];
+		return elem ?
+			elem.style ?
+			parseFloat( jQuery.css( elem, type, "padding" ) ) :
+			this[ type ]() :
+			null;
+	};
+
+	// outerHeight and outerWidth
+	jQuery.fn[ "outer" + name ] = function( margin ) {
+		var elem = this[0];
+		return elem ?
+			elem.style ?
+			parseFloat( jQuery.css( elem, type, margin ? "margin" : "border" ) ) :
+			this[ type ]() :
+			null;
+	};
+
+	jQuery.fn[ type ] = function( value ) {
+		return jQuery.access( this, function( elem, type, value ) {
+			var doc, docElemProp, orig, ret;
+
+			if ( jQuery.isWindow( elem ) ) {
+				// 3rd condition allows Nokia support, as it supports the docElem prop but not CSS1Compat
+				doc = elem.document;
+				docElemProp = doc.documentElement[ clientProp ];
+				return jQuery.support.boxModel && docElemProp ||
+					doc.body && doc.body[ clientProp ] || docElemProp;
+			}
+
+			// Get document width or height
+			if ( elem.nodeType === 9 ) {
+				// Either scroll[Width/Height] or offset[Width/Height], whichever is greater
+				doc = elem.documentElement;
+
+				// when a window > document, IE6 reports a offset[Width/Height] > client[Width/Height]
+				// so we can't use max, as it'll choose the incorrect offset[Width/Height]
+				// instead we use the correct client[Width/Height]
+				// support:IE6
+				if ( doc[ clientProp ] >= doc[ scrollProp ] ) {
+					return doc[ clientProp ];
+				}
+
+				return Math.max(
+					elem.body[ scrollProp ], doc[ scrollProp ],
+					elem.body[ offsetProp ], doc[ offsetProp ]
+				);
+			}
+
+			// Get width or height on the element
+			if ( value === undefined ) {
+				orig = jQuery.css( elem, type );
+				ret = parseFloat( orig );
+				return jQuery.isNumeric( ret ) ? ret : orig;
+			}
+
+			// Set the width or height on the element
+			jQuery( elem ).css( type, value );
+		}, type, value, arguments.length, null );
+	};
+});
+
+
+
+
+// Expose jQuery to the global object
+window.jQuery = window.$ = jQuery;
+
+// Expose jQuery as an AMD module, but only for AMD loaders that
+// understand the issues with loading multiple versions of jQuery
+// in a page that all might call define(). The loader will indicate
+// they have special allowances for multiple jQuery versions by
+// specifying define.amd.jQuery = true. Register as a named module,
+// since jQuery can be concatenated with other files that may use define,
+// but not use a proper concatenation script that understands anonymous
+// AMD modules. A named AMD is safest and most robust way to register.
+// Lowercase jquery is used because AMD module names are derived from
+// file names, and jQuery is normally delivered in a lowercase file name.
+// Do this after creating the global so that if an AMD module wants to call
+// noConflict to hide this version of jQuery, it will work.
+if ( typeof define === "function" && define.amd && define.amd.jQuery ) {
+	define( "jquery", [], function () { return jQuery; } );
+}
+
+
+
+})( window );

Added: www-releases/trunk/3.6.0/docs/_static/lines.gif
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/lines.gif?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/lines.gif
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/llvm-theme.css
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/llvm-theme.css?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_static/llvm-theme.css (added)
+++ www-releases/trunk/3.6.0/docs/_static/llvm-theme.css Fri Feb 27 12:44:09 2015
@@ -0,0 +1,371 @@
+/*
+ * sphinxdoc.css_t
+ * ~~~~~~~~~~~~~~~
+ *
+ * Sphinx stylesheet -- sphinxdoc theme.  Originally created by
+ * Armin Ronacher for Werkzeug.
+ *
+ * :copyright: Copyright 2007-2010 by the Sphinx team, see AUTHORS.
+ * :license: BSD, see LICENSE for details.
+ *
+ */
+
+ at import url("basic.css");
+
+/* -- page layout ----------------------------------------------------------- */
+
+body {
+    font-family: 'Lucida Grande', 'Lucida Sans Unicode', 'Geneva',
+                 'Verdana', sans-serif;
+    font-size: 14px;
+    line-height: 150%;
+    text-align: center;
+    background-color: #BFD1D4;
+    color: black;
+    padding: 0;
+    border: 1px solid #aaa;
+
+    margin: 0px 80px 0px 80px;
+    min-width: 740px;
+}
+
+div.logo {
+    background-color: white;
+    text-align: left;
+    padding: 10px 10px 15px 15px;
+}
+
+div.document {
+    background-color: white;
+    text-align: left;
+    background-image: url(contents.png);
+    background-repeat: repeat-x;
+}
+
+div.bodywrapper {
+    margin: 0 240px 0 0;
+    border-right: 1px solid #ccc;
+}
+
+div.body {
+    margin: 0;
+    padding: 0.5em 20px 20px 20px;
+}
+
+div.related {
+    font-size: 1em;
+}
+
+div.related ul {
+    background-image: url(navigation.png);
+    height: 2em;
+    border-top: 1px solid #ddd;
+    border-bottom: 1px solid #ddd;
+}
+
+div.related ul li {
+    margin: 0;
+    padding: 0;
+    height: 2em;
+    float: left;
+}
+
+div.related ul li.right {
+    float: right;
+    margin-right: 5px;
+}
+
+div.related ul li a {
+    margin: 0;
+    padding: 0 5px 0 5px;
+    line-height: 1.75em;
+    color: #EE9816;
+}
+
+div.related ul li a:hover {
+    color: #3CA8E7;
+}
+
+div.sphinxsidebarwrapper {
+    padding: 0;
+}
+
+div.sphinxsidebar {
+    margin: 0;
+    padding: 0.5em 15px 15px 0;
+    width: 210px;
+    float: right;
+    font-size: 1em;
+    text-align: left;
+}
+
+div.sphinxsidebar h3, div.sphinxsidebar h4 {
+    margin: 1em 0 0.5em 0;
+    font-size: 1em;
+    padding: 0.1em 0 0.1em 0.5em;
+    color: white;
+    border: 1px solid #86989B;
+    background-color: #AFC1C4;
+}
+
+div.sphinxsidebar h3 a {
+    color: white;
+}
+
+div.sphinxsidebar ul {
+    padding-left: 1.5em;
+    margin-top: 7px;
+    padding: 0;
+    line-height: 130%;
+}
+
+div.sphinxsidebar ul ul {
+    margin-left: 20px;
+}
+
+div.footer {
+    background-color: #E3EFF1;
+    color: #86989B;
+    padding: 3px 8px 3px 0;
+    clear: both;
+    font-size: 0.8em;
+    text-align: right;
+}
+
+div.footer a {
+    color: #86989B;
+    text-decoration: underline;
+}
+
+/* -- body styles ----------------------------------------------------------- */
+
+p {
+    margin: 0.8em 0 0.5em 0;
+}
+
+a {
+    color: #CA7900;
+    text-decoration: none;
+}
+
+a:hover {
+    color: #2491CF;
+}
+
+div.body p a{
+    text-decoration: underline;
+}
+
+h1 {
+    margin: 0;
+    padding: 0.7em 0 0.3em 0;
+    font-size: 1.5em;
+    color: #11557C;
+}
+
+h2 {
+    margin: 1.3em 0 0.2em 0;
+    font-size: 1.35em;
+    padding: 0;
+}
+
+h3 {
+    margin: 1em 0 -0.3em 0;
+    font-size: 1.2em;
+}
+
+h3 a:hover {
+    text-decoration: underline;
+}
+
+div.body h1 a, div.body h2 a, div.body h3 a, div.body h4 a, div.body h5 a, div.body h6 a {
+    color: black!important;
+}
+
+div.body h1,
+div.body h2,
+div.body h3,
+div.body h4,
+div.body h5,
+div.body h6 {
+    background-color: #f2f2f2;
+    font-weight: normal;
+    color: #20435c;
+    border-bottom: 1px solid #ccc;
+    margin: 20px -20px 10px -20px;
+    padding: 3px 0 3px 10px;
+}
+
+div.body h1 { margin-top: 0; font-size: 200%; }
+div.body h2 { font-size: 160%; }
+div.body h3 { font-size: 140%; }
+div.body h4 { font-size: 120%; }
+div.body h5 { font-size: 110%; }
+div.body h6 { font-size: 100%; }
+
+h1 a.anchor, h2 a.anchor, h3 a.anchor, h4 a.anchor, h5 a.anchor, h6 a.anchor {
+    display: none;
+    margin: 0 0 0 0.3em;
+    padding: 0 0.2em 0 0.2em;
+    color: #aaa!important;
+}
+
+h1:hover a.anchor, h2:hover a.anchor, h3:hover a.anchor, h4:hover a.anchor,
+h5:hover a.anchor, h6:hover a.anchor {
+    display: inline;
+}
+
+h1 a.anchor:hover, h2 a.anchor:hover, h3 a.anchor:hover, h4 a.anchor:hover,
+h5 a.anchor:hover, h6 a.anchor:hover {
+    color: #777;
+    background-color: #eee;
+}
+
+a.headerlink {
+    color: #c60f0f!important;
+    font-size: 1em;
+    margin-left: 6px;
+    padding: 0 4px 0 4px;
+    text-decoration: none!important;
+}
+
+a.headerlink:hover {
+    background-color: #ccc;
+    color: white!important;
+}
+
+cite, code, tt {
+    font-family: 'Consolas', 'Deja Vu Sans Mono',
+                 'Bitstream Vera Sans Mono', monospace;
+    font-size: 0.95em;
+}
+
+:not(a.reference) > tt {
+    background-color: #f2f2f2;
+    border-bottom: 1px solid #ddd;
+    color: #333;
+}
+
+tt.descname, tt.descclassname, tt.xref {
+    border: 0;
+}
+
+hr {
+    border: 1px solid #abc;
+    margin: 2em;
+}
+
+p a tt {
+    border: 0;
+    color: #CA7900;
+}
+
+p a tt:hover {
+    color: #2491CF;
+}
+
+a tt {
+    border: none;
+}
+
+pre {
+    font-family: 'Consolas', 'Deja Vu Sans Mono',
+                 'Bitstream Vera Sans Mono', monospace;
+    font-size: 0.95em;
+    line-height: 120%;
+    padding: 0.5em;
+    border: 1px solid #ccc;
+    background-color: #f8f8f8;
+}
+
+pre a {
+    color: inherit;
+    text-decoration: underline;
+}
+
+td.linenos pre {
+    padding: 0.5em 0;
+}
+
+div.quotebar {
+    background-color: #f8f8f8;
+    max-width: 250px;
+    float: right;
+    padding: 2px 7px;
+    border: 1px solid #ccc;
+}
+
+div.topic {
+    background-color: #f8f8f8;
+}
+
+table {
+    border-collapse: collapse;
+    margin: 0 -0.5em 0 -0.5em;
+}
+
+table td, table th {
+    padding: 0.2em 0.5em 0.2em 0.5em;
+}
+
+div.admonition, div.warning {
+    font-size: 0.9em;
+    margin: 1em 0 1em 0;
+    border: 1px solid #86989B;
+    background-color: #f7f7f7;
+    padding: 0;
+}
+
+div.admonition p, div.warning p {
+    margin: 0.5em 1em 0.5em 1em;
+    padding: 0;
+}
+
+div.admonition pre, div.warning pre {
+    margin: 0.4em 1em 0.4em 1em;
+}
+
+div.admonition p.admonition-title,
+div.warning p.admonition-title {
+    margin: 0;
+    padding: 0.1em 0 0.1em 0.5em;
+    color: white;
+    border-bottom: 1px solid #86989B;
+    font-weight: bold;
+    background-color: #AFC1C4;
+}
+
+div.warning {
+    border: 1px solid #940000;
+}
+
+div.warning p.admonition-title {
+    background-color: #CF0000;
+    border-bottom-color: #940000;
+}
+
+div.admonition ul, div.admonition ol,
+div.warning ul, div.warning ol {
+    margin: 0.1em 0.5em 0.5em 3em;
+    padding: 0;
+}
+
+div.versioninfo {
+    margin: 1em 0 0 0;
+    border: 1px solid #ccc;
+    background-color: #DDEAF0;
+    padding: 8px;
+    line-height: 1.3em;
+    font-size: 0.9em;
+}
+
+.viewcode-back {
+    font-family: 'Lucida Grande', 'Lucida Sans Unicode', 'Geneva',
+                 'Verdana', sans-serif;
+}
+
+div.viewcode-block:target {
+    background-color: #f4debf;
+    border-top: 1px solid #ac9;
+    border-bottom: 1px solid #ac9;
+}

Added: www-releases/trunk/3.6.0/docs/_static/llvm.css
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/llvm.css?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_static/llvm.css (added)
+++ www-releases/trunk/3.6.0/docs/_static/llvm.css Fri Feb 27 12:44:09 2015
@@ -0,0 +1,112 @@
+/*
+ * LLVM documentation style sheet
+ */
+
+/* Common styles */
+.body { color: black; background: white; margin: 0 0 0 0 }
+
+/* No borders on image links */
+a:link img, a:visited img { border-style: none }
+
+address img { float: right; width: 88px; height: 31px; }
+address     { clear: right; }
+
+table       { text-align: center; border: 2px solid black;
+              border-collapse: collapse; margin-top: 1em; margin-left: 1em;
+              margin-right: 1em; margin-bottom: 1em; }
+tr, td      { border: 2px solid gray; padding: 4pt 4pt 2pt 2pt; }
+th          { border: 2px solid gray; font-weight: bold; font-size: 105%;
+              background: url("lines.gif");
+              font-family: "Georgia,Palatino,Times,Roman,SanSerif";
+              text-align: center; vertical-align: middle; }
+/*
+ * Documentation
+ */
+/* Common for title and header */
+.doc_title, .doc_section, .doc_subsection, h1, h2, h3 {
+  color: black; background: url("lines.gif");
+  font-family: "Georgia,Palatino,Times,Roman,SanSerif"; font-weight: bold;
+  border-width: 1px;
+  border-style: solid none solid none;
+  text-align: center;
+  vertical-align: middle;
+  padding-left: 8pt;
+  padding-top: 1px;
+  padding-bottom: 2px
+}
+
+h1, .doc_title, .title { text-align: left;   font-size: 25pt }
+
+h2, .doc_section   { text-align: center; font-size: 22pt;
+                     margin: 20pt 0pt 5pt 0pt; }
+
+h3, .doc_subsection { width: 75%;
+                      text-align: left;  font-size: 12pt;
+                      padding: 4pt 4pt 4pt 4pt;
+                      margin: 1.5em 0.5em 0.5em 0.5em }
+
+h4, .doc_subsubsection { margin: 2.0em 0.5em 0.5em 0.5em;
+                         font-weight: bold; font-style: oblique;
+                         border-bottom: 1px solid #999999; font-size: 12pt;
+                         width: 75%; }
+
+.doc_author     { text-align: left; font-weight: bold; padding-left: 20pt }
+.doc_text       { text-align: left; padding-left: 20pt; padding-right: 10pt }
+
+.doc_footer     { text-align: left; padding: 0 0 0 0 }
+
+.doc_hilite     { color: blue; font-weight: bold; }
+
+.doc_table      { text-align: center; width: 90%;
+                  padding: 1px 1px 1px 1px; border: 1px; }
+
+.doc_warning    { color: red; font-weight: bold }
+
+/* <div class="doc_code"> would use this class, and <div> adds more padding */
+.doc_code, .literal-block
+                { border: solid 1px gray; background: #eeeeee;
+                  margin: 0 1em 0 1em;
+                  padding: 0 1em 0 1em;
+                  display: table;
+                }
+
+blockquote pre {
+        padding: 1em 2em 1em 1em;
+        border: solid 1px gray;
+        background: #eeeeee;
+        margin: 0 1em 0 1em;
+        display: table;
+}
+
+h2+div, h2+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
+h3+div, h3+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
+h4+div, h4+p {text-align: left; padding-left: 20pt; padding-right: 10pt;}
+
+/* It is preferrable to use <pre class="doc_code"> everywhere instead of the
+ * <div class="doc_code"><pre>...</ptr></div> construct.
+ *
+ * Once all docs use <pre> for code regions, this style can  be merged with the
+ * one above, and we can drop the [pre] qualifier.
+ */
+pre.doc_code, .literal-block { padding: 1em 2em 1em 1em }
+
+.doc_notes      { background: #fafafa; border: 1px solid #cecece;
+                  display: table; padding: 0 1em 0 .1em }
+
+table.layout    { text-align: left; border: none; border-collapse: collapse;
+                  padding: 4px 4px 4px 4px; }
+tr.layout, td.layout, td.left, td.right
+                { border: none; padding: 4pt 4pt 2pt 2pt; vertical-align: top; }
+td.left         { text-align: left }
+td.right        { text-align: right }
+th.layout       { border: none; font-weight: bold; font-size: 105%;
+                  text-align: center; vertical-align: middle; }
+
+/* Left align table cell */
+.td_left        { border: 2px solid gray; text-align: left; }
+
+/* ReST-specific */
+.title { margin-top: 0 }
+.topic-title{ display: none }
+div.contents ul { list-style-type: decimal }
+.toc-backref    { color: black; text-decoration: none; }

Added: www-releases/trunk/3.6.0/docs/_static/logo.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/logo.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/logo.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/minus.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/minus.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/minus.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/navigation.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/navigation.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/navigation.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/plus.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/plus.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/plus.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/pygments.css
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/pygments.css?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_static/pygments.css (added)
+++ www-releases/trunk/3.6.0/docs/_static/pygments.css Fri Feb 27 12:44:09 2015
@@ -0,0 +1,62 @@
+.highlight .hll { background-color: #ffffcc }
+.highlight  { background: #f0f0f0; }
+.highlight .c { color: #60a0b0; font-style: italic } /* Comment */
+.highlight .err { border: 1px solid #FF0000 } /* Error */
+.highlight .k { color: #007020; font-weight: bold } /* Keyword */
+.highlight .o { color: #666666 } /* Operator */
+.highlight .cm { color: #60a0b0; font-style: italic } /* Comment.Multiline */
+.highlight .cp { color: #007020 } /* Comment.Preproc */
+.highlight .c1 { color: #60a0b0; font-style: italic } /* Comment.Single */
+.highlight .cs { color: #60a0b0; background-color: #fff0f0 } /* Comment.Special */
+.highlight .gd { color: #A00000 } /* Generic.Deleted */
+.highlight .ge { font-style: italic } /* Generic.Emph */
+.highlight .gr { color: #FF0000 } /* Generic.Error */
+.highlight .gh { color: #000080; font-weight: bold } /* Generic.Heading */
+.highlight .gi { color: #00A000 } /* Generic.Inserted */
+.highlight .go { color: #888888 } /* Generic.Output */
+.highlight .gp { color: #c65d09; font-weight: bold } /* Generic.Prompt */
+.highlight .gs { font-weight: bold } /* Generic.Strong */
+.highlight .gu { color: #800080; font-weight: bold } /* Generic.Subheading */
+.highlight .gt { color: #0044DD } /* Generic.Traceback */
+.highlight .kc { color: #007020; font-weight: bold } /* Keyword.Constant */
+.highlight .kd { color: #007020; font-weight: bold } /* Keyword.Declaration */
+.highlight .kn { color: #007020; font-weight: bold } /* Keyword.Namespace */
+.highlight .kp { color: #007020 } /* Keyword.Pseudo */
+.highlight .kr { color: #007020; font-weight: bold } /* Keyword.Reserved */
+.highlight .kt { color: #902000 } /* Keyword.Type */
+.highlight .m { color: #40a070 } /* Literal.Number */
+.highlight .s { color: #4070a0 } /* Literal.String */
+.highlight .na { color: #4070a0 } /* Name.Attribute */
+.highlight .nb { color: #007020 } /* Name.Builtin */
+.highlight .nc { color: #0e84b5; font-weight: bold } /* Name.Class */
+.highlight .no { color: #60add5 } /* Name.Constant */
+.highlight .nd { color: #555555; font-weight: bold } /* Name.Decorator */
+.highlight .ni { color: #d55537; font-weight: bold } /* Name.Entity */
+.highlight .ne { color: #007020 } /* Name.Exception */
+.highlight .nf { color: #06287e } /* Name.Function */
+.highlight .nl { color: #002070; font-weight: bold } /* Name.Label */
+.highlight .nn { color: #0e84b5; font-weight: bold } /* Name.Namespace */
+.highlight .nt { color: #062873; font-weight: bold } /* Name.Tag */
+.highlight .nv { color: #bb60d5 } /* Name.Variable */
+.highlight .ow { color: #007020; font-weight: bold } /* Operator.Word */
+.highlight .w { color: #bbbbbb } /* Text.Whitespace */
+.highlight .mf { color: #40a070 } /* Literal.Number.Float */
+.highlight .mh { color: #40a070 } /* Literal.Number.Hex */
+.highlight .mi { color: #40a070 } /* Literal.Number.Integer */
+.highlight .mo { color: #40a070 } /* Literal.Number.Oct */
+.highlight .sb { color: #4070a0 } /* Literal.String.Backtick */
+.highlight .sc { color: #4070a0 } /* Literal.String.Char */
+.highlight .sd { color: #4070a0; font-style: italic } /* Literal.String.Doc */
+.highlight .s2 { color: #4070a0 } /* Literal.String.Double */
+.highlight .se { color: #4070a0; font-weight: bold } /* Literal.String.Escape */
+.highlight .sh { color: #4070a0 } /* Literal.String.Heredoc */
+.highlight .si { color: #70a0d0; font-style: italic } /* Literal.String.Interpol */
+.highlight .sx { color: #c65d09 } /* Literal.String.Other */
+.highlight .sr { color: #235388 } /* Literal.String.Regex */
+.highlight .s1 { color: #4070a0 } /* Literal.String.Single */
+.highlight .ss { color: #517918 } /* Literal.String.Symbol */
+.highlight .bp { color: #007020 } /* Name.Builtin.Pseudo */
+.highlight .vc { color: #bb60d5 } /* Name.Variable.Class */
+.highlight .vg { color: #bb60d5 } /* Name.Variable.Global */
+.highlight .vi { color: #bb60d5 } /* Name.Variable.Instance */
+.highlight .il { color: #40a070 } /* Literal.Number.Integer.Long */
\ No newline at end of file

Added: www-releases/trunk/3.6.0/docs/_static/searchtools.js
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/searchtools.js?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_static/searchtools.js (added)
+++ www-releases/trunk/3.6.0/docs/_static/searchtools.js Fri Feb 27 12:44:09 2015
@@ -0,0 +1,622 @@
+/*
+ * searchtools.js_t
+ * ~~~~~~~~~~~~~~~~
+ *
+ * Sphinx JavaScript utilties for the full-text search.
+ *
+ * :copyright: Copyright 2007-2014 by the Sphinx team, see AUTHORS.
+ * :license: BSD, see LICENSE for details.
+ *
+ */
+
+
+/**
+ * Porter Stemmer
+ */
+var Stemmer = function() {
+
+  var step2list = {
+    ational: 'ate',
+    tional: 'tion',
+    enci: 'ence',
+    anci: 'ance',
+    izer: 'ize',
+    bli: 'ble',
+    alli: 'al',
+    entli: 'ent',
+    eli: 'e',
+    ousli: 'ous',
+    ization: 'ize',
+    ation: 'ate',
+    ator: 'ate',
+    alism: 'al',
+    iveness: 'ive',
+    fulness: 'ful',
+    ousness: 'ous',
+    aliti: 'al',
+    iviti: 'ive',
+    biliti: 'ble',
+    logi: 'log'
+  };
+
+  var step3list = {
+    icate: 'ic',
+    ative: '',
+    alize: 'al',
+    iciti: 'ic',
+    ical: 'ic',
+    ful: '',
+    ness: ''
+  };
+
+  var c = "[^aeiou]";          // consonant
+  var v = "[aeiouy]";          // vowel
+  var C = c + "[^aeiouy]*";    // consonant sequence
+  var V = v + "[aeiou]*";      // vowel sequence
+
+  var mgr0 = "^(" + C + ")?" + V + C;                      // [C]VC... is m>0
+  var meq1 = "^(" + C + ")?" + V + C + "(" + V + ")?$";    // [C]VC[V] is m=1
+  var mgr1 = "^(" + C + ")?" + V + C + V + C;              // [C]VCVC... is m>1
+  var s_v   = "^(" + C + ")?" + v;                         // vowel in stem
+
+  this.stemWord = function (w) {
+    var stem;
+    var suffix;
+    var firstch;
+    var origword = w;
+
+    if (w.length < 3)
+      return w;
+
+    var re;
+    var re2;
+    var re3;
+    var re4;
+
+    firstch = w.substr(0,1);
+    if (firstch == "y")
+      w = firstch.toUpperCase() + w.substr(1);
+
+    // Step 1a
+    re = /^(.+?)(ss|i)es$/;
+    re2 = /^(.+?)([^s])s$/;
+
+    if (re.test(w))
+      w = w.replace(re,"$1$2");
+    else if (re2.test(w))
+      w = w.replace(re2,"$1$2");
+
+    // Step 1b
+    re = /^(.+?)eed$/;
+    re2 = /^(.+?)(ed|ing)$/;
+    if (re.test(w)) {
+      var fp = re.exec(w);
+      re = new RegExp(mgr0);
+      if (re.test(fp[1])) {
+        re = /.$/;
+        w = w.replace(re,"");
+      }
+    }
+    else if (re2.test(w)) {
+      var fp = re2.exec(w);
+      stem = fp[1];
+      re2 = new RegExp(s_v);
+      if (re2.test(stem)) {
+        w = stem;
+        re2 = /(at|bl|iz)$/;
+        re3 = new RegExp("([^aeiouylsz])\\1$");
+        re4 = new RegExp("^" + C + v + "[^aeiouwxy]$");
+        if (re2.test(w))
+          w = w + "e";
+        else if (re3.test(w)) {
+          re = /.$/;
+          w = w.replace(re,"");
+        }
+        else if (re4.test(w))
+          w = w + "e";
+      }
+    }
+
+    // Step 1c
+    re = /^(.+?)y$/;
+    if (re.test(w)) {
+      var fp = re.exec(w);
+      stem = fp[1];
+      re = new RegExp(s_v);
+      if (re.test(stem))
+        w = stem + "i";
+    }
+
+    // Step 2
+    re = /^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/;
+    if (re.test(w)) {
+      var fp = re.exec(w);
+      stem = fp[1];
+      suffix = fp[2];
+      re = new RegExp(mgr0);
+      if (re.test(stem))
+        w = stem + step2list[suffix];
+    }
+
+    // Step 3
+    re = /^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/;
+    if (re.test(w)) {
+      var fp = re.exec(w);
+      stem = fp[1];
+      suffix = fp[2];
+      re = new RegExp(mgr0);
+      if (re.test(stem))
+        w = stem + step3list[suffix];
+    }
+
+    // Step 4
+    re = /^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/;
+    re2 = /^(.+?)(s|t)(ion)$/;
+    if (re.test(w)) {
+      var fp = re.exec(w);
+      stem = fp[1];
+      re = new RegExp(mgr1);
+      if (re.test(stem))
+        w = stem;
+    }
+    else if (re2.test(w)) {
+      var fp = re2.exec(w);
+      stem = fp[1] + fp[2];
+      re2 = new RegExp(mgr1);
+      if (re2.test(stem))
+        w = stem;
+    }
+
+    // Step 5
+    re = /^(.+?)e$/;
+    if (re.test(w)) {
+      var fp = re.exec(w);
+      stem = fp[1];
+      re = new RegExp(mgr1);
+      re2 = new RegExp(meq1);
+      re3 = new RegExp("^" + C + v + "[^aeiouwxy]$");
+      if (re.test(stem) || (re2.test(stem) && !(re3.test(stem))))
+        w = stem;
+    }
+    re = /ll$/;
+    re2 = new RegExp(mgr1);
+    if (re.test(w) && re2.test(w)) {
+      re = /.$/;
+      w = w.replace(re,"");
+    }
+
+    // and turn initial Y back to y
+    if (firstch == "y")
+      w = firstch.toLowerCase() + w.substr(1);
+    return w;
+  }
+}
+
+
+
+/**
+ * Simple result scoring code.
+ */
+var Scorer = {
+  // Implement the following function to further tweak the score for each result
+  // The function takes a result array [filename, title, anchor, descr, score]
+  // and returns the new score.
+  /*
+  score: function(result) {
+    return result[4];
+  },
+  */
+
+  // query matches the full name of an object
+  objNameMatch: 11,
+  // or matches in the last dotted part of the object name
+  objPartialMatch: 6,
+  // Additive scores depending on the priority of the object
+  objPrio: {0:  15,   // used to be importantResults
+            1:  5,   // used to be objectResults
+            2: -5},  // used to be unimportantResults
+  //  Used when the priority is not in the mapping.
+  objPrioDefault: 0,
+
+  // query found in title
+  title: 15,
+  // query found in terms
+  term: 5
+};
+
+
+/**
+ * Search Module
+ */
+var Search = {
+
+  _index : null,
+  _queued_query : null,
+  _pulse_status : -1,
+
+  init : function() {
+      var params = $.getQueryParameters();
+      if (params.q) {
+          var query = params.q[0];
+          $('input[name="q"]')[0].value = query;
+          this.performSearch(query);
+      }
+  },
+
+  loadIndex : function(url) {
+    $.ajax({type: "GET", url: url, data: null,
+            dataType: "script", cache: true,
+            complete: function(jqxhr, textstatus) {
+              if (textstatus != "success") {
+                document.getElementById("searchindexloader").src = url;
+              }
+            }});
+  },
+
+  setIndex : function(index) {
+    var q;
+    this._index = index;
+    if ((q = this._queued_query) !== null) {
+      this._queued_query = null;
+      Search.query(q);
+    }
+  },
+
+  hasIndex : function() {
+      return this._index !== null;
+  },
+
+  deferQuery : function(query) {
+      this._queued_query = query;
+  },
+
+  stopPulse : function() {
+      this._pulse_status = 0;
+  },
+
+  startPulse : function() {
+    if (this._pulse_status >= 0)
+        return;
+    function pulse() {
+      var i;
+      Search._pulse_status = (Search._pulse_status + 1) % 4;
+      var dotString = '';
+      for (i = 0; i < Search._pulse_status; i++)
+        dotString += '.';
+      Search.dots.text(dotString);
+      if (Search._pulse_status > -1)
+        window.setTimeout(pulse, 500);
+    }
+    pulse();
+  },
+
+  /**
+   * perform a search for something (or wait until index is loaded)
+   */
+  performSearch : function(query) {
+    // create the required interface elements
+    this.out = $('#search-results');
+    this.title = $('<h2>' + _('Searching') + '</h2>').appendTo(this.out);
+    this.dots = $('<span></span>').appendTo(this.title);
+    this.status = $('<p style="display: none"></p>').appendTo(this.out);
+    this.output = $('<ul class="search"/>').appendTo(this.out);
+
+    $('#search-progress').text(_('Preparing search...'));
+    this.startPulse();
+
+    // index already loaded, the browser was quick!
+    if (this.hasIndex())
+      this.query(query);
+    else
+      this.deferQuery(query);
+  },
+
+  /**
+   * execute search (requires search index to be loaded)
+   */
+  query : function(query) {
+    var i;
+    var stopwords = ["a","and","are","as","at","be","but","by","for","if","in","into","is","it","near","no","not","of","on","or","such","that","the","their","then","there","these","they","this","to","was","will","with"];
+
+    // stem the searchterms and add them to the correct list
+    var stemmer = new Stemmer();
+    var searchterms = [];
+    var excluded = [];
+    var hlterms = [];
+    var tmp = query.split(/\s+/);
+    var objectterms = [];
+    for (i = 0; i < tmp.length; i++) {
+      if (tmp[i] !== "") {
+          objectterms.push(tmp[i].toLowerCase());
+      }
+
+      if ($u.indexOf(stopwords, tmp[i].toLowerCase()) != -1 || tmp[i].match(/^\d+$/) ||
+          tmp[i] === "") {
+        // skip this "word"
+        continue;
+      }
+      // stem the word
+      var word = stemmer.stemWord(tmp[i].toLowerCase());
+      var toAppend;
+      // select the correct list
+      if (word[0] == '-') {
+        toAppend = excluded;
+        word = word.substr(1);
+      }
+      else {
+        toAppend = searchterms;
+        hlterms.push(tmp[i].toLowerCase());
+      }
+      // only add if not already in the list
+      if (!$u.contains(toAppend, word))
+        toAppend.push(word);
+    }
+    var highlightstring = '?highlight=' + $.urlencode(hlterms.join(" "));
+
+    // console.debug('SEARCH: searching for:');
+    // console.info('required: ', searchterms);
+    // console.info('excluded: ', excluded);
+
+    // prepare search
+    var terms = this._index.terms;
+    var titleterms = this._index.titleterms;
+
+    // array of [filename, title, anchor, descr, score]
+    var results = [];
+    $('#search-progress').empty();
+
+    // lookup as object
+    for (i = 0; i < objectterms.length; i++) {
+      var others = [].concat(objectterms.slice(0, i),
+                             objectterms.slice(i+1, objectterms.length));
+      results = results.concat(this.performObjectSearch(objectterms[i], others));
+    }
+
+    // lookup as search terms in fulltext
+    results = results.concat(this.performTermsSearch(searchterms, excluded, terms, Scorer.term))
+                     .concat(this.performTermsSearch(searchterms, excluded, titleterms, Scorer.title));
+
+    // let the scorer override scores with a custom scoring function
+    if (Scorer.score) {
+      for (i = 0; i < results.length; i++)
+        results[i][4] = Scorer.score(results[i]);
+    }
+
+    // now sort the results by score (in opposite order of appearance, since the
+    // display function below uses pop() to retrieve items) and then
+    // alphabetically
+    results.sort(function(a, b) {
+      var left = a[4];
+      var right = b[4];
+      if (left > right) {
+        return 1;
+      } else if (left < right) {
+        return -1;
+      } else {
+        // same score: sort alphabetically
+        left = a[1].toLowerCase();
+        right = b[1].toLowerCase();
+        return (left > right) ? -1 : ((left < right) ? 1 : 0);
+      }
+    });
+
+    // for debugging
+    //Search.lastresults = results.slice();  // a copy
+    //console.info('search results:', Search.lastresults);
+
+    // print the results
+    var resultCount = results.length;
+    function displayNextItem() {
+      // results left, load the summary and display it
+      if (results.length) {
+        var item = results.pop();
+        var listItem = $('<li style="display:none"></li>');
+        if (DOCUMENTATION_OPTIONS.FILE_SUFFIX === '') {
+          // dirhtml builder
+          var dirname = item[0] + '/';
+          if (dirname.match(/\/index\/$/)) {
+            dirname = dirname.substring(0, dirname.length-6);
+          } else if (dirname == 'index/') {
+            dirname = '';
+          }
+          listItem.append($('<a/>').attr('href',
+            DOCUMENTATION_OPTIONS.URL_ROOT + dirname +
+            highlightstring + item[2]).html(item[1]));
+        } else {
+          // normal html builders
+          listItem.append($('<a/>').attr('href',
+            item[0] + DOCUMENTATION_OPTIONS.FILE_SUFFIX +
+            highlightstring + item[2]).html(item[1]));
+        }
+        if (item[3]) {
+          listItem.append($('<span> (' + item[3] + ')</span>'));
+          Search.output.append(listItem);
+          listItem.slideDown(5, function() {
+            displayNextItem();
+          });
+        } else if (DOCUMENTATION_OPTIONS.HAS_SOURCE) {
+          $.ajax({url: DOCUMENTATION_OPTIONS.URL_ROOT + '_sources/' + item[0] + '.txt',
+                  dataType: "text",
+                  complete: function(jqxhr, textstatus) {
+                    var data = jqxhr.responseText;
+                    if (data !== '') {
+                      listItem.append(Search.makeSearchSummary(data, searchterms, hlterms));
+                    }
+                    Search.output.append(listItem);
+                    listItem.slideDown(5, function() {
+                      displayNextItem();
+                    });
+                  }});
+        } else {
+          // no source available, just display title
+          Search.output.append(listItem);
+          listItem.slideDown(5, function() {
+            displayNextItem();
+          });
+        }
+      }
+      // search finished, update title and status message
+      else {
+        Search.stopPulse();
+        Search.title.text(_('Search Results'));
+        if (!resultCount)
+          Search.status.text(_('Your search did not match any documents. Please make sure that all words are spelled correctly and that you\'ve selected enough categories.'));
+        else
+            Search.status.text(_('Search finished, found %s page(s) matching the search query.').replace('%s', resultCount));
+        Search.status.fadeIn(500);
+      }
+    }
+    displayNextItem();
+  },
+
+  /**
+   * search for object names
+   */
+  performObjectSearch : function(object, otherterms) {
+    var filenames = this._index.filenames;
+    var objects = this._index.objects;
+    var objnames = this._index.objnames;
+    var titles = this._index.titles;
+
+    var i;
+    var results = [];
+
+    for (var prefix in objects) {
+      for (var name in objects[prefix]) {
+        var fullname = (prefix ? prefix + '.' : '') + name;
+        if (fullname.toLowerCase().indexOf(object) > -1) {
+          var score = 0;
+          var parts = fullname.split('.');
+          // check for different match types: exact matches of full name or
+          // "last name" (i.e. last dotted part)
+          if (fullname == object || parts[parts.length - 1] == object) {
+            score += Scorer.objNameMatch;
+          // matches in last name
+          } else if (parts[parts.length - 1].indexOf(object) > -1) {
+            score += Scorer.objPartialMatch;
+          }
+          var match = objects[prefix][name];
+          var objname = objnames[match[1]][2];
+          var title = titles[match[0]];
+          // If more than one term searched for, we require other words to be
+          // found in the name/title/description
+          if (otherterms.length > 0) {
+            var haystack = (prefix + ' ' + name + ' ' +
+                            objname + ' ' + title).toLowerCase();
+            var allfound = true;
+            for (i = 0; i < otherterms.length; i++) {
+              if (haystack.indexOf(otherterms[i]) == -1) {
+                allfound = false;
+                break;
+              }
+            }
+            if (!allfound) {
+              continue;
+            }
+          }
+          var descr = objname + _(', in ') + title;
+
+          var anchor = match[3];
+          if (anchor === '')
+            anchor = fullname;
+          else if (anchor == '-')
+            anchor = objnames[match[1]][1] + '-' + fullname;
+          // add custom score for some objects according to scorer
+          if (Scorer.objPrio.hasOwnProperty(match[2])) {
+            score += Scorer.objPrio[match[2]];
+          } else {
+            score += Scorer.objPrioDefault;
+          }
+          results.push([filenames[match[0]], fullname, '#'+anchor, descr, score]);
+        }
+      }
+    }
+
+    return results;
+  },
+
+  /**
+   * search for full-text terms in the index
+   */
+  performTermsSearch : function(searchterms, excluded, terms, score) {
+    var filenames = this._index.filenames;
+    var titles = this._index.titles;
+
+    var i, j, file, files;
+    var fileMap = {};
+    var results = [];
+
+    // perform the search on the required terms
+    for (i = 0; i < searchterms.length; i++) {
+      var word = searchterms[i];
+      // no match but word was a required one
+      if ((files = terms[word]) === undefined)
+        break;
+      if (files.length === undefined) {
+        files = [files];
+      }
+      // create the mapping
+      for (j = 0; j < files.length; j++) {
+        file = files[j];
+        if (file in fileMap)
+          fileMap[file].push(word);
+        else
+          fileMap[file] = [word];
+      }
+    }
+
+    // now check if the files don't contain excluded terms
+    for (file in fileMap) {
+      var valid = true;
+
+      // check if all requirements are matched
+      if (fileMap[file].length != searchterms.length)
+          continue;
+
+      // ensure that none of the excluded terms is in the search result
+      for (i = 0; i < excluded.length; i++) {
+        if (terms[excluded[i]] == file ||
+          $u.contains(terms[excluded[i]] || [], file)) {
+          valid = false;
+          break;
+        }
+      }
+
+      // if we have still a valid result we can add it to the result list
+      if (valid) {
+        results.push([filenames[file], titles[file], '', null, score]);
+      }
+    }
+    return results;
+  },
+
+  /**
+   * helper function to return a node containing the
+   * search summary for a given text. keywords is a list
+   * of stemmed words, hlwords is the list of normal, unstemmed
+   * words. the first one is used to find the occurance, the
+   * latter for highlighting it.
+   */
+  makeSearchSummary : function(text, keywords, hlwords) {
+    var textLower = text.toLowerCase();
+    var start = 0;
+    $.each(keywords, function() {
+      var i = textLower.indexOf(this.toLowerCase());
+      if (i > -1)
+        start = i;
+    });
+    start = Math.max(start - 120, 0);
+    var excerpt = ((start > 0) ? '...' : '') +
+      $.trim(text.substr(start, 240)) +
+      ((start + 240 - text.length) ? '...' : '');
+    var rv = $('<div class="context"></div>').text(excerpt);
+    $.each(hlwords, function() {
+      rv = rv.highlightText(this, 'highlighted');
+    });
+    return rv;
+  }
+};
+
+$(document).ready(function() {
+  Search.init();
+});
\ No newline at end of file

Added: www-releases/trunk/3.6.0/docs/_static/underscore.js
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/underscore.js?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_static/underscore.js (added)
+++ www-releases/trunk/3.6.0/docs/_static/underscore.js Fri Feb 27 12:44:09 2015
@@ -0,0 +1,1226 @@
+//     Underscore.js 1.4.4
+//     http://underscorejs.org
+//     (c) 2009-2013 Jeremy Ashkenas, DocumentCloud Inc.
+//     Underscore may be freely distributed under the MIT license.
+
+(function() {
+
+  // Baseline setup
+  // --------------
+
+  // Establish the root object, `window` in the browser, or `global` on the server.
+  var root = this;
+
+  // Save the previous value of the `_` variable.
+  var previousUnderscore = root._;
+
+  // Establish the object that gets returned to break out of a loop iteration.
+  var breaker = {};
+
+  // Save bytes in the minified (but not gzipped) version:
+  var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype;
+
+  // Create quick reference variables for speed access to core prototypes.
+  var push             = ArrayProto.push,
+      slice            = ArrayProto.slice,
+      concat           = ArrayProto.concat,
+      toString         = ObjProto.toString,
+      hasOwnProperty   = ObjProto.hasOwnProperty;
+
+  // All **ECMAScript 5** native function implementations that we hope to use
+  // are declared here.
+  var
+    nativeForEach      = ArrayProto.forEach,
+    nativeMap          = ArrayProto.map,
+    nativeReduce       = ArrayProto.reduce,
+    nativeReduceRight  = ArrayProto.reduceRight,
+    nativeFilter       = ArrayProto.filter,
+    nativeEvery        = ArrayProto.every,
+    nativeSome         = ArrayProto.some,
+    nativeIndexOf      = ArrayProto.indexOf,
+    nativeLastIndexOf  = ArrayProto.lastIndexOf,
+    nativeIsArray      = Array.isArray,
+    nativeKeys         = Object.keys,
+    nativeBind         = FuncProto.bind;
+
+  // Create a safe reference to the Underscore object for use below.
+  var _ = function(obj) {
+    if (obj instanceof _) return obj;
+    if (!(this instanceof _)) return new _(obj);
+    this._wrapped = obj;
+  };
+
+  // Export the Underscore object for **Node.js**, with
+  // backwards-compatibility for the old `require()` API. If we're in
+  // the browser, add `_` as a global object via a string identifier,
+  // for Closure Compiler "advanced" mode.
+  if (typeof exports !== 'undefined') {
+    if (typeof module !== 'undefined' && module.exports) {
+      exports = module.exports = _;
+    }
+    exports._ = _;
+  } else {
+    root._ = _;
+  }
+
+  // Current version.
+  _.VERSION = '1.4.4';
+
+  // Collection Functions
+  // --------------------
+
+  // The cornerstone, an `each` implementation, aka `forEach`.
+  // Handles objects with the built-in `forEach`, arrays, and raw objects.
+  // Delegates to **ECMAScript 5**'s native `forEach` if available.
+  var each = _.each = _.forEach = function(obj, iterator, context) {
+    if (obj == null) return;
+    if (nativeForEach && obj.forEach === nativeForEach) {
+      obj.forEach(iterator, context);
+    } else if (obj.length === +obj.length) {
+      for (var i = 0, l = obj.length; i < l; i++) {
+        if (iterator.call(context, obj[i], i, obj) === breaker) return;
+      }
+    } else {
+      for (var key in obj) {
+        if (_.has(obj, key)) {
+          if (iterator.call(context, obj[key], key, obj) === breaker) return;
+        }
+      }
+    }
+  };
+
+  // Return the results of applying the iterator to each element.
+  // Delegates to **ECMAScript 5**'s native `map` if available.
+  _.map = _.collect = function(obj, iterator, context) {
+    var results = [];
+    if (obj == null) return results;
+    if (nativeMap && obj.map === nativeMap) return obj.map(iterator, context);
+    each(obj, function(value, index, list) {
+      results[results.length] = iterator.call(context, value, index, list);
+    });
+    return results;
+  };
+
+  var reduceError = 'Reduce of empty array with no initial value';
+
+  // **Reduce** builds up a single result from a list of values, aka `inject`,
+  // or `foldl`. Delegates to **ECMAScript 5**'s native `reduce` if available.
+  _.reduce = _.foldl = _.inject = function(obj, iterator, memo, context) {
+    var initial = arguments.length > 2;
+    if (obj == null) obj = [];
+    if (nativeReduce && obj.reduce === nativeReduce) {
+      if (context) iterator = _.bind(iterator, context);
+      return initial ? obj.reduce(iterator, memo) : obj.reduce(iterator);
+    }
+    each(obj, function(value, index, list) {
+      if (!initial) {
+        memo = value;
+        initial = true;
+      } else {
+        memo = iterator.call(context, memo, value, index, list);
+      }
+    });
+    if (!initial) throw new TypeError(reduceError);
+    return memo;
+  };
+
+  // The right-associative version of reduce, also known as `foldr`.
+  // Delegates to **ECMAScript 5**'s native `reduceRight` if available.
+  _.reduceRight = _.foldr = function(obj, iterator, memo, context) {
+    var initial = arguments.length > 2;
+    if (obj == null) obj = [];
+    if (nativeReduceRight && obj.reduceRight === nativeReduceRight) {
+      if (context) iterator = _.bind(iterator, context);
+      return initial ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator);
+    }
+    var length = obj.length;
+    if (length !== +length) {
+      var keys = _.keys(obj);
+      length = keys.length;
+    }
+    each(obj, function(value, index, list) {
+      index = keys ? keys[--length] : --length;
+      if (!initial) {
+        memo = obj[index];
+        initial = true;
+      } else {
+        memo = iterator.call(context, memo, obj[index], index, list);
+      }
+    });
+    if (!initial) throw new TypeError(reduceError);
+    return memo;
+  };
+
+  // Return the first value which passes a truth test. Aliased as `detect`.
+  _.find = _.detect = function(obj, iterator, context) {
+    var result;
+    any(obj, function(value, index, list) {
+      if (iterator.call(context, value, index, list)) {
+        result = value;
+        return true;
+      }
+    });
+    return result;
+  };
+
+  // Return all the elements that pass a truth test.
+  // Delegates to **ECMAScript 5**'s native `filter` if available.
+  // Aliased as `select`.
+  _.filter = _.select = function(obj, iterator, context) {
+    var results = [];
+    if (obj == null) return results;
+    if (nativeFilter && obj.filter === nativeFilter) return obj.filter(iterator, context);
+    each(obj, function(value, index, list) {
+      if (iterator.call(context, value, index, list)) results[results.length] = value;
+    });
+    return results;
+  };
+
+  // Return all the elements for which a truth test fails.
+  _.reject = function(obj, iterator, context) {
+    return _.filter(obj, function(value, index, list) {
+      return !iterator.call(context, value, index, list);
+    }, context);
+  };
+
+  // Determine whether all of the elements match a truth test.
+  // Delegates to **ECMAScript 5**'s native `every` if available.
+  // Aliased as `all`.
+  _.every = _.all = function(obj, iterator, context) {
+    iterator || (iterator = _.identity);
+    var result = true;
+    if (obj == null) return result;
+    if (nativeEvery && obj.every === nativeEvery) return obj.every(iterator, context);
+    each(obj, function(value, index, list) {
+      if (!(result = result && iterator.call(context, value, index, list))) return breaker;
+    });
+    return !!result;
+  };
+
+  // Determine if at least one element in the object matches a truth test.
+  // Delegates to **ECMAScript 5**'s native `some` if available.
+  // Aliased as `any`.
+  var any = _.some = _.any = function(obj, iterator, context) {
+    iterator || (iterator = _.identity);
+    var result = false;
+    if (obj == null) return result;
+    if (nativeSome && obj.some === nativeSome) return obj.some(iterator, context);
+    each(obj, function(value, index, list) {
+      if (result || (result = iterator.call(context, value, index, list))) return breaker;
+    });
+    return !!result;
+  };
+
+  // Determine if the array or object contains a given value (using `===`).
+  // Aliased as `include`.
+  _.contains = _.include = function(obj, target) {
+    if (obj == null) return false;
+    if (nativeIndexOf && obj.indexOf === nativeIndexOf) return obj.indexOf(target) != -1;
+    return any(obj, function(value) {
+      return value === target;
+    });
+  };
+
+  // Invoke a method (with arguments) on every item in a collection.
+  _.invoke = function(obj, method) {
+    var args = slice.call(arguments, 2);
+    var isFunc = _.isFunction(method);
+    return _.map(obj, function(value) {
+      return (isFunc ? method : value[method]).apply(value, args);
+    });
+  };
+
+  // Convenience version of a common use case of `map`: fetching a property.
+  _.pluck = function(obj, key) {
+    return _.map(obj, function(value){ return value[key]; });
+  };
+
+  // Convenience version of a common use case of `filter`: selecting only objects
+  // containing specific `key:value` pairs.
+  _.where = function(obj, attrs, first) {
+    if (_.isEmpty(attrs)) return first ? null : [];
+    return _[first ? 'find' : 'filter'](obj, function(value) {
+      for (var key in attrs) {
+        if (attrs[key] !== value[key]) return false;
+      }
+      return true;
+    });
+  };
+
+  // Convenience version of a common use case of `find`: getting the first object
+  // containing specific `key:value` pairs.
+  _.findWhere = function(obj, attrs) {
+    return _.where(obj, attrs, true);
+  };
+
+  // Return the maximum element or (element-based computation).
+  // Can't optimize arrays of integers longer than 65,535 elements.
+  // See: https://bugs.webkit.org/show_bug.cgi?id=80797
+  _.max = function(obj, iterator, context) {
+    if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) {
+      return Math.max.apply(Math, obj);
+    }
+    if (!iterator && _.isEmpty(obj)) return -Infinity;
+    var result = {computed : -Infinity, value: -Infinity};
+    each(obj, function(value, index, list) {
+      var computed = iterator ? iterator.call(context, value, index, list) : value;
+      computed >= result.computed && (result = {value : value, computed : computed});
+    });
+    return result.value;
+  };
+
+  // Return the minimum element (or element-based computation).
+  _.min = function(obj, iterator, context) {
+    if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) {
+      return Math.min.apply(Math, obj);
+    }
+    if (!iterator && _.isEmpty(obj)) return Infinity;
+    var result = {computed : Infinity, value: Infinity};
+    each(obj, function(value, index, list) {
+      var computed = iterator ? iterator.call(context, value, index, list) : value;
+      computed < result.computed && (result = {value : value, computed : computed});
+    });
+    return result.value;
+  };
+
+  // Shuffle an array.
+  _.shuffle = function(obj) {
+    var rand;
+    var index = 0;
+    var shuffled = [];
+    each(obj, function(value) {
+      rand = _.random(index++);
+      shuffled[index - 1] = shuffled[rand];
+      shuffled[rand] = value;
+    });
+    return shuffled;
+  };
+
+  // An internal function to generate lookup iterators.
+  var lookupIterator = function(value) {
+    return _.isFunction(value) ? value : function(obj){ return obj[value]; };
+  };
+
+  // Sort the object's values by a criterion produced by an iterator.
+  _.sortBy = function(obj, value, context) {
+    var iterator = lookupIterator(value);
+    return _.pluck(_.map(obj, function(value, index, list) {
+      return {
+        value : value,
+        index : index,
+        criteria : iterator.call(context, value, index, list)
+      };
+    }).sort(function(left, right) {
+      var a = left.criteria;
+      var b = right.criteria;
+      if (a !== b) {
+        if (a > b || a === void 0) return 1;
+        if (a < b || b === void 0) return -1;
+      }
+      return left.index < right.index ? -1 : 1;
+    }), 'value');
+  };
+
+  // An internal function used for aggregate "group by" operations.
+  var group = function(obj, value, context, behavior) {
+    var result = {};
+    var iterator = lookupIterator(value || _.identity);
+    each(obj, function(value, index) {
+      var key = iterator.call(context, value, index, obj);
+      behavior(result, key, value);
+    });
+    return result;
+  };
+
+  // Groups the object's values by a criterion. Pass either a string attribute
+  // to group by, or a function that returns the criterion.
+  _.groupBy = function(obj, value, context) {
+    return group(obj, value, context, function(result, key, value) {
+      (_.has(result, key) ? result[key] : (result[key] = [])).push(value);
+    });
+  };
+
+  // Counts instances of an object that group by a certain criterion. Pass
+  // either a string attribute to count by, or a function that returns the
+  // criterion.
+  _.countBy = function(obj, value, context) {
+    return group(obj, value, context, function(result, key) {
+      if (!_.has(result, key)) result[key] = 0;
+      result[key]++;
+    });
+  };
+
+  // Use a comparator function to figure out the smallest index at which
+  // an object should be inserted so as to maintain order. Uses binary search.
+  _.sortedIndex = function(array, obj, iterator, context) {
+    iterator = iterator == null ? _.identity : lookupIterator(iterator);
+    var value = iterator.call(context, obj);
+    var low = 0, high = array.length;
+    while (low < high) {
+      var mid = (low + high) >>> 1;
+      iterator.call(context, array[mid]) < value ? low = mid + 1 : high = mid;
+    }
+    return low;
+  };
+
+  // Safely convert anything iterable into a real, live array.
+  _.toArray = function(obj) {
+    if (!obj) return [];
+    if (_.isArray(obj)) return slice.call(obj);
+    if (obj.length === +obj.length) return _.map(obj, _.identity);
+    return _.values(obj);
+  };
+
+  // Return the number of elements in an object.
+  _.size = function(obj) {
+    if (obj == null) return 0;
+    return (obj.length === +obj.length) ? obj.length : _.keys(obj).length;
+  };
+
+  // Array Functions
+  // ---------------
+
+  // Get the first element of an array. Passing **n** will return the first N
+  // values in the array. Aliased as `head` and `take`. The **guard** check
+  // allows it to work with `_.map`.
+  _.first = _.head = _.take = function(array, n, guard) {
+    if (array == null) return void 0;
+    return (n != null) && !guard ? slice.call(array, 0, n) : array[0];
+  };
+
+  // Returns everything but the last entry of the array. Especially useful on
+  // the arguments object. Passing **n** will return all the values in
+  // the array, excluding the last N. The **guard** check allows it to work with
+  // `_.map`.
+  _.initial = function(array, n, guard) {
+    return slice.call(array, 0, array.length - ((n == null) || guard ? 1 : n));
+  };
+
+  // Get the last element of an array. Passing **n** will return the last N
+  // values in the array. The **guard** check allows it to work with `_.map`.
+  _.last = function(array, n, guard) {
+    if (array == null) return void 0;
+    if ((n != null) && !guard) {
+      return slice.call(array, Math.max(array.length - n, 0));
+    } else {
+      return array[array.length - 1];
+    }
+  };
+
+  // Returns everything but the first entry of the array. Aliased as `tail` and `drop`.
+  // Especially useful on the arguments object. Passing an **n** will return
+  // the rest N values in the array. The **guard**
+  // check allows it to work with `_.map`.
+  _.rest = _.tail = _.drop = function(array, n, guard) {
+    return slice.call(array, (n == null) || guard ? 1 : n);
+  };
+
+  // Trim out all falsy values from an array.
+  _.compact = function(array) {
+    return _.filter(array, _.identity);
+  };
+
+  // Internal implementation of a recursive `flatten` function.
+  var flatten = function(input, shallow, output) {
+    each(input, function(value) {
+      if (_.isArray(value)) {
+        shallow ? push.apply(output, value) : flatten(value, shallow, output);
+      } else {
+        output.push(value);
+      }
+    });
+    return output;
+  };
+
+  // Return a completely flattened version of an array.
+  _.flatten = function(array, shallow) {
+    return flatten(array, shallow, []);
+  };
+
+  // Return a version of the array that does not contain the specified value(s).
+  _.without = function(array) {
+    return _.difference(array, slice.call(arguments, 1));
+  };
+
+  // Produce a duplicate-free version of the array. If the array has already
+  // been sorted, you have the option of using a faster algorithm.
+  // Aliased as `unique`.
+  _.uniq = _.unique = function(array, isSorted, iterator, context) {
+    if (_.isFunction(isSorted)) {
+      context = iterator;
+      iterator = isSorted;
+      isSorted = false;
+    }
+    var initial = iterator ? _.map(array, iterator, context) : array;
+    var results = [];
+    var seen = [];
+    each(initial, function(value, index) {
+      if (isSorted ? (!index || seen[seen.length - 1] !== value) : !_.contains(seen, value)) {
+        seen.push(value);
+        results.push(array[index]);
+      }
+    });
+    return results;
+  };
+
+  // Produce an array that contains the union: each distinct element from all of
+  // the passed-in arrays.
+  _.union = function() {
+    return _.uniq(concat.apply(ArrayProto, arguments));
+  };
+
+  // Produce an array that contains every item shared between all the
+  // passed-in arrays.
+  _.intersection = function(array) {
+    var rest = slice.call(arguments, 1);
+    return _.filter(_.uniq(array), function(item) {
+      return _.every(rest, function(other) {
+        return _.indexOf(other, item) >= 0;
+      });
+    });
+  };
+
+  // Take the difference between one array and a number of other arrays.
+  // Only the elements present in just the first array will remain.
+  _.difference = function(array) {
+    var rest = concat.apply(ArrayProto, slice.call(arguments, 1));
+    return _.filter(array, function(value){ return !_.contains(rest, value); });
+  };
+
+  // Zip together multiple lists into a single array -- elements that share
+  // an index go together.
+  _.zip = function() {
+    var args = slice.call(arguments);
+    var length = _.max(_.pluck(args, 'length'));
+    var results = new Array(length);
+    for (var i = 0; i < length; i++) {
+      results[i] = _.pluck(args, "" + i);
+    }
+    return results;
+  };
+
+  // Converts lists into objects. Pass either a single array of `[key, value]`
+  // pairs, or two parallel arrays of the same length -- one of keys, and one of
+  // the corresponding values.
+  _.object = function(list, values) {
+    if (list == null) return {};
+    var result = {};
+    for (var i = 0, l = list.length; i < l; i++) {
+      if (values) {
+        result[list[i]] = values[i];
+      } else {
+        result[list[i][0]] = list[i][1];
+      }
+    }
+    return result;
+  };
+
+  // If the browser doesn't supply us with indexOf (I'm looking at you, **MSIE**),
+  // we need this function. Return the position of the first occurrence of an
+  // item in an array, or -1 if the item is not included in the array.
+  // Delegates to **ECMAScript 5**'s native `indexOf` if available.
+  // If the array is large and already in sort order, pass `true`
+  // for **isSorted** to use binary search.
+  _.indexOf = function(array, item, isSorted) {
+    if (array == null) return -1;
+    var i = 0, l = array.length;
+    if (isSorted) {
+      if (typeof isSorted == 'number') {
+        i = (isSorted < 0 ? Math.max(0, l + isSorted) : isSorted);
+      } else {
+        i = _.sortedIndex(array, item);
+        return array[i] === item ? i : -1;
+      }
+    }
+    if (nativeIndexOf && array.indexOf === nativeIndexOf) return array.indexOf(item, isSorted);
+    for (; i < l; i++) if (array[i] === item) return i;
+    return -1;
+  };
+
+  // Delegates to **ECMAScript 5**'s native `lastIndexOf` if available.
+  _.lastIndexOf = function(array, item, from) {
+    if (array == null) return -1;
+    var hasIndex = from != null;
+    if (nativeLastIndexOf && array.lastIndexOf === nativeLastIndexOf) {
+      return hasIndex ? array.lastIndexOf(item, from) : array.lastIndexOf(item);
+    }
+    var i = (hasIndex ? from : array.length);
+    while (i--) if (array[i] === item) return i;
+    return -1;
+  };
+
+  // Generate an integer Array containing an arithmetic progression. A port of
+  // the native Python `range()` function. See
+  // [the Python documentation](http://docs.python.org/library/functions.html#range).
+  _.range = function(start, stop, step) {
+    if (arguments.length <= 1) {
+      stop = start || 0;
+      start = 0;
+    }
+    step = arguments[2] || 1;
+
+    var len = Math.max(Math.ceil((stop - start) / step), 0);
+    var idx = 0;
+    var range = new Array(len);
+
+    while(idx < len) {
+      range[idx++] = start;
+      start += step;
+    }
+
+    return range;
+  };
+
+  // Function (ahem) Functions
+  // ------------------
+
+  // Create a function bound to a given object (assigning `this`, and arguments,
+  // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if
+  // available.
+  _.bind = function(func, context) {
+    if (func.bind === nativeBind && nativeBind) return nativeBind.apply(func, slice.call(arguments, 1));
+    var args = slice.call(arguments, 2);
+    return function() {
+      return func.apply(context, args.concat(slice.call(arguments)));
+    };
+  };
+
+  // Partially apply a function by creating a version that has had some of its
+  // arguments pre-filled, without changing its dynamic `this` context.
+  _.partial = function(func) {
+    var args = slice.call(arguments, 1);
+    return function() {
+      return func.apply(this, args.concat(slice.call(arguments)));
+    };
+  };
+
+  // Bind all of an object's methods to that object. Useful for ensuring that
+  // all callbacks defined on an object belong to it.
+  _.bindAll = function(obj) {
+    var funcs = slice.call(arguments, 1);
+    if (funcs.length === 0) funcs = _.functions(obj);
+    each(funcs, function(f) { obj[f] = _.bind(obj[f], obj); });
+    return obj;
+  };
+
+  // Memoize an expensive function by storing its results.
+  _.memoize = function(func, hasher) {
+    var memo = {};
+    hasher || (hasher = _.identity);
+    return function() {
+      var key = hasher.apply(this, arguments);
+      return _.has(memo, key) ? memo[key] : (memo[key] = func.apply(this, arguments));
+    };
+  };
+
+  // Delays a function for the given number of milliseconds, and then calls
+  // it with the arguments supplied.
+  _.delay = function(func, wait) {
+    var args = slice.call(arguments, 2);
+    return setTimeout(function(){ return func.apply(null, args); }, wait);
+  };
+
+  // Defers a function, scheduling it to run after the current call stack has
+  // cleared.
+  _.defer = function(func) {
+    return _.delay.apply(_, [func, 1].concat(slice.call(arguments, 1)));
+  };
+
+  // Returns a function, that, when invoked, will only be triggered at most once
+  // during a given window of time.
+  _.throttle = function(func, wait) {
+    var context, args, timeout, result;
+    var previous = 0;
+    var later = function() {
+      previous = new Date;
+      timeout = null;
+      result = func.apply(context, args);
+    };
+    return function() {
+      var now = new Date;
+      var remaining = wait - (now - previous);
+      context = this;
+      args = arguments;
+      if (remaining <= 0) {
+        clearTimeout(timeout);
+        timeout = null;
+        previous = now;
+        result = func.apply(context, args);
+      } else if (!timeout) {
+        timeout = setTimeout(later, remaining);
+      }
+      return result;
+    };
+  };
+
+  // Returns a function, that, as long as it continues to be invoked, will not
+  // be triggered. The function will be called after it stops being called for
+  // N milliseconds. If `immediate` is passed, trigger the function on the
+  // leading edge, instead of the trailing.
+  _.debounce = function(func, wait, immediate) {
+    var timeout, result;
+    return function() {
+      var context = this, args = arguments;
+      var later = function() {
+        timeout = null;
+        if (!immediate) result = func.apply(context, args);
+      };
+      var callNow = immediate && !timeout;
+      clearTimeout(timeout);
+      timeout = setTimeout(later, wait);
+      if (callNow) result = func.apply(context, args);
+      return result;
+    };
+  };
+
+  // Returns a function that will be executed at most one time, no matter how
+  // often you call it. Useful for lazy initialization.
+  _.once = function(func) {
+    var ran = false, memo;
+    return function() {
+      if (ran) return memo;
+      ran = true;
+      memo = func.apply(this, arguments);
+      func = null;
+      return memo;
+    };
+  };
+
+  // Returns the first function passed as an argument to the second,
+  // allowing you to adjust arguments, run code before and after, and
+  // conditionally execute the original function.
+  _.wrap = function(func, wrapper) {
+    return function() {
+      var args = [func];
+      push.apply(args, arguments);
+      return wrapper.apply(this, args);
+    };
+  };
+
+  // Returns a function that is the composition of a list of functions, each
+  // consuming the return value of the function that follows.
+  _.compose = function() {
+    var funcs = arguments;
+    return function() {
+      var args = arguments;
+      for (var i = funcs.length - 1; i >= 0; i--) {
+        args = [funcs[i].apply(this, args)];
+      }
+      return args[0];
+    };
+  };
+
+  // Returns a function that will only be executed after being called N times.
+  _.after = function(times, func) {
+    if (times <= 0) return func();
+    return function() {
+      if (--times < 1) {
+        return func.apply(this, arguments);
+      }
+    };
+  };
+
+  // Object Functions
+  // ----------------
+
+  // Retrieve the names of an object's properties.
+  // Delegates to **ECMAScript 5**'s native `Object.keys`
+  _.keys = nativeKeys || function(obj) {
+    if (obj !== Object(obj)) throw new TypeError('Invalid object');
+    var keys = [];
+    for (var key in obj) if (_.has(obj, key)) keys[keys.length] = key;
+    return keys;
+  };
+
+  // Retrieve the values of an object's properties.
+  _.values = function(obj) {
+    var values = [];
+    for (var key in obj) if (_.has(obj, key)) values.push(obj[key]);
+    return values;
+  };
+
+  // Convert an object into a list of `[key, value]` pairs.
+  _.pairs = function(obj) {
+    var pairs = [];
+    for (var key in obj) if (_.has(obj, key)) pairs.push([key, obj[key]]);
+    return pairs;
+  };
+
+  // Invert the keys and values of an object. The values must be serializable.
+  _.invert = function(obj) {
+    var result = {};
+    for (var key in obj) if (_.has(obj, key)) result[obj[key]] = key;
+    return result;
+  };
+
+  // Return a sorted list of the function names available on the object.
+  // Aliased as `methods`
+  _.functions = _.methods = function(obj) {
+    var names = [];
+    for (var key in obj) {
+      if (_.isFunction(obj[key])) names.push(key);
+    }
+    return names.sort();
+  };
+
+  // Extend a given object with all the properties in passed-in object(s).
+  _.extend = function(obj) {
+    each(slice.call(arguments, 1), function(source) {
+      if (source) {
+        for (var prop in source) {
+          obj[prop] = source[prop];
+        }
+      }
+    });
+    return obj;
+  };
+
+  // Return a copy of the object only containing the whitelisted properties.
+  _.pick = function(obj) {
+    var copy = {};
+    var keys = concat.apply(ArrayProto, slice.call(arguments, 1));
+    each(keys, function(key) {
+      if (key in obj) copy[key] = obj[key];
+    });
+    return copy;
+  };
+
+   // Return a copy of the object without the blacklisted properties.
+  _.omit = function(obj) {
+    var copy = {};
+    var keys = concat.apply(ArrayProto, slice.call(arguments, 1));
+    for (var key in obj) {
+      if (!_.contains(keys, key)) copy[key] = obj[key];
+    }
+    return copy;
+  };
+
+  // Fill in a given object with default properties.
+  _.defaults = function(obj) {
+    each(slice.call(arguments, 1), function(source) {
+      if (source) {
+        for (var prop in source) {
+          if (obj[prop] == null) obj[prop] = source[prop];
+        }
+      }
+    });
+    return obj;
+  };
+
+  // Create a (shallow-cloned) duplicate of an object.
+  _.clone = function(obj) {
+    if (!_.isObject(obj)) return obj;
+    return _.isArray(obj) ? obj.slice() : _.extend({}, obj);
+  };
+
+  // Invokes interceptor with the obj, and then returns obj.
+  // The primary purpose of this method is to "tap into" a method chain, in
+  // order to perform operations on intermediate results within the chain.
+  _.tap = function(obj, interceptor) {
+    interceptor(obj);
+    return obj;
+  };
+
+  // Internal recursive comparison function for `isEqual`.
+  var eq = function(a, b, aStack, bStack) {
+    // Identical objects are equal. `0 === -0`, but they aren't identical.
+    // See the Harmony `egal` proposal: http://wiki.ecmascript.org/doku.php?id=harmony:egal.
+    if (a === b) return a !== 0 || 1 / a == 1 / b;
+    // A strict comparison is necessary because `null == undefined`.
+    if (a == null || b == null) return a === b;
+    // Unwrap any wrapped objects.
+    if (a instanceof _) a = a._wrapped;
+    if (b instanceof _) b = b._wrapped;
+    // Compare `[[Class]]` names.
+    var className = toString.call(a);
+    if (className != toString.call(b)) return false;
+    switch (className) {
+      // Strings, numbers, dates, and booleans are compared by value.
+      case '[object String]':
+        // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is
+        // equivalent to `new String("5")`.
+        return a == String(b);
+      case '[object Number]':
+        // `NaN`s are equivalent, but non-reflexive. An `egal` comparison is performed for
+        // other numeric values.
+        return a != +a ? b != +b : (a == 0 ? 1 / a == 1 / b : a == +b);
+      case '[object Date]':
+      case '[object Boolean]':
+        // Coerce dates and booleans to numeric primitive values. Dates are compared by their
+        // millisecond representations. Note that invalid dates with millisecond representations
+        // of `NaN` are not equivalent.
+        return +a == +b;
+      // RegExps are compared by their source patterns and flags.
+      case '[object RegExp]':
+        return a.source == b.source &&
+               a.global == b.global &&
+               a.multiline == b.multiline &&
+               a.ignoreCase == b.ignoreCase;
+    }
+    if (typeof a != 'object' || typeof b != 'object') return false;
+    // Assume equality for cyclic structures. The algorithm for detecting cyclic
+    // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.
+    var length = aStack.length;
+    while (length--) {
+      // Linear search. Performance is inversely proportional to the number of
+      // unique nested structures.
+      if (aStack[length] == a) return bStack[length] == b;
+    }
+    // Add the first object to the stack of traversed objects.
+    aStack.push(a);
+    bStack.push(b);
+    var size = 0, result = true;
+    // Recursively compare objects and arrays.
+    if (className == '[object Array]') {
+      // Compare array lengths to determine if a deep comparison is necessary.
+      size = a.length;
+      result = size == b.length;
+      if (result) {
+        // Deep compare the contents, ignoring non-numeric properties.
+        while (size--) {
+          if (!(result = eq(a[size], b[size], aStack, bStack))) break;
+        }
+      }
+    } else {
+      // Objects with different constructors are not equivalent, but `Object`s
+      // from different frames are.
+      var aCtor = a.constructor, bCtor = b.constructor;
+      if (aCtor !== bCtor && !(_.isFunction(aCtor) && (aCtor instanceof aCtor) &&
+                               _.isFunction(bCtor) && (bCtor instanceof bCtor))) {
+        return false;
+      }
+      // Deep compare objects.
+      for (var key in a) {
+        if (_.has(a, key)) {
+          // Count the expected number of properties.
+          size++;
+          // Deep compare each member.
+          if (!(result = _.has(b, key) && eq(a[key], b[key], aStack, bStack))) break;
+        }
+      }
+      // Ensure that both objects contain the same number of properties.
+      if (result) {
+        for (key in b) {
+          if (_.has(b, key) && !(size--)) break;
+        }
+        result = !size;
+      }
+    }
+    // Remove the first object from the stack of traversed objects.
+    aStack.pop();
+    bStack.pop();
+    return result;
+  };
+
+  // Perform a deep comparison to check if two objects are equal.
+  _.isEqual = function(a, b) {
+    return eq(a, b, [], []);
+  };
+
+  // Is a given array, string, or object empty?
+  // An "empty" object has no enumerable own-properties.
+  _.isEmpty = function(obj) {
+    if (obj == null) return true;
+    if (_.isArray(obj) || _.isString(obj)) return obj.length === 0;
+    for (var key in obj) if (_.has(obj, key)) return false;
+    return true;
+  };
+
+  // Is a given value a DOM element?
+  _.isElement = function(obj) {
+    return !!(obj && obj.nodeType === 1);
+  };
+
+  // Is a given value an array?
+  // Delegates to ECMA5's native Array.isArray
+  _.isArray = nativeIsArray || function(obj) {
+    return toString.call(obj) == '[object Array]';
+  };
+
+  // Is a given variable an object?
+  _.isObject = function(obj) {
+    return obj === Object(obj);
+  };
+
+  // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp.
+  each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp'], function(name) {
+    _['is' + name] = function(obj) {
+      return toString.call(obj) == '[object ' + name + ']';
+    };
+  });
+
+  // Define a fallback version of the method in browsers (ahem, IE), where
+  // there isn't any inspectable "Arguments" type.
+  if (!_.isArguments(arguments)) {
+    _.isArguments = function(obj) {
+      return !!(obj && _.has(obj, 'callee'));
+    };
+  }
+
+  // Optimize `isFunction` if appropriate.
+  if (typeof (/./) !== 'function') {
+    _.isFunction = function(obj) {
+      return typeof obj === 'function';
+    };
+  }
+
+  // Is a given object a finite number?
+  _.isFinite = function(obj) {
+    return isFinite(obj) && !isNaN(parseFloat(obj));
+  };
+
+  // Is the given value `NaN`? (NaN is the only number which does not equal itself).
+  _.isNaN = function(obj) {
+    return _.isNumber(obj) && obj != +obj;
+  };
+
+  // Is a given value a boolean?
+  _.isBoolean = function(obj) {
+    return obj === true || obj === false || toString.call(obj) == '[object Boolean]';
+  };
+
+  // Is a given value equal to null?
+  _.isNull = function(obj) {
+    return obj === null;
+  };
+
+  // Is a given variable undefined?
+  _.isUndefined = function(obj) {
+    return obj === void 0;
+  };
+
+  // Shortcut function for checking if an object has a given property directly
+  // on itself (in other words, not on a prototype).
+  _.has = function(obj, key) {
+    return hasOwnProperty.call(obj, key);
+  };
+
+  // Utility Functions
+  // -----------------
+
+  // Run Underscore.js in *noConflict* mode, returning the `_` variable to its
+  // previous owner. Returns a reference to the Underscore object.
+  _.noConflict = function() {
+    root._ = previousUnderscore;
+    return this;
+  };
+
+  // Keep the identity function around for default iterators.
+  _.identity = function(value) {
+    return value;
+  };
+
+  // Run a function **n** times.
+  _.times = function(n, iterator, context) {
+    var accum = Array(n);
+    for (var i = 0; i < n; i++) accum[i] = iterator.call(context, i);
+    return accum;
+  };
+
+  // Return a random integer between min and max (inclusive).
+  _.random = function(min, max) {
+    if (max == null) {
+      max = min;
+      min = 0;
+    }
+    return min + Math.floor(Math.random() * (max - min + 1));
+  };
+
+  // List of HTML entities for escaping.
+  var entityMap = {
+    escape: {
+      '&': '&',
+      '<': '<',
+      '>': '>',
+      '"': '"',
+      "'": '&#x27;',
+      '/': '&#x2F;'
+    }
+  };
+  entityMap.unescape = _.invert(entityMap.escape);
+
+  // Regexes containing the keys and values listed immediately above.
+  var entityRegexes = {
+    escape:   new RegExp('[' + _.keys(entityMap.escape).join('') + ']', 'g'),
+    unescape: new RegExp('(' + _.keys(entityMap.unescape).join('|') + ')', 'g')
+  };
+
+  // Functions for escaping and unescaping strings to/from HTML interpolation.
+  _.each(['escape', 'unescape'], function(method) {
+    _[method] = function(string) {
+      if (string == null) return '';
+      return ('' + string).replace(entityRegexes[method], function(match) {
+        return entityMap[method][match];
+      });
+    };
+  });
+
+  // If the value of the named property is a function then invoke it;
+  // otherwise, return it.
+  _.result = function(object, property) {
+    if (object == null) return null;
+    var value = object[property];
+    return _.isFunction(value) ? value.call(object) : value;
+  };
+
+  // Add your own custom functions to the Underscore object.
+  _.mixin = function(obj) {
+    each(_.functions(obj), function(name){
+      var func = _[name] = obj[name];
+      _.prototype[name] = function() {
+        var args = [this._wrapped];
+        push.apply(args, arguments);
+        return result.call(this, func.apply(_, args));
+      };
+    });
+  };
+
+  // Generate a unique integer id (unique within the entire client session).
+  // Useful for temporary DOM ids.
+  var idCounter = 0;
+  _.uniqueId = function(prefix) {
+    var id = ++idCounter + '';
+    return prefix ? prefix + id : id;
+  };
+
+  // By default, Underscore uses ERB-style template delimiters, change the
+  // following template settings to use alternative delimiters.
+  _.templateSettings = {
+    evaluate    : /<%([\s\S]+?)%>/g,
+    interpolate : /<%=([\s\S]+?)%>/g,
+    escape      : /<%-([\s\S]+?)%>/g
+  };
+
+  // When customizing `templateSettings`, if you don't want to define an
+  // interpolation, evaluation or escaping regex, we need one that is
+  // guaranteed not to match.
+  var noMatch = /(.)^/;
+
+  // Certain characters need to be escaped so that they can be put into a
+  // string literal.
+  var escapes = {
+    "'":      "'",
+    '\\':     '\\',
+    '\r':     'r',
+    '\n':     'n',
+    '\t':     't',
+    '\u2028': 'u2028',
+    '\u2029': 'u2029'
+  };
+
+  var escaper = /\\|'|\r|\n|\t|\u2028|\u2029/g;
+
+  // JavaScript micro-templating, similar to John Resig's implementation.
+  // Underscore templating handles arbitrary delimiters, preserves whitespace,
+  // and correctly escapes quotes within interpolated code.
+  _.template = function(text, data, settings) {
+    var render;
+    settings = _.defaults({}, settings, _.templateSettings);
+
+    // Combine delimiters into one regular expression via alternation.
+    var matcher = new RegExp([
+      (settings.escape || noMatch).source,
+      (settings.interpolate || noMatch).source,
+      (settings.evaluate || noMatch).source
+    ].join('|') + '|$', 'g');
+
+    // Compile the template source, escaping string literals appropriately.
+    var index = 0;
+    var source = "__p+='";
+    text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
+      source += text.slice(index, offset)
+        .replace(escaper, function(match) { return '\\' + escapes[match]; });
+
+      if (escape) {
+        source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
+      }
+      if (interpolate) {
+        source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
+      }
+      if (evaluate) {
+        source += "';\n" + evaluate + "\n__p+='";
+      }
+      index = offset + match.length;
+      return match;
+    });
+    source += "';\n";
+
+    // If a variable is not specified, place data values in local scope.
+    if (!settings.variable) source = 'with(obj||{}){\n' + source + '}\n';
+
+    source = "var __t,__p='',__j=Array.prototype.join," +
+      "print=function(){__p+=__j.call(arguments,'');};\n" +
+      source + "return __p;\n";
+
+    try {
+      render = new Function(settings.variable || 'obj', '_', source);
+    } catch (e) {
+      e.source = source;
+      throw e;
+    }
+
+    if (data) return render(data, _);
+    var template = function(data) {
+      return render.call(this, data, _);
+    };
+
+    // Provide the compiled function source as a convenience for precompilation.
+    template.source = 'function(' + (settings.variable || 'obj') + '){\n' + source + '}';
+
+    return template;
+  };
+
+  // Add a "chain" function, which will delegate to the wrapper.
+  _.chain = function(obj) {
+    return _(obj).chain();
+  };
+
+  // OOP
+  // ---------------
+  // If Underscore is called as a function, it returns a wrapped object that
+  // can be used OO-style. This wrapper holds altered versions of all the
+  // underscore functions. Wrapped objects may be chained.
+
+  // Helper function to continue chaining intermediate results.
+  var result = function(obj) {
+    return this._chain ? _(obj).chain() : obj;
+  };
+
+  // Add all of the Underscore functions to the wrapper object.
+  _.mixin(_);
+
+  // Add all mutator Array functions to the wrapper.
+  each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {
+    var method = ArrayProto[name];
+    _.prototype[name] = function() {
+      var obj = this._wrapped;
+      method.apply(obj, arguments);
+      if ((name == 'shift' || name == 'splice') && obj.length === 0) delete obj[0];
+      return result.call(this, obj);
+    };
+  });
+
+  // Add all accessor Array functions to the wrapper.
+  each(['concat', 'join', 'slice'], function(name) {
+    var method = ArrayProto[name];
+    _.prototype[name] = function() {
+      return result.call(this, method.apply(this._wrapped, arguments));
+    };
+  });
+
+  _.extend(_.prototype, {
+
+    // Start chaining a wrapped Underscore object.
+    chain: function() {
+      this._chain = true;
+      return this;
+    },
+
+    // Extracts the result from a wrapped and chained object.
+    value: function() {
+      return this._wrapped;
+    }
+
+  });
+
+}).call(this);

Added: www-releases/trunk/3.6.0/docs/_static/up-pressed.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/up-pressed.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/up-pressed.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/up.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/up.png?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/_static/up.png
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/_static/websupport.js
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/_static/websupport.js?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/_static/websupport.js (added)
+++ www-releases/trunk/3.6.0/docs/_static/websupport.js Fri Feb 27 12:44:09 2015
@@ -0,0 +1,808 @@
+/*
+ * websupport.js
+ * ~~~~~~~~~~~~~
+ *
+ * sphinx.websupport utilties for all documentation.
+ *
+ * :copyright: Copyright 2007-2014 by the Sphinx team, see AUTHORS.
+ * :license: BSD, see LICENSE for details.
+ *
+ */
+
+(function($) {
+  $.fn.autogrow = function() {
+    return this.each(function() {
+    var textarea = this;
+
+    $.fn.autogrow.resize(textarea);
+
+    $(textarea)
+      .focus(function() {
+        textarea.interval = setInterval(function() {
+          $.fn.autogrow.resize(textarea);
+        }, 500);
+      })
+      .blur(function() {
+        clearInterval(textarea.interval);
+      });
+    });
+  };
+
+  $.fn.autogrow.resize = function(textarea) {
+    var lineHeight = parseInt($(textarea).css('line-height'), 10);
+    var lines = textarea.value.split('\n');
+    var columns = textarea.cols;
+    var lineCount = 0;
+    $.each(lines, function() {
+      lineCount += Math.ceil(this.length / columns) || 1;
+    });
+    var height = lineHeight * (lineCount + 1);
+    $(textarea).css('height', height);
+  };
+})(jQuery);
+
+(function($) {
+  var comp, by;
+
+  function init() {
+    initEvents();
+    initComparator();
+  }
+
+  function initEvents() {
+    $('a.comment-close').live("click", function(event) {
+      event.preventDefault();
+      hide($(this).attr('id').substring(2));
+    });
+    $('a.vote').live("click", function(event) {
+      event.preventDefault();
+      handleVote($(this));
+    });
+    $('a.reply').live("click", function(event) {
+      event.preventDefault();
+      openReply($(this).attr('id').substring(2));
+    });
+    $('a.close-reply').live("click", function(event) {
+      event.preventDefault();
+      closeReply($(this).attr('id').substring(2));
+    });
+    $('a.sort-option').live("click", function(event) {
+      event.preventDefault();
+      handleReSort($(this));
+    });
+    $('a.show-proposal').live("click", function(event) {
+      event.preventDefault();
+      showProposal($(this).attr('id').substring(2));
+    });
+    $('a.hide-proposal').live("click", function(event) {
+      event.preventDefault();
+      hideProposal($(this).attr('id').substring(2));
+    });
+    $('a.show-propose-change').live("click", function(event) {
+      event.preventDefault();
+      showProposeChange($(this).attr('id').substring(2));
+    });
+    $('a.hide-propose-change').live("click", function(event) {
+      event.preventDefault();
+      hideProposeChange($(this).attr('id').substring(2));
+    });
+    $('a.accept-comment').live("click", function(event) {
+      event.preventDefault();
+      acceptComment($(this).attr('id').substring(2));
+    });
+    $('a.delete-comment').live("click", function(event) {
+      event.preventDefault();
+      deleteComment($(this).attr('id').substring(2));
+    });
+    $('a.comment-markup').live("click", function(event) {
+      event.preventDefault();
+      toggleCommentMarkupBox($(this).attr('id').substring(2));
+    });
+  }
+
+  /**
+   * Set comp, which is a comparator function used for sorting and
+   * inserting comments into the list.
+   */
+  function setComparator() {
+    // If the first three letters are "asc", sort in ascending order
+    // and remove the prefix.
+    if (by.substring(0,3) == 'asc') {
+      var i = by.substring(3);
+      comp = function(a, b) { return a[i] - b[i]; };
+    } else {
+      // Otherwise sort in descending order.
+      comp = function(a, b) { return b[by] - a[by]; };
+    }
+
+    // Reset link styles and format the selected sort option.
+    $('a.sel').attr('href', '#').removeClass('sel');
+    $('a.by' + by).removeAttr('href').addClass('sel');
+  }
+
+  /**
+   * Create a comp function. If the user has preferences stored in
+   * the sortBy cookie, use those, otherwise use the default.
+   */
+  function initComparator() {
+    by = 'rating'; // Default to sort by rating.
+    // If the sortBy cookie is set, use that instead.
+    if (document.cookie.length > 0) {
+      var start = document.cookie.indexOf('sortBy=');
+      if (start != -1) {
+        start = start + 7;
+        var end = document.cookie.indexOf(";", start);
+        if (end == -1) {
+          end = document.cookie.length;
+          by = unescape(document.cookie.substring(start, end));
+        }
+      }
+    }
+    setComparator();
+  }
+
+  /**
+   * Show a comment div.
+   */
+  function show(id) {
+    $('#ao' + id).hide();
+    $('#ah' + id).show();
+    var context = $.extend({id: id}, opts);
+    var popup = $(renderTemplate(popupTemplate, context)).hide();
+    popup.find('textarea[name="proposal"]').hide();
+    popup.find('a.by' + by).addClass('sel');
+    var form = popup.find('#cf' + id);
+    form.submit(function(event) {
+      event.preventDefault();
+      addComment(form);
+    });
+    $('#s' + id).after(popup);
+    popup.slideDown('fast', function() {
+      getComments(id);
+    });
+  }
+
+  /**
+   * Hide a comment div.
+   */
+  function hide(id) {
+    $('#ah' + id).hide();
+    $('#ao' + id).show();
+    var div = $('#sc' + id);
+    div.slideUp('fast', function() {
+      div.remove();
+    });
+  }
+
+  /**
+   * Perform an ajax request to get comments for a node
+   * and insert the comments into the comments tree.
+   */
+  function getComments(id) {
+    $.ajax({
+     type: 'GET',
+     url: opts.getCommentsURL,
+     data: {node: id},
+     success: function(data, textStatus, request) {
+       var ul = $('#cl' + id);
+       var speed = 100;
+       $('#cf' + id)
+         .find('textarea[name="proposal"]')
+         .data('source', data.source);
+
+       if (data.comments.length === 0) {
+         ul.html('<li>No comments yet.</li>');
+         ul.data('empty', true);
+       } else {
+         // If there are comments, sort them and put them in the list.
+         var comments = sortComments(data.comments);
+         speed = data.comments.length * 100;
+         appendComments(comments, ul);
+         ul.data('empty', false);
+       }
+       $('#cn' + id).slideUp(speed + 200);
+       ul.slideDown(speed);
+     },
+     error: function(request, textStatus, error) {
+       showError('Oops, there was a problem retrieving the comments.');
+     },
+     dataType: 'json'
+    });
+  }
+
+  /**
+   * Add a comment via ajax and insert the comment into the comment tree.
+   */
+  function addComment(form) {
+    var node_id = form.find('input[name="node"]').val();
+    var parent_id = form.find('input[name="parent"]').val();
+    var text = form.find('textarea[name="comment"]').val();
+    var proposal = form.find('textarea[name="proposal"]').val();
+
+    if (text == '') {
+      showError('Please enter a comment.');
+      return;
+    }
+
+    // Disable the form that is being submitted.
+    form.find('textarea,input').attr('disabled', 'disabled');
+
+    // Send the comment to the server.
+    $.ajax({
+      type: "POST",
+      url: opts.addCommentURL,
+      dataType: 'json',
+      data: {
+        node: node_id,
+        parent: parent_id,
+        text: text,
+        proposal: proposal
+      },
+      success: function(data, textStatus, error) {
+        // Reset the form.
+        if (node_id) {
+          hideProposeChange(node_id);
+        }
+        form.find('textarea')
+          .val('')
+          .add(form.find('input'))
+          .removeAttr('disabled');
+	var ul = $('#cl' + (node_id || parent_id));
+        if (ul.data('empty')) {
+          $(ul).empty();
+          ul.data('empty', false);
+        }
+        insertComment(data.comment);
+        var ao = $('#ao' + node_id);
+        ao.find('img').attr({'src': opts.commentBrightImage});
+        if (node_id) {
+          // if this was a "root" comment, remove the commenting box
+          // (the user can get it back by reopening the comment popup)
+          $('#ca' + node_id).slideUp();
+        }
+      },
+      error: function(request, textStatus, error) {
+        form.find('textarea,input').removeAttr('disabled');
+        showError('Oops, there was a problem adding the comment.');
+      }
+    });
+  }
+
+  /**
+   * Recursively append comments to the main comment list and children
+   * lists, creating the comment tree.
+   */
+  function appendComments(comments, ul) {
+    $.each(comments, function() {
+      var div = createCommentDiv(this);
+      ul.append($(document.createElement('li')).html(div));
+      appendComments(this.children, div.find('ul.comment-children'));
+      // To avoid stagnating data, don't store the comments children in data.
+      this.children = null;
+      div.data('comment', this);
+    });
+  }
+
+  /**
+   * After adding a new comment, it must be inserted in the correct
+   * location in the comment tree.
+   */
+  function insertComment(comment) {
+    var div = createCommentDiv(comment);
+
+    // To avoid stagnating data, don't store the comments children in data.
+    comment.children = null;
+    div.data('comment', comment);
+
+    var ul = $('#cl' + (comment.node || comment.parent));
+    var siblings = getChildren(ul);
+
+    var li = $(document.createElement('li'));
+    li.hide();
+
+    // Determine where in the parents children list to insert this comment.
+    for(i=0; i < siblings.length; i++) {
+      if (comp(comment, siblings[i]) <= 0) {
+        $('#cd' + siblings[i].id)
+          .parent()
+          .before(li.html(div));
+        li.slideDown('fast');
+        return;
+      }
+    }
+
+    // If we get here, this comment rates lower than all the others,
+    // or it is the only comment in the list.
+    ul.append(li.html(div));
+    li.slideDown('fast');
+  }
+
+  function acceptComment(id) {
+    $.ajax({
+      type: 'POST',
+      url: opts.acceptCommentURL,
+      data: {id: id},
+      success: function(data, textStatus, request) {
+        $('#cm' + id).fadeOut('fast');
+        $('#cd' + id).removeClass('moderate');
+      },
+      error: function(request, textStatus, error) {
+        showError('Oops, there was a problem accepting the comment.');
+      }
+    });
+  }
+
+  function deleteComment(id) {
+    $.ajax({
+      type: 'POST',
+      url: opts.deleteCommentURL,
+      data: {id: id},
+      success: function(data, textStatus, request) {
+        var div = $('#cd' + id);
+        if (data == 'delete') {
+          // Moderator mode: remove the comment and all children immediately
+          div.slideUp('fast', function() {
+            div.remove();
+          });
+          return;
+        }
+        // User mode: only mark the comment as deleted
+        div
+          .find('span.user-id:first')
+          .text('[deleted]').end()
+          .find('div.comment-text:first')
+          .text('[deleted]').end()
+          .find('#cm' + id + ', #dc' + id + ', #ac' + id + ', #rc' + id +
+                ', #sp' + id + ', #hp' + id + ', #cr' + id + ', #rl' + id)
+          .remove();
+        var comment = div.data('comment');
+        comment.username = '[deleted]';
+        comment.text = '[deleted]';
+        div.data('comment', comment);
+      },
+      error: function(request, textStatus, error) {
+        showError('Oops, there was a problem deleting the comment.');
+      }
+    });
+  }
+
+  function showProposal(id) {
+    $('#sp' + id).hide();
+    $('#hp' + id).show();
+    $('#pr' + id).slideDown('fast');
+  }
+
+  function hideProposal(id) {
+    $('#hp' + id).hide();
+    $('#sp' + id).show();
+    $('#pr' + id).slideUp('fast');
+  }
+
+  function showProposeChange(id) {
+    $('#pc' + id).hide();
+    $('#hc' + id).show();
+    var textarea = $('#pt' + id);
+    textarea.val(textarea.data('source'));
+    $.fn.autogrow.resize(textarea[0]);
+    textarea.slideDown('fast');
+  }
+
+  function hideProposeChange(id) {
+    $('#hc' + id).hide();
+    $('#pc' + id).show();
+    var textarea = $('#pt' + id);
+    textarea.val('').removeAttr('disabled');
+    textarea.slideUp('fast');
+  }
+
+  function toggleCommentMarkupBox(id) {
+    $('#mb' + id).toggle();
+  }
+
+  /** Handle when the user clicks on a sort by link. */
+  function handleReSort(link) {
+    var classes = link.attr('class').split(/\s+/);
+    for (var i=0; i<classes.length; i++) {
+      if (classes[i] != 'sort-option') {
+	by = classes[i].substring(2);
+      }
+    }
+    setComparator();
+    // Save/update the sortBy cookie.
+    var expiration = new Date();
+    expiration.setDate(expiration.getDate() + 365);
+    document.cookie= 'sortBy=' + escape(by) +
+                     ';expires=' + expiration.toUTCString();
+    $('ul.comment-ul').each(function(index, ul) {
+      var comments = getChildren($(ul), true);
+      comments = sortComments(comments);
+      appendComments(comments, $(ul).empty());
+    });
+  }
+
+  /**
+   * Function to process a vote when a user clicks an arrow.
+   */
+  function handleVote(link) {
+    if (!opts.voting) {
+      showError("You'll need to login to vote.");
+      return;
+    }
+
+    var id = link.attr('id');
+    if (!id) {
+      // Didn't click on one of the voting arrows.
+      return;
+    }
+    // If it is an unvote, the new vote value is 0,
+    // Otherwise it's 1 for an upvote, or -1 for a downvote.
+    var value = 0;
+    if (id.charAt(1) != 'u') {
+      value = id.charAt(0) == 'u' ? 1 : -1;
+    }
+    // The data to be sent to the server.
+    var d = {
+      comment_id: id.substring(2),
+      value: value
+    };
+
+    // Swap the vote and unvote links.
+    link.hide();
+    $('#' + id.charAt(0) + (id.charAt(1) == 'u' ? 'v' : 'u') + d.comment_id)
+      .show();
+
+    // The div the comment is displayed in.
+    var div = $('div#cd' + d.comment_id);
+    var data = div.data('comment');
+
+    // If this is not an unvote, and the other vote arrow has
+    // already been pressed, unpress it.
+    if ((d.value !== 0) && (data.vote === d.value * -1)) {
+      $('#' + (d.value == 1 ? 'd' : 'u') + 'u' + d.comment_id).hide();
+      $('#' + (d.value == 1 ? 'd' : 'u') + 'v' + d.comment_id).show();
+    }
+
+    // Update the comments rating in the local data.
+    data.rating += (data.vote === 0) ? d.value : (d.value - data.vote);
+    data.vote = d.value;
+    div.data('comment', data);
+
+    // Change the rating text.
+    div.find('.rating:first')
+      .text(data.rating + ' point' + (data.rating == 1 ? '' : 's'));
+
+    // Send the vote information to the server.
+    $.ajax({
+      type: "POST",
+      url: opts.processVoteURL,
+      data: d,
+      error: function(request, textStatus, error) {
+        showError('Oops, there was a problem casting that vote.');
+      }
+    });
+  }
+
+  /**
+   * Open a reply form used to reply to an existing comment.
+   */
+  function openReply(id) {
+    // Swap out the reply link for the hide link
+    $('#rl' + id).hide();
+    $('#cr' + id).show();
+
+    // Add the reply li to the children ul.
+    var div = $(renderTemplate(replyTemplate, {id: id})).hide();
+    $('#cl' + id)
+      .prepend(div)
+      // Setup the submit handler for the reply form.
+      .find('#rf' + id)
+      .submit(function(event) {
+        event.preventDefault();
+        addComment($('#rf' + id));
+        closeReply(id);
+      })
+      .find('input[type=button]')
+      .click(function() {
+        closeReply(id);
+      });
+    div.slideDown('fast', function() {
+      $('#rf' + id).find('textarea').focus();
+    });
+  }
+
+  /**
+   * Close the reply form opened with openReply.
+   */
+  function closeReply(id) {
+    // Remove the reply div from the DOM.
+    $('#rd' + id).slideUp('fast', function() {
+      $(this).remove();
+    });
+
+    // Swap out the hide link for the reply link
+    $('#cr' + id).hide();
+    $('#rl' + id).show();
+  }
+
+  /**
+   * Recursively sort a tree of comments using the comp comparator.
+   */
+  function sortComments(comments) {
+    comments.sort(comp);
+    $.each(comments, function() {
+      this.children = sortComments(this.children);
+    });
+    return comments;
+  }
+
+  /**
+   * Get the children comments from a ul. If recursive is true,
+   * recursively include childrens' children.
+   */
+  function getChildren(ul, recursive) {
+    var children = [];
+    ul.children().children("[id^='cd']")
+      .each(function() {
+        var comment = $(this).data('comment');
+        if (recursive)
+          comment.children = getChildren($(this).find('#cl' + comment.id), true);
+        children.push(comment);
+      });
+    return children;
+  }
+
+  /** Create a div to display a comment in. */
+  function createCommentDiv(comment) {
+    if (!comment.displayed && !opts.moderator) {
+      return $('<div class="moderate">Thank you!  Your comment will show up '
+               + 'once it is has been approved by a moderator.</div>');
+    }
+    // Prettify the comment rating.
+    comment.pretty_rating = comment.rating + ' point' +
+      (comment.rating == 1 ? '' : 's');
+    // Make a class (for displaying not yet moderated comments differently)
+    comment.css_class = comment.displayed ? '' : ' moderate';
+    // Create a div for this comment.
+    var context = $.extend({}, opts, comment);
+    var div = $(renderTemplate(commentTemplate, context));
+
+    // If the user has voted on this comment, highlight the correct arrow.
+    if (comment.vote) {
+      var direction = (comment.vote == 1) ? 'u' : 'd';
+      div.find('#' + direction + 'v' + comment.id).hide();
+      div.find('#' + direction + 'u' + comment.id).show();
+    }
+
+    if (opts.moderator || comment.text != '[deleted]') {
+      div.find('a.reply').show();
+      if (comment.proposal_diff)
+        div.find('#sp' + comment.id).show();
+      if (opts.moderator && !comment.displayed)
+        div.find('#cm' + comment.id).show();
+      if (opts.moderator || (opts.username == comment.username))
+        div.find('#dc' + comment.id).show();
+    }
+    return div;
+  }
+
+  /**
+   * A simple template renderer. Placeholders such as <%id%> are replaced
+   * by context['id'] with items being escaped. Placeholders such as <#id#>
+   * are not escaped.
+   */
+  function renderTemplate(template, context) {
+    var esc = $(document.createElement('div'));
+
+    function handle(ph, escape) {
+      var cur = context;
+      $.each(ph.split('.'), function() {
+        cur = cur[this];
+      });
+      return escape ? esc.text(cur || "").html() : cur;
+    }
+
+    return template.replace(/<([%#])([\w\.]*)\1>/g, function() {
+      return handle(arguments[2], arguments[1] == '%' ? true : false);
+    });
+  }
+
+  /** Flash an error message briefly. */
+  function showError(message) {
+    $(document.createElement('div')).attr({'class': 'popup-error'})
+      .append($(document.createElement('div'))
+               .attr({'class': 'error-message'}).text(message))
+      .appendTo('body')
+      .fadeIn("slow")
+      .delay(2000)
+      .fadeOut("slow");
+  }
+
+  /** Add a link the user uses to open the comments popup. */
+  $.fn.comment = function() {
+    return this.each(function() {
+      var id = $(this).attr('id').substring(1);
+      var count = COMMENT_METADATA[id];
+      var title = count + ' comment' + (count == 1 ? '' : 's');
+      var image = count > 0 ? opts.commentBrightImage : opts.commentImage;
+      var addcls = count == 0 ? ' nocomment' : '';
+      $(this)
+        .append(
+          $(document.createElement('a')).attr({
+            href: '#',
+            'class': 'sphinx-comment-open' + addcls,
+            id: 'ao' + id
+          })
+            .append($(document.createElement('img')).attr({
+              src: image,
+              alt: 'comment',
+              title: title
+            }))
+            .click(function(event) {
+              event.preventDefault();
+              show($(this).attr('id').substring(2));
+            })
+        )
+        .append(
+          $(document.createElement('a')).attr({
+            href: '#',
+            'class': 'sphinx-comment-close hidden',
+            id: 'ah' + id
+          })
+            .append($(document.createElement('img')).attr({
+              src: opts.closeCommentImage,
+              alt: 'close',
+              title: 'close'
+            }))
+            .click(function(event) {
+              event.preventDefault();
+              hide($(this).attr('id').substring(2));
+            })
+        );
+    });
+  };
+
+  var opts = {
+    processVoteURL: '/_process_vote',
+    addCommentURL: '/_add_comment',
+    getCommentsURL: '/_get_comments',
+    acceptCommentURL: '/_accept_comment',
+    deleteCommentURL: '/_delete_comment',
+    commentImage: '/static/_static/comment.png',
+    closeCommentImage: '/static/_static/comment-close.png',
+    loadingImage: '/static/_static/ajax-loader.gif',
+    commentBrightImage: '/static/_static/comment-bright.png',
+    upArrow: '/static/_static/up.png',
+    downArrow: '/static/_static/down.png',
+    upArrowPressed: '/static/_static/up-pressed.png',
+    downArrowPressed: '/static/_static/down-pressed.png',
+    voting: false,
+    moderator: false
+  };
+
+  if (typeof COMMENT_OPTIONS != "undefined") {
+    opts = jQuery.extend(opts, COMMENT_OPTIONS);
+  }
+
+  var popupTemplate = '\
+    <div class="sphinx-comments" id="sc<%id%>">\
+      <p class="sort-options">\
+        Sort by:\
+        <a href="#" class="sort-option byrating">best rated</a>\
+        <a href="#" class="sort-option byascage">newest</a>\
+        <a href="#" class="sort-option byage">oldest</a>\
+      </p>\
+      <div class="comment-header">Comments</div>\
+      <div class="comment-loading" id="cn<%id%>">\
+        loading comments... <img src="<%loadingImage%>" alt="" /></div>\
+      <ul id="cl<%id%>" class="comment-ul"></ul>\
+      <div id="ca<%id%>">\
+      <p class="add-a-comment">Add a comment\
+        (<a href="#" class="comment-markup" id="ab<%id%>">markup</a>):</p>\
+      <div class="comment-markup-box" id="mb<%id%>">\
+        reStructured text markup: <i>*emph*</i>, <b>**strong**</b>, \
+        <tt>``code``</tt>, \
+        code blocks: <tt>::</tt> and an indented block after blank line</div>\
+      <form method="post" id="cf<%id%>" class="comment-form" action="">\
+        <textarea name="comment" cols="80"></textarea>\
+        <p class="propose-button">\
+          <a href="#" id="pc<%id%>" class="show-propose-change">\
+            Propose a change ▹\
+          </a>\
+          <a href="#" id="hc<%id%>" class="hide-propose-change">\
+            Propose a change ▿\
+          </a>\
+        </p>\
+        <textarea name="proposal" id="pt<%id%>" cols="80"\
+                  spellcheck="false"></textarea>\
+        <input type="submit" value="Add comment" />\
+        <input type="hidden" name="node" value="<%id%>" />\
+        <input type="hidden" name="parent" value="" />\
+      </form>\
+      </div>\
+    </div>';
+
+  var commentTemplate = '\
+    <div id="cd<%id%>" class="sphinx-comment<%css_class%>">\
+      <div class="vote">\
+        <div class="arrow">\
+          <a href="#" id="uv<%id%>" class="vote" title="vote up">\
+            <img src="<%upArrow%>" />\
+          </a>\
+          <a href="#" id="uu<%id%>" class="un vote" title="vote up">\
+            <img src="<%upArrowPressed%>" />\
+          </a>\
+        </div>\
+        <div class="arrow">\
+          <a href="#" id="dv<%id%>" class="vote" title="vote down">\
+            <img src="<%downArrow%>" id="da<%id%>" />\
+          </a>\
+          <a href="#" id="du<%id%>" class="un vote" title="vote down">\
+            <img src="<%downArrowPressed%>" />\
+          </a>\
+        </div>\
+      </div>\
+      <div class="comment-content">\
+        <p class="tagline comment">\
+          <span class="user-id"><%username%></span>\
+          <span class="rating"><%pretty_rating%></span>\
+          <span class="delta"><%time.delta%></span>\
+        </p>\
+        <div class="comment-text comment"><#text#></div>\
+        <p class="comment-opts comment">\
+          <a href="#" class="reply hidden" id="rl<%id%>">reply ▹</a>\
+          <a href="#" class="close-reply" id="cr<%id%>">reply ▿</a>\
+          <a href="#" id="sp<%id%>" class="show-proposal">proposal ▹</a>\
+          <a href="#" id="hp<%id%>" class="hide-proposal">proposal ▿</a>\
+          <a href="#" id="dc<%id%>" class="delete-comment hidden">delete</a>\
+          <span id="cm<%id%>" class="moderation hidden">\
+            <a href="#" id="ac<%id%>" class="accept-comment">accept</a>\
+          </span>\
+        </p>\
+        <pre class="proposal" id="pr<%id%>">\
+<#proposal_diff#>\
+        </pre>\
+          <ul class="comment-children" id="cl<%id%>"></ul>\
+        </div>\
+        <div class="clearleft"></div>\
+      </div>\
+    </div>';
+
+  var replyTemplate = '\
+    <li>\
+      <div class="reply-div" id="rd<%id%>">\
+        <form id="rf<%id%>">\
+          <textarea name="comment" cols="80"></textarea>\
+          <input type="submit" value="Add reply" />\
+          <input type="button" value="Cancel" />\
+          <input type="hidden" name="parent" value="<%id%>" />\
+          <input type="hidden" name="node" value="" />\
+        </form>\
+      </div>\
+    </li>';
+
+  $(document).ready(function() {
+    init();
+  });
+})(jQuery);
+
+$(document).ready(function() {
+  // add comment anchors for all paragraphs that are commentable
+  $('.sphinx-has-comment').comment();
+
+  // highlight search words in search results
+  $("div.context").each(function() {
+    var params = $.getQueryParameters();
+    var terms = (params.q) ? params.q[0].split(/\s+/) : [];
+    var result = $(this);
+    $.each(terms, function() {
+      result.highlightText(this.toLowerCase(), 'highlighted');
+    });
+  });
+
+  // directly open comment window if requested
+  var anchor = document.location.hash;
+  if (anchor.substring(0, 9) == '#comment-') {
+    $('#ao' + anchor.substring(9)).click();
+    document.location.hash = '#s' + anchor.substring(9);
+  }
+});

Added: www-releases/trunk/3.6.0/docs/genindex.html
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/genindex.html?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/genindex.html (added)
+++ www-releases/trunk/3.6.0/docs/genindex.html Fri Feb 27 12:44:09 2015
@@ -0,0 +1,2251 @@
+
+
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+  "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+
+<html xmlns="http://www.w3.org/1999/xhtml">
+  <head>
+    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+    
+    <title>Index — LLVM 3.6 documentation</title>
+    
+    <link rel="stylesheet" href="_static/llvm-theme.css" type="text/css" />
+    <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
+    
+    <script type="text/javascript">
+      var DOCUMENTATION_OPTIONS = {
+        URL_ROOT:    './',
+        VERSION:     '3.6',
+        COLLAPSE_INDEX: false,
+        FILE_SUFFIX: '.html',
+        HAS_SOURCE:  true
+      };
+    </script>
+    <script type="text/javascript" src="_static/jquery.js"></script>
+    <script type="text/javascript" src="_static/underscore.js"></script>
+    <script type="text/javascript" src="_static/doctools.js"></script>
+    <link rel="top" title="LLVM 3.6 documentation" href="index.html" />
+<style type="text/css">
+  table.right { float: right; margin-left: 20px; }
+  table.right td { border: 1px solid #ccc; }
+</style>
+
+  </head>
+  <body>
+<div class="logo">
+  <a href="index.html">
+    <img src="_static/logo.png"
+         alt="LLVM Logo" width="250" height="88"/></a>
+</div>
+
+    <div class="related">
+      <h3>Navigation</h3>
+      <ul>
+        <li class="right" style="margin-right: 10px">
+          <a href="#" title="General Index"
+             accesskey="I">index</a></li>
+  <li><a href="http://llvm.org/">LLVM Home</a> | </li>
+  <li><a href="index.html">Documentation</a>»</li>
+ 
+      </ul>
+    </div>
+
+
+    <div class="document">
+      <div class="documentwrapper">
+          <div class="body">
+            
+
+<h1 id="index">Index</h1>
+
+<div class="genindex-jumpbox">
+ <a href="#Symbols"><strong>Symbols</strong></a>
+ | <a href="#C"><strong>C</strong></a>
+ | <a href="#L"><strong>L</strong></a>
+ | <a href="#T"><strong>T</strong></a>
+ 
+</div>
+<h2 id="Symbols">Symbols</h2>
+<table style="width: 100%" class="indextable genindextable"><tr>
+  <td style="width: 33%" valign="top"><dl>
+      
+  <dt>
+    --check-prefix prefix
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption--check-prefix">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --config-prefix=NAME
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--config-prefix">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --debug
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--debug">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --debug-syms, -a
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--debug-syms">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --defined-only
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--defined-only">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --disable-excess-fp-precision
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--disable-excess-fp-precision">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --disable-fp-elim
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--disable-fp-elim">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --dynamic, -D
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--dynamic">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --enable-no-infs-fp-math
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--enable-no-infs-fp-math">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --enable-no-nans-fp-math
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--enable-no-nans-fp-math">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --enable-unsafe-fp-math
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--enable-unsafe-fp-math">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --extern-only, -g
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--extern-only">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --format=format, -f format
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--format">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --help
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption--help">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --implicit-check-not check-pattern
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption--implicit-check-not">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --input-file filename
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption--input-file">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --load=<dso_path>
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--load">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --max-tests=N
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--max-tests">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --max-time=N
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--max-time">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --no-progress-bar
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--no-progress-bar">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --no-sort, -p
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--no-sort">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --numeric-sort, -n, -v
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--numeric-sort">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --param NAME, --param NAME=VALUE
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--param">command line option</a>, <a href="CommandGuide/lit.html#cmdoption--param">[1]</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --path=PATH
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--path">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --print-file-name, -A, -o
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--print-file-name">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --print-machineinstrs
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--print-machineinstrs">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --print-size, -S
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--print-size">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --regalloc=<allocator>
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--regalloc">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --show-suites
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--show-suites">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --show-tests
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--show-tests">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --show-unsupported
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--show-unsupported">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --show-xfail
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--show-xfail">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --shuffle
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--shuffle">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --size-sort
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--size-sort">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --spiller=<spiller>
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--spiller">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --stats
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--stats">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --strict-whitespace
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption--strict-whitespace">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --time-passes
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--time-passes">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --time-tests
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--time-tests">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --undefined-only, -u
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--undefined-only">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --vg
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--vg">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --vg-arg=ARG
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--vg-arg">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --vg-leak
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--vg-leak">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    --x86-asm-syntax=[att|intel]
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--x86-asm-syntax">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -a, --all-blocks
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-a">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -all-functions
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-all-functions">llvm-profdata-show command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -asmparsernum N
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-asmparsernum">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -asmwriternum N
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-asmwriternum">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -B    (default)
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm-B">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -b, --branch-probabilities
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-b">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -c, --branch-counts
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-c">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -class className
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-class">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -counts
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-counts">llvm-profdata-show command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -d
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-link.html#cmdoption-d">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -debug
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-debug">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -debug-dump=section
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-dwarfdump.html#cmdoption-debug-dump">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -default-arch
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-default-arch">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -demangle
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-demangle">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -disable-inlining
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-disable-inlining">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -disable-opt
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-disable-opt">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -dsym-hint=<path/to/file.dSYM>
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-dsym-hint">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -dump
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-bcanalyzer.html#cmdoption-llvm-bcanalyzer-dump">llvm-bcanalyzer command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -dyn-symbols
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-dyn-symbols">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -dynamic-table
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-dynamic-table">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -expand-relocs
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-expand-relocs">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -f
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-f">command line option</a>, <a href="CommandGuide/llvm-link.html#cmdoption-f">[1]</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -f, --function-summaries
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-f">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -file-headers, -h
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-file-headers">command line option</a>
+  </dt>
+
+      </dl></dd>
+  </dl></td>
+  <td style="width: 33%" valign="top"><dl>
+      
+  <dt>
+    -filetype=<output file type>
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-filetype">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -function=string
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-function">llvm-profdata-show command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -functions=[none|short|linkage]
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-functions">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-asm-matcher
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-asm-matcher">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-asm-writer
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-asm-writer">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-dag-isel
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-dag-isel">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-dfa-packetizer
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-dfa-packetizer">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-disassembler
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-disassembler">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-emitter
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-emitter">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-enhanced-disassembly-info
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-enhanced-disassembly-info">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-fast-isel
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-fast-isel">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-instr-info
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-instr-info">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-intrinsic
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-intrinsic">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-pseudo-lowering
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-pseudo-lowering">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-register-info
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-register-info">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-subtarget
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-subtarget">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -gen-tgt-intrinsic
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-tgt-intrinsic">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -h, --help
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption-h">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -help
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption-help">command line option</a>, <a href="CommandGuide/llvm-readobj.html#cmdoption-help">[1]</a>, <a href="CommandGuide/opt.html#cmdoption-help">[2]</a>, <a href="CommandGuide/llc.html#cmdoption-help">[3]</a>, <a href="CommandGuide/llvm-link.html#cmdoption-help">[4]</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-bcanalyzer.html#cmdoption-llvm-bcanalyzer-help">llvm-bcanalyzer command line option</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm-help">llvm-nm command line option</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-help">llvm-profdata-merge command line option</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-help">llvm-profdata-show command line option</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-help">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -I directory
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-I">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -inlining
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-inlining">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -j N, --threads=N
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption-j">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -l, --long-file-names
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-l">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -load=<plugin>
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-load">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -march=<arch>
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-march">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -mattr=a1,+a2,-a3,...
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-mattr">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -mcpu=<cpuname>
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-mcpu">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -mtriple=<target triple>
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-mtriple">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -n, --no-output
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-n">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -needed-libs
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-needed-libs">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -nodetails
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-bcanalyzer.html#cmdoption-llvm-bcanalyzer-nodetails">llvm-bcanalyzer command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -o <filename>
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-o">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -o filename
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-stress.html#cmdoption-o">command line option</a>, <a href="CommandGuide/llvm-link.html#cmdoption-o">[1]</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-o">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -o=<DIR|FILE>, --object-directory=<DIR>, --object-file=<FILE>
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-o">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -O=uint
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-O">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -obj
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-obj">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -output=output, -o=output
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-output">llvm-profdata-merge command line option</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-output">llvm-profdata-show command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -P
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm-P">llvm-nm command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -p
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-p">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -p, --preserve-paths
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-p">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -print-enums
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-print-enums">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -print-records
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-print-records">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -print-sets
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-print-sets">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -program-headers
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-program-headers">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -q, --quiet
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption-q">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -relocations, -r
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-relocations">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -S
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-S">command line option</a>, <a href="CommandGuide/llvm-link.html#cmdoption-S">[1]</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -s, --succinct
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption-s">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -section-data, -sd
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-section-data">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -section-relocations, -sr
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-section-relocations">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -section-symbols, -st
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-section-symbols">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -sections, -s
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-sections">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -seed seed
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-stress.html#cmdoption-seed">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -size size
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-stress.html#cmdoption-size">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -stats
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-stats">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -strip-debug
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-strip-debug">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -symbols, -t
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-symbols">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -time-passes
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-time-passes">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -u, --unconditional-branches
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-u">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -unwind, -u
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-unwind">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -use-symbol-table
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-use-symbol-table">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -v
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-link.html#cmdoption-v">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -v, --verbose
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption-v">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -verify
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-bcanalyzer.html#cmdoption-llvm-bcanalyzer-verify">llvm-bcanalyzer command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -verify-each
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-verify-each">command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -version
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption-version">command line option</a>, <a href="CommandGuide/llvm-readobj.html#cmdoption-version">[1]</a>, <a href="CommandGuide/llvm-cov.html#cmdoption-version">[2]</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-version">tblgen command line option</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    -{passname}
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-">command line option</a>
+  </dt>
+
+      </dl></dd>
+  </dl></td>
+</tr></table>
+
+<h2 id="C">C</h2>
+<table style="width: 100%" class="indextable genindextable"><tr>
+  <td style="width: 33%" valign="top"><dl>
+      
+  <dt>
+    command line option
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption--check-prefix">--check-prefix prefix</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--config-prefix">--config-prefix=NAME</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--debug">--debug</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--disable-excess-fp-precision">--disable-excess-fp-precision</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--disable-fp-elim">--disable-fp-elim</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--enable-no-infs-fp-math">--enable-no-infs-fp-math</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--enable-no-nans-fp-math">--enable-no-nans-fp-math</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--enable-unsafe-fp-math">--enable-unsafe-fp-math</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption--help">--help</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption--implicit-check-not">--implicit-check-not check-pattern</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption--input-file">--input-file filename</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--load">--load=<dso_path></a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--max-tests">--max-tests=N</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--max-time">--max-time=N</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--no-progress-bar">--no-progress-bar</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--param">--param NAME, --param NAME=VALUE</a>, <a href="CommandGuide/lit.html#cmdoption--param">[1]</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--path">--path=PATH</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--print-machineinstrs">--print-machineinstrs</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--regalloc">--regalloc=<allocator></a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--show-suites">--show-suites</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--show-tests">--show-tests</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--show-unsupported">--show-unsupported</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--show-xfail">--show-xfail</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--shuffle">--shuffle</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--spiller">--spiller=<spiller></a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--stats">--stats</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption--strict-whitespace">--strict-whitespace</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--time-passes">--time-passes</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--time-tests">--time-tests</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--vg">--vg</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--vg-arg">--vg-arg=ARG</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption--vg-leak">--vg-leak</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption--x86-asm-syntax">--x86-asm-syntax=[att|intel]</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-O">-O=uint</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-S">-S</a>, <a href="CommandGuide/llvm-link.html#cmdoption-S">[1]</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-a">-a, --all-blocks</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-b">-b, --branch-probabilities</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-c">-c, --branch-counts</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-link.html#cmdoption-d">-d</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-debug">-debug</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-dwarfdump.html#cmdoption-debug-dump">-debug-dump=section</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-default-arch">-default-arch</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-demangle">-demangle</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-disable-inlining">-disable-inlining</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-disable-opt">-disable-opt</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-dsym-hint">-dsym-hint=<path/to/file.dSYM></a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-dyn-symbols">-dyn-symbols</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-dynamic-table">-dynamic-table</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-expand-relocs">-expand-relocs</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-f">-f</a>, <a href="CommandGuide/llvm-link.html#cmdoption-f">[1]</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-f">-f, --function-summaries</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-file-headers">-file-headers, -h</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-filetype">-filetype=<output file type></a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-functions">-functions=[none|short|linkage]</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption-h">-h, --help</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption-help">-help</a>, <a href="CommandGuide/llvm-readobj.html#cmdoption-help">[1]</a>, <a href="CommandGuide/opt.html#cmdoption-help">[2]</a>, <a href="CommandGuide/llc.html#cmdoption-help">[3]</a>, <a href="CommandGuide/llvm-link.html#cmdoption-help">[4]</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-inlining">-inlining</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption-j">-j N, --threads=N</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-l">-l, --long-file-names</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-load">-load=<plugin></a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-march">-march=<arch></a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-mattr">-mattr=a1,+a2,-a3,...</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-mcpu">-mcpu=<cpuname></a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llc.html#cmdoption-mtriple">-mtriple=<target triple></a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-n">-n, --no-output</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-needed-libs">-needed-libs</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-o">-o <filename></a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-stress.html#cmdoption-o">-o filename</a>, <a href="CommandGuide/llvm-link.html#cmdoption-o">[1]</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-o">-o=<DIR|FILE>, --object-directory=<DIR>, --object-file=<FILE></a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-obj">-obj</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-p">-p</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-p">-p, --preserve-paths</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-program-headers">-program-headers</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption-q">-q, --quiet</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-relocations">-relocations, -r</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption-s">-s, --succinct</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-section-data">-section-data, -sd</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-section-relocations">-section-relocations, -sr</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-section-symbols">-section-symbols, -st</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-sections">-sections, -s</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-stress.html#cmdoption-seed">-seed seed</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-stress.html#cmdoption-size">-size size</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-stats">-stats</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-strip-debug">-strip-debug</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-symbols">-symbols, -t</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-time-passes">-time-passes</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-cov.html#cmdoption-u">-u, --unconditional-branches</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-readobj.html#cmdoption-unwind">-unwind, -u</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-symbolizer.html#cmdoption-use-symbol-table">-use-symbol-table</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-link.html#cmdoption-v">-v</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/lit.html#cmdoption-v">-v, --verbose</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-verify-each">-verify-each</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/FileCheck.html#cmdoption-version">-version</a>, <a href="CommandGuide/llvm-readobj.html#cmdoption-version">[1]</a>, <a href="CommandGuide/llvm-cov.html#cmdoption-version">[2]</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/opt.html#cmdoption-">-{passname}</a>
+  </dt>
+
+      </dl></dd>
+  </dl></td>
+</tr></table>
+
+<h2 id="L">L</h2>
+<table style="width: 100%" class="indextable genindextable"><tr>
+  <td style="width: 33%" valign="top"><dl>
+      
+  <dt>
+    llvm-bcanalyzer command line option
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-bcanalyzer.html#cmdoption-llvm-bcanalyzer-dump">-dump</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-bcanalyzer.html#cmdoption-llvm-bcanalyzer-help">-help</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-bcanalyzer.html#cmdoption-llvm-bcanalyzer-nodetails">-nodetails</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-bcanalyzer.html#cmdoption-llvm-bcanalyzer-verify">-verify</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    llvm-nm command line option
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--debug-syms">--debug-syms, -a</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--defined-only">--defined-only</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--dynamic">--dynamic, -D</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--extern-only">--extern-only, -g</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--format">--format=format, -f format</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--no-sort">--no-sort, -p</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--numeric-sort">--numeric-sort, -n, -v</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--print-file-name">--print-file-name, -A, -o</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--print-size">--print-size, -S</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--size-sort">--size-sort</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm--undefined-only">--undefined-only, -u</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm-B">-B    (default)</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm-P">-P</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-nm.html#cmdoption-llvm-nm-help">-help</a>
+  </dt>
+
+      </dl></dd>
+  </dl></td>
+  <td style="width: 33%" valign="top"><dl>
+      
+  <dt>
+    llvm-profdata-merge command line option
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-help">-help</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-output">-output=output, -o=output</a>
+  </dt>
+
+      </dl></dd>
+      
+  <dt>
+    llvm-profdata-show command line option
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-all-functions">-all-functions</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-counts">-counts</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-function">-function=string</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-help">-help</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-output">-output=output, -o=output</a>
+  </dt>
+
+      </dl></dd>
+  </dl></td>
+</tr></table>
+
+<h2 id="T">T</h2>
+<table style="width: 100%" class="indextable genindextable"><tr>
+  <td style="width: 33%" valign="top"><dl>
+      
+  <dt>
+    tblgen command line option
+  </dt>
+
+      <dd><dl>
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-I">-I directory</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-asmparsernum">-asmparsernum N</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-asmwriternum">-asmwriternum N</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-class">-class className</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-asm-matcher">-gen-asm-matcher</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-asm-writer">-gen-asm-writer</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-dag-isel">-gen-dag-isel</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-dfa-packetizer">-gen-dfa-packetizer</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-disassembler">-gen-disassembler</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-emitter">-gen-emitter</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-enhanced-disassembly-info">-gen-enhanced-disassembly-info</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-fast-isel">-gen-fast-isel</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-instr-info">-gen-instr-info</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-intrinsic">-gen-intrinsic</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-pseudo-lowering">-gen-pseudo-lowering</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-register-info">-gen-register-info</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-subtarget">-gen-subtarget</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-gen-tgt-intrinsic">-gen-tgt-intrinsic</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-help">-help</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-o">-o filename</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-print-enums">-print-enums</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-print-records">-print-records</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-print-sets">-print-sets</a>
+  </dt>
+
+        
+  <dt><a href="CommandGuide/tblgen.html#cmdoption-tblgen-version">-version</a>
+  </dt>
+
+      </dl></dd>
+  </dl></td>
+</tr></table>
+
+
+
+          </div>
+      </div>
+      <div class="clearer"></div>
+    </div>
+    <div class="related">
+      <h3>Navigation</h3>
+      <ul>
+        <li class="right" style="margin-right: 10px">
+          <a href="#" title="General Index"
+             >index</a></li>
+  <li><a href="http://llvm.org/">LLVM Home</a> | </li>
+  <li><a href="index.html">Documentation</a>»</li>
+ 
+      </ul>
+    </div>
+    <div class="footer">
+        © Copyright 2003-2014, LLVM Project.
+      Last updated on 2015-02-27.
+      Created using <a href="http://sphinx-doc.org/">Sphinx</a> 1.2.2.
+    </div>
+  </body>
+</html>
\ No newline at end of file

Added: www-releases/trunk/3.6.0/docs/index.html
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/index.html?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/index.html (added)
+++ www-releases/trunk/3.6.0/docs/index.html Fri Feb 27 12:44:09 2015
@@ -0,0 +1,377 @@
+
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+  "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+
+<html xmlns="http://www.w3.org/1999/xhtml">
+  <head>
+    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+    
+    <title>Overview — LLVM 3.6 documentation</title>
+    
+    <link rel="stylesheet" href="_static/llvm-theme.css" type="text/css" />
+    <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
+    
+    <script type="text/javascript">
+      var DOCUMENTATION_OPTIONS = {
+        URL_ROOT:    './',
+        VERSION:     '3.6',
+        COLLAPSE_INDEX: false,
+        FILE_SUFFIX: '.html',
+        HAS_SOURCE:  true
+      };
+    </script>
+    <script type="text/javascript" src="_static/jquery.js"></script>
+    <script type="text/javascript" src="_static/underscore.js"></script>
+    <script type="text/javascript" src="_static/doctools.js"></script>
+    <link rel="top" title="LLVM 3.6 documentation" href="#" />
+    <link rel="next" title="LLVM Language Reference Manual" href="LangRef.html" />
+<style type="text/css">
+  table.right { float: right; margin-left: 20px; }
+  table.right td { border: 1px solid #ccc; }
+</style>
+
+  </head>
+  <body>
+<div class="logo">
+  <a href="#">
+    <img src="_static/logo.png"
+         alt="LLVM Logo" width="250" height="88"/></a>
+</div>
+
+    <div class="related">
+      <h3>Navigation</h3>
+      <ul>
+        <li class="right" style="margin-right: 10px">
+          <a href="genindex.html" title="General Index"
+             accesskey="I">index</a></li>
+        <li class="right" >
+          <a href="LangRef.html" title="LLVM Language Reference Manual"
+             accesskey="N">next</a> |</li>
+  <li><a href="http://llvm.org/">LLVM Home</a> | </li>
+  <li><a href="#">Documentation</a>»</li>
+ 
+      </ul>
+    </div>
+
+
+    <div class="document">
+      <div class="documentwrapper">
+          <div class="body">
+            
+  <div class="section" id="overview">
+<h1>Overview<a class="headerlink" href="#overview" title="Permalink to this headline">¶</a></h1>
+<p>The LLVM compiler infrastructure supports a wide range of projects, from
+industrial strength compilers to specialized JIT applications to small
+research projects.</p>
+<p>Similarly, documentation is broken down into several high-level groupings
+targeted at different audiences:</p>
+</div>
+<div class="section" id="llvm-design-overview">
+<h1>LLVM Design & Overview<a class="headerlink" href="#llvm-design-overview" title="Permalink to this headline">¶</a></h1>
+<p>Several introductory papers and presentations.</p>
+<div class="toctree-wrapper compound">
+</div>
+<dl class="docutils">
+<dt><a class="reference internal" href="LangRef.html"><em>LLVM Language Reference Manual</em></a></dt>
+<dd>Defines the LLVM intermediate representation.</dd>
+<dt><a class="reference external" href="http://llvm.org/pubs/2008-10-04-ACAT-LLVM-Intro.html">Introduction to the LLVM Compiler</a></dt>
+<dd>Presentation providing a users introduction to LLVM.</dd>
+<dt><a class="reference external" href="http://www.aosabook.org/en/llvm.html">Intro to LLVM</a></dt>
+<dd>Book chapter providing a compiler hacker’s introduction to LLVM.</dd>
+<dt><a class="reference external" href="http://llvm.org/pubs/2004-01-30-CGO-LLVM.html">LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation</a></dt>
+<dd>Design overview.</dd>
+<dt><a class="reference external" href="http://llvm.org/pubs/2002-12-LattnerMSThesis.html">LLVM: An Infrastructure for Multi-Stage Optimization</a></dt>
+<dd>More details (quite old now).</dd>
+<dt><a class="reference external" href="http://llvm.org/pubs">Publications mentioning LLVM</a></dt>
+<dd></dd>
+</dl>
+</div>
+<div class="section" id="user-guides">
+<h1>User Guides<a class="headerlink" href="#user-guides" title="Permalink to this headline">¶</a></h1>
+<p>For those new to the LLVM system.</p>
+<p>NOTE: If you are a user who is only interested in using LLVM-based
+compilers, you should look into <a class="reference external" href="http://clang.llvm.org">Clang</a> or
+<a class="reference external" href="http://dragonegg.llvm.org">DragonEgg</a> instead. The documentation here is
+intended for users who have a need to work with the intermediate LLVM
+representation.</p>
+<div class="toctree-wrapper compound">
+</div>
+<dl class="docutils">
+<dt><a class="reference internal" href="GettingStarted.html"><em>Getting Started with the LLVM System</em></a></dt>
+<dd>Discusses how to get up and running quickly with the LLVM infrastructure.
+Everything from unpacking and compilation of the distribution to execution
+of some tools.</dd>
+<dt><a class="reference internal" href="CMake.html"><em>Building LLVM with CMake</em></a></dt>
+<dd>An addendum to the main Getting Started guide for those using the <a class="reference external" href="http://www.cmake.org">CMake
+build system</a>.</dd>
+<dt><a class="reference internal" href="HowToBuildOnARM.html"><em>How To Build On ARM</em></a></dt>
+<dd>Notes on building and testing LLVM/Clang on ARM.</dd>
+<dt><a class="reference internal" href="HowToCrossCompileLLVM.html"><em>How To Cross-Compile Clang/LLVM using Clang/LLVM</em></a></dt>
+<dd>Notes on cross-building and testing LLVM/Clang.</dd>
+<dt><a class="reference internal" href="GettingStartedVS.html"><em>Getting Started with the LLVM System using Microsoft Visual Studio</em></a></dt>
+<dd>An addendum to the main Getting Started guide for those using Visual Studio
+on Windows.</dd>
+<dt><a class="reference internal" href="tutorial/index.html"><em>LLVM Tutorial: Table of Contents</em></a></dt>
+<dd>Tutorials about using LLVM. Includes a tutorial about making a custom
+language with LLVM.</dd>
+<dt><a class="reference internal" href="CommandGuide/index.html"><em>LLVM Command Guide</em></a></dt>
+<dd>A reference manual for the LLVM command line utilities (“man” pages for LLVM
+tools).</dd>
+<dt><a class="reference internal" href="Passes.html"><em>LLVM’s Analysis and Transform Passes</em></a></dt>
+<dd>A list of optimizations and analyses implemented in LLVM.</dd>
+<dt><a class="reference internal" href="FAQ.html"><em>Frequently Asked Questions (FAQ)</em></a></dt>
+<dd>A list of common questions and problems and their solutions.</dd>
+<dt><a class="reference internal" href="ReleaseNotes.html"><em>Release notes for the current release</em></a></dt>
+<dd>This describes new features, known bugs, and other limitations.</dd>
+<dt><a class="reference internal" href="HowToSubmitABug.html"><em>How to submit an LLVM bug report</em></a></dt>
+<dd>Instructions for properly submitting information about any bugs you run into
+in the LLVM system.</dd>
+<dt><a class="reference internal" href="SphinxQuickstartTemplate.html"><em>Sphinx Quickstart Template</em></a></dt>
+<dd>A template + tutorial for writing new Sphinx documentation. It is meant
+to be read in source form.</dd>
+<dt><a class="reference internal" href="TestingGuide.html"><em>LLVM Testing Infrastructure Guide</em></a></dt>
+<dd>A reference manual for using the LLVM testing infrastructure.</dd>
+<dt><a class="reference external" href="http://clang.llvm.org/get_started.html">How to build the C, C++, ObjC, and ObjC++ front end</a></dt>
+<dd>Instructions for building the clang front-end from source.</dd>
+<dt><a class="reference internal" href="Lexicon.html"><em>The LLVM Lexicon</em></a></dt>
+<dd>Definition of acronyms, terms and concepts used in LLVM.</dd>
+<dt><a class="reference internal" href="HowToAddABuilder.html"><em>How To Add Your Build Configuration To LLVM Buildbot Infrastructure</em></a></dt>
+<dd>Instructions for adding new builder to LLVM buildbot master.</dd>
+<dt><a class="reference internal" href="YamlIO.html"><em>YAML I/O</em></a></dt>
+<dd>A reference guide for using LLVM’s YAML I/O library.</dd>
+<dt><a class="reference internal" href="GetElementPtr.html"><em>The Often Misunderstood GEP Instruction</em></a></dt>
+<dd>Answers to some very frequent questions about LLVM’s most frequently
+misunderstood instruction.</dd>
+</dl>
+</div>
+<div class="section" id="programming-documentation">
+<h1>Programming Documentation<a class="headerlink" href="#programming-documentation" title="Permalink to this headline">¶</a></h1>
+<p>For developers of applications which use LLVM as a library.</p>
+<div class="toctree-wrapper compound">
+</div>
+<dl class="docutils">
+<dt><a class="reference internal" href="LangRef.html"><em>LLVM Language Reference Manual</em></a></dt>
+<dd>Defines the LLVM intermediate representation and the assembly form of the
+different nodes.</dd>
+<dt><a class="reference internal" href="Atomics.html"><em>LLVM Atomic Instructions and Concurrency Guide</em></a></dt>
+<dd>Information about LLVM’s concurrency model.</dd>
+<dt><a class="reference internal" href="ProgrammersManual.html"><em>LLVM Programmer’s Manual</em></a></dt>
+<dd>Introduction to the general layout of the LLVM sourcebase, important classes
+and APIs, and some tips & tricks.</dd>
+<dt><a class="reference internal" href="Extensions.html"><em>LLVM Extensions</em></a></dt>
+<dd>LLVM-specific extensions to tools and formats LLVM seeks compatibility with.</dd>
+<dt><a class="reference internal" href="CommandLine.html"><em>CommandLine 2.0 Library Manual</em></a></dt>
+<dd>Provides information on using the command line parsing library.</dd>
+<dt><a class="reference internal" href="CodingStandards.html"><em>LLVM Coding Standards</em></a></dt>
+<dd>Details the LLVM coding standards and provides useful information on writing
+efficient C++ code.</dd>
+<dt><a class="reference internal" href="HowToSetUpLLVMStyleRTTI.html"><em>How to set up LLVM-style RTTI for your class hierarchy</em></a></dt>
+<dd>How to make <tt class="docutils literal"><span class="pre">isa<></span></tt>, <tt class="docutils literal"><span class="pre">dyn_cast<></span></tt>, etc. available for clients of your
+class hierarchy.</dd>
+<dt><a class="reference internal" href="ExtendingLLVM.html"><em>Extending LLVM: Adding instructions, intrinsics, types, etc.</em></a></dt>
+<dd>Look here to see how to add instructions and intrinsics to LLVM.</dd>
+<dt><a class="reference external" href="http://llvm.org/doxygen/">Doxygen generated documentation</a></dt>
+<dd>(<a class="reference external" href="http://llvm.org/doxygen/inherits.html">classes</a>)
+(<a class="reference external" href="http://llvm.org/doxygen/doxygen.tar.gz">tarball</a>)</dd>
+</dl>
+<p><a class="reference external" href="http://godoc.org/llvm.org/llvm/bindings/go/llvm">Documentation for Go bindings</a></p>
+<dl class="docutils">
+<dt><a class="reference external" href="http://llvm.org/viewvc/">ViewVC Repository Browser</a></dt>
+<dd></dd>
+<dt><a class="reference internal" href="CompilerWriterInfo.html"><em>Architecture & Platform Information for Compiler Writers</em></a></dt>
+<dd>A list of helpful links for compiler writers.</dd>
+</dl>
+</div>
+<div class="section" id="subsystem-documentation">
+<h1>Subsystem Documentation<a class="headerlink" href="#subsystem-documentation" title="Permalink to this headline">¶</a></h1>
+<p>For API clients and LLVM developers.</p>
+<div class="toctree-wrapper compound">
+</div>
+<dl class="docutils">
+<dt><a class="reference internal" href="WritingAnLLVMPass.html"><em>Writing an LLVM Pass</em></a></dt>
+<dd>Information on how to write LLVM transformations and analyses.</dd>
+<dt><a class="reference internal" href="WritingAnLLVMBackend.html"><em>Writing an LLVM Backend</em></a></dt>
+<dd>Information on how to write LLVM backends for machine targets.</dd>
+<dt><a class="reference internal" href="CodeGenerator.html"><em>The LLVM Target-Independent Code Generator</em></a></dt>
+<dd>The design and implementation of the LLVM code generator.  Useful if you are
+working on retargetting LLVM to a new architecture, designing a new codegen
+pass, or enhancing existing components.</dd>
+<dt><a class="reference internal" href="TableGen/index.html"><em>TableGen</em></a></dt>
+<dd>Describes the TableGen tool, which is used heavily by the LLVM code
+generator.</dd>
+<dt><a class="reference internal" href="AliasAnalysis.html"><em>LLVM Alias Analysis Infrastructure</em></a></dt>
+<dd>Information on how to write a new alias analysis implementation or how to
+use existing analyses.</dd>
+<dt><a class="reference internal" href="GarbageCollection.html"><em>Accurate Garbage Collection with LLVM</em></a></dt>
+<dd>The interfaces source-language compilers should use for compiling GC’d
+programs.</dd>
+<dt><a class="reference internal" href="SourceLevelDebugging.html"><em>Source Level Debugging with LLVM</em></a></dt>
+<dd>This document describes the design and philosophy behind the LLVM
+source-level debugger.</dd>
+<dt><a class="reference internal" href="Vectorizers.html"><em>Auto-Vectorization in LLVM</em></a></dt>
+<dd>This document describes the current status of vectorization in LLVM.</dd>
+<dt><a class="reference internal" href="ExceptionHandling.html"><em>Exception Handling in LLVM</em></a></dt>
+<dd>This document describes the design and implementation of exception handling
+in LLVM.</dd>
+<dt><a class="reference internal" href="Bugpoint.html"><em>LLVM bugpoint tool: design and usage</em></a></dt>
+<dd>Automatic bug finder and test-case reducer description and usage
+information.</dd>
+<dt><a class="reference internal" href="BitCodeFormat.html"><em>LLVM Bitcode File Format</em></a></dt>
+<dd>This describes the file format and encoding used for LLVM “bc” files.</dd>
+<dt><a class="reference internal" href="SystemLibrary.html"><em>System Library</em></a></dt>
+<dd>This document describes the LLVM System Library (<tt class="docutils literal"><span class="pre">lib/System</span></tt>) and
+how to keep LLVM source code portable</dd>
+<dt><a class="reference internal" href="LinkTimeOptimization.html"><em>LLVM Link Time Optimization: Design and Implementation</em></a></dt>
+<dd>This document describes the interface between LLVM intermodular optimizer
+and the linker and its design</dd>
+<dt><a class="reference internal" href="GoldPlugin.html"><em>The LLVM gold plugin</em></a></dt>
+<dd>How to build your programs with link-time optimization on Linux.</dd>
+<dt><a class="reference internal" href="DebuggingJITedCode.html"><em>Debugging JIT-ed Code With GDB</em></a></dt>
+<dd>How to debug JITed code with GDB.</dd>
+<dt><a class="reference internal" href="MCJITDesignAndImplementation.html"><em>MCJIT Design and Implementation</em></a></dt>
+<dd>Describes the inner workings of MCJIT execution engine.</dd>
+<dt><a class="reference internal" href="BranchWeightMetadata.html"><em>LLVM Branch Weight Metadata</em></a></dt>
+<dd>Provides information about Branch Prediction Information.</dd>
+<dt><a class="reference internal" href="BlockFrequencyTerminology.html"><em>LLVM Block Frequency Terminology</em></a></dt>
+<dd>Provides information about terminology used in the <tt class="docutils literal"><span class="pre">BlockFrequencyInfo</span></tt>
+analysis pass.</dd>
+<dt><a class="reference internal" href="SegmentedStacks.html"><em>Segmented Stacks in LLVM</em></a></dt>
+<dd>This document describes segmented stacks and how they are used in LLVM.</dd>
+<dt><a class="reference internal" href="MarkedUpDisassembly.html"><em>LLVM’s Optional Rich Disassembly Output</em></a></dt>
+<dd>This document describes the optional rich disassembly output syntax.</dd>
+<dt><a class="reference internal" href="HowToUseAttributes.html"><em>How To Use Attributes</em></a></dt>
+<dd>Answers some questions about the new Attributes infrastructure.</dd>
+<dt><a class="reference internal" href="NVPTXUsage.html"><em>User Guide for NVPTX Back-end</em></a></dt>
+<dd>This document describes using the NVPTX back-end to compile GPU kernels.</dd>
+<dt><a class="reference internal" href="R600Usage.html"><em>User Guide for R600 Back-end</em></a></dt>
+<dd>This document describes how to use the R600 back-end.</dd>
+<dt><a class="reference internal" href="StackMaps.html"><em>Stack maps and patch points in LLVM</em></a></dt>
+<dd>LLVM support for mapping instruction addresses to the location of
+values and allowing code to be patched.</dd>
+<dt><a class="reference internal" href="BigEndianNEON.html"><em>Using ARM NEON instructions in big endian mode</em></a></dt>
+<dd>LLVM’s support for generating NEON instructions on big endian ARM targets is
+somewhat nonintuitive. This document explains the implementation and rationale.</dd>
+<dt><a class="reference internal" href="CoverageMappingFormat.html"><em>LLVM Code Coverage Mapping Format</em></a></dt>
+<dd>This describes the format and encoding used for LLVM’s code coverage mapping.</dd>
+<dt><a class="reference internal" href="Statepoints.html"><em>Garbage Collection Safepoints in LLVM</em></a></dt>
+<dd>This describes a set of experimental extensions for garbage
+collection support.</dd>
+<dt><a class="reference internal" href="MergeFunctions.html"><em>MergeFunctions pass, how it works</em></a></dt>
+<dd>Describes functions merging optimization.</dd>
+</dl>
+</div>
+<div class="section" id="development-process-documentation">
+<h1>Development Process Documentation<a class="headerlink" href="#development-process-documentation" title="Permalink to this headline">¶</a></h1>
+<p>Information about LLVM’s development process.</p>
+<div class="toctree-wrapper compound">
+</div>
+<dl class="docutils">
+<dt><a class="reference internal" href="DeveloperPolicy.html"><em>LLVM Developer Policy</em></a></dt>
+<dd>The LLVM project’s policy towards developers and their contributions.</dd>
+<dt><a class="reference internal" href="Projects.html"><em>Creating an LLVM Project</em></a></dt>
+<dd>How-to guide and templates for new projects that <em>use</em> the LLVM
+infrastructure.  The templates (directory organization, Makefiles, and test
+tree) allow the project code to be located outside (or inside) the <tt class="docutils literal"><span class="pre">llvm/</span></tt>
+tree, while using LLVM header files and libraries.</dd>
+<dt><a class="reference internal" href="LLVMBuild.html"><em>LLVMBuild Guide</em></a></dt>
+<dd>Describes the LLVMBuild organization and files used by LLVM to specify
+component descriptions.</dd>
+<dt><a class="reference internal" href="MakefileGuide.html"><em>LLVM Makefile Guide</em></a></dt>
+<dd>Describes how the LLVM makefiles work and how to use them.</dd>
+<dt><a class="reference internal" href="HowToReleaseLLVM.html"><em>How To Release LLVM To The Public</em></a></dt>
+<dd>This is a guide to preparing LLVM releases. Most developers can ignore it.</dd>
+<dt><a class="reference internal" href="ReleaseProcess.html"><em>How To Validate a New Release</em></a></dt>
+<dd>This is a guide to validate a new release, during the release process. Most developers can ignore it.</dd>
+<dt><a class="reference internal" href="Packaging.html"><em>Advice on Packaging LLVM</em></a></dt>
+<dd>Advice on packaging LLVM into a distribution.</dd>
+<dt><a class="reference internal" href="Phabricator.html"><em>Code Reviews with Phabricator</em></a></dt>
+<dd>Describes how to use the Phabricator code review tool hosted on
+<a class="reference external" href="http://reviews.llvm.org/">http://reviews.llvm.org/</a> and its command line interface, Arcanist.</dd>
+</dl>
+</div>
+<div class="section" id="community">
+<h1>Community<a class="headerlink" href="#community" title="Permalink to this headline">¶</a></h1>
+<p>LLVM has a thriving community of friendly and helpful developers.
+The two primary communication mechanisms in the LLVM community are mailing
+lists and IRC.</p>
+<div class="section" id="mailing-lists">
+<h2>Mailing Lists<a class="headerlink" href="#mailing-lists" title="Permalink to this headline">¶</a></h2>
+<p>If you can’t find what you need in these docs, try consulting the mailing
+lists.</p>
+<dl class="docutils">
+<dt><a class="reference external" href="http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev">Developer’s List (llvmdev)</a></dt>
+<dd>This list is for people who want to be included in technical discussions of
+LLVM. People post to this list when they have questions about writing code
+for or using the LLVM tools. It is relatively low volume.</dd>
+<dt><a class="reference external" href="http://lists.cs.uiuc.edu/pipermail/llvm-commits/">Commits Archive (llvm-commits)</a></dt>
+<dd>This list contains all commit messages that are made when LLVM developers
+commit code changes to the repository. It also serves as a forum for
+patch review (i.e. send patches here). It is useful for those who want to
+stay on the bleeding edge of LLVM development. This list is very high
+volume.</dd>
+<dt><a class="reference external" href="http://lists.cs.uiuc.edu/pipermail/llvmbugs/">Bugs & Patches Archive (llvmbugs)</a></dt>
+<dd>This list gets emailed every time a bug is opened and closed. It is
+higher volume than the LLVMdev list.</dd>
+<dt><a class="reference external" href="http://lists.cs.uiuc.edu/pipermail/llvm-testresults/">Test Results Archive (llvm-testresults)</a></dt>
+<dd>A message is automatically sent to this list by every active nightly tester
+when it completes.  As such, this list gets email several times each day,
+making it a high volume list.</dd>
+<dt><a class="reference external" href="http://lists.cs.uiuc.edu/mailman/listinfo/llvm-announce">LLVM Announcements List (llvm-announce)</a></dt>
+<dd>This is a low volume list that provides important announcements regarding
+LLVM.  It gets email about once a month.</dd>
+</dl>
+</div>
+<div class="section" id="irc">
+<h2>IRC<a class="headerlink" href="#irc" title="Permalink to this headline">¶</a></h2>
+<p>Users and developers of the LLVM project (including subprojects such as Clang)
+can be found in #llvm on <a class="reference external" href="irc://irc.oftc.net/llvm">irc.oftc.net</a>.</p>
+<p>This channel has several bots.</p>
+<ul class="simple">
+<li>Buildbot reporters<ul>
+<li>llvmbb - Bot for the main LLVM buildbot master.
+<a class="reference external" href="http://lab.llvm.org:8011/console">http://lab.llvm.org:8011/console</a></li>
+<li>bb-chapuni - An individually run buildbot master. <a class="reference external" href="http://bb.pgr.jp/console">http://bb.pgr.jp/console</a></li>
+<li>smooshlab - Apple’s internal buildbot master.</li>
+</ul>
+</li>
+<li>robot - Bugzilla linker. %bug <number></li>
+<li>clang-bot - A <a class="reference external" href="http://www.eelis.net/geordi/">geordi</a> instance running
+near-trunk clang instead of gcc.</li>
+</ul>
+</div>
+</div>
+<div class="section" id="indices-and-tables">
+<h1>Indices and tables<a class="headerlink" href="#indices-and-tables" title="Permalink to this headline">¶</a></h1>
+<ul class="simple">
+<li><a class="reference internal" href="genindex.html"><em>Index</em></a></li>
+<li><a class="reference internal" href="search.html"><em>Search Page</em></a></li>
+</ul>
+</div>
+
+
+          </div>
+      </div>
+      <div class="clearer"></div>
+    </div>
+    <div class="related">
+      <h3>Navigation</h3>
+      <ul>
+        <li class="right" style="margin-right: 10px">
+          <a href="genindex.html" title="General Index"
+             >index</a></li>
+        <li class="right" >
+          <a href="LangRef.html" title="LLVM Language Reference Manual"
+             >next</a> |</li>
+  <li><a href="http://llvm.org/">LLVM Home</a> | </li>
+  <li><a href="#">Documentation</a>»</li>
+ 
+      </ul>
+    </div>
+    <div class="footer">
+        © Copyright 2003-2014, LLVM Project.
+      Last updated on 2015-02-27.
+      Created using <a href="http://sphinx-doc.org/">Sphinx</a> 1.2.2.
+    </div>
+  </body>
+</html>
\ No newline at end of file

Added: www-releases/trunk/3.6.0/docs/objects.inv
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/objects.inv?rev=230777&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www-releases/trunk/3.6.0/docs/objects.inv
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www-releases/trunk/3.6.0/docs/search.html
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/search.html?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/search.html (added)
+++ www-releases/trunk/3.6.0/docs/search.html Fri Feb 27 12:44:09 2015
@@ -0,0 +1,111 @@
+
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+  "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+
+<html xmlns="http://www.w3.org/1999/xhtml">
+  <head>
+    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+    
+    <title>Search — LLVM 3.6 documentation</title>
+    
+    <link rel="stylesheet" href="_static/llvm-theme.css" type="text/css" />
+    <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
+    
+    <script type="text/javascript">
+      var DOCUMENTATION_OPTIONS = {
+        URL_ROOT:    './',
+        VERSION:     '3.6',
+        COLLAPSE_INDEX: false,
+        FILE_SUFFIX: '.html',
+        HAS_SOURCE:  true
+      };
+    </script>
+    <script type="text/javascript" src="_static/jquery.js"></script>
+    <script type="text/javascript" src="_static/underscore.js"></script>
+    <script type="text/javascript" src="_static/doctools.js"></script>
+    <script type="text/javascript" src="_static/searchtools.js"></script>
+    <link rel="top" title="LLVM 3.6 documentation" href="index.html" />
+  <script type="text/javascript">
+    jQuery(function() { Search.loadIndex("searchindex.js"); });
+  </script>
+  
+  <script type="text/javascript" id="searchindexloader"></script>
+  
+<style type="text/css">
+  table.right { float: right; margin-left: 20px; }
+  table.right td { border: 1px solid #ccc; }
+</style>
+
+
+  </head>
+  <body>
+<div class="logo">
+  <a href="index.html">
+    <img src="_static/logo.png"
+         alt="LLVM Logo" width="250" height="88"/></a>
+</div>
+
+    <div class="related">
+      <h3>Navigation</h3>
+      <ul>
+        <li class="right" style="margin-right: 10px">
+          <a href="genindex.html" title="General Index"
+             accesskey="I">index</a></li>
+  <li><a href="http://llvm.org/">LLVM Home</a> | </li>
+  <li><a href="index.html">Documentation</a>»</li>
+ 
+      </ul>
+    </div>
+
+
+    <div class="document">
+      <div class="documentwrapper">
+          <div class="body">
+            
+  <h1 id="search-documentation">Search</h1>
+  <div id="fallback" class="admonition warning">
+  <script type="text/javascript">$('#fallback').hide();</script>
+  <p>
+    Please activate JavaScript to enable the search
+    functionality.
+  </p>
+  </div>
+  <p>
+    From here you can search these documents. Enter your search
+    words into the box below and click "search". Note that the search
+    function will automatically search for all of the words. Pages
+    containing fewer words won't appear in the result list.
+  </p>
+  <form action="" method="get">
+    <input type="text" name="q" value="" />
+    <input type="submit" value="search" />
+    <span id="search-progress" style="padding-left: 10px"></span>
+  </form>
+  
+  <div id="search-results">
+  
+  </div>
+
+          </div>
+      </div>
+      <div class="clearer"></div>
+    </div>
+    <div class="related">
+      <h3>Navigation</h3>
+      <ul>
+        <li class="right" style="margin-right: 10px">
+          <a href="genindex.html" title="General Index"
+             >index</a></li>
+  <li><a href="http://llvm.org/">LLVM Home</a> | </li>
+  <li><a href="index.html">Documentation</a>»</li>
+ 
+      </ul>
+    </div>
+    <div class="footer">
+        © Copyright 2003-2014, LLVM Project.
+      Last updated on 2015-02-27.
+      Created using <a href="http://sphinx-doc.org/">Sphinx</a> 1.2.2.
+    </div>
+  </body>
+</html>
\ No newline at end of file

Added: www-releases/trunk/3.6.0/docs/searchindex.js
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/searchindex.js?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/searchindex.js (added)
+++ www-releases/trunk/3.6.0/docs/searchindex.js Fri Feb 27 12:44:09 2015
@@ -0,0 +1 @@
+Search.setIndex({envversion:42,terms:{orthogon:83,interchang:[62,81,64],four:[81,107,51,40,41,20,1,53,70,64,75,8,98,23,19],prefix:[64,81,58,107],grokabl:64,is_open:8,francesco:30,atomicrmw:83,add32ri8:6,globalvari:98,identityprop:16,foldingsetnodeid:16,build_fcmp:[12,13,14,15,19],dbx:53,digit:[23,20,106,16],intregsregclass:51,emitconst:51,basic_:111,n2118:64,delv:[12,48],f110:8,aliasa:23,dw_lang_c89:53,configstatusscript:62,distcheckdir:62,fpmad:53,mli:12,seper:23,second:[30,81,0,32,33,1,89,64,65,4,23,67,38,39,92,41,5,93,45,47,11,69,13,16,19,51,98,70,20,53,73,24,103,87,82,84,107,110],x86ii:51,r15d:6,r15b:6,alignstack:[23,107],ptrb:8,thefpm:[39,45,2,47,48],constrast:40,r15w:6,errorf:[39,41,108,45,2,47,48],xchg:[23,83],cull:64,ongo:[69,25,26],noreturn:[23,107],visitxor:80,here:[87,32,33,34,89,35,64,65,4,94,5,6,67,37,38,39,81,8,41,23,43,93,45,2,47,48,10,11,69,12,13,14,15,16,18,19,72,51,97,70,86,20,95,53,73,98,92,24,58,80,25,40,82,83,104,84,108,109,62,29,111],gnu_hash:53,accur:[90,40],i
 mage_file_machine_r4000:104,iseldagtodag:21,"0x20":53,golden:64,unic:20,bou_tru:20,unif:40,brought:32,substr:67,unix:[24,58,92,16,20,93,10,23,62,4,5],pound:[62,87],content_disposition_typ:26,uint64_max:56,unit:[58,75],ldri:51,fstream:8,subpath:[27,1],destarglist:23,strike:[41,19],until:[30,64,31,1,23,72,39,41,42,43,45,2,47,48,10,68,12,13,14,15,16,17,18,19,51,108,20,73,21,75,54,106,24,80,25,81,26,107,103],new_else_bb:[13,14,15],emitlabelplusoffset:70,jmp:23,relat:[30,81,98,8,31,32,53,1,64,40,89,10,65,21,26,23,69,27,16],notic:[93,58,97,8,41,32,81,45,26,98,15,16,19],hurt:64,exce:[64,23,53],hole:[20,23],herebi:64,image_scn_align_128byt:104,generalis:[14,2],dagtodag:99,conceptu:[64,98,5,20,81,103,75,23,16],forexpr:[39,45,2,47,13,14,15],oftc:37,rework:[20,26],get_matcher_implement:21,al_superregsset:51,phabric:26,dtor:[93,23],createfunct:39,replaceusesofwith:[57,16],doubletyp:16,caution:[62,83,69],fibonacci:[62,35,17,43],want:[59,34,90,35,64,65,23,99,40,5,93,9,46,97,98,20,24,58,81,26,107,
 109,62],umin:23,hasfp:51,mcasmstream:81,shuffl:[1,23],hoc:[30,81,16],classifi:40,i686:[10,81,5],how:[58,107,40,83,75,80,56],hot:[25,23,56],actionscript:[38,11],macosx10:23,perspect:[97,40,69,73,103,23],lhse:[39,45],wrong:[64,40],beauti:[41,43,2,14,17,19],adc32rm:6,outoperandlist:[6,51],weakanylinkag:16,index2virtreg:81,passopt:73,isvalid:39,apint:16,alias:[107,40],"18th":98,prototypeast:[39,41,108,45,2,47,48],tok_for:[39,45,2,47],"0x3f":22,feedback:[73,109,26,89],assing:32,affect:[93,58,75,8,31,29,20,59,9,83,47,89,73,23,13,32,4,16,25,111],vari:[38,93,16,81,83,53,11,107,4,80],exported_symbol_list:62,redhat:60,fit:[30,64,98,23,20,81,53,47,26,75,13,16],fix:83,"200000e":[13,47],xxxinstrdescriptor:51,hidden:[64,16,20,81,46,63,53,73,90,107,54,23],easier:[30,59,31,83,64,23,6,99,39,8,41,108,93,45,94,10,15,16,18,19,96,70,21,79,81,40,26,27],aliasesset:40,proce:[31,32,57,70,103],imagstart:[14,2],"0x34":53,interrupt:[4,64,1,23],sellect:21,kernelparam:8,initializecustomlow:70,loopinfo:73,dcmake_
 install_prefix:9,exprast:[39,41,108,45,2,47,48,18],accommod:[81,22,107,8],"0x7ffff7ed404c":94,build_fadd:19,openfileforwrit:4,resum:[103,94],isloadfromstackslot:51,pinsrd_1:5,numentri:107,whip:[14,2],intregssuperclass:51,dst:[65,81,6,51,111],smp:73,only_tool:[24,62],llvm_lit_arg:58,adapt:[4,93,16,30],aliasdebugg:40,impract:16,navig:[27,20,79],selectionkind:23,omiss:23,targetloweringobjectfil:81,gollvm:25,adc64ri32:6,f3_1:51,uiuc:26,f3_3:51,proj_src_root:[62,49],reformul:40,realstart:[14,2],att:[77,74,23],unabl:[57,23,18,111],disablelazycompil:16,"0x2e":53,confus:[64,92,51,98,32,26,23,16],configurescriptflag:62,clariti:[13,53,47],wast:[72,110,45,53,84,15,16],psubusw:10,mingw:[35,81,58,89],mklib:62,wasn:[39,40,32,45,2,64,14,15],vhdl:25,isalnum:[39,41,108,43,45,2,47,48],llvmmemorymanagerallocatedatasectioncallback:84,signext:[25,23,107],setargstr:20,nobuiltin:23,master:[10,24,109,49,37],image_scn_mem_discard:104,similarli:[37,39,51,40,23,20,59,64,80,26,75,62,89,16,33],getnod:[99,51],im
 age_sym_class_stat:104,linpack:0,addrrr:51,arrayidx1:23,arrayidx3:23,arrayidx2:23,arrayidx4:23,"0x3500000001652748":94,ntid:8,crawl:70,technic:[37,26],lvalu:16,tree:[26,1,58,64,52],wchar_t:23,image_rel_i386_secrel:22,entri:[72,24,99,44,58,107,97,40,70,32,8,46,98,23,103,27,62,55,81,5,56],sdnode:[80,81,16,6,51],recheck:[30,62,32],uniniti:[70,111,23,98],aforement:24,increment:[64,81,80],infring:26,incompat:[60,23],dozen:34,sig_atomic_t:23,dw_apple_property_readwrit:53,musttail:23,lfoo:81,multimap:16,get_instrinfo_operand_types_enum:51,simplifi:81,shall:[23,20,58,11,38],cpu2:87,object:[75,40],numloc:84,letter:[39,51,20,45,2,64,107,62,14,15,23],breakpoint:[80,94],alwaysinlin:[23,107],errorv:[39,41,45,2,47,48],getelementtyp:16,expr0rh:67,purgev:107,dummi:[30,93,51,81,10,111],lpm:73,mayreadfrommemori:83,detriment:64,came:[13,38,106,11,47],addr2:76,matchinstructionimpl:81,layout:[58,75],ccmake:58,apach:[4,26],somefil:93,theme:[6,95],busi:26,exctyp:103,recursivetarget:62,plate:20,selectionda
 gbuild:81,enable_profil:[24,93,62],addri:51,replaceusesofwithonconst:57,addrr:51,smallvectorimpl:16,ppc_fp128:[32,23,107],hasopsizeprefix:6,patch:64,emitstorecondit:83,sligtli:75,respond:[30,79,40],sjljehprepar:103,mandatori:[23,35,16,51],fprofil:[67,90],fail:[64,58,42,20,1,83,26,103,77,5],best:[30,38,59,24,103,43,40,64,53,84,26,11,75,108,77,81,16,93,18],dw_tag_reference_typ:53,heterogen:25,wikipedia:[27,13,23,47],copyleft:26,figur:[73,81,51,16,20,59,80,10,64,75,62,23],irc:[26,79],sysroot:[9,6],glasgow:23,xvf:35,never:[30,87,32,33,90,64,23,67,38,92,40,97,93,48,11,12,16,51,98,70,73,75,25,81,83,61,86],extend:[81,20,1,64,83],extens:[81,64,74,58,90],extent:[70,26,23,98,52],toler:[70,23,89],advertis:103,rtti:58,"0f3f800000":8,accident:[73,4,20,64],atomicexpandpass:83,logic:[30,64,32,1,23,41,5,45,2,47,13,14,15,16,19,97,98,81,26,108,27,62],hh567368:64,compromis:16,assur:87,mattr:[77,74,5,51],creategvnpass:[39,45,2,47,48],"2nd":[23,16,111],dibuild:[39,53],makelight:64,diff:[64,63],summat:23
 ,assum:[3,24,99,64,98,40,103,74,81,35,26,107,77,80,56,93],summar:[70,30,1,81],duplic:[86,64,92,40,32,20,81,26,22,23],frc:81,frb:81,fra:81,bewilder:62,union:[64,40,81,45,53,15,23],n_hash:53,frt:81,spir:25,life:[26,64],regul:73,mrm6m:51,ani:[30,87,75,0,32,33,1,74,34,89,90,35,64,36,65,4,108,5,6,93,67,37,38,39,81,8,41,42,43,44,45,2,47,48,10,11,95,69,12,13,14,15,16,17,18,19,72,96,51,98,70,86,20,71,99,53,73,21,22,23,54,106,56,92,88,24,57,58,80,25,40,83,105,26,84,49,107,103,27,62,28,110,29,111],cufunct:8,"0x16151f0":94,objectfil:72,hasfparmv8:6,image_scn_mem_not_cach:104,commerci:26,employ:26,one_onli:22,debug_metadata_vers:39,emit_22:51,unop:[39,14,15,45,2],rediscov:[38,11],filename0:67,image_file_machine_powerpc:104,eh_fram:103,createret:[39,41,45,2,47,48],transpar:[99,64,79,98,16,20,86],bikesh:97,generalcategori:20,falsedest:23,split:[30,99,51,98,32,20,81,82,83,80,26,75,23,49,53],subfield:111,functionpassmanag:[39,45,2,47,48],annoat:28,reassoci:[57,23],cxx0x:64,dest1:23,fairli:[38,93,51
 ,40,108,25,43,2,47,83,11,27,13,14,16,17,18],dest2:23,refil:32,ownership:[39,45,2,47,48,26,16],printdeclar:51,tune:[81,58],tokvarnam:29,nuzman:0,gzip:[24,89],unchang:[23,16,40],ordin:20,bit:[83,75],previous:[58,51,33,41,23,20,47,89,90,29,25,19],fintegr:25,easi:[81,31,32,33,1,64,23,38,45,41,108,43,9,47,48,10,11,12,13,15,16,17,18,19,97,70,53,73,21,24,58,87,61,26,107,27,110],bitwidth:[32,23,107],had:[8,32,87,83,73,84,75,36,4,110,23],ideal:[27,69,64,16,51],har:[24,49],hat:87,sanit:[25,58],ocamlbuild:[12,13,14,15,18,19],issimpl:83,preserv:[38,81,92,98,52,20,40,73,90,11,75,84,23],instrumen:67,st_mode:92,attrparsedattrkind:21,stylist:64,measur:92,specif:[83,107],fcmpinst:16,nonlazybind:23,remind:89,underli:[81,20,26,64,75],right:[99,64,92,42,20,83,26,75],old:[90,26,94,40],getargumentlist:16,unabashedli:62,attornei:26,olt:23,paralleltarget:62,dominatorset:73,txt:[64,58,52,20,89,10,76,26,27,110],sparcsubtarget:51,bottom:[30,57,79,51,0,32,20,73,13,4,23,56,77],undisturb:64,lto_module_get_num_sy
 mbol:86,stringsort:64,subclass:[64,97,40,70,20,81],cassert:[64,8],armv7l:34,topleveltarget:62,op_begin:16,condit:[24,57,58,98,8,32,20,81,64,83,90,3,86,103,23,93],foo:[87,0,64,23,67,8,41,5,93,46,47,48,10,12,13,81,16,18,19,97,98,20,53,22,75,76,56,103,25,59,40,108,29,111],"0f00000000":8,armv7a:[9,89],sensibl:16,leftr:32,egregi:26,tablegen:58,bindex:51,emitt:[111,21,23,101,94],image_scn_mem_lock:104,llvmanalysi:49,true_branch_weight:3,slightli:[64,23],xor64rr:81,dw_tag_array_typ:53,selectiondagisel:21,basenam:53,expandop:99,mbb:[81,51],creativ:51,mcinstlow:81,wrap:[72,24,64,98,43,41,23,20,87,46,53,26,107,108,4,16,17,18,19],msp430:[24,81],data32bitsdirect:51,suffici:[24,98,59,97,30,70,5,25,40,43,83,17,80,23,69,62,28,16,20,111],support:[107,83,75,40],sub_rr:111,happi:[15,45,49],sub_ri:111,width:[83,75],cpprefer:16,distsubdir:62,icon:79,use_back:16,headach:31,"0x2413bc":73,fpga:81,offer:[70,25,87,16,83],refcount:70,dllstorageclass:[23,107],multiprocessor:[70,73],reserveresourc:81,profdata:
 63,mymod:62,insidi:64,reiter:23,handili:64,fermi:81,dump_valu:[12,13,14,15,19],rerun:62,isexternalsymbol:51,adopt:[4,26,64,81],proven:[30,106,15,23,45],flagsflat:87,ericsson:23,build_phi:[13,14,15],bswap:99,role:[64,31,32,53,70,108,29,18],finalizeobject:[72,39,45,2,47,48],presum:23,smell:16,roll:[64,97],mri:81,legitim:64,notif:40,intend:[24,99,81,58,92,40,70,103,20,44,83,26,5],createargumentalloca:[39,45],intens:[16,0],intent:[92,23,25,81,45,26,86,75,15,29],keycol:65,dyn_switch:64,"1s100000s11010s10100s1111s1010s110s11s1":16,cumemcpyhtod:8,geometr:[38,11],time:[58,40,81,83,107,80,56],push:[70,81,64,39,80],image_file_dl:104,breadth:[77,43,17],mrmsrcmem:51,sparctargetmachin:51,osi:93,aptr:23,const_nul:[13,14,15],image_sym_type_short:104,decid:[99,87,0,69,20,59,45,2,48,73,75,108,12,14,15,23,18,53],hold:[30,32,23,6,72,39,41,108,43,45,2,47,48,10,12,13,14,15,16,18,19,51,70,20,53,73,24,81,49,27,111],decim:[92,20,87,22,23,111],x08:104,decis:[64,0,80,81,48,26,75,103,12,23],x03:104,x01:104,ma
 cho:[72,81],oversight:26,x04:104,painlessli:20,uint32_max:53,cudevicecomputecap:8,vmcore:[58,20,16,99],fullest:64,exact:[30,64,52,70,23,20,83,53,73,86,27,16,33],numlin:67,solver:81,tear:103,unsupport:[81,51,31,1,83,89,10,35],team:[49,89],cooki:[23,16],prevent:[30,64,0,69,4,23,39,40,41,5,93,45,10,15,16,19,70,20,53,73,25,82,26,84,62],dcmake_cxx_flag:9,numroot:70,heavyweight:16,relocat:[72,77,51],filenameindex1:67,lazili:[12,86,16,107,48],currenc:[12,81,26,48],thecu:39,merge_bb:[13,14,15],current:[68,30,87,75,31,32,1,74,46,35,3,65,4,64,5,6,67,37,38,39,81,8,41,42,43,93,9,2,47,48,10,11,45,12,13,14,15,16,17,18,19,72,51,98,70,20,99,53,73,109,21,22,23,77,106,89,92,24,58,69,103,25,40,82,83,60,61,26,84,49,107,108,27,62,29,111],image_scn_cnt_cod:104,i256:23,objdir:[24,62],addpdrr:111,intraprocedur:80,adc64rr:6,cudevicegetnam:8,dropdown:79,autogener:26,live_begin:70,splice:[23,16],address:[107,58,83,75,40],along:[72,24,81,58,97,70,59,83,64,107,65,106,23],ffast:0,cur_var:15,volumin:16,commentstr
 :51,queue:[73,16,51],replaceinstwithvalu:16,mipsel:24,commonli:[64,51,70,16,107,23],ourselv:[64,53,8],ipc:4,ipa:57,love:16,"2ap3":22,pentium:[24,51],prefer:[83,40],ipo:[32,57],src2:[81,6,111],regalloc:[73,77,74,81],src1:[81,6,111],fake:77,instal:[96,24,99,58,93,34,61,35,109],llvm_lib_search_path:24,anothercategori:20,virtreg:81,image_sym_class_nul:104,abbrevid:107,scope:[64,40,70,103,26,107,101,80],tightli:[39,41,108,45,2,47,48,64,12,13,14,15,23,18,19],"66ghz":109,peopl:[37,38,64,79,98,43,31,20,81,99,89,73,26,11,4,23,17,93],claus:[81,26,23,103],refrain:[23,89],enhanc:[26,64,101],dagarg:29,dualiti:25,linkmodul:62,langref:[99,83],easiest:[24,38,51,83,89,73,11,110],behalf:[26,79],b_ctor_bas:5,subel:23,descriptor:107,valuet:16,whatev:[30,58,98,40,23,20,87,4,5],problemat:64,encapsul:[64,97,54],recycl:81,setrecordnam:107,optnon:23,r11b:6,r11d:6,"0x00001c00":81,fpu:[25,9,34],parameter:111,r11w:6,remap:81,motohiro:81,dw_apple_property_gett:53,"__cuda_ftz":8,mrm4m:51,mrm4r:51,succ:64,date:[2
 4,92,40,31,25,47,89,35,62,13,80,111],fucompi:81,data:[83,75,40],codes:6,stress:[64,63],rc2:[31,89],indexloc:16,disable_auto_depend:62,stdio:[24,61,35,13,12,4,14,15,86],stdin:[39,10,12,13,14,15,5,18,19],mangl:[106,64,26,23,53],fp4:[6,111],sandbox:[31,9],fp6:[6,111],fp1:[6,111],fp0:[6,111],fp3:[6,111],fp2:[6,111],callabl:[64,23,8],iftmp:[39,45,2,47,13,14,15],untest:31,operand_type_list_end:51,my_funct:8,llvm_library_vis:70,numbyt:84,x86retflag:111,overhaul:89,thumb:[81,26,64],image_sym_class_block:104,precedecnc:[39,45,2],instantli:16,"__stack_chk_guard":23,jit:[80,58],canonicalis:75,image_sym_class_end_of_struct:104,outli:103,smarter:20,isbinaryop:[39,45,2],"0x00000147":53,inpredsens:65,therebi:[20,84],"0x00000140":53,mcode:22,revers:[30,57,98,5,75,16],llvm_src_dir:34,separ:[81,33,90,64,4,23,8,5,9,46,10,49,51,98,70,20,53,73,21,106,56,24,58,87,83,26,84,18,107,108,27,62,110,86,111],dwarf2:39,complextyp:104,sk_squar:97,compil:[80,107,75,40],argvalu:[20,94],registertarget:51,"__has_attri
 but":21,blx:22,movsx64rr32:81,"0x100":53,toolchain:[64,81,58],blk:16,nsw:[26,23,98],libxxx:9,getschedclass:51,roots_iter:70,pseudocod:51,million:[23,16],removefrompar:16,crazier:[13,47],micromip:25,"byte":[36,23,67,99,92,40,12,13,14,15,16,18,19,51,98,53,75,25,81,82,83,84,107],subregist:[84,51],reusabl:81,departur:62,jitcompilerfunct:51,sysconfdir:62,modest:64,recov:[16,103,5,23,84],neglect:33,arraytyp:16,oper:[3,64,58,107,40,81,83,74,75,77],onc:[87,103,31,32,33,1,89,90,35,64,4,23,6,72,37,7,81,40,41,42,93,45,47,48,11,69,12,13,15,16,18,19,51,98,70,86,20,71,38,73,24,57,58,80,25,59,61,26,108,107,99,62,110,29,111],iaddroff:81,insertbefor:16,coveragemappingdataforfunctionrecord0:67,submit:80,symmetri:10,open:[42,64,26,58,81],lexicograph:[32,64],addtmp4:[41,19],insttoreplac:16,f88:8,convent:107,bite:93,f80:23,enable_optim:[60,24,89,62],optlevel:20,draft:[24,83,53],addtmp1:[12,48],lnt:[10,31,33,9],getsubtarget:51,conveni:[30,64,1,23,67,38,8,93,2,47,10,11,13,14,16,49,97,20,24,25,81,26,111],g
 oldberg91:70,usenamedoperandt:51,fma:81,programat:[14,81,2],artifact:[32,98],"__apple_namespac":53,llvm_parallel_compile_job:58,third:[64,32,33,89,23,67,38,39,41,11,69,81,16,49,19,51,98,70,20,53,73,24,103,87,26,84,107],rival:16,rzi:8,param2:16,param1:16,"0x12345678":53,sai:[38,39,97,92,33,43,41,5,20,81,110,26,11,62,65,4,98,69,16,17,19],nicer:[20,39,16,87],argument:[96,81,58,40,42,1,63,64,75,36,77,106,101,5],second_tru:23,sar:81,saw:[73,13,86,47],entrytoken:81,notw:5,xxxgenregisterinfo:51,destroi:[81,51,16,87,46,73,103,23,93],note:[58,75,40,83,107,80],denomin:64,take:[30,87,103,31,32,97,1,46,35,64,36,65,5,72,7,39,81,8,41,23,43,93,45,2,47,48,11,69,12,13,14,15,16,17,18,19,51,98,70,86,20,71,38,53,73,21,75,54,77,88,24,102,80,74,40,104,83,105,61,26,84,108,107,99,62,110,29,111],llvmcreatesimplemcjitmemorymanag:84,jumptabl:23,printer:[27,70,28,81],buffer:[23,86,16,103],fcc_ug:51,compress:[24,58,107,36,62,16],insertel:[5,75],abus:16,homepag:[24,35],allevi:[23,20,81,16],"_function_nam":22,dri
 ve:[27,34],axi:0,event:[58,16,84,69],merit:64,identifierstr:[39,41,108,43,45,2,47,48],cclib:[14,15],objptr:23,slot:[81,23,46,36],xmm:[23,5,51],xmo:100,activ:[37,64,51,40,70,23,50,81,46,73,26,84,103,16],v2size:40,freebsd5:81,dw_tag_imported_declar:53,v16f32:23,flagscpu2:87,flagscpu1:87,clang:[67,26,58,98,103,74,1,64,83,94,3,5,93],"import":[30,64,59,32,1,34,89,35,65,23,40,44,80,70,20,75,24,58,81,83,26,107],embedd:25,prime:[39,41,108,45,2,47,48,12,13,14,15,18,19],borrow:23,specialsquar:97,getframes:70,openorcreatefileforwrit:4,xmax:[14,2],clenumvalend:20,where:[67,107,99,26,58,92,103,80,20,1,64,83,101,90,3,75,71,81,5,56],respres:16,deadlin:26,dw_at_apple_property_sett:53,arglist:23,xxxtrait:87,x86targetmachin:81,x24:104,build_mul:[12,13,14,15,19],getindex:51,assumpt:[38,39,23,81,64,53,74,11,5],screen:31,secnam:22,opval:51,sparc:[81,83],uncondition:[81,39,22,40],genericvalu:[12,13,14,15],eflag:[6,111],extern_weak:[23,107],kleckner:25,mani:[30,59,0,31,45,33,46,35,64,97,4,5,93,38,81,8,41,
 23,43,44,9,2,47,48,10,11,69,12,13,14,15,16,17,18,19,51,98,70,20,99,53,73,75,56,24,79,80,25,40,83,87,84,107,108,27,62],summaris:75,qhelpgener:58,dw_at_mips_linkage_nam:53,unistd:4,sccp:57,curr:17,boat:64,curs:[42,1],printstar:[13,47],fib:[30,39,43,45,47,13,15,17],add16mr:6,image_scn_align_4096byt:104,ismod:111,parseifexpr:[39,45,2,47],inst_begin:16,add16mi:6,reflex:32,constantfoldcal:99,symobl:22,thousand:30,somemap:64,ppcisellow:99,former:[69,81,83,18,108],combine1:81,combine2:81,emitalign:70,columnstart:67,polli:58,view_function_cfg:13,test_exec_root:1,"__vectorcal":25,lto_module_get_symbol_attribut:86,canon:[30,16,75,23,53],blah:[20,64],pthread:23,ascii:[39,92,41,108,43,45,2,47,48,53,107,12,13,14,15,23,17,18,19],binari:[67,7,81,58,102,88,20,71,64,96,26,22,100,107,76,91,80],devcount:8,srem:81,unhandl:103,irread:58,"0x1603020":94,getfunct:[39,41,45,2,47,48,73,70,16],extern:[64,92,107,81,106,75,77],defi:23,sret:[23,107],defm:111,fnname:[39,41,108,45,2,47,48],dw_form_ref_udata:53,clob
 ber:40,dimension:[14,98,2,8],runtimedyldmacho:72,noencod:81,resp:[23,16],rest:[24,107,70,32,81,53,26,86,23,4,110,5,16],checkcudaerror:8,fmadd:81,gdb:81,unmaintain:6,invalid:[30,64,1,72,39,40,41,108,45,2,47,48,12,13,14,15,16,18,19,51,98,20,71,53,73,57,103,87,105,84],loadable_modul:[10,62,73,70],cond_fals:[15,45],r13w:6,ghostli:16,"__imp_":23,littl:[81,107,75],instrument:[67,24,30,25,98,105,90,23],r13d:6,r13b:6,exercis:[10,38,11],dwarfdebug:53,featurev8deprec:51,disubprogram:39,mrm2m:[51,111],around:[30,64,32,89,4,23,38,39,40,108,93,46,47,11,13,16,51,98,20,53,73,54,24,83,26,27],libm:[12,41,48,23,19],getunqu:16,unveil:[43,17],libz:23,traffic:[45,15,16],dispatch:[84,16,18,108],llvm_lib:58,world:[67,24,70,53,35,110,23],mrm2r:[51,111],find_program:58,intel:58,"__gxx_personality_v0":[103,23],timepassesisen:20,inter:[4,26,57,40],manag:[31,89,35,72,38,40,42,93,45,11,15,80,51,98,70,73,24,57,79,16,84,109],attrlist:21,a64:75,mfenc:83,pushf:81,pred_iter:16,constitut:[10,16,107,75],tok_extern:[39
 ,41,108,43,45,2,47,48],seterrorstr:[39,45,2,47,48],"0x000000000059c583":94,definit:[107,81,83,75],parseextern:[39,41,108,45,2,47,48],evolv:86,exit:[81,56],nonintuit:37,notabl:[24,58,98,23,25,81,16],refer:[81,58,107,40,42,1,80,64,75,77,106,5,56],pointnum:70,power:[30,34,46,23,6,100,40,41,108,43,45,2,47,48,95,12,13,14,15,16,17,18,19,20,79,25,81,86],isloopinvari:16,blockaddress:23,image_sym_type_union:104,n1984:64,n1987:64,ispic:51,mov64ri:51,isset:20,mingw32msvc:81,acc:16,spiffygrep:20,gplv3:61,aco:40,acm:[70,81],printmethod:51,compuat:57,act:[30,64,23,81,53,32,16,56],cater:21,industri:37,specialfp:111,srcloc:23,cflag:[62,49],surviv:[103,18,108],homeless:16,cmake_module_path:58,setinsertpoint:[39,41,45,2,47,48],hex:23,movsx64rr16:81,kaleidoscop:[32,16],verbatim:[20,51],thedoclist:87,mantissa:23,conclud:[13,14,2,47],htpasswd:26,createjit:72,clenumv:20,categor:[30,20,21,51],conclus:[32,43],ifunequ:23,pull:[24,64,83],tripl:107,dirti:64,rage:36,agrep:33,inaccuraci:23,emitprologu:51,gcolum
 n:0,basenamesourc:62,uid:92,creat:[67,96,71,58,92,103,20,1,74,90,26,75,64,81],certain:[1,23,67,99,92,40,5,45,48,12,15,16,20,73,22,75,24,25,81,60,84,62,111],numregion:67,getnamedoperandidx:51,creal:[14,2],movsx32rr8:81,googl:79,discrimin:[81,64,53,97],collector:[93,107],emphas:[25,64,110],collis:[64,41,16,25,53,23],writabl:53,freestand:23,of_list:[12,13,14,15,18,19],benchspec:33,numexpress:67,spiffysh:20,allowsanysmalls:16,mask:[70,64,81,5,54],shadowlist:51,tricki:[70,73,64,83],mimic:64,createuitofp:[39,41,45,2,47,48],prealloc:16,cpp:[64,0,32,4,94,5,99,39,8,41,108,93,45,2,47,48,10,96,51,70,20,53,73,21,24,58,81,62],cpu:[87,51,32,25,1,9,34,73,74,107,54,77,23],illustr:[43,41,23,20,45,53,48,73,86,75,108,12,15,16,17,18,19],labeltyp:16,scc:57,dw_at_apple_properti:53,mno:25,fntree:32,astcontext:64,rewrit:[30,57,97,51,69,45,64,15],add16ri:6,incap:[38,11,107],add16rm:6,dsl:[6,95],tail:107,add16rr:6,norm:[62,29,111],getframeinfo:[81,51],"102kb":20,gcov_prefix_strip:90,element_typ:[12,13,14,15,
 19],attr0:107,attr1:107,strang:[64,75],condition:1,quux:64,pedant:58,sane:[25,83,58,17,43],small:[64,32,33,89,36,4,23,67,37,39,8,42,43,10,80,17,97,98,70,20,53,73,77,16,25,81,105,26,84,107,27],release_xi:89,dsa:57,mount:24,"__image_info":23,sync:[24,25,87,83,8],past:[39,79,51,98,23,64,2,26,69,14,16,111],trick:[45,97,23,43,9,21,26,16],deleg:[103,83],xor:81,registerregalloc:73,clock:[73,23],section:[81,58,92,52,107,1,40,63,83,64,75,77],delet:[24,81,92,40,32,8,80,61,64,23,5,93],succinct:1,letlist:29,contrast:[97,41,103,81,73,19],hasn:[73,16,98],full:[24,96,64,58,94,40,81,9,46,83,76,26,27,106,89,101,93],hash:[24,40,23,26,32,16],vtabl:[64,5,53],unmodifi:69,tailcal:81,blocknam:107,inher:[93,16],ineffici:[0,81,45,107,15,16],dw_tag_arg_vari:[39,53],islvalu:64,simpleproject:58,myownp3sett:53,shufflevector:[5,75],prior:[67,24,64,103,20,81,46,73,107,27,23],lto_module_get_symbol_nam:86,pick:[81,58,98,59,9,64,75,77],action:[99,64,51,70,16,81,73,3,103,62,23],narrowaddr:23,token_prec:[12,13,14,15,1
 8,19],via:[72,30,81,24,86,71,9,94,61,22,103,76,62,23],depart:[64,92],dw_tag_namespac:53,ifcond:[39,45,2,47,13,14,15],vim:[24,110,6,62],memrr:51,image_sym_class_member_of_union:104,ifcont:[39,45,2,47,13,14,15],unbias:56,decrement:103,select:75,x44:104,llvm_doxygen_qch_filenam:58,targetselect:[39,45,2,47,48],objectivec:23,isconst:[16,107],more:[58,40,81,83,107,80],isintegerti:16,door:97,tester:63,f3_2:51,zeroext:[25,23,107],addcom:70,webkit:[84,23],multiset:16,compani:26,cach:[72,30,39,58,40,23,25,81,34,83,73,84,16,53],uint64:84,llvm_on_unix:4,enable_if:97,at_apple_properti:53,x86callingconv:51,isnullvalu:32,returntyp:23,learn:[24,38,64,79,32,25,45,110,11,23,15,16],cmpinst:16,add_librari:58,bogu:73,scan:[73,38,81,70,32,74,1,64,48,10,21,11,12,77],challeng:[69,14,64,2],registr:[70,93,100,94],accept:[24,64,79,97,8,5,20,93,89,61,35,26,22,23,32,68,28,16,29,111],pessim:30,x86instrinfo:51,v_reg:81,huge:[24,64,10,21,26,6],llvmgrep:24,readobj:63,attrpchwrit:21,clangxx:10,appenduniqu:23,simpl:[
 64,1,35,5,67,99,40,80,98,70,20,74,75,77,106,56,24,58,81,83,26,107,27],isn:83,loophead:[23,2,47],plant:73,referenc:[32,23,39,41,108,45,2,47,48,12,13,14,15,16,18,19,51,20,53,106,57,86,25,61,107,29],spillalign:51,variant:[73,30,51,16,20,10,27,84,13,12,4,14,15,5,17,18,19],unsound:69,plane:[14,2],maywritetomemori:[16,83],thought:[23,81,29,69],circumst:[51,5,45,48,73,23,103,12,62,15,16],github:[50,79],arcanist:[37,79],author:[64,97,32,81,26,57,23,93],imm_eq0:6,atan2:[43,17],nvidia:[81,8],returns_signed_char:23,constitu:[13,47],ith:16,trade:[80,16],i386:[76,81],paper:[37,81,64,100],vec2:[23,16],pane:79,vec1:[23,16],bou_unset:20,nifti:[73,13,38,11,47],alli:23,gcov:90,hexinteg:29,superflu:98,targetselectiondag:[99,81,51],image_sym_type_void:104,argsv:[39,41,45,2,47,48],opaqu:[107,75],cond_next:[15,45],instruct:40,authent:[109,100],achiev:[65,58,86,23,83],tokcodefrag:29,lto_module_is_object_file_in_memory_for_target:86,found:[30,59,0,31,81,89,35,36,65,4,5,37,39,92,8,41,42,45,2,10,14,15,16,49,
 19,51,70,20,53,73,23,24,58,102,80,25,40,87,26,103,62,86],gettermin:16,mergabl:30,quesion:32,"0b000011":51,procedur:[57,100,43,32,20,89,75,16,17,49],realli:[99,64,58,20,83,26],loweralloc:73,getcalleesavedreg:51,reduct:64,reconstitut:23,ftp:24,massiv:[62,21,44],ftz:8,stackframes:70,research:[37,33,99,53],getbasicblock:81,x86genregisterinfo:[81,51],occurr:[5,107],ftl:[84,23],loopbb:[39,45,2,47],isfirstclasstyp:32,distoth:62,mrm0r:51,numabbrevop:107,believ:[64,23,2,47,48,26,12,13,14,16],"__cxa_begin_catch":103,mrm0m:51,fnptrval:23,xxxend:16,struggl:24,amper:34,testament:[43,17],ge_missing_jmp_buf:64,new_then_bb:[13,14,15],major:[67,64,81,5,40],instprint:21,dw_at_high_pc:53,curesult:8,unprofit:30,number:[75,40],sometim:[24,26,107,97,51,30,5,20,87,64,80,10,21,23,32,62,98,81,16,93],obj_root:24,horribl:64,dw_at_low_pc:53,guess:58,exponenti:[30,20,23],checkpoint:103,unrecogniz:106,functionast:[39,41,108,45,2,47,48],illeg:[30,81,98,8,23,20,0,69,16,93],dfa:[81,21,101],fptr:[39,45,2,47,48],rela
 tionship:[65,32,5,70,23],no_switch:0,dagarglist:29,consult:[24,57,92,37,25,73,35,62],aad:81,llvm_svn_rw:94,tokstr:29,seamlessli:86,reus:[81,53,73,26,84,23],arrang:[73,30,97,20,81,10,23],comput:[67,64,100,40,81,36,80,56,93],packag:[24,58,9,34,89,62,56],returns_twic:23,flto:61,equival:[30,64,32,23,38,8,68,11,16,98,70,20,22,75,77,103,25,81,83,107,62,29,111],odd:[20,26,64,25,59],self:[67,81,107],also:[58,107,40,81,83,75,80],without:[67,107,96,64,58,92,42,20,81,83,80,90,26,75,103,77,94,5,56],ex2:8,selp:8,ptrc:8,coff:[81,100,107],ptra:8,pipelin:[73,30,39,51,8,45,2,47,48,10,107,36,12,13,14,15,23],unset_vari:62,rhs_val:[12,13,14,15,19],plai:[38,32,43,73,11,29,17],plan:[24,93,8,70,81,46,26,16,6],exn:23,alu32_rr:65,"0x14c":104,cover:81,ext:75,abnorm:4,exp:3,pubnam:53,gold:[24,81],getsymbolnam:51,xcode:[24,58,94],gcmetadaprint:70,session:[110,16,94],tracevalu:30,ugt:23,impact:[70,23,64,16,53],addrri:51,writer:[81,44,83,107,101],solut:[93,58,20,81,83,75],printdatadirect:51,baseregisterinfo:21,l
 lvm_executionengin:[12,13,14,15,25],factor:[64,0,16,81,23,6,111],bernstein:53,i64imm:51,llvm_obj_dir:93,microprocessor:[81,23,51],regstat:81,mainten:[65,26,86],bitmap:107,n1757:64,f2_1:51,synthet:51,f2_2:51,synthes:[12,99,53,48],"__chkstk":22,machinememoperand:83,coerce_offset0:5,link_compon:[62,49],image_sym_class_member_of_enum:104,seq:104,creator:[73,24,58],overwhelm:[43,17],startup:[24,64,8,1,60,23],see:[58,107,40,81,83,3,75,80,56],sed:[24,93,62],sec:23,sea:[100,68],overboard:64,analog:[70,23,111,16,69],reglist:51,parsenumberexpr:[39,41,108,45,2,47,48],lto_codegen_cr:86,topmost:70,mymaptyp:87,subdir:62,documentlisttrait:87,thrive:37,signatur:[92,69,25,81,73,75,36,23],machineoperand:[81,51],javascript:[23,38,11,84],libnam:[73,62,96],myocamlbuild:[12,13,14,15,19],disallow:[98,69,20,84,27,23],nohup:31,dividend:[81,23],proj_src_dir:62,bodi:[64,107,32,20,80,23,5],last:[64,0,69,1,89,97,23,39,92,41,5,43,2,10,14,16,19,51,20,73,103,81,26,107,110,29,111],operarand:3,whole:[30,64,32,33,23,
 99,92,108,9,47,48,10,12,13,16,18,70,73,54,81,26,27],lower16:22,sink:[20,40],load:[64,59,1,5,40,42,44,52,94,80,98,70,20,71,74,75,77,58,81,83,107,27],episod:[13,47],nakatani:81,dw_tag_namelist:53,hollow:87,lex:[39,43,12,13,14,15,29,17,18,19],functionpass:[70,30,16,51,40],"0x100000f24":76,boolean_property_nam:27,worthless:64,devic:[7,91,102,8,88,71,34],perpetu:26,sinc:[59,87,31,32,34,89,35,64,65,4,23,6,72,39,81,8,41,108,43,93,9,2,47,48,45,12,13,14,15,16,18,19,51,98,70,97,20,53,73,56,92,24,69,103,25,40,82,26,84,107,62,110,29],devis:49,firm:62,gettokpreced:[39,41,108,45,2,47,48],fire:[64,80],func:[67,23,7,16],registerpass:73,rdtsc:23,uncertain:64,straight:[40,41,32,43,81,108,54,4,111,16,17,18,19],erron:[24,20],histor:[10,64,23,83,98],durat:[73,81,40],passmanag:[72,20],error:[81,58,83,40],dvariabl:58,v1size:40,machinecodeemitt:51,binutil:[109,24,100,9,61],genregisternam:81,miscommun:26,inst_invok:107,chase:59,i29:23,decor:53,irrelev:[98,40],initializerconst:23,i20:23,i24:23,x64:[109,24,5]
 ,funni:[15,45],decod:[23,107],sparclite86x:51,built_sourc:62,cta:8,bitread:27,predreg:65,dw_at_declar:53,stack:40,recent:[24,31,103,87,26,23],call32r:111,eleg:[38,108,47,48,11,12,13,18],rdi:[84,6],implicitus:81,llvm_unreach:[32,64],person:[87,103,25,59,110,23],parse_prototyp:[12,13,14,15,18,19],expens:[30,64,51,32,20,83,73,103,16],call32m:111,llvm_tablegen:58,crosscompil:[81,9],else_v:[13,14,15],immutablepass:40,debug_level:20,simd:[77,74,23,0],numshadowbyt:84,sidebar:89,browsabl:58,smooshlab:37,eager:16,input:[30,81,0,88,1,5,90,36,65,23,6,7,91,8,42,44,10,80,93,51,20,71,53,73,21,76,77,55,106,24,57,40,105,74,62,101,86,111],format:75,immtypebit:6,intuit:23,dw_tag_ptr_to_member_typ:53,formal:[32,53,23,16,6,111],pf1:32,todefin:21,atomicexpand:83,ivar:53,isdeclar:[25,16],threadsaf:70,image_sym_type_nul:104,parse_toplevel:[12,13,14,15,18,19],ii32:111,x86framelow:81,moduleid:[10,41,19],encount:[23,106,81,16,51],image_file_debug_strip:104,sampl:20,sight:[15,45],itanium_abi_tripl:10,attrvisi
 tor:21,"_bool":[15,45],p5i8:8,recognit:25,llvm_obj_root:[10,62,33,49],xxxgendagisel:51,agreement:26,wget:24,materi:32,codeemittergen:21,image_sym_type_long:104,condbranch:51,oneormor:20,getinsertblock:[39,45,2,47],putchard:[38,39,41,45,2,47,48,11,12,13,14,15],primarili:[24,7,44,30,70,46,1,2,52,34,27,14,81,16,55,111],result_float:69,getimm:51,xxxinstrformat:51,requires_rtti:60,contributor:26,occupi:[23,92],span:[73,64,6],printinformationalmessag:20,custom:[42,64,81,5,58],createcondbr:[39,45,2,47],parse_arg:[12,13,14,15,18,19],expound:53,subgraph:30,atop:70,nodupl:23,atoi:23,link:[96,64,58,92,40,42,81,83,63,80],line:[81,88,1,5,90,35,64,36,23,67,7,91,92,8,42,93,94,80,70,20,71,74,54,76,77,55,106,24,57,58,102,103,59,83,105,60,61,26,27,62,101],talli:33,cin:93,intim:64,hex8:87,"0xffffffff":107,doc:[42,58],call_site_num:103,"char":[64,0,94,23,67,39,92,8,41,108,45,2,47,48,12,13,14,15,16,17,18,19,51,98,20,53,73,40,86],gcfunctioninfo:70,doe:[99,44,58,92,40,80,20,1,64,83,94,90,26,22,107,103,91,
 106,81,5],linkonceodrlinkag:16,tok_unari:[39,45,2],intrepid:[108,18],xxxcodeemitt:51,ud2a:81,kwalifi:104,scrape:1,download_prerequisit:24,disp32:81,isnotduplic:6,issiz:16,caml:[17,18],lang:20,mayalia:40,land:[69,26,23,46,103],x86codeemitt:51,algorithm:40,agg:23,libstdc:[24,64,9],fresh:[24,62],hello:[67,24,35,23,111],mustalia:40,llvmcontext:23,code:[107,83,75,40],partial:[81,57,23,101],resultv:23,scratch:[23,25,16,51],setcc:[81,16],globallisttyp:16,printimplicitdef:51,young:16,send:[7,91,88,74,81,83,26,101],tr1:16,sens:[38,64,58,92,98,40,41,23,20,81,46,83,53,11,16,93,19],getprocesstripl:39,sent:[37,26,79,88,89,74,69,105],unzip:[31,24],flagscpumask:87,clearresourc:81,registeredarg:70,tri:[30,58,51,32,43,81,80,73,110,23,17],bsd4:92,setconvertact:51,dname:20,complic:[24,99,64,97,51,0,70,46,83,10,35],trc:81,tre:30,fewer:[70,30,69],"__llvm_covmap":67,race:[23,16,83],build_uitofp:[12,13,14,15,19],vehicl:64,use_s:16,monospac:110,natur:[24,64,97,98,70,23,20,83,26,86,103,5],odr:23,proj_obj_di
 r:62,psubu:10,rauw:[32,25,57,16],ueq:[45,15,23],index:[67,107,92,40,70,103,20,81,105,22,75],step_val:[13,14,15],targetregisterclass:[81,51],asmwrit:[70,99],getanalysisusag:40,henceforth:[82,23],paramti:107,image_scn_align_64byt:104,dyn_cast_or_nul:16,lea:[81,6],leb:67,mappingtrait:87,len:23,short_enum:23,sparctargetlow:51,rglob:7,let:[67,59,79,97,40,32,20,8,53,5,110,60,109,86,23,69,65,98,81,16],ubuntu:[24,9,34],ptx30:81,ptx31:81,great:[64,70,43,81,2,73,26,62,14,16,17],survei:100,dllvm_enable_doxygen:58,technolog:[86,25,11,38],rdx:[84,6],flagshollow:87,global_end:16,ifloc:39,sgt:23,sgi:16,pf0:32,sgn:23,llvm_enable_cxx1i:58,sge:23,movsx32rr16:81,"__________":16,getnumparam:16,eltti:[39,107],zip:[24,62],commun:[94,26,64,93,40],my_fmad:8,doubl:[30,81,32,35,23,38,39,100,97,41,5,43,45,2,47,48,11,12,13,14,15,16,17,18,19,51,20,53,87,107,108,62,111],upgrad:[26,52],next:[64,80,107],doubt:[110,97],lock:[73,23,16,83],commut:[30,81,51,40],fpregsclass:51,comparison:[3,23,83,97,98],gladli:[24,35],
 firstcondit:16,bunzip2:24,objectslo:62,uvari:58,get_instrinfo_operand_enum:51,folder:[24,58],devmajor:8,intregssuperregclass:51,scatter:53,gc_root:69,statepoint_token:69,dw_form_data4:53,n2431:64,weaker:23,dw_form_data1:53,dw_form_data2:53,process:[80,56,83],shadowbyt:84,preformat:110,high:[107,40],fprintf:[39,41,108,45,2,47,48],streamer:81,dw_ate_signed_char:53,onlin:[15,45],adc32mi8:6,visitsrl:99,delai:[32,16],infeas:57,allocainst:[64,16,45,39,15,23],stand:[73,64,16,81,10,26,108,23,18],overridden:[23,40],singular:64,surfac:81,xc3:104,loc0:84,loc1:84,xc7:104,xc4:104,x86registerinfo:[81,51],dw_at_apple_property_attribut:53,dw_tag_class_typ:53,alloc:40,essenti:[51,70,16,71,83,107,32,29],sdiv:81,counter:[80,83,105],robot:37,element:[99,64,75,40,81,107],liveintervalanalysi:81,unaccept:26,allow:[107,81,58,92,40,42,74,1,64,83,90,3,75,5],retval:[39,41,45,2,47,48,23],stepexpr:[39,15,45,2,47],movl:[84,5],decltyp:64,fstrict:23,movi:64,move:[24,64,92,40,70,69,81,83,89,26,84,95,30,23,6,93],sta
 cksav:46,movz:75,movw:22,oprofil:[60,58],gcn:68,movq:84,perfect:[26,75],disambigu:40,chosen:[81,64,1,23,75],interlink:25,cond_tru:[15,45],lastinst:51,decad:6,therefor:[67,30,81,98,8,70,23,20,87,83,73,26,84,75,28,16],python:[70,24,35,1,9],initializenativetarget:[39,45,2,47,48],overal:[79,98,70,103,81,47,21,26,13,23],innermost:0,facilit:[64,16,87,53,26,23,49],smovq:81,fcc_val:51,anyth:[24,64,97,93,30,41,74,81,83,47,48,53,35,26,84,77,12,13,16,6,19],hasexternallinkag:16,xvjf:24,truth:[13,23,47],"0b111":111,llvminitializesparcasmprint:51,compute_xx:8,idxmask:23,subset:[38,98,8,23,33,1,40,53,10,26,11,16],"0x7fffffffe040":94,bump:[70,82,16],"0x400":53,lsampl:49,largeconst:84,unique_ptr:[39,45,2,47,48],variabl:[83,40],contigu:[23,16,53],myregalloc:73,tok_if:[39,45,2,47],tok_in:[39,45,2,47],memorysanit:23,shut:[64,51],initializepass:40,unpars:[108,1,18],tempt:[4,64,24],image_file_system:104,greedi:[81,20,74],shtest:1,spill:[69,81,84,51,77],could:[24,81,58,109,97,40,70,23,20,1,46,80,61,83,64,
 54,65,98,5,93],lexer:99,scari:[38,11,17,43],length:[67,92,20,1,75,107],enforc:[64,70,5,20,81,83,84,23,16,111],outsid:40,scare:26,spilt:81,softwar:[70,77,26,64],scene:16,add_pt:65,spaghetti:[43,17],selectiondagnod:[81,51],fcontext:39,owner:[81,92],stringswitch:21,add_pf:65,featurev9:51,sparcgensubtarget:51,licens:64,system:[99,81,58,92,98,52,100,20,40,74,26,75,77,64,93],parse_oper:[14,15],gcse:[73,30,16],termin:[7,44,91,92,102,103,88,20,1,64,3,71,80],f_inlined_into_main:76,llvmgcc:62,returnindex:54,ldrex:83,gotcha:64,endexpr:[39,15,45,2,47],baseclasslist:29,"12x10":23,haven:[73,33,64,23],datatyp:[20,81,16,17,43],bother:[15,45],arg_end:16,featurevi:51,stricter:[5,83],f1f2:32,xxxregisterinfo:51,tdtag:21,getzextvalu:16,viewer:64,op_end:16,var_arg_function_typ:19,clearli:[64,26,84],optimis:12,mdstring:[3,53],"0x00002200":53,tramp1:23,accuraci:[30,23],at_typ:53,rvalu:64,type_of:[12,13,14,15,19],courtesi:26,griddim:8,poison4:23,poison3:23,poison2:23,incfil:62,setloadextact:51,ffi_include_d
 ir:58,placement:62,stronger:[23,16,83,69],parsevarexpr:[39,45],face:[73,4,64,21,82],isbranch:6,brew:16,linkonc:107,fact:[64,23,38,92,40,41,93,45,2,48,11,12,14,15,16,97,98,20,73,24,57,103,81,26,27,29,111],movslq:84,dbn:24,borderlin:64,truedest:23,dbg:[80,23],bring:[38,64,70,69,11,16],rough:[111,29,83,98],trivial:[30,99,64,51,40,23,20,81,46,83,73,53,75,108,4,98,16,43,93],redirect:[10,42,39,89],isstor:81,getelementptr:[67,81,40,5,36],image_sym_class_argu:104,should:[64,1,90,3,99,92,40,42,80,20,71,74,75,77,56,58,103,81,83,26,107,101],jan:92,suppos:[81,97,32,87,73,103,27,4,23],create_funct:[12,13,14,15],opreand:16,nonzero:[107,111],hope:[64,70,32,25,60,26,69],meant:[67,24,37,31,29,71,35,23,32,62,110,16,111],insight:[67,23],familiar:[24,39,97,8,32,43,81,47,73,68,62,13,17],memcpi:[83,40],autom:[24,79,81,21,6,49],smash:23,isatleastreleas:83,symtab:16,ptr_rc:81,reid:[4,25],dw_ate_sign:53,stuff:[20,81],booltmp:[39,41,45,2,47,48,12,13,14,15,19],inlni:76,comma:[24,20,87,47,13,28,23,111],unimpor
 t:[31,69],temporarili:[62,80],binary_nam:76,movt:22,polymorph:[84,16],ofstream:20,op_iter:16,fakesourc:62,compute_factori:94,verilog:25,live_iter:70,sectionmemorymanag:[72,39,45,2,47,48],unrecurs:[15,45,39],email:[24,38,57,79,37,83,26,11],superword:[57,0],dislik:26,linkonceanylinkag:16,memri:[81,51],use_iter:16,doxygen:58,scalaropt:96,valgrind:[10,42,25,1,59],sdtc:51,etc:[64,58,40,42,81,83,26,107,85,5],cindex:51,vk_basicblock:64,preheader_bb:[13,14],position_at_end:[12,13,14,15,19],exprprec:[39,41,108,45,2,47,48],indici:107,distil:10,bininteg:29,rpcc:23,llvm_external_:58,triniti:100,insuffici:[4,23,34,51,53],immedi:[30,64,69,83,23,72,38,92,8,93,45,48,11,12,15,16,51,73,25,81,40,84,107,28,111],hex16:87,deliber:[64,84],image_sym_type_char:104,togeth:[30,64,0,32,33,5,23,67,38,92,40,41,42,43,2,47,10,11,13,14,16,17,18,19,70,20,71,53,73,106,75,56,102,80,81,105,26,108,27,111],allocationinst:16,sphinx_output_man:58,rbx:[81,6],dataflow:[45,15,23],cvt:8,reloc_absolute_dword:51,rbp:[81,6],llvm_
 tools_binary_dir:58,cvf:89,lto_module_create_from_memori:86,objmakefil:62,auxiliarydata:104,apfloat:[39,41,45,2,47,48,19],site:[30,40,70,103,1,46,35,23],sn_map:32,archiv:63,mybuilddir:58,incom:[51,23,81,45,47,26,13,14,15,16],surprisingli:[12,24,108,18,48],greater:[30,64,107,51,8,70,32,81,3,75,36,98,23],mutat:[70,30,64,16,2],referenti:30,basicblocklisttyp:16,lex_com:[12,13,14,15,17,18,19],dan:87,preserve_mostcc:[23,107],phi:[81,64,107,36],expans:[67,81,29,51,54],upon:[72,93,51,70,16,71,53,62,23,49],foldmemoryoperand:[81,51],expand:[67,99,81,111,32,54,10,64,23,36,62,55,101,5,6,93],off:[64,23,6,38,39,92,8,41,43,45,2,47,48,10,11,12,13,14,15,16,17,19,58,80,81,60,26],symbol2:22,argnam:[39,41,108,20,45,2,47,48],exampl:[83,40],command:[64,58,40,42,81,5,80],svnup:24,filesystem:[1,9],outputfilenam:20,newest:22,paus:[70,40],xec:104,glue:[81,93],web:26,makefil:[96,81,58,52],blockfrequencyinfo:[37,56],exempt:64,target_opt:24,nonnul:23,nvt:51,dest:23,piec:[59,89,64,23,39,41,108,43,45,2,47,10,13,1
 4,15,80,17,18,19,98,53,24,81,26,107,27,111],core2:10,five:[103,20,81,16],release_16:24,addsdrr:111,xe8:104,recurr:30,desc:[73,20,51],addsdrm:111,resid:[107,8,70,53,73,75,23],emmc:34,isus:81,objectbuff:72,byteswap:99,resiz:64,"0x29273623":53,captur:[23,38,39,41,5,45,2,47,48,10,11,12,13,14,15,80,18,19,20,99,53,81,84,107,108],vsx:25,main_loop:[12,13,14,15,18,19],build_exampl:62,i64:[51,8,69,81,53,5,84,75,98,23,6],emitglobaladdress:51,flush:[72,64,8,34,12,13,14,15,23,18,19],guarante:[30,26,103,98,24,70,23,20,40,45,83,53,73,21,84,69,62,81,16,93],transport:25,"__syncthread":8,avoid:[81,80,107,75,40],image_sym_class_fil:104,arg_siz:[39,41,45,2,47,48,70,16],imaginari:53,barlist:64,cmake_minimum_requir:58,stage:[37,51,8,31,42,20,81,89,108,32,86,18],"0x4200":53,c_str:[39,8,41,108,20,45,2,47,48,16,43],interven:84,nullari:[108,18],dw_op_deref:53,x86_vectorcallcc:25,getbitwidth:16,handleextern:[39,41,108,45,2,47,48],dw_tag_base_typ:53,insidebundl:81,retcc_x86_32:51,takecallback:16,waterfal:109,m
 ere:[30,98,41,69,35,23,19],merg:[58,81,5,40],behind:[81,8,5,59,64,23,54,65,16],createsubroutinetyp:39,relpo:92,valuesuffix:29,multidef:111,textfileread:64,p4i8:8,mandel:[14,2],llvm_include_exampl:58,mdnode:[3,23,53],"function":[58,107,40,83,75,80,56],reduc:[67,7,81,92,98,8,32,20,59,64,80,26,42,65,23],documentlist:87,getenv:4,dw_at_entry_pc:53,inst_cal:107,data16bitsdirect:51,lookup_funct:[12,13,14,15,19],evidenc:98,localexec:[23,107],otherwis:[30,87,32,1,34,89,90,64,36,5,67,7,39,91,41,42,43,44,9,2,47,48,68,45,12,13,14,15,16,17,18,19,96,52,86,20,71,53,73,74,23,77,55,56,88,57,58,102,69,80,59,83,108,107,103,62,101,29,111],problem:40,"int":[87,75,0,32,46,35,64,65,94,5,6,67,38,39,81,8,41,42,43,93,45,2,47,48,11,12,13,14,15,16,18,19,51,98,70,86,20,53,23,76,24,80,40,104,83,61,108,110,29,111],rightli:62,ini:27,ind:39,insertdeclar:39,ing:[30,64,41,45,48,12,15,19],inc:[51,81,73,21,65,62],bzip2:[24,62],nonetheless:23,optsiz:[23,107],libcxx:31,lookup:[24,64,30,32,23,16],varieti:[64,34,38,100,92,
 40,41,2,47,48,11,12,13,14,16,19,70,53,24,57,103,25,81,83,84,107,27,29],getopt:20,liblzma:9,computearea:97,aliasresult:40,repeat:[30,31,23,53,103,32,28,80],defaultlib:35,emitsymbolattribut:81,fexist:32,in0:23,in1:[81,23],in2:81,eof:[39,41,108,43,45,2,47,48],header_data:53,cumemfre:8,dumpabl:73,rabfik:92,configmaxtest:16,hashes_count:53,sourceloc:39,sm_20:[81,8],sm_21:81,untrust:26,child:[14,2,97],rapid:26,"const":[67,99,64,97,40,70,86,20,81,46,23],r8b:6,r8d:6,deviat:[64,81,22],binoppreced:[39,41,108,45,2,47,48],worth:[80,64,16,34,97],r8w:6,rowfield:65,emploi:16,printnextinstruct:16,getpar:[45,39,16,2,47],llvm_enable_ffi:58,cmd:79,upload:79,defens:26,"0x2a":75,red:23,add_rr:111,add_char:[12,13,14,15,17,18,19],externally_initi:23,callcount:16,cmp:[30,81,16,23],abil:[99,71,81,43,70,23,20,87,45,2,47,94,28,13,14,15,16,17,49,53],hork:111,consequ:[24,40,23,80,10,84,103,62,16],image_scn_mem_shar:104,llvmbuild:52,disk:[64,23,1,53,27,4,86],runfunctionasmain:94,loop_bb:[13,14,15],qux:23,topolog
 :5,told:64,ontwo:23,somefunc:[64,16],mcoperand:81,pred_end:16,myregisteralloc:73,optzn:[39,59,45,2,47,48,12,13,14,15],"0f7f800000":8,aka:[23,81,16,40],werror:61,dcmake_cxx_link_flag:24,idnam:[39,41,108,45,2,47,48],instr:[67,70,81,111,101],setgc:70,sspstrong:23,ftoi:51,total:[30,23,33,82,83,53,73,107,36,32,16],bra:8,highli:[70,16,81,45,15,23,49],bookkeep:[30,16],plot:[14,2],postincr:64,afterward:30,foster:[4,26],shortest:[32,29],simplifycfg:42,setreg:81,iscommut:6,llvm_enable_p:58,reinterpret:75,numberofauxsymbol:104,toolkit:[16,8],tblegen:21,armgenasmmatch:21,insignific:[84,44,23],err:[73,16,8],restor:[39,51,82,81,45,2,47,46,84,107,103,13,14,15,23],next_prec:[12,13,14,15,18,19],work:[67,99,81,58,40,70,42,20,1,74,83,52,80,26,36,100,64,105,5,56,93],foo_ctor:46,coalesc:[77,44,16,81],viewcfgonli:[16,47],unnam:[30,20,64,29,23],"16gb":109,novic:58,autodetect:[77,74],u64:8,indic:[67,26,58,92,40,70,103,20,1,64,107,3,22,75,36,81,56],llvmcore:[31,49],liter:[64,23,39,92,41,108,43,45,2,47,48,12
 ,13,14,15,16,17,18,19,20,107,28,29,111],unavail:[83,51],constantstruct:16,createinstructioncombiningpass:[39,45,2,47,48],str2:111,ordinari:[67,23],lexloc:39,sever:[30,64,31,32,33,1,36,4,23,6,67,37,38,92,40,41,93,47,10,11,13,16,49,19,51,70,20,99,53,73,21,54,24,58,102,80,81,105,107,103,62,86,111],verifi:[80,107],bindir:[62,96],recogn:[30,39,33,43,32,20,81,47,86,13,23,17],superreg:51,rebas:24,lad:20,chines:24,after:[58,107,40,81,83,75,80,56],hex32:87,lab:[109,37],law:64,arch:[24,92,31,89,74,76,77],demonstr:[67,51,41,23,25,48,12,16,19],sparccallingconv:51,domin:[70,24,64,23],writealia:32,lto_module_dispos:86,recompil:[40,25,47,84,75,13],icmpinst:16,buildslav:109,noitinerari:[6,51],order:40,movhpd:5,ud2:81,diagnos:[73,44,0],use_camlp4:[12,13,14,15,18,19],offici:81,opnod:51,llvmsystem:62,pascal:23,noimm:6,getnexttoken:[39,41,108,45,2,47,48],flexibl:81,getattribut:32,bytecod:[24,107],isellow:21,setoperationact:[81,51],induct:[24,40],them:[30,87,75,31,32,33,90,35,64,65,4,108,5,67,37,38,39,8
 1,8,41,42,43,93,9,2,47,48,10,11,45,12,13,14,15,16,17,18,19,51,98,70,97,20,53,73,106,23,54,92,24,58,102,69,80,25,40,82,83,105,60,26,84,49,107,103,27,62,28,86,111],dw_apple_property_atom:53,thei:[30,81,75,0,31,32,33,1,34,89,64,36,65,4,5,6,67,37,38,97,92,40,41,42,44,45,46,47,48,10,11,69,12,13,15,16,93,18,19,51,98,70,108,20,71,53,73,21,23,77,106,24,57,80,25,87,83,26,84,49,107,103,27,62,28,111],fragment:[52,70,16,33,81,53,23,29,111],safe:[40,42,20,81,83,26,107,80],printccoperand:51,denorm:87,"break":[24,99,26,70,103,20,81,64,89,60,3,75,54,28,23],bang:29,astread:21,selti:23,lifelong:37,stdarg:23,"__cxa_rethrow":103,sequentialtyp:16,monolith:[26,82],"0x000003cd":53,stream:[64,0,88,5,23,67,7,91,42,12,13,14,81,16,17,18,19,51,71,73,106,24,15,102,87,107,108],const_op_iter:16,network:25,visiticmpinst:80,suffic:75,lib64:[24,58],forth:75,image_file_relocs_strip:104,multilin:[1,29,111],srcmakefil:62,registeralias:21,ms_abi_tripl:10,barrier:83,multilib:9,standard:[83,75,40],nth:64,fixm:[24,51],debu
 glev:20,mvt:[81,51],angl:[87,64],zerodirect:51,regress:[24,64,31,80,33,1,89,26,62,5,49],gcregistri:70,subtl:[38,98,108,47,48,11,12,13,18],boiler:20,render:[14,81,16,2],refin:[81,40],subreg:51,i48:23,setcondcodeact:51,llvm_build_32_bit:58,"0x00000000016677e0":94,ispredic:6,image_file_bytes_reversed_hi:104,isalpha:[39,41,108,43,45,2,47,48],baseclasslistn:29,john:64,"40th":[43,17],headerdata:53,getdatasect:70,inexact:23,tee:80,registerpasspars:73,gcmetadataprinterregistri:70,analyzebranch:51,hashdata:53,llvm_build_root:58,target:[107,58,83,75],provid:[58,40,81,83,3,107],cppflag:[62,49],minut:24,uint64_t:[32,87,16,56,54],hassse2:111,hassse3:111,emitfunctionstub:51,contenti:64,n1737:64,manner:[67,24,51,98,23,81,83,103,69,16],strength:[20,81,23,83],recreat:[24,87,23],laden:[38,11],latter:[51,32,81,83,108,18],image_rel_amd64_secrel:22,"0x400528":76,postcal:70,llvm_doxygen_qhp_namespac:58,smul_lohi:81,attrdump:21,usernam:[24,26],cumodul:8,llvm_definit:58,lexic:[64,81,23,93,53],keystrok:64,r
 etcc_sparc32:51,passthru:23,valuerequir:20,instritinclass:6,bracket:[64,103,87,53,27,23],notion:[64,97,25,81,53,47,48,73,26,12,13,23],md_prof:3,opposit:[62,57,92,87],overload:[99,97,51,8,16,2,73,69,62,14,23],buildbot:1,identifi:[81,58,92,80,20,1,64,107,103,5],involv:[30,87,69,89,65,4,23,99,39,40,108,45,47,13,15,16,18,51,98,56,81,83,62],op2:23,the_funct:[12,13,14,15,19],"41m":20,sroa:57,baseopcod:[65,51],latenc:[77,81,23],callbackvh:16,govern:23,instlisttyp:16,predecessor:[30,81,23,56],showdebug:94,likewis:[70,24,23],tag_memb:53,dw_tag_compile_unit:53,llvm_include_tool:58,subtarget:[81,101],didescriptor:[39,53],numregionarrai:67,lit_arg:10,fomit:81,isosdarwin:39,emb:[23,38,11,107],cleanli:[73,64,26,23,89],st_uid:92,cudevicegetcount:8,memorywithorigin:58,chapuni:37,dw_ate_float:[39,53],eatomtypedieoffset:53,awar:[24,64,98,40,20,81,83,26,5],sphinxquickstarttempl:[24,110],dicompileunit:39,unordered_set:16,awai:[30,64,97,5,25,53,17,73,56,86,16,43],getiniti:16,accord:[58,97,51,31,16,20,89
 ,70,84,107,69,23,56],unsett:73,preprocessor:[67,38,58,51,20,93,48,11,12,62],isjumptableindex:51,memorybuff:64,image_file_machine_armnt:104,cov:63,howev:[64,0,69,33,46,35,65,4,23,6,72,38,92,40,93,45,2,47,48,10,11,12,13,14,15,16,98,70,20,53,73,22,75,24,80,25,81,82,83,60,61,26,84,107,27,62,110],xmm0:[10,84,5,6,111],xmm1:[6,111],calltmp:[39,41,45,2,47,48,12,13,14,15,19],ilp:0,themself:26,com:[24,64,26,16,50],col:39,con:[29,75],testcleanup:23,widen:[81,0],solari:24,resultti:23,excess:[77,74],getbasicblocklist:[45,39,16,2,47],permut:23,prologu:[70,107],wider:[99,83,98],add_instruction_combin:[12,13,14,15],goodby:110,speak:[13,14,2,47],degener:[30,15,45],"__builtin_expect":3,macport:60,debug_info:53,subscrib:[26,79],mallocbench:33,compatible_class:81,machineblockfrequencyinfo:56,hoist:[30,16,83,84,40],unclutt:4,binaryoper:[64,16],inhibit:23,ident:[30,64,32,23,92,40,5,45,47,48,10,12,13,14,15,16,17,18,19,70,53,75,81],aix:[81,100],gnu:[73,24,64,58,92,51,103,25,81,34,10,61,106,109,62,23,111],z
 lib:[24,58],cxx_statu:64,aim:[67,64,42,25,80,26,75,4,23],scalarrepl:83,pairwis:40,publicli:[16,53],aid:70,keytyp:53,opt:[42,64,80,63,40],cont:[23,46],conv:93,theexecutionengin:[39,45,2,47,48],extractloop:30,uint32x2_t:75,cond:[39,51,93,45,2,47,13,14,15,23,56],int_of_float:[14,15],dw_tag_lexical_block:53,dw_tag_enumer:53,old_val:[13,14,15],descent:[108,43,2,14,17,18],incorrectli:[41,43,64,19],perform:[99,71,58,92,40,103,20,1,74,83,26,75,64,81,80],descend:23,doxgyen:58,addintervalsforspil:81,fragil:5,code_own:26,evil:[6,75],hand:[30,81,31,32,64,4,6,38,97,41,108,43,2,48,11,12,14,16,17,18,19,51,98,70,21,54,58,87,83],fuse:[30,23,77],use_llvm_scalar_opt:[12,13,14,15],disassembleremitt:21,operandv:[39,45,2],kept:[73,26,64,57,40],undesir:23,scenario:[10,80,93,16,83],incorpor:[81,16],thu:[30,81,32,64,23,67,40,41,108,93,2,47,48,10,69,12,13,14,15,16,18,19,70,20,53,73,56,79,80,59,26,107,103,62],hypothet:[73,32,81,16],whizbang:64,get_reginfo_target_desc:21,contact:[73,109,25,26],thi:[64,88,1,90,
 3,36,5,67,7,91,92,40,42,44,94,100,80,96,52,20,71,99,74,22,75,76,77,55,106,56,58,102,103,81,83,105,26,107,101],gettok:[39,41,108,43,45,2,47,48],clenumvaln:20,value_load:23,destsharedlib:62,mandelbrot:[14,43,2,17],stack_loc:81,ifdef:[67,4,20,11,38],sparctargetasminfo:51,opencl:[25,8],spread:30,board:[9,34],parse_primari:[12,13,14,15,18,19],relwithdebinfo:58,mayb:[38,21,11,99],stringwithspecialstr:53,fusion:23,fsin:[74,51],xdata:25,mip:[81,83],ppc32:[25,81],irbuilder_8h:[41,19],sectnam:20,entry_block:15,bucket_count:53,bpl:6,image_file_machine_ebc:104,openfil:64,prefixdata:107,negat:[14,2,107],percentag:36,cfrac:33,bork:[20,111],flatten:[81,23,0],bore:73,pos2:20,pos1:20,getmodulematchqu:51,colloqui:23,fpic:[25,58],loadregfromaddr:51,mandleconverg:[14,2],dopartialredundancyelimin:20,wunus:64,trunk:[24,37,33,81,53,89,10,35,26],peek:[12,13,14,15,18,19],plu:[107,51,70,23,47,26,108,75,103,13,16,18],aggress:[24,57,40,70,81,64,23],memdep:40,someclass:29,pose:[70,57],confer:[70,81],fastmath:8,
 repositori:[24,93,79,37,103,59,9,53,10,26],post:[77,26,23,81],obj:[96,31,33,70,35,74,76,23],literatur:81,image_scn_align_4byt:104,canonic:[81,5],s64:8,deltalinestart:67,nctaid:8,sames:23,curiou:32,xyz:[65,77,74],"float":[81,74,56,107],profession:26,bound:70,emitinstruct:[81,51],unittestnametest:58,opportun:[30,51,0,48,12,23],accordingli:[65,70,16],wai:[67,64,92,40,70,42,20,81,83,80,26,107,103,76,94,5,93],copycost:51,callexprast:[39,41,108,45,2,47,48],n2764:64,lowest:[67,39,41,108,45,2,47,48,64,75,83,12,13,14,15,23,18,19],asmwriternum:101,raw_ostream:81,maxim:[77,43,17,107],"true":[30,87,32,64,3,65,23,6,39,81,8,97,42,9,47,10,12,13,14,15,16,19,51,98,70,20,53,73,76,77,24,25,40,83,61,29],reset:[107,111],absent:16,optimizationbit:20,legalizeop:99,x86_fastcal:81,anew:53,absenc:[81,80],llvm_gc_root_chain:70,emit:[107,80,81,83,63,74,75,77,5],hotter:56,alongsid:107,wcover:64,thunderbird:26,noinlin:[94,23,107,54],xxxjitinfo:51,postscript:30,valuelist:29,encrypt:26,refactor:[25,15,45,57],instr
 0:32,instr1:32,instr2:32,entrypoint:[25,23],test:[80,40],shrink:81,roots_siz:70,realiti:89,xxxtargetasminfo:51,fpreg:51,"2acr96qjuqsym":26,add32ri:6,dihead:53,debugflag:[20,16],clang_cl:10,pathnam:[24,96],set_value_nam:[12,13,14,15,19],libgcc1:9,concept:[81,64,107,75],mayload:6,consum:[52,23,20,98,34,35,36,28,16],dw_tag_inlined_subroutin:53,supplement:100,value_typ:87,middl:64,zone:23,graph:[24,57,80,81,101,23,56],certainli:[70,30,38,11],jvm:[38,11],"0x200":53,dootherth:64,munger_struct:98,fom:30,brows:[41,58,19],seemingli:51,dw_apple_property_readonli:53,avx1:10,avx2:10,administr:109,aad8i8:81,elttypearrai:39,gui:[35,64,58],libthread_db:94,adc64ri8:6,gut:62,sparcinstrformat:51,usescustominsert:6,upper:[64,51,42,53,62,16],isvolatil:23,brave:[108,18],preservemost:23,cost:[81,64],build_fmul:19,after_bb:[13,14,15],gr16:81,appear:[67,30,44,92,51,40,16,20,1,34,80,83,64,23,69,98,29,93,53],scaffold:[108,18],"23421e":23,constantarrai:16,uniform:[64,16],isoptim:53,va_list:23,image_sym_class_
 funct:104,gener:[107,3,83,75,40],inputcont:87,satisfi:[40,45,83,89,26,4,15],roots_end:70,precursor:26,plotter:[14,2],hash_data_count:53,mach_universal_binari:76,behav:[64,40,103,59,83,23],myvar:98,triag:81,regardless:[30,7,64,58,102,70,88,71,45,53,60,35,91,15,23],extra:[64,58,103,20,3,107],stingi:16,stksizerecord:84,marker:[81,20,1],llvm_on_xyz:4,regex:[20,5,33],prove:[30,40,32,33,46,23],nothrow:83,naddit:20,subvers:26,live:[58,75,40],tape:24,lgtm:79,"0xl00000000000000004000900000000000":23,cxxabi:24,finit:[81,21,23],ctype:25,viewcfg:[16,47],geordi:37,iffals:23,dw_tag_express:53,logarithm:107,graphic:[14,11,2,38],at_nam:53,canconstantfoldcallto:99,prepar:[23,103,9,98],focu:[81,86,110,0],cat:[10,24,20,70,76],ctfe:25,can:[64,88,1,5,90,36,66,67,99,92,40,42,44,94,80,96,52,20,71,74,22,75,76,106,56,58,103,81,83,105,26,107,101],debug_symbol:[60,62],boilerpl:[97,70,20,48,21,12],heart:[69,62,52],underestim:23,basemulticlasslist:29,chip:[51,8,81,9,34,10,74,77],spu:51,abort:[80,64,23,111,103],
 spl:6,occur:[30,81,69,1,64,5,3,36,4,23,7,91,92,42,93,10,88,16,49,96,98,70,71,73,74,57,102,103,25,59,26,84,18,107,108,62,101,29],multipl:[30,64,32,90,23,67,7,92,40,5,46,72,98,20,109,106,22,76,56,24,81,83,26,107,27],image_sym_class_regist:104,ge_missing_sigjmp_buf:64,regioninfo:30,"0x80":[92,53],x86instrss:51,product:[70,32,25,81,2,89,73,26,23,108,62,14,29,56,18],multiplicand:23,southern:100,cours:[38,40,32,20,43,99,73,11,108,62,16,17,18],uint:74,drastic:4,lto_codegen_compil:86,breakag:26,voidtyp:16,newlin:[64,92,1,2,107,14,5],copyphysreg:51,getcalledfunct:[70,16],explicit:[64,32,23,38,39,8,93,45,2,47,48,11,12,13,14,15,16,97,98,70,20,53,73,22,24,57,81,83,26,27],is_base_of:97,objectimag:72,somewhat:[37,64,40,23,33,93,2,83,26,108,69,14,16,18],ghc:[25,81,23],thread_loc:[81,23],approx:8,arch_nam:76,approv:[26,89],graphviz:[30,16],brain:64,svnrevert:24,cold:[23,56],still:[30,87,0,32,33,1,46,90,35,64,4,23,67,38,81,93,45,2,47,11,13,14,15,16,72,97,70,20,53,73,75,24,80,25,59,60,61,26,84,62],ie
 ee:[74,23,92],dynam:[80,107],mypass:[73,16],conjunct:[52,31,62,4,23,111],precondit:64,getoperand:[64,81,16,51],window:[20,81,58,64],addreg:81,curli:[10,23,64,16,111],val_success:23,llvm_doxygen_qhelpgenerator_path:58,has_asmprint:27,non:[64,88,1,36,5,67,7,91,92,40,42,44,80,96,52,20,71,99,74,77,58,102,103,81,83,26,107,101],evok:23,recal:[41,32,87,47,48,12,19],halv:99,half:[90,64,107],recap:75,now:[99,81,58,92,80,20,1,64,83,26,5],nop:[84,25,23],discuss:[67,24,64,97,51,37,23,25,53,6,73,26,84,108,69,16,20,18],mybranch:24,organ:[103,64],drop:[25,26,23,64,79],reg1024:81,reg1025:81,reg1026:81,reg1027:81,image_scn_align_1024byt:104,dw_tag_vari:53,add32rr:6,domain:[38,51,70,81,11,95,23,6],replac:[90,24,57,58,92,8,70,32,20,81,83,61,26,86,54,103,106,23],arg2:[43,23,17],condmovfp:111,add32mi8:6,backport:9,reallyhidden:20,year:[25,64,6],rl5:8,rl4:8,happen:[81,64,26,5,83],targetfunc:16,rl1:8,rl3:8,rl2:8,shown:[67,51,33,8,55,23,20,1,2,53,90,35,84,75,97,14,110,16,6],accomplish:[24,97,30,70,43,26,16
 ,17],space:107,oldval:[45,39,23,2,47],rational:81,ldrr:51,release_34:24,release_31:24,release_30:24,release_33:24,release_32:24,argu:64,argv:[67,8,20,53,94,77,80],ldrd:83,mandelconverg:[14,2],argc:[67,8,20,53,94,23],ocamlc:25,card:[69,34],care:[24,38,64,51,40,5,33,81,45,83,89,73,111,11,23,4,28,15,16,6,93],xor16rr:81,couldn:[32,40],adc32rr:6,enginebuild:[72,39,45,2,47,48],unwis:[23,92],adc32ri:6,blind:81,yourself:[24,99,26,16,111],stringref:[20,64],size:[30,64,32,83,36,66,67,99,92,8,42,80,98,70,20,106,22,75,81,40,23,60,107,86],yypvr:110,silent:[26,23,111,40],caught:[103,64,23],yin:87,himitsu:24,checker:[21,98,59],cumul:81,friend:93,editor:[24,26,64,110,62],nummeta:70,ariti:70,especi:[30,26,51,32,20,93,64,34,83,3,57,4,16,49,53],dw_tag_interface_typ:53,apple_nam:53,cpu0:50,cpu1:87,qual:23,llvmtop:73,mostli:[30,38,39,58,51,24,32,20,81,83,47,35,57,11,13],quad:[23,51],than:[67,107,99,64,58,92,40,70,103,20,81,74,83,26,75,36,80,56,93],image_sym_type_word:104,"0x432ff973cafa8000":23,xcore:81
 ,spisd:51,browser:[37,79],anywher:[110,32,45,10,86,23,108,62,15,5,6,18],getint32ti:64,cc_sparc32:51,bitcast:[70,98,5,75,40],engin:[24,96,57,93,98],fldcw:81,mccodeemitt:[81,21],begin:[81,32,89,35,64,4,23,72,39,92,40,97,44,45,47,12,13,14,15,16,18,19,51,70,20,53,24,57,25,87,26,84,107,29],importantli:[13,64,47,40],numrecord:84,toplevel:[12,13,14,15,18,19],setdebugloc:39,wire:93,cstdlib:108,getpointers:70,renam:[24,64,31,23,45,53,41,62,15,16],"_p1":53,"_p3":53,callinst:16,llvm_libdir_suffix:58,add_reassoci:[12,13,14,15],image_file_bytes_reversed_lo:104,fifth:[67,23,51,8],onli:[81,32,1,64,89,35,3,36,65,23,67,99,92,8,5,44,9,46,80,93,98,97,52,70,20,71,74,22,75,76,77,55,106,24,57,58,103,40,83,26,107,27,62,101,86],ratio:56,image_rel_i386_dir32nb:22,expr_prec:[12,13,14,15,18,19],endloop:[39,15,45,2,47],overwritten:[84,81,23],llvminitializesparctargetinfo:51,cannot:[30,64,0,90,35,4,5,72,38,40,23,46,11,80,51,98,70,20,73,106,22,75,16,25,81,83,105,26,42],mrm6r:51,operandlist:111,seldom:32,intermit
 t:24,object_addr:70,gettypenam:16,rrinst:111,"0x0000000000d953b3":94,sometest:33,hierarchi:[24,99,1],istreambuf_iter:8,foo_test:10,concern:[98,70,16,26,27,23],"1svn":89,dityp:39,mrminitreg:51,printinstruct:[21,51],between:[67,99,81,107,40,70,20,44,74,83,105,26,75,64,5,93],x86reloc:51,modulelevelpass:73,paramet:[81,58,98,70,103,20,1,64,3,107,54],constantpoolsect:51,clang_cpp:10,"__text":81,intregssubclass:51,dw_tag_subrange_typ:53,mono:25,pertain:[62,26,53,103],inputfilenam:20,nearbi:32,inconsist:[64,53,98],qualtyp:64,image_sym_type_struct:104,gr32:[81,6,111],my86flag:87,clarif:[100,26,64],invert:10,shim:30,valuekind:64,invers:30,uglifi:[12,48],getentryblock:[45,39,16],kdevelop3:24,derefer:[23,16,53,98],normalformat:20,rubi:70,getjitinfo:[81,51],thischar:[39,41,108,43,45,2,47,48],eip:6,global_context:[12,13,14,15,19],retcc_x86_32_c:51,fastemit:21,fneg:23,initializenativetargetasmpars:[39,45,2,47,48],dw_at_artifici:53,stdout:[24,104,35,12,13,14,15,23,18,19],metric:[73,56,89],henc:[24,
 29,20,93,84,86],worri:[24,39,79,108,20,23,18],eras:[39,41,20,93,45,2,47,83,62,16,53],bigblock:77,antisymmetri:32,proto:[39,41,108,45,2,47,48,12,13,14,15,18,19],"__nv_powf":8,sizeofimm:51,image_scn_lnk_info:104,cc1:94,epoch:[87,92],komatsu:81,externalstorag:20,document:[58,107,40,81,83,75,56],finish:[0,31,32,89,48,23,72,39,41,45,2,47,94,12,13,14,15,80,18,19,73,103,81,110],closest:[39,23],someon:[38,64,81,99,26,11,110],removebranch:51,freeli:[26,83],tradition:[81,40],pervas:[16,97],whose:[67,64,107,51,40,106,29,53,81,45,2,80,26,23,108,14,15,16,18,111],createstor:[39,45],destreg:81,ccc:[23,9,107],noaa:30,touch:[30,64,23,53,73,16],tool_verbos:[24,62],speed:[64,20,45,10,26,15],create_modul:[12,13,14,15,19],struct:107,bb0_29:8,bb0_28:8,getx86regnum:51,bb0_26:8,desktop:60,identif:[24,9,29,23],gettoknam:39,treatment:[70,51],versa:83,real:[24,64,51,8,5,20,40,43,2,53,23,14,16,6],imul16rmi8:81,"0x82638293":53,read:[64,88,90,36,5,7,91,92,40,44,94,100,80,93,20,71,99,74,75,76,77,55,81,83,105,26,1
 07,101],cayman:100,googletest:1,bangoper:29,funcresolv:16,benefit:[30,64,40,70,25,98,53,16,49],lex_numb:[12,13,14,15,17,18,19],output:[64,58,40,42,81,5,80,56],debug_pubtyp:53,matur:[70,20],initid:107,cmake_install_prefix:[58,35,9],viral:26,getregisterinfo:[81,51],debug_with_typ:16,extralib:62,blockidx:8,lto_codegen_set_debug_model:86,v2i32:23,n64:25,tdm:109,tok_binari:[39,45,2],sixth:51,objectbufferstream:72,asan:25,flagprototyp:39,"throw":81,dw_tag_subprogram:53,src:[96,51,31,33,81,89,23,49],sra:[29,111],central:[4,53,103],greatli:[69,25,53],underwai:25,image_sym_class_sect:104,srl:[29,111],numbit:16,chop:53,degre:[109,83,0],dw_tag_subroutine_typ:53,backup:61,processor:[24,58,51,0,70,100,25,81,53,6,21,75,77,62,23,20],valuecol:65,bodylist:29,op3val:51,llibnam:20,unregist:73,xxxbegin:16,outloop:[39,15,45,2,47],yout:87,your:[80,83,40],parsebinoprh:[39,41,108,45,2,47,48],verifyfunct:[39,41,45,2,47,48],loc:[85,39,53,51],log:[1,80,40],opengl:[38,64,11],aren:[30,38,81,98,24,70,23,40,64,47
 ,48,35,26,11,12,16],haskel:[16,38,11,23],start:[80,107,40],low:[81,107],lot:[30,81,33,34,64,23,6,38,39,97,41,108,43,93,45,2,48,11,12,14,15,16,17,18,19,51,98,70,20,99,53,73,54,24,80,25,87,60,26,62],colder:56,submiss:26,satur:[14,2],addresssanit:[25,23],furthermor:[30,5,23,98],"default":[81,3,58,107,40],tok_def:[39,41,108,43,45,2,47,48],start_bb:[13,14,15],bucket:[16,53],v32:8,scanner:[43,17],decreas:77,opnam:51,producess:24,value_1:27,prepend:[90,16,53],valid:[72,30,96,58,98,8,5,20,93,74,89,26,23,32,77,16,56],release_19:24,release_18:24,release_17:24,ignor:[0,32,36,5,37,39,40,41,23,43,44,45,2,47,48,12,13,14,15,16,17,18,19,51,20,53,56,24,81,26,107,108,27,62,28],you:[30,81,31,32,1,34,63,83,90,35,64,5,67,99,92,8,23,93,9,94,88,16,49,97,98,70,20,71,53,54,76,77,89,24,58,79,80,59,40,60,61,26,107,42,109,62],release_14:24,release_13:24,release_12:24,release_11:24,poor:[13,64,47],polar:87,registri:70,base_offset:69,multidimension:23,binfmt:24,pool:[51,81,73,84,107,36],namedvalu:[39,41,45,2,47,
 48],bulk:[45,15,16,81],adc64mr:6,value_n:27,skeleton:24,osx:92,messi:81,month:[37,89],correl:[70,23],"__cxa_end_catch":103,getglob:51,pandaboard:34,paramidx:107,getnullvalu:[45,39,16,2,47],"_ri":111,cpufrequtil:34,sparcinstrinfo:51,articl:[30,24,32,45,47,13,15],sdisel:57,gcfunctionmetadata:[70,84],phielimin:81,"_rr":111,datalayout:107,verb:[62,64],mechan:[81,107],veri:[30,81,0,32,33,34,89,64,5,6,93,37,38,40,41,23,43,44,45,2,47,48,10,11,95,12,13,14,15,16,17,18,19,98,70,108,20,53,73,21,24,80,87,83,26,107,103,28,111],passmanagerbas:51,targetregisterdesc:[81,51],methodbodi:51,eatomtypetag:53,emul:[99,81,23,64],cosin:[23,51],customari:[20,23],dimens:23,fixedt:53,preserveal:23,casual:[62,26],kistanova:109,dofin:51,nand:23,fpformat:[6,111],isobjcclass:53,llvmlibspath:62,fp128:[32,23,107],"0x00000100":53,signextimm:81,modular:[27,73,71,64,40],minor:[38,64,32,81,89,60,26,11],exeext:[10,62],mclabel:81,strong:[32,93,83,26,23,5],modifi:[64,81,80,83,40],divisor:23,ahead:[24,64,108,43,59,73,35,26
 ],dform_1:81,xstep:[14,2],amount:[30,59,32,64,23,6,99,43,93,48,12,80,17,70,20,71,73,74,77,16,81,82,21,84,103,62],sphinx_warnings_as_error:58,initializealiasanalysi:40,put:[30,81,69,89,64,23,67,38,39,40,5,43,45,47,94,10,11,32,13,15,16,17,70,20,53,73,80,87,83,110],famili:[38,23,53,35,11,69,68,16],sequencetrait:87,dangl:[13,16],"0x710":76,is64bitmod:51,isimmedi:51,zorg:109,massag:64,formul:4,bash:[4,110],libxml2:9,taken:[30,38,92,51,40,31,32,20,81,103,3,11,23,62,4,16,6],distfil:62,zork:111,vec:[23,16],build_arch:[62,49],cbtw:81,valuetyp:[81,6,51],regoffset:28,oblivi:75,targetcallingconv:51,"0b000111":51,x00:104,x86instrmmx:51,histori:[24,26,79],ninf:23,reindent:64,templat:[24,64,97,40,70,32,20,30,23],vectortyp:16,unreli:40,parsabl:69,phrase:64,mabical:25,anoth:[30,81,32,34,35,64,65,23,67,99,92,8,5,93,9,46,70,20,71,22,75,57,40,83,26,107,27,62,86],llvm_enable_rtti:58,snippet:[70,16],reject:[20,5],getarg:39,rude:103,personlist:87,secondlastopc:51,unlink:[41,16],retcc_x86common:51,"0x00003
 500":53,lifetim:[70,81],machinepassregistri:73,help:[64,88,1,63,90,36,5,7,91,40,42,80,96,52,71,74,75,77,55,58,102,83,105,106,85,101],mbbi:81,soon:[31,108,47,73,26,13,86,18],mrmdestreg:[6,51],held:[26,23,79,75],ffi:93,foo4:[61,86],foo1:[61,86],foo2:[61,86],foo3:[61,86],dfpreg:51,eatomtypecuoffset:53,tok_els:[39,45,2,47],mergebb:[39,45,2,47],systemz:81,finer:40,cee:16,dexonsmith:53,sentenc:64,wideaddr:23,ninja:9,gmon:62,libllvm:60,stopper:31,addenda:100,x0c:104,iff:23,scalarevolut:[98,40],fulli:[81,56,107],heavi:[62,16],succ_iter:16,llvm_build_tool:58,beyond:[101,98,16,103,28,110,23,6],todo:[30,99,79,31,69,81,9,53,73,21,95],ific:20,isunaryop:[39,45,2],ppcinstrinfo:99,safeti:23,publish:[31,64,16],debuglevel:20,dynamci:23,astnod:21,unreview:26,labf:20,ast:[43,21,57],errorp:[39,41,108,45,2,47,48],dw_tag_volatile_typ:53,mystruct:98,pub:53,mips64:[24,25],reason:[64,32,39,4,23,99,45,40,41,108,43,9,47,48,10,69,12,13,15,16,17,18,19,97,98,20,53,73,21,24,103,81,82,83,26,27,110,111],base:[80,3,5
 8,107,40],ask:[99,26,40],asi:51,intermodular:[37,86],wglobal:64,asm:107,basi:[43,70,23,20,2,36,14,16,17],n2439:64,launch:8,warpsiz:8,undergo:[30,23],assign:[3,57,98,8,32,20,81,64,83,26,107,65,23,56,93],obviou:[30,38,64,40,32,53,81,80,2,48,21,26,11,108,75,83,12,84,14,23,93],ultrasparc3:51,islazi:51,isregist:81,uninterest:[43,17],implementor:[12,13,6,47,48],miss:[45,0,23,33,9,2,80,61,64,108,14,15,16,18],st6:6,st4:6,st5:6,nodetail:36,st7:6,st0:[6,51,111],st1:[81,75,6,51],st2:6,st3:6,scheme:[64,51,70,36,45,54,15,16],schema:[87,1,104,52],adher:[4,26,16,6,95],xxxgencodeemitt:51,getter:[21,16,53],bidirect:16,newabbrevlen:107,intrinsicinst:70,grep:[24,58,20,81,34,10,5,33],stl:[24,64,30,87,16,93],rootmetadata:70,store:[67,107,58,92,40,103,20,81,83,75,76,5,56],str:[67,39,8,41,16,45,2,47,48,104,75,108,23],consumpt:[73,81],aliaseeti:23,toward:[37,26,16,56,23],grei:31,randomli:66,gofmt:64,"null":[103,77,74,64,40],dllvm_target_arch:9,attrimpl:21,imagin:32,unintend:30,bz2:24,lib:[99,58,70,20,81,96
 ,94,36,55],lic:30,ourfunctionpass:16,lit:[58,63],"__apple_objc":53,useless:[38,53,47,11,75,13],numfunct:84,mixtur:111,c_ctor_bas:5,maco:[24,93,16],alpha:[23,51],filenameindex0:67,isbarri:[6,111],hipe:[81,23],clear:[64,46,23,39,41,108,45,2,47,48,12,13,14,15,16,18,19,98,70,71,26,27,62],implicitdef:81,clean:[24,81,42,59,89,86,93],latest:[31,25,5],test1:[10,110],unsimm:81,v16:8,instrins:23,i32imm:[51,111],"3x4":23,get_instrinfo_named_op:51,getgloballist:16,ptrval:23,coerc:32,delin:1,pretti:[30,32,33,4,41,108,43,45,2,47,48,12,13,14,15,17,18,19,98,73,54,28,110,29,111],setnam:[39,41,45,2,47,48,16],less:[30,64,31,32,1,34,46,23,6,67,38,39,92,40,41,108,43,93,45,2,47,48,10,11,12,13,14,15,16,17,18,19,70,20,53,75,24,81,107,110],lastopc:51,adc32ri8:6,createfsub:[39,41,45,2,47,48],suspect:71,darwin:[39,81,10,84,76,62,23],ymm:23,defaultdest:23,prolang:33,addpreemitpass:51,has_asmpars:27,nativ:83,same_cont:22,"133700e":[41,19],setdata:64,rejit:[12,48],llvmlibdir:62,image_scn_lnk_oth:104,kawahito:81,
 "__llvm_profile_name_bar":67,ctaid:8,xword:51,close:[24,64,98,52,81,57,23],"0x0b17c0de":107,smallvectorhead:16,deriv:[81,26,64,92],libcmt:35,particip:[10,23,26,16,62],parse_unari:[14,15],pifft:33,won:[64,98,40,31,81,9,53,26,54,62,23],isprefix:20,cst_code_integ:107,emitint32:70,makeup:16,fpform:6,numer:[35,23,6,39,41,108,43,45,2,47,48,95,12,13,14,15,16,17,18,19,51,20,106,25,29],isol:[64,81,80,56],lowercas:[12,51,48],numel:23,distinguish:[67,38,70,16,11,75,4,23],both:[67,81,58,92,98,40,70,80,20,1,64,83,90,26,107,103,5,93],clang_attr_identifier_arg_list:21,delimit:[23,28,29,68],fancyaa:73,lako:64,sty:6,getnumvirtreg:81,protector:[23,53],block_par:[13,14,15],"__objc":23,jeff:4,byval:[81,23,107],header:[58,83,107],instrsch:16,"100mb":62,linux:[64,81,58],forgiv:32,llvm_enable_thread:58,stamp:92,territori:24,empti:[64,32,1,23,39,41,108,45,2,47,48,10,69,13,16,18,19,51,70,20,53,76,58,103,87,62,29,111],destructor:[64,16,93,73,103,23],newcom:[15,45,6,95],add_excut:58,newinst:16,as_float:[12,13
 ,14,15],box:[81,53,79],lattner:[38,11],imag:[72,25,81,2,106,22,14,23],ada:103,imac:0,coordin:[69,87],modrefv:111,imap:24,look:[30,87,32,1,89,35,64,97,94,5,67,37,38,39,81,8,41,23,45,2,47,48,10,11,12,13,14,15,16,18,19,51,98,70,20,99,53,73,21,76,24,58,86,25,40,82,83,61,26,84,49,107,108,27,110,29,111],ramif:98,"while":[30,64,32,1,65,23,40,5,46,94,80,98,20,71,24,57,58,79,81,60,107,62,86],dw_lang_c_plus_plu:53,loos:[62,6],loop:[83,40],pack:[31,81,53,41,107,23,19],malloc:[70,16,38,11,73],pragmat:25,readi:[32,89,72,39,41,108,43,45,2,47,48,12,13,14,15,17,18,19,20,53,73,25,61,26],readm:[10,24,26,110],"__gcmap_":70,thesparctarget:51,hideaki:81,"0x00001203":53,quadrat:[81,74,16],targetlow:80,fedora:24,grant:[32,26],tokinteg:29,belong:[32,20,16,23],llvm_site_config:35,indvar:23,octal:[20,92,111],curloc:39,conflict:[24,39,111,41,23,81,45,2,47,48,10,26,12,13,14,15,16,6,19],"0b10":111,goodwil:26,ccif:51,optim:40,image_sym_class_type_definit:104,desttool:62,temporari:[30,57,87,23,33,1,10,64,62,81,16
 ,93],user:[81,58,40,42,1,83,64,80,56],"3gb":35,vreg:81,numarg:[39,84],"0x16677e0":94,older:[24,51,20,34,26,62,28],mctargetstream:81,pointtoconstantmemori:40,reclaim:[57,23],use_:16,positionaleatsarg:20,weakest:[81,83],predetermin:40,cout:[87,64,93,8],isunord:83,accumulateconstantoffset:32,afre:46,dw_ate_unsigned_char:53,undeclar:[41,19],tick:92,recurs:[30,38,41,23,43,1,45,2,47,70,21,11,108,62,13,14,15,16,17,18,19],shortcut:[43,17,18],supersparc:51,subsequ:[72,30,98,51,0,20,81,53,84,28,23,25,111],gnueabihf:[9,34],march:[24,59,53,74,77,5],arm_aapcscc:107,mcsectionelf:81,xterm:64,nothidden:20,game:26,optimizationlist:20,characterist:[99,51,16,81,104,23],isproto:107,outright:98,signal:[10,20,23,83,94],resolv:[72,81,41,23,25,1,47,48,73,26,86,62,12,13,16,6,19],"______________________________________":16,popular:[24,81,34,40],regionsforfile1:67,regionsforfile0:67,ptroff:81,some:[30,87,0,31,32,33,1,74,34,46,90,35,3,65,4,64,5,6,37,38,39,81,40,41,23,43,93,9,2,47,48,10,11,45,12,13,14,15,16,17,
 18,19,51,97,70,86,20,95,99,53,73,21,75,54,98,89,92,24,57,58,79,69,80,25,59,82,83,60,26,84,107,108,27,62,110,29,106,111],urgent:26,mnemonicalia:81,getfunctionlist:16,mem_address:81,uselistorder_bb:23,addpreserv:40,printinlineasm:51,pathsep:10,n2930:64,slash:[92,53],castinst:16,bcanalyz:[107,63],run:[64,58,40,42,81,83,5,75,80],stem:16,step:[24,99,58,98,40,103,81,35,80],ditypearrai:39,movsx64rr8:81,curtok:[39,41,108,45,2,47,48],assignvirt2phi:81,subtract:[67,99,23],"_ztid":23,blocksizei:8,idx:[39,98,41,45,2,47,48,64,23],nnnnnn:81,shini:73,blocksizez:8,f31:51,blocksizex:8,block:40,getsubtargetimpl:[70,51],aq2:23,within:[30,87,32,33,1,64,23,39,81,8,5,93,45,2,47,48,69,12,13,14,15,16,49,97,98,70,71,53,75,24,57,80,40,84,107,103,62,111],loadsdnod:16,proj_install_root:49,ensur:[30,81,0,69,89,64,36,23,39,8,41,5,93,45,2,10,15,16,19,96,51,20,71,73,22,24,103,40,83,26,84,107,62],llvm_package_vers:58,mach:[76,100,23,107],properli:[81,80,83,40],pwd:[24,9],vfprintf:23,newer:[24,35,26,94],cmpxchg:83,f
 lagsfeatureb:87,flagsfeaturec:87,flagsfeaturea:87,specialti:16,info:[24,81,58,70,86,1,94,107,103,76,101,23],inreg:[25,81,23,107,51],"0xc3":111,i65:23,abs_fp64:6,similar:[30,81,0,32,34,64,4,5,39,92,8,41,23,43,2,47,48,10,12,13,14,16,17,49,19,96,51,98,70,20,73,21,22,24,103,87,83,26,107,111],createdefaultmypass:73,obviat:49,reflectparam:8,doesn:[67,26,92,40,80,20,1,64,83,3,75,103,81,5],repres:[75,40,83,3,107,56],arg_iter:[39,41,45,2,47,48,16],incomplet:64,nextvari:[2,47],minsiz:23,titl:[26,79],speccpu2006:33,nan:[77,74,23,53],accross:23,setenv:62,"0x00007fff":81,dosometh:64,resign:26,xtemp:83,drag:79,canfoldasload:6,svn:[26,58],typeid:107,infrequ:73,addmbb:81,orbit:[14,2],devminor:8,depth:[30,32,20,81,53,47,61,13,6],loadobject:72,unconnect:98,msbuild:[35,58],getkind:[21,97],image_scn_mem_preload:104,compact:[38,39,70,81,11,36,84,16],friendli:[37,64,108,26,95,28,18],"__llvm_profile_name_foo":67,breakcriticaledg:73,aris:[23,26,16,98],instr_iter:81,yoyodyn:26,then_bb:[13,14,15],image_sym_d
 type_arrai:104,runnabl:24,nonatom:53,llvmdisasminstruct:28,weakvh:16,llvm_enable_doxygen:58,use_llvm_target:[12,13,14,15],dw_tag_const_typ:53,ccifnest:51,initializer_list:64,lazier:25,relink:[96,80],calleef:[39,41,45,2,47,48],jump:[81,20,59,22,107,62,23],imper:[64,70,45,47,13,15],download:[24,58,51,31,25,9,89,10,61,109,62,16],click:[35,79],hasoneus:64,poke:107,image_scn_lnk_nreloc_ovfl:104,espresso:33,cell:51,experiment:[99,23],registerschedul:73,ramsei:81,init_v:15,legalizeact:51,becom:[30,64,0,34,23,6,51,108,45,47,10,13,15,16,18,97,98,20,73,75,25,81,84,62],accessor:[73,108,81,53],"_source_dir":58,startexpr:[39,15,45,2,47],convert:[1,88,81,83,63,75],convers:20,converg:[14,2],solaris2:73,chang:[96,44,58,107,40,42,20,1,64,83,52,80,3,75,91,81,5],hexagon:[24,21,81],add_definit:58,chanc:[3,72,43,87,17,26,6],selectinst:64,n3272:64,although:[64,1,35,23,99,2,10,16,19,97,52,70,20,73,24,25,81,83,107,27,62,110],danger:[16,5,23],revok:26,realloc:40,degen:23,dyn_cast:[70,64,97],"boolean":[81,64
 ,74,58,107],basic_block:19,externallyiniti:23,getrawsubclassoptionaldata:32,implic:[81,26],recordid:107,fibi:[15,45],remaind:[67,24,99,51,103,81,10,27,23],llvm_enable_warn:58,"0x00ff0000":81,image_scn_lnk_remov:104,mismatch:[75,105],landingpad:103,findlead:16,retriev:[72,92,79,8,20,87,73,84,16],image_scn_gprel:104,perceiv:[38,11],memory_order_acq_rel:[23,83],linearscan:[73,77,81],meet:[73,24,26,81,32],control:[44,58,1,64,74,77,81,80],malform:[30,80],sudo:[24,34],llvm_use_intel_jitev:58,compactli:111,myfooflag:87,sought:23,emitepilogu:51,clang_attr_arg_context_list:21,egrep:24,parenexpr:[39,41,108,45,2,47,48,12,13,14,15,18,19],dissolv:62,tag_base_typ:53,templatearglist:29,lto_module_is_object_fil:86,live_s:70,eliminatecallframepseudoinstr:51,aliasanalysiscount:40,"0x3feaed548f090ce":48,filterclass:65,vsetq_lane_s32:75,subtyp:[103,51],primaryexpr:[108,18],jne:81,onzero:23,distzip:62,outer:[39,87,45,46,47,73,64,13,15,23],consensu:26,pushfl:81,topdistdir:62,release_15:24,foreach:[64,111
 ],dw_tag_auto_vari:53,label_branch_weight:3,handl:[58,83,75],auto:81,handi:[41,62,110,16,19],memberlist:51,armgenregisterinfo:21,p15:8,p16:8,p17:8,front:[103,81,64],p19:8,modr:81,somewher:[73,97,41,23,33,2,10,103,14,5,19],ourfpm:[39,45,2,47,48],upward:1,unwind:[30,51,103,81,46,22,55,23],globl:[22,8],selectiondag:83,map:[107,40],chunk:[30,64,107,41,81,82,53,75,19],special:[24,59,107,98,40,70,20,1,9,83,94,26,75,27,81],image_sym_type_byt:104,"0x00000130":53,influenc:[73,57,53,75],suitabl:[67,30,8,70,23,20,81,72,10,107,16],hardwar:[77,81],statist:[67,40,71,74,36,77],llvmtransformutil:49,spec95:33,lcssa:57,spot:[30,89],manipul:[24,81,52,70,93,54],undo:75,parallel_dir:[62,49],ecx:[81,22,6,111],image_scn_mem_writ:104,bodyexpr:[39,15,45,2,47],bclinklib:62,mac:[24,92,94,73,89,16],keep:[81,40],wrote:[99,39,23,98],dumpmymapdoc:87,svptr:23,linkallcodegencompon:73,qualiti:81,fmul:81,art:70,find_a:16,rs1:51,rs2:51,scalartrait:87,perfectli:[64,98,5,81,108,23,93,18],mkdir:[24,62,58,89,61],second_en
 d:23,attach:[24,64,79,8,25,45,53,94,26,15,23],functionpassctor:73,"final":[67,24,81,92,103,20,1,9,26,107,64,80],prone:[20,81,6,93,34],my_valu:64,rsi:6,methodolog:103,qualifi:[81,64],exactli:[30,64,69,1,4,23,40,5,48,32,12,16,97,70,20,53,73,22,75,87,107,27,111],rsp:[84,81,82,6],ehashfunctiondjb:53,bloat:64,a_ctor_bas:5,instvisitor:[99,16],dubiou:92,bare:[23,96,16,51,84],f16:23,exhibit:[80,83],multhread:16,xor8rr:81,reg2:5,procnoitin:6,reg1:5,goldberg:70,lightli:[31,23],tabl:[107,75,40],need:[64,90,5,99,92,40,93,94,80,96,52,70,20,71,74,75,77,55,56,58,103,81,83,26,107,101],altivec:81,fp5:[6,111],createfunctiontyp:39,"0x08":53,reloc_pcrel_word:51,"0x04":53,"0x05":84,"0x06":84,"0x07":84,"0x00":[67,84,92],parse_extern:[12,13,14,15,18,19],"0x02":[67,53],fileit:20,unawar:23,lgkcmt:68,platformstripopt:62,llvmgold:61,detector:32,equal_rang:16,singl:[64,1,90,5,67,99,92,46,80,98,70,20,75,54,24,102,103,81,83,105,26,107],parseidentifierexpr:[39,41,108,45,2,47,48],discop:39,discov:[81,70,1,45,53,47
 ,89,13,4,15],rigor:81,x86_ssecal:51,x86_fp80:[32,23,107],promoteop:99,sdk:35,url:[26,79,110],hasrex_wprefix:6,"0xe8":111,indx:87,llvm_parallel_link_job:58,unoptim:[24,74],"0x0d":84,"0x0e":84,constrain:[60,41,93,10,19,111],disable_assert:[60,24,89,62],"0x0a":[84,92],"0x0b":84,"0x0c":67,coveragemappingdataforfunctionrecord1:67,cute:[38,11],verbos:[24,1,92,102,87,62],objc:[37,110,53],molest:23,anywai:[30,64,9],varnam:[39,45,2,47,13,15],tire:[64,6],losslessli:32,envp:94,x86_thiscal:81,themodul:[39,41,45,2,47,48],add_to_library_group:27,gettyp:[64,16],tbb:51,shr:64,enabl:[64,88,1,34,67,7,91,42,93,94,70,20,71,74,75,77,24,58,102,81,61,26],getmbb:51,she:[109,6],contain:[30,59,32,1,64,34,89,90,35,3,65,23,67,91,92,8,5,9,94,81,72,97,98,70,20,109,106,22,75,76,56,24,57,58,103,40,105,61,26,107,27,62,101,86],shapekind:97,grab:[39,31,93,89,21,13,14,15,16],image_file_local_syms_strip:104,shl:64,nolink:20,rc1:[31,89],vectorize_width:0,target_link_librari:58,image_scn_mem_16bit:104,mileston:[32,25],st
 atu:58,aros:25,correctli:[87,32,64,23,108,93,47,10,69,13,16,49,98,20,53,73,58,103,81,82,83,26,18],writter:20,sectvalu:20,realign:23,state:[24,64,40,70,103,20,81,83,89,26,75,62,23],neither:[30,107,40,32,35,84,75,23],tent:23,vfp3:9,kei:[32,81,73,26,23,69,65,16,6],header_data_len:53,parseabl:69,setgraphcolor:16,eclips:24,monitor:40,xxxreloc:51,admin:109,handledefinit:[39,41,108,45,2,47,48],dw_tag_inherit:53,test_format:1,unglamor:26,multi_v:20,orig:23,quit:[32,4,23,37,38,40,41,47,94,11,13,16,19,98,70,99,24,25,81,84,62,110],slowli:[24,26],addition:[24,81,30,70,23,20,40,83,61,26,27,62,16,25],classnam:101,libdir:[62,96],image_sym_dtype_nul:104,treat:[107,81,58,83,75],cputyp:107,alphacompilationcallback:51,otp:23,createcal:[39,41,45,2,47,48,16],acq_rel:[23,83],replic:[59,86,111,87],novel:[70,23,16],dw_tag_typedef:53,harder:[30,69,93,108,4,23,18],print_str:[12,13,14,15,18,19],engag:26,demo:20,rootstackoffset:70,povray31:33,invokeinst:16,inf:[77,20,74,23,53],welcom:[32,35,38,39,100,41,108,43
 ,45,2,47,48,11,12,13,14,15,17,18,19,73,24,26],parti:[69,26,64,49],mglibc:25,reloc_picrel_word:51,print_float:[12,13,14,15],ro_signed_pat:6,setcategori:20,matcher:[81,21,101],nightli:[26,89],http:[24,50,39,79,37,31,33,9,89,10,41,35,26,109,64,19],tokprec:[39,41,108,45,2,47,48],effect:[64,58,40,70,20,81,107,77],isopt:20,llvm_use_oprofil:58,global_s:16,bitpack:10,spreg:25,appendinglinkag:16,dllvm_enable_p:9,callgraphscc:73,isrematerializ:6,dw_form_strp:53,well:[24,99,81,40,42,20,71,64,83,89,61,26,107,27,94,80,93],makefileconfig:62,undefin:[64,58,98,59,83,106,75,93],jonathan2251:50,memory_order_consum:83,mistaken:[12,48],aform_1:81,aform_2:81,namedvar:39,xs1:100,size1:23,size2:23,size3:23,outstream:70,densiti:[14,64,2],warrant:99,nodebuginfo:20,takelast:16,howto:[50,21,110],mcsectioncoff:81,add_gvn:[12,13,14,15],burden:[25,26,23],n2343:64,zchf:9,n2347:64,loss:[70,16],lost:[38,103,93,11,62,23],"0f3fb8aa3b":8,ldflag:[96,39,41,45,2,47,48,62],necessari:[81,69,89,64,4,23,67,99,39,92,40,5,93,9
 ,94,10,16,72,51,70,20,73,75,54,56,24,57,58,103,59,83,26,84,62,110,86],rotl:99,lose:[73,38,11,53],profraw:67,page:[64,58,20,63,26,22,100],hasdelayslot:6,didn:[64,41,32,25,81,45,53,73,15,16,18,19],isnul:64,"04e":23,notfp:111,"__cxa_allocate_except":103,home:[10,24,33,16,94],librari:[58,107,40],win32:[10,4,35,81,24],setmcjitmemorymanag:[72,39,45,2,47,48],broad:[43,70,20,48,12,17],createexpress:39,overlap:[40,0,81,46,73,84,23],estim:[32,56,0],asmstr:[6,51,111],myfunct:8,encourag:[30,38,64,24,59,26,11,16],ifequ:23,nutshel:16,offset:[38,107,92,51,98,69,16,25,81,82,53,10,70,11,23,32,84,5,6],image_file_32bit_machin:104,testsuit:[62,5],bcreader:96,freedom:[23,16],viewvc:37,bodyitem:29,cocoa:23,cmake_cxx_flag:58,attrtemplateinstanti:21,m_func:16,"0x00000110":53,gcov_prefix:90,image_file_removable_run_from_swap:104,"_cuda_ftz":8,downgrad:93,inner:[37,64,42,87,46,23,16],sslverifi:24,interleave_count:0,pty2:23,addpassestoemitfil:73,eax:[51,81,22,5,6,111],gain:20,spuriou:[64,23],eas:34,highest:[3
 9,41,108,45,2,47,48,75,12,13,14,15,23,18,19],eat:[39,43,41,108,20,45,2,47,48,12,13,14,15,17,18,19],liblto:61,dmb:83,displac:81,displai:[67,30,81,51,33,43,55,20,1,64,53,105,109,90,26,36,97,28,106,17],sectiondata:104,asynchron:83,cruel:110,"0xffbef174":73,calctypenam:99,add_llvm_loadable_modul:58,tmp9:[5,98],atyp:98,isconvertibletothreeaddress:6,reciproc:23,lastchar:[39,41,108,43,45,2,47,48],intregsregclassid:51,fourinarow:33,rule:[64,91,52,81,83,26,5],acloc:24,tok_var:[39,45],arctan:87,hash_set:16,getjmp_buftyp:64,futur:[58,107],rememb:[24,39,98,69,23,20,81,9,47,73,35,26,108,45,13,64,15,16,33,18,93],parse_id:[12,13,14,15,18,19],tmp2:[15,45],stat:[92,40,71,74,77,80],cmake_build_typ:58,dw_tag:53,stab:53,same_s:22,dyld:72,sphinx:[24,58],"_ztv3foo":5,indirectli:[64,23,83,111],bcc:51,portion:[67,24,51,30,42,20,81,80,48,26,103,12,28,23],image_file_machine_sh3dsp:104,perhap:[64,40,70,32,23,16],callingconv:107,getpointertofunct:[72,39,45,2,47,48,16],secondli:39,use_bind:[12,13,14,15],"0x29":
 53,unaryexprast:[39,45,2],parse_var_nam:15,sorri:[38,11],"0x24":53,swap:[25,23,34,75],getllvmcontext:64,preprocess:[59,93],aux:16,downstream:[44,56],"void":[67,99,64,107,98,40,70,103,20,81,46,83,61,75,5,56,93],llbuilder:15,build_stor:15,appar:[15,45],x86_stdcallcc:107,theier:30,pinvok:25,stageselectioncat:20,image_file_machine_m32r:104,uint32:84,scalarbitsettrait:87,vector:[99,64,75,20,81,107],llvm_build_test:58,mllvm:0,initialis:[20,6],whirlwind:[108,18],likeli:3,cpu_x86:87,aggreg:[64,46],binop_preced:[12,13,14,15,18,19],ill:92,dw_apple_property_unsafe_unretain:53,even:[81,0,32,33,1,35,64,4,5,6,38,45,92,40,23,43,9,2,47,48,10,11,69,12,14,15,16,17,97,70,95,73,21,77,56,24,25,87,106,107,62,28,110,86,111],rope:16,fcur:32,addllvm:58,neg:[103,26,5,107],asid:[23,16],transcrib:[41,19],nex:73,libpo:20,net:[109,37,25],ever:[38,64,40,23,25,26,11,27,16],metadata:[56,107],elimin:[24,57,40,70,80,20,8,74,61,26,64,81,23,93],old_bind:15,henrik:4,restat:64,met:[32,81,23],ccassigntostack:51,image_scn_
 cnt_initialized_data:104,interpret:[69,1,23,6,67,38,39,41,42,44,45,2,47,48,10,11,12,13,14,15,16,18,19,96,70,20,53,75,77,24,58,81,60,84,107,108,27,62,29],dcmake_crosscompil:9,gcname:107,credit:26,ebenders_test:94,permit:[39,70,23,74,81,45,10,57,22,15,16,111],parlanc:[43,17],volunt:[31,109],immin:89,machineregisterinfo:81,quickcheck:16,fcoverag:67,createnvvmreflectpass:8,icc_n:51,overhead:[70,93,48,65,12,16],calm:[15,45],recommend:[64,69,1,8,108,45,46,48,10,12,15,18,98,53,73,24,58,25,81,60,26,62],icc_g:51,type:[58,107,40,81,3,75,80],tell:[67,99,64,58,40,70,42,20,81,26,80],esi:[81,6],"__eh_fram":81,columnend:67,warn:58,all_build:35,emitloadlink:83,gpl:[26,93],dw_tag_apple_properti:53,room:[73,108,18,54],rightr:32,floattyp:16,dw_apple_property_nonatom:53,setup:[61,22],thefunct:[39,41,45,2,47,48],librarygroup:27,root:[96,1,58,52,81,26],clang_cc1:[10,5],defer:[12,32,72,48],give:[67,64,40,20,81,83,26,107,80],dlsym:[12,62,73,48],binpath:94,subtmp5:[15,45],dragonegg:[37,93,26,81,89],unsign:[
 87,0,32,64,3,23,67,39,8,41,45,2,47,48,81,16,19,51,98,70,20,53,21,40,107,86],secidx:22,quot:[20,87,53,10,27,23,111],dependfil:62,answer:[30,64,98,37,32,20,40,45,47,48,110,12,13,15,23,25,93],registerlist:51,config:[1,58,63,52],confid:26,reloc_absolute_word:51,attempt:[72,30,71,51,40,103,42,25,62,80,73,64,84,107,24,4,81,23,93],unnamed_addr:[23,107],maintain:[99,64,107,40,70,32,20,81,83,53,73,26,84,23,4,16,6],yourregex:5,vfp:[34,75],decl:6,"0fbf317200":8,privileg:[4,23],gcda:90,unexpetedli:10,sigplan:[70,81],better:[30,59,0,32,33,64,5,38,23,45,47,94,11,13,15,16,18,73,57,25,81,83,108],argti:23,persist:16,erlang:23,vmcnt:68,newtoset:64,dummytargetmachin:51,promin:[10,33],overestim:23,promis:26,then_:[13,14,15],usertarget:62,"0x7f":[23,111],mapsectionaddress:72,isel:[81,57,111,51,101],"instanceof":16,grammat:[108,33,18],grammar:[108,14,2,18,99],meat:12,build_for_websit:89,setdescript:20,getvalu:[64,16],somefancyaa:73,went:[13,47],thenv:[39,45,2,47],side:[30,81,8,41,32,25,40,2,47,10,70,64,1
 08,23,69,13,14,16,18,19],bone:[84,51],mean:[30,81,32,1,89,64,97,4,5,6,38,39,92,40,41,23,43,45,46,47,48,11,69,12,13,15,16,17,49,19,51,98,70,20,95,53,73,106,22,75,24,58,86,87,61,26,107,103,62,29,111],rev64:75,awri:62,add_ri:111,taught:81,f108:8,f107:8,extract:[92,63],getsextvalu:16,unbound:[81,23,51],crucial:23,content:[75,40],dw_lang_c99:53,mtripl:[23,74,5,77],dfpregsregclass:51,reader:[64,107,63],end_cond:[13,14,15],parseforexpr:[39,45,2,47],nodetyp:51,linear:[24,98,40,81,73,74,77,16],parse_definit:[12,13,14,15,18,19],mytyp:23,verif:[20,23],situat:[30,97,51,0,32,20,81,83,48,73,61,23,103,12,62,98,16],infin:23,parenthesi:[108,64,18],f89:8,getfunctiontyp:16,retcc_x86_32_fast:51,dw_at_rang:53,nummodulevalu:107,typesaf:23,ish:[14,2],prefetch:100,isa:[70,100,81,64,97],getinstrinfo:[81,51],isd:[99,81,51],cpuinfo:34,floorf:0,my_kernel:8,targetregistri:[81,51],hook:[13,81,80,49,47],unlik:[30,64,69,23,45,48,12,15,16,97,70,73,24,103,25,81,83,61,26,84,107,62,29],featureb:87,featurec:87,featurea
 :87,agre:[30,26,87],payload:81,hood:[10,67],global_empti:16,tsc701:51,ieee754:23,distchecktop:62,sphinx_output_html:58,arm_apcscc:107,dwell:41,filepo:20,llvm_enable_pedant:58,bodyv:[39,45],a32:75,namespac:[58,107],build_cond_br:[13,14,15],direct:58,isascii:[39,41,108,45,2,47,48],dllvm_tablegen:9,ri_inst:111,symptom:24,enjoi:109,r14d:6,silli:[43,64,17,93,40],r14b:6,keyword:[81,40],mcdesc:51,r14w:6,matter:[99,64,83,73,26,84,12,23],emitjumptableaddress:51,pointkind:70,modern:[64,100,93,94],mind:[64,108,45,26,15,16,18],stackar:70,bitfield:83,seed:66,seen:[38,64,107,51,32,20,81,2,48,73,11,23,69,14,16],seem:[81,58,97,40,70,32,20,44,75,98,80],seek:[30,58,37,25,98,26,22,62],minu:[82,23],ty2:[99,23],memcheck:[10,1],image_sym_class_register_param:104,rethrow:103,myset:64,myseq:87,distsourc:62,fnstrart:81,cudevic:8,regular:[24,7,64,92,33,32,25,87,38,83,11,23,62,5,20],ccassigntoreg:51,secrel32:22,tradit:[24,30,43,81,53,73,106,16,17],simplic:[41,43,70,84,16,19],don:[81,40],pointe:[23,107],simpli
 f:[73,30,80],pointi:87,alarm:34,obtus:98,dog:20,expandinlineasm:51,digress:[14,2],dot:[62,89],"0xffff000000000002":84,syntat:[],hunger:[38,11],visitor:[99,43,41,25,70,21,80,17],esoter:111,llvm_enable_werror:58,syntax:[81,64],errstr:[39,45,2,47,48],image_sym_class_weak_extern:104,istruncatingstor:51,despit:[69,20,81,53,73,95,6,111],explain:[37,64,58,92,40,32,43,81,45,73,82,75,15,16,17,93],sugar:[25,23],regnum:84,"__nv_truncf":8,pinst:16,hasgc:32,stop:[24,99,64,58,70,23,44,73,108,103,16,93,18],compli:70,bar:[64,0,1,23,67,8,41,5,93,46,47,10,13,81,16,19,20,53,22,58,25,87,29],sacrific:[32,23],baz:[64,0,20,53,47,13,29,25],reload:[81,15,45,39,57],bad:[39,31,42,53,87,2,80,64,23,32,4,14,16,93],dw_tag_shared_typ:53,bam:64,addinstselector:51,flagpointi:87,cstdio:[39,41,108,45,2,47,48],instalias:81,"0x40":53,"0x42":107,"0x43":107,subject:[81,64,26,16],p1i8:8,said:[38,64,103,53,11,16],xarch:24,simplest:[81,51,41,108,20,87,48,35,12,18],attribut:[77,74,44,107],add_memory_to_register_promot:15,trip
 let:[20,23],howtousejit:96,lazi:[23,40],gr1:23,abs_fp80:6,configurescript:62,imagmag:[14,2],against:[24,96,26,58,92,97,8,5,33,87,46,10,60,3,23,103,30,16,93],fno:0,uni:8,readnon:[30,8,69,53,107,23],constantindex:84,uno:23,foobaz:64,createload:[39,45],devbufferc:8,devbufferb:8,devbuffera:8,foobar:[87,64],int32_t:[70,87],"16b":75,loader:24,theoret:[4,16],"__________________________________________________________":16,performcustomlow:[70,25],three:[30,31,32,33,5,23,93,47,10,69,80,18,51,98,108,20,73,21,24,16,81,103,107,42,62],objc_properti:53,specul:[103,23,83,40],succ_begin:16,trigger:[72,7,87,58,40,70,80,25,59,10,64,84,23,33],interest:[30,81,69,33,1,63,35,64,36,5,72,37,38,39,40,41,23,43,93,45,2,47,48,10,11,12,13,14,15,16,17,18,19,97,70,20,53,73,75,24,103,25,87,83,26,108,109],basic:83,mo_registermask:81,tini:[32,97],llvmpassnam:58,build_load:15,suppress:[70,64,1,23],mce:51,multithread:[70,16],lpae:83,lpad:23,argumentexpr:[12,13,14,15,18,19],llvm_include_test:58,terminatorinst:[64,3,16]
 ,ugli:[16,14,93,5,2],codegener:59,intregsvt:51,itinerari:[81,6,51],noredzon:[23,107],slt:23,servic:[4,93,40],lex_id:[12,13,14,15,17,18,19],slp:57,calcul:[73,30,57,51,40,23,33,81,53,47,10,13,98,16,56],typeflag:53,occas:64,sle:23,uncopy:64,xxxkind:97,disappear:[24,93,34],grown:[14,11,2,38],receiv:[72,16,107,103,23,6,18],make:[58,107,40,81,83,75,80],bitmask:23,isspac:[39,41,108,43,45,2,47,48],initialexec:[23,107],kevin:81,zlib1g:9,kib:20,overs:16,revector:[30,16],binopprototyp:[14,15],vehiclemak:64,ea_r:81,"00clang":53,addrawvalu:54,inherit:[73,64,97,40,16,20,81,60,21,4,29,6,111],llvm_dir:[32,58],endif:[67,38,39,20,64,11,4],programm:[81,97,70,20,71,83,64,62,80],paradigm:[25,16,98],left:[30,64,0,32,33,23,6,39,92,41,108,47,13,81,80,18,19,51,53,25,87,107],projusedlib:62,op0:107,op1:[23,107],just:[30,87,31,32,33,1,90,35,64,36,97,4,5,6,93,67,38,39,81,40,41,23,43,44,9,2,47,48,10,11,45,12,13,14,15,16,17,18,19,51,98,20,53,73,21,75,77,106,56,92,24,79,69,80,25,59,82,83,61,26,84,49,107,108,27,62,
 110,111],op3:51,bandwidth:23,human:[88,24,64,91,102,30,32,87,73,36,85,23,6],nowadai:9,yet:[30,64,32,33,46,23,72,2,47,48,68,12,13,14,16,96,51,70,20,73,109,24,81,27],languag:[81,83],uint16:84,save:[81,0,46,35,36,23,72,99,39,8,45,2,47,48,12,13,14,15,16,51,20,53,75,24,58,79,103,25,59,60,84,107,111],vpsubusw:10,u999999:79,applic:[64,32,33,90,23,6,72,37,38,100,92,43,2,48,10,11,69,12,14,16,17,96,51,70,20,73,75,58,103,81,26,84,107,27,62,111],segnam:20,"0x0000000000dc8872":94,opc:[39,45,2,111],wojciech:30,fact1:32,fact0:32,getinstlist:16,manual:[80,64,71,58,81],dindex:51,tolmach:70,machinepassregistrynod:73,choic:[88,38,64,69,16,43,34,47,84,74,11,99,13,23],funcion:8,unnecessari:81,cxxflag:[96,39,41,45,2,47,48,62],www:89,deal:[30,64,107,97,103,45,83,53,21,26,75,15,16],somehow:[73,16],dead:[24,57,40,86,20,8,81,23,93],intern:[81,58,107,40],interg:67,make_pair:[32,39,45],norman:81,insensit:40,collect:[90,64,56,40],henderson2002:70,tracker:26,genrat:58,getchar:[39,41,108,43,45,2,47,48],xmm15:6,cr
 eatur:[14,43,2,17],burg:57,idiomat:[10,64],bold:110,identifierexpr:[39,41,108,45,2,47,48,12,13,14,15,18,19],uncompress:[24,16,58],cdt4:24,mappingnorm:87,buri:64,strippointercast:64,promot:[99,57,40,81,26,23],burr:77,"super":[81,86,51],fnty:23,unsaf:[38,83,53,84,74,11,77,23],dw_tag_formal_paramet:53,movsd:5,argv0:77,culaunchkernel:8,ppcf128:23,compilecommonopt:62,simul:[81,23,75],movsx:81,commit:64,marshal:84,movsq:81,mrm7m:51,contriv:[93,111],f128:[23,51],down:[30,81,32,6,67,37,38,39,97,40,42,2,47,11,13,14,16,18,51,98,108,20,53,73,74,75,77,24,79,80,25,59,60,26,103,62],f3_12:51,indexreg:81,mrm7r:51,nomodref:40,contrib:24,subl:[81,5],parsesubtargetfeatur:51,precomput:40,perldoc:24,frameinfo:51,xpass:1,imit:[110,29],r173931:21,fraction:[65,56,97],amazingli:[13,47],"_els":[39,45,2,47],fork:4,numxform:16,creation:[70,89,23,54],form:[58,107,40],sub1:5,forc:[24,64,58,0,103,20,87,9,46,53,73,84,77,62,23],retarget:[37,81],nounwind:[8,5,53,10,107,23],phid:64,emitbyt:51,autoinsert:16,addmodulef
 lag:39,bugfix:89,writeattribut:21,processrelocationref:72,llvma:62,multisourc:[10,33,26,53,59],dontcopi:64,"__i386__":[38,11],unrel:[26,16,51,89],classid:29,classif:[4,23],semicolon:[39,58,111,41,108,45,2,47,48,12,13,14,15,18,19],classic:25,consciou:24,visitgcroot:70,diagnost:[21,1,5,6,44],glanc:[38,64,11],ship:[24,25,11,38,94],dwarfnumb:51,password:[109,26],excel:[24,16,51,40],image_scn_align_2048byt:104,stackrestor:46,journei:[15,45],subdivid:33,why:[26,64,40],"0fc2d20000":8,iteri:[12,13,14,15,19],libffi:60,setinsertfencesforatom:83,uclibc:25,pseudo:[81,56,75,101],dcommit:24,image_sym_type_int:104,include_directori:58,value_2:27,skip:[64,0,23,67,39,41,108,43,45,2,47,48,12,13,14,15,17,18,19,51,53,75,81,107],"0x00000150":53,inlineasm:32,skim:64,createvirtualregist:81,mill:20,primer:110,pldi:70,hierarch:[30,107],misread:64,libit:20,fancier:[73,110],intermedi:[37,7,93,58,102,51,31,23,71,46,70,108,107,54,69,16,18],targetinstrformat:51,hasinternallinkag:16,image_scn_align_2byt:104,letit
 em:29,mandlebrot:[14,2],llvmbuilder:12,aspx:64,llvmdummycodegen:51,string:[81,58,92,20,1,74,105,3,107,76,77,64,5],create_argument_alloca:15,kernel_param_2:8,kernel_param_0:8,kernel_param_1:8,print_endlin:[12,13,14,15,18,19],dil:6,did:[103,64,40],dif:30,dig:[43,17,111],iter:[72,30,57,40,70,32,20,81,64,80,26,86,23,56],item:[107,20,92,75,36],div:[81,16],round:[67,81,75,89],dir:[24,58,31,1,9,53,90,62,49],sparclit:51,originput:20,nozero:77,sideeffect:23,addr:[76,23,51],addq:84,insertbranch:51,favour:[6,95],addx:111,wors:[81,64,75],rephras:98,addi:111,xml:107,dwarf:[81,63],oversimplifi:16,elsev:[39,45,2,47],slow:[60,73,74,16],imul16rmi:81,wait:[64,31,108,68,109,4,18],patleaf:51,insan:64,canadian:24,shift:[30,99,32,20,81,6,107,23,56],bot:[37,26,64],"_ztii":23,storeregtoaddr:51,extrem:[24,81,107,51,30,29,53,40,45,83,80,73,26,23,65,15,16,111],bob:87,else_:[13,14,15],opcstr:51,stb_local:23,elect:26,modul:[80,81,58,107,40],"__jit_debug_register_cod":94,patchabl:84,"0baz":16,"0x60":92,"0x800":5
 3,sake:[73,16],allocinst:15,use_llvm:[12,13,14,15,19],visit:[70,80,99,16],tokidentifi:29,deplib:107,perl:70,everybodi:[32,26],zeroargfp:111,rpath:[24,25],fcomi:81,com_fir:81,appel:70,examin:[72,51,80,20,81,89,10,90,16,25],effort:[72,30,99,64,41,93,53,26,84,4,19],armhf:9,fly:[108,25,81,48,12,18],reviewe:26,ulp:23,uniqu:[107,0,69,32,81,53,5,65,86,84,23,54,27,16,6],ult:[45,47,12,13,14,15,23,19],sourcewar:61,imped:23,nextvar:[39,45,2,47,13,14,15],nearest:[67,23],makefileconfigin:62,predict:[73,37,3,64],crazi:[20,43,11,17,38],subregion:23,dominatortre:73,exctype1:103,strikingli:[14,2],delete_funct:[12,13,14,15,19],subnorm:8,binarypreced:[39,45,2],"0x000034f0":53,ping:[32,26],f32:[81,23,51,8],idiv:81,till:[109,16,94],purg:64,attrparserstringswitch:21,pure:[30,57,51,41,69,81,53,26,27,29,19],doclist:87,testingconfig:1,grok:[41,93,19],exctypen:103,max:[67,20,1,23],usabl:[81,20,74,16,51],intrus:[23,16],membership:16,mag:23,uselistord:23,underscor:[62,64,53],maj:31,grow:[23,20,81,46,47,13,28,1
 6],man:[10,24,20,58,37],noun:64,"0x00001000":53,myglob:53,targetframeinfo:51,purifi:59,str1:111,talk:[38,64,41,108,43,45,99,47,48,73,11,12,13,15,17,18,19],image_sym_class_automat:104,abbrevop0:107,abbrevop1:107,config_fil:62,shield:[4,81],iptr:23,comdat:[22,107],"123kkk":20,recoup:107,nbsp:81,gcmetadata:70,entiti:[64,16,53,84,107,23],group:[64,81,5,92],thank:59,polici:[64,40],shadowstack:70,build_shared_lib:58,mail:[24,64,79,31,26,109,110,49],inlinehint:[23,107],main:[67,24,64,90,70,86,20,81,46,89,76,61,35,26,75,103,27,94,23,56],irbuild:[39,41,45,2,47,48,12,13,16,19],recoveri:[39,41,108,45,2,47,48,12,13,14,15,18,19],parseunari:[14,39,45,2],remateri:83,sooner:109,initv:[39,45],possess:[67,16],lo16:81,subproject:[24,25,26,89,37],xlc:24,careless:64,x11:16,myflag:87,misbehav:31,loopunswitch:30,ndebug:[60,20],continu:[81,107,40],redistribut:26,libgcc:82,tmp8:98,arcp:23,tmp7:[5,98],tmp6:98,tmp1:[64,5],tmp3:5,baselin:[81,89],getbinarypreced:[39,45,2],"3rd":23,mess:[24,30],bespok:70,numval:
 [39,41,108,43,45,2,47,48,107],dw_tag_unspecified_typ:53,arminstrinfo:51,correct:[30,81,0,31,69,33,89,64,4,23,99,40,93,9,48,10,12,16,20,53,73,75,24,57,58,25,59,82,83,61,26,109,62],earlier:[27,67,23,51],"goto":[39,0,32,45,2,47,64,15],tmpb:[39,45],ori:81,org:[24,39,58,79,37,31,33,61,9,87,10,41,35,26,109,64,89,19],ord:23,v8deprecatedinst:51,sn_mapr:32,createasmstream:81,thing:[67,81,107,40,80,20,1,64,26,75,5],sn_mapl:32,principl:[64,100,32,43,4,17],think:[67,38,81,58,97,8,43,40,64,99,47,26,11,13,65,4,98,16,17],first:[64,88,1,90,3,5,67,92,40,93,80,70,20,71,75,77,58,103,81,83,26,107],carri:[23,28,16,92,98],"long":[81,31,1,64,90,3,36,97,4,23,38,100,92,40,41,42,93,10,11,16,19,51,98,70,53,73,22,24,80,87,26,62],oppos:[24,57,23,20,106,13,29,49],numop:[107,51],const_iter:16,indiviu:81,indivis:46,numindic:67,averag:[13,47,36],daunt:58,"0f42d20000":8,my_kei:64,attrkind:[21,54],foldingsetnod:16,getpredopcod:65,vbr6:107,vbr4:107,vbr5:107,vbr8:107,redefinit:[39,41,45,2,47,48,12,13,14,15,19],valuedis
 allow:20,were:[30,81,0,32,1,35,64,5,6,67,38,23,46,11,16,52,20,71,53,75,24,25,59,83,62],lcpi0_0:10,mcexpr:81,mrm5m:51,dw_tag_set_typ:53,llvmlibsopt:62,dash:[20,87],mageia:24,greet:111,gettargetlow:51,exclud:[42,81,26,65,62,5],mrm5r:51,repeatedli:23,unadorn:23,weak_odr:[23,107],squar:[27,87,23,97],cumoduleloaddataex:8,llvm_target:[12,13,14,15],"_crit_edg":23,advis:[13,89,92,47,54],interior:[57,97],immsext16:81,channel:37,sparciseldagtodag:51,llvm_analysi:[12,13,14,15,19],ptrloc:[70,23],pain:[20,16,94],ldststoreupd:81,trace:[73,69,20,57,53],normal:[64,0,69,1,4,5,7,91,92,23,88,16,20,71,53,73,21,75,106,24,58,102,103,81,82,83,26,84,107,62,28,86,111],track:[30,59,32,1,64,6,39,40,41,93,45,2,69,14,15,80,19,70,53,73,24,16,25,81,26,84],nestabl:[29,111],cucontext:8,pair:[30,64,69,5,23,39,40,108,45,47,32,13,81,16,18,51,53,75,54,103,87,83],r31:81,isglobaladdress:51,synonym:92,cumodulegetfunct:8,dw_form_:53,rev128:75,getmetadata:53,llvmgxx:62,isphysicalregist:81,defaultconfig:16,gracefulli:16,show
 :[1,81,90,3,106,5],eckel:16,shoe:87,threshold:[30,23],corner:84,getadjustedanalysispoint:40,emitexternalsymboladdress:51,dice:16,fenc:[64,83],enough:83,adc64mi32:6,parametr:29,ftest:90,sparcisellow:51,intptr_t:[39,0,45,2,47,48],gep:93,variou:[67,24,71,58,40,42,8,64,83,72,65,80,86,100,107,103,27,62,81,23],get:[83,75,40],mung:[30,98],secondari:[26,84],repo:24,emitlabel:81,wheezi:9,fde:81,gen:101,r10b:6,nullptr:[39,64],yield:[30,98,23,20,107,69,16,33],r10d:6,stupid:80,mediat:40,r10w:6,wiki:[24,58],kernel:[77,23],setpreservesal:73,"__builtin_setjmp":103,intrinsicsnvvm:8,spars:[24,99,57,81],testcas:[41,42,26,23,16,19],"0b1001011":111,infinit:[30,81,23,40],expandatomicrmwinir:83,allroot:33,innov:25,maskedbitset:87,datalayoutpass:[39,45,2,47,48],enumer:[81,107],label:[81,56,107],innoc:[13,47],enumem:51,volatil:[70,93,81,83,40],across:[30,0,69,36,23,6,38,8,48,11,12,16,20,53,73,75,24,57,81,83,84,27],august:72,parent:[24,64,41,23,1,47,27,13,16,56],fpregsregisterclass:51,modref:[111,83,40],par
 seprototyp:[39,41,108,45,2,47,48],copyabl:16,false_branch_weight:3,llvm_enable_sphinx:58,blocklen:107,tour:[108,18],library_nam:27,litloc:39,p0i64:5,improv:[24,38,79,51,30,70,32,25,1,40,48,73,11,103,12,89,23],peephol:[99,39,81,45,2,47,48,73,12,13,14,15,16],among:[30,86,81,24,32,8,64,40,21,22,16],acceler:89,undocu:64,unittest:58,tsflag:51,getnumsuccessor:64,cancel:103,iscal:[6,111],inadvert:[4,5],mctargetdesc:21,xadd:83,ultim:[64,31,1,48,12,62,23,6],p0i8:[23,8],mark:[81,83,107],certifi:93,"0x4004f4":76,calledcount:80,fadd:[99,81],squash:[24,75],f92:8,f93:8,f90:8,f91:8,f96:8,f97:8,f94:8,f95:8,univers:[67,76,26,64],f98:8,f99:8,those:[30,81,32,1,34,90,64,36,4,23,6,67,37,39,92,40,5,44,45,10,69,15,16,51,98,70,20,53,73,24,58,80,25,87,83,26,84,103,27,62],sound:40,isvararg:16,interoper:[70,16,38,11,103],"0x3fed":53,"0x3feb":53,"0x3fea":53,invoc:[24,58,23,81,80,73,42,62,5],isdoubl:111,gvneedslazyptr:51,advantag:[38,64,98,70,23,20,81,45,2,83,26,11,75,54,14,15,16,86],mfloat:9,bytecode_libdir:62
 ,destin:[39,92,51,103,81,45,10,3,15,23],llvm_gcc_dir:33,variable_op:111,my_function_precis:8,cudeviceget:8,liveoffset:70,same:[30,59,32,89,90,64,36,65,23,67,99,91,92,8,5,93,46,81,80,98,70,20,71,22,75,77,24,57,40,83,60,61,26,107,27,62],image_file_machine_unknown:104,pad:[67,92,103,46,84,107,23],pai:[10,26,64,51],oneargfp:111,add32mi:6,exhaust:[70,24,81],assist:[64,59,2,62,14,101],executionengin:[24,39,58,94,81,45,2,47,48,12,13,14,15,16],capabl:[23,38,100,8,41,45,2,48,11,12,14,15,16,19,51,20,99,73,24,81,40,86],executeprogramandwait:4,runonmachinefunct:[81,51],appropri:[30,81,31,9,1,89,64,65,4,23,6,99,8,108,45,2,69,14,15,16,18,51,70,20,53,73,75,54,24,103,25,40,83,26,109,62,86],macro:[67,24,64,58,20,71,23],markup:[24,64],spadini:30,getobjfilelow:70,asmnam:51,roughli:[57,97,103,81,83,89],emitleadingf:83,release_22:24,execut:[83,80,56,40],speccpu2000:33,mo1:51,mul_ri:111,mygcprint:70,subblock:107,aspect:[38,39,58,41,29,25,81,53,47,70,26,11,23,108,13,16,18,19],mul_rr:111,flavor:[23,16,53,1
 11],"125000e":23,xxxtargetmachin:51,critial:89,param:[64,8,70,1,109,35,12,13,14,15,16,19],cumoduleunload:8,sparcregisterinfo:51,autoregen:51,dclang_tablegen:9,setrequiresstructuredcfg:51,mcregaliasiter:81,mov:[22,81,5,83,8],sk_specialsquar:97,libsfgcc1:9,mod:[23,40],cast_or_nul:16,llvm_tarball_nam:62,ifstream:8,qnan:23,divari:39,server:16,bb0_4:8,bb0_5:8,prologuedata:107,either:[30,59,32,33,1,89,64,23,6,72,38,39,92,8,108,43,93,47,48,10,11,69,12,13,81,16,17,18,96,51,98,70,20,71,99,53,74,75,76,24,80,25,40,83,61,26,84,107,103,62,111],bb0_2:8,physreg:81,maybeoverridden:32,mappingnormalizationheap:87,fulfil:[4,97],exitcod:1,fastcal:[81,23],ascend:[67,23],substitu:10,llvm_enable_doxygen_qt_help:58,adequ:[70,35,58,51],confirm:64,llvmscalaropt:49,recomput:[73,16,40],ffi_library_dir:58,"__llvm_stackmap":84,inject:64,dw_op_plu:53,lto_module_is_object_file_in_memori:86,ret_val:[12,13,14,15,19],broken:[37,93,51,25,1,10,26,75,73,111],cuinit:8,selectaddrrr:51,cornerston:98,x32:5,dw_ate_address:53
 ,island:[100,68],loadinst:64,pluginfilenam:77,deopt:69,llvm_targets_to_build:[35,58],livecount:70,hashtbl:[12,13,14,15,18,19],strip:[24,20,71,90,62,86],"0x3fe9":53,ymax:[14,2],mingw32:[10,109,81],overwrit:[20,84,49],legalact:51,savethi:5,x86inst:6,dllvm_default_target_tripl:9,source_x86_64:76,dw_ate_boolean:53,jite:[37,94],buggi:59,gprc:81,possibl:[58,107,40,81,83,75,80],optnum:20,poolalloc:40,unusu:[38,70,81,82,11,62,16],sanitize_address:23,embed:107,i32mem:111,emitpseudoexpansionlow:21,machinefunctioninfo:81,emitloc:39,threadloc:[23,107],deep:[30,64,97],simpletyp:104,deem:[99,59,23,89],emitvalu:81,release_xyz:89,proport:[62,20],fill:[39,40,41,23,20,59,45,2,47,48,73,64,108,109,87,16,43,53],denot:[24,81,70,87,107,23],mangler:51,field:[67,64,92,98,40,70,1,106,107,65,23],xxxgeninstrinfo:51,"0xc0de":107,riinst:111,architectur:[81,58,1,83,74,75,76,77,5],reextern:[39,41,45,2,47,48,12,13,14,15,19],"0th":98,sequenc:[30,64,0,69,5,67,40,23,32,16,51,98,70,73,21,75,77,103,81,84,29,111],arrayid
 x:23,unload:[73,23],descript:[83,107,40],v2f64:23,version_less:58,escap:[24,40,70,29,2,10,86,23,14,5,28],getreturntyp:16,unset:[39,29],forget:[70,39,64,97],mrm3m:51,dollar:34,dw_form_ref2:53,sunk:40,llvmdummyasmprint:51,dw_form_ref1:53,regno:81,mrm3r:51,dw_form_ref8:53,children:[62,97],edg:[23,81,5,56,80],image_sym_class_clr_token:104,at_byte_s:53,insertion_block:[13,14,15],daniel:53,brtarget8:51,immt:6,image_scn_lnk_comdat:104,r14:[81,6],r15:[81,6],r12:[81,22,6],r13:[81,6],r10:[81,82,6,8],r11:[82,23,6,84],fals:[30,64,45,1,34,3,65,23,39,97,40,41,42,93,9,2,47,48,32,13,16,51,70,20,53,73,21,77,24,80,62,86],offlin:[25,81,8],util:[77,40,92,63,36],fall:[30,39,51,70,16,20,45,2,47,48,64,23,12,13,14,15,5,56],"__clear_cach":23,basereg:81,run_funct:[12,13,14,15],gcno:90,use_end:16,"__sizeof_int128__":25,quiet2:20,webkit_jscc:[23,107],rawfrm:[51,111],globalalia:73,lawyer:26,val2:23,val1:23,val0:23,excit:[25,11,38,89],parsedattrinfo:21,excis:23,abi:75,worthwhil:16,abl:[67,24,57,92,98,40,70,23,20
 ,59,9,46,80,26,86,27,81,5,93],invok:[24,64,58,40,70,80,20,81,46,107,103,5],abu:92,g0l6pw:24,pointertyp:16,exit5:8,cumemcpydtoh:8,valc:8,variat:[51,40,0,81,4,110],vala:8,sophist:[70,33,81,73,110,23],analysisusag:40,memory_order_acquir:[23,83],movsx16rm8w:81,xemac:[24,62],valu:[64,88,1,3,36,5,7,91,92,40,42,44,96,52,71,74,75,77,58,102,81,83,105,107,101],quieta:20,search:[24,57,58,70,23,20,1,80,65,103,27,62,5],unabbrevi:107,image_rel_amd64_sect:22,createfcmpon:[39,45,2,47],r12w:6,r12b:6,val_:15,r12d:6,codebas:64,narrow:[24,99,64,98,40,42,59,83,80,16],iuml:81,quotient:23,primit:83,transit:[32,25,81,48,73,27,12,23,65],establish:[51,70,69,81,48,26,12,23],memor:64,vptr:[23,16],mylib:62,zeroiniti:23,parse_expr:[12,13,14,15,18,19],tackl:[12,15,45,93,48],two:[58,107,40,83,3,75,80,56],x86targetasminfo:51,getbit:20,saptr:23,desir:[72,30,38,64,51,70,16,20,1,53,73,80,10,84,11,23,69,65,22,5,6],upper16:22,penultim:51,reconfigur:[27,109],particular:[30,59,32,33,1,90,64,23,6,67,81,8,97,108,45,46,48,10
 ,69,12,15,16,18,72,51,98,70,20,53,73,21,24,80,25,40,83,84,107,103,27,29],ultrasparc:[24,51],dictat:[82,64,16],none:[81,69,1,89,65,4,23,92,12,13,14,15,16,18,19,98,70,20,73,76,77,24,103,59,62,111],dep:[12,13,14,15],elsebb:[39,45,2,47],dev:[74,99,25,9,73,26,77,16],remain:[67,30,64,107,92,111,70,5,25,45,2,89,10,26,84,23,103,14,15,16,53],paragraph:[32,64,110],deb:9,binfmt_misc:24,def:[65,81,99,57,106],share:[24,81,58,8,42,59,9,83,80,74,86,107,77,65,62,64,94,23,93],sln:35,loopend:[39,15,45,2,47],mcobjectstream:81,minimum:[24,99,64,58,51,42,59,53,26,84,108,23,18],image_file_executable_imag:104,dw_ate_unsign:53,strlen:16,retcc_x86_32_ss:51,calltmp1:[41,13,47,19],calltmp2:[12,48],awkward:[20,64,98],secur:[30,20],programmat:[70,87,8],comfort:32,unittestnam:58,cst:23,csv:33,bar_map:64,regener:[59,51,89],our:[81,0,32,64,38,39,8,41,108,43,45,2,47,48,11,69,12,13,14,15,16,17,18,19,20,53,73,24,58,59,60,26,86],"0x0000000000000002":94,number2:32,number1:32,add32mr:6,memory_order_seq_cst:[23,83],assoc
 i:[30,64,69,4,23,67,92,108,32,16,18,72,51,70,20,53,74,22,75,54,56,57,103,81,84,107,27,111],ccpassbyv:51,sse4:0,int8_t:87,binloc:39,sse2:10,mislead:64,cs1:40,image_sym_class_end_of_funct:104,rotat:[99,81],intermediari:16,isconstantpoolindex:51,mydoctyp:87,through:[58,40,81,83,107,80,56],suffer:70,llvm_src_root:[62,33,49],patfrag:51,pch:53,pend:[24,39,94,41,108,45,2,47,48,12,13,14,15,18,19],good:[30,81,31,32,33,34,89,64,4,6,99,100,8,41,42,45,2,47,48,12,13,14,15,16,51,20,53,73,24,80,25,40,26,28,111],pollut:[24,64],compound:67,adventur:16,complain:[24,61],cmpflag:32,mysteri:98,micro:64,token:[87,69,99,39,41,108,43,45,2,47,48,12,13,14,15,17,18,19,81,28,29,111],distdir:62,subsystem:[81,23],mm5:[6,111],unequ:23,mm7:[6,111],hard:[81,92,32,43,87,9,2,34,60,26,80,95,4,64,23,6,49,93],mm1:[6,111],idea:[30,99,64,31,32,20,34,47,48,41,56,26,107,108,111,23,33,53],functor:64,mm2:[6,111],dstindex:51,connect:[109,30,57,16,79],orient:[16,38,64,11,97],sparcgenregisterinfo:51,usedlib:[62,49],dw_tag_xxx:53
 ,isref:111,variable_nam:58,dagcombin:99,isinlin:53,cconv:23,mmx:[81,23,51],intregssubregclass:51,suspici:4,committ:26,cuctxdestroi:8,dw_tag_union_typ:53,omit:[30,7,81,91,88,71,47,105,73,74,84,108,36,76,13,55,106,23,18],buildmast:109,testfnptr:23,llvmgccdir:33,vmov:5,perman:[93,89],classllvm_1_1dibuild:39,callon:16,registerasmstream:81,printsth:30,exchang:[24,16],argstart:20,done:[30,81,31,32,33,34,89,64,65,4,94,23,72,99,39,92,41,108,45,2,47,48,10,69,12,13,14,15,16,18,19,97,70,86,20,71,53,73,58,80,25,87,82,83,26,103,62,29,111],dylib:[10,60],"0x00007ffff7ed40a9":94,stabl:[86,26,16,44,89],asmread:99,rootnum:70,functionindex:54,image_sym_type_uint:104,somewhatspecialsquar:97,expansionregiontag:67,least:[30,64,31,45,1,34,89,23,39,92,40,41,108,9,2,47,48,69,12,13,14,15,16,18,19,51,20,21,75,24,81,83,26,84,107,111],createpromotememorytoregisterpass:[39,45],unalign:83,cfe:[24,26,79,89],binop:[39,41,108,45,2,47,48,12,13,14,15,18,19],power8:25,selector:[24,103,81,53,21,101,23],part:[30,81,32,1,
 35,64,23,6,38,39,97,40,41,42,43,45,2,47,48,10,11,69,12,13,14,15,16,17,18,19,51,98,70,108,20,53,73,21,75,24,58,80,25,87,83,26,107,103,27,62,86],pars:107,toolset:[25,58],contrari:81,cyclic:24,i32:[67,93,70,103,81,3,75,5,56],"_tag":[12,13,14,15,18,19],horizont:5,i8mem:81,"_runtim":84,fpinst:6,constval:16,xxxtargetlow:51,uncontroversi:70,char6:107,debug_loc:85,consol:[12,37,81,110,48],built:107,build:[107,40],extractel:75,distribut:[24,64,42,1,9,94,35,26,56,93],previou:[67,99,64,92,107,81,83,75,5],chart:0,most:[81,32,1,34,83,35,64,36,23,72,99,8,5,93,9,94,96,97,98,70,20,71,75,54,89,24,103,59,40,60,26,27,62,28,101],cygwin:[24,35,81],charg:81,"234000e":[41,19],resolvereloc:72,t2item:32,sector:4,visitbasicblock:16,gettypedescript:99,carefulli:[70,26,15,45,53],particularli:[64,51,5,83,73,23,16],fine:[64,58,98,20,35,75],find:[67,99,44,58,40,42,20,1,64,101,90,26,103,81,80],realmag:[14,2],merger:32,filesizepars:20,printmemoperand:51,hasctrldep:[6,111],unus:[7,57,8,81,64,27],express:[81,64,40],c
 heaper:16,wrinkl:46,restart:[73,109,16],misnam:81,mycustomtyp:87,image_file_machine_arm:104,common:[99,64,107,92,98,40,70,103,20,81,83,26,75,106,93],intptrsiz:70,"__nv_isnanf":8,printout:[71,16],decompos:[99,26],atomtyp:53,reserv:[51,81,89,84,107,23],mrm1m:51,ccdelegateto:51,someth:[30,87,32,35,64,65,4,5,38,39,81,40,41,23,45,2,47,48,11,12,13,14,15,16,18,19,51,97,20,99,21,106,24,59,26,108,110,29,111],someti:23,debat:64,stringifi:53,smallest:[59,23],subscript:[30,23,53,40],experi:[58,32,53,34,48,69,12,62,110],altern:[80,81,58,90],dw_at_apple_property_gett:53,bourn:[24,20,93],appreci:26,complement:[23,16,98],popul:[24,99,8,103,1,21],alon:[70,108,20,81,10,26,62,18],foreign:[93,58],densemapinfo:16,cpufreq:34,corei7:[10,0],simpli:[30,64,69,33,4,23,92,40,41,5,93,9,48,10,12,16,49,19,51,98,20,71,53,73,24,80,81,26,84,18,108,62,28],fldcww:81,point:[64,58,40,81,83,74,107,80,56],instanti:[72,87,97,51,20,1,73,21,16,6,111],alloca:[70,81,64,46,98],suppli:[24,38,87,23,59,34,89,73,86,11,107,103,28,16
 ],setinternallinkag:16,throughout:[67,72,107,24,75,62,4,23],backend:[80,83],global_begin:[64,16],dovetail:[15,45],aarch64:75,"00int":53,linkonce_odr:[23,107,8],val1l:23,globalvarnam:23,reformat:28,multiclassobject:29,image_sym_class_extern:104,lto_codegen_add_must_preserve_symbol:86,unnecessarili:[73,40],gap:[64,23],understand:[99,1,40,103,81,64,26,107],repetit:81,isstoretostackslot:51,raw:[67,72,7,81,91,102,88,20,71,21,54,28,33],unifi:[23,107],fun:[38,43,22,11,62,12,13,14,15,17,19],everyon:[38,26,11,64],subsect:16,propag:[24,57,58,103,20,81,23],lto_codegen_add_modul:86,mystic:[38,11],semispac:70,itself:[87,31,32,1,46,64,23,38,39,81,40,41,42,93,9,2,47,48,10,11,45,12,13,14,15,16,18,19,97,52,70,108,20,99,53,73,75,98,24,58,69,86,25,59,26,84,107,103,27,62,29,111],codegen_func:[12,13,14,15,19],ualpha:29,case_branch_weight:3,myseqel:87,incarn:99,benign:33,getlin:39,flag2:32,flag1:32,nameflag:53,sym:[31,106,22],keyt:16,moment:[70,23,83,19],ocamlopt:25,travers:[30,81,97,70,32,1,27],task:[70
 ,103,99,64],n_bucket:53,epilogu:[70,25,23,51],"16mib":22,uint32_t:[87,53],spend:1,instr_begin:15,explan:[32,93,58,97],obscur:16,shape:[53,16,6,97,89],at_decl_lin:53,depriv:16,stwu:81,cut:[20,56,51],shiftinst:64,snan:23,singlesourc:[10,33],"0b000000":51,restructuredtext:[24,110],objectbodi:29,win:[64,16,40],rgm:73,bin:[24,31,42,20,9,10,61,35,6,49],"0x00001023":53,judgement:26,transmit:23,fucomip:81,phinod:[64,39,45,2,47],ccassigntoregwithshadow:51,knock:64,semi:[27,70,38,11],sema:21,has_jit:27,aliasset:[51,40],often:[99,64,58,40,70,80,20,81,83,26,75,5,93],steensgaard:40,weakodrlinkag:16,dllimport:[23,107],back:[64,58,92,103,81,90,26,80],bach:4,"0x00002000":53,mirror:70,sizeof:[23,93,16,8],sparcreg:51,arcmt:34,per:[87,33,36,23,67,92,8,48,12,16,97,70,20,53,73,21,56,58,86,25,81,83,106,84,107,103,27,62,29],bruce:16,substitut:[30,81,70,1,83,84,5,111],mathemat:[8,32,93,108,23,18],larg:[30,64,33,89,35,36,65,23,6,8,42,46,48,10,12,16,49,51,20,53,22,77,24,80,25,81,83,26,84,107,62],reproduc:[59
 ,45,10,26,15,80],createentryblockalloca:[39,45],bb0_1:8,intial:16,patient:73,initialse:66,oeq:23,unvectoriz:0,adc64rm:6,addpdrm:111,float_of_str:[12,13,14,15,17,18,19],impos:[23,26,16,81,84],constraint:[81,99,71],preclud:[69,75],createfadd:[39,41,45,2,47,48],litconfig:1,forexprast:[39,45,2,47],disclosur:26,timberwolfmc:33,fmin:23,ostream:[64,39,16],nsz:23,frames:70,"0x1c2":22,inclus:[4,101,23,49,62],errno:[23,40],megabyt:[24,42],x86_fastcallcc:107,subst:[29,6,111],includ:[58,40,81,83,3,75,80],cptmp0:51,cptmp1:51,forward:[30,64,4,23,99,40,41,108,43,47,16,17,18,19,53,54,103,25,81,107,29,111],image_scn_align_1byt:104,llvm_build_doc:58,reorgan:87,sidelength:97,n2429:64,translat:[67,30,38,39,91,101,51,24,23,20,40,64,83,87,21,11,98,81,16,93,53],llvmfoldingbuild:12,codeblock:[70,24],concaten:[24,75,29,53,10,23,16,111],internaltarget:62,exported_symbol_fil:62,movsx16rr8w:81,dw_tag_const:53,movnt:23,v8i16:51,glibcxx_3:24,xxxiter:16,attrinfomap:21,flow:[72,30,44,51,8,0,23,40,64,103,80,73,26,8
 6,69,81,16,110],debug_nam:53,codgen:19,isdigit:[39,41,108,43,45,2,47,48],prevail:92,singli:70,crypt:26,sequenti:[23,81,5,107,103],declas:23,llvm_target_arch:58,vg_leak:1,asymmetr:98,deseri:21,numelt:107,functionnod:32,benchmark:[24,0,31,33,53,10,26,16,49],globalvar:107,tok_numb:[39,41,108,43,45,2,47,48],libtool:[24,93,62],stryjewski:30,image_sym_type_float:104,image_comdat_select_associ:23,downcast:97,i16:[81,23,51,8],tradeoff:[12,70,83,48],required_librari:27,dwarfregnum:51,"0fb5bfbe8e":8,queri:[64,40,20,81,83,54,65,23],mantain:89,strex:83,regallocregistri:73,demangl:[76,106,53],privat:107,antisymmetr:32,sensit:[73,87,44,58,40],elsewher:[62,51],createtargetasminfo:51,granular:4,cumoduleloaddata:8,noop:23,priority_queu:16,immsubreg:51,vla:22,named_valu:[12,13,14,15,19],cudeviceptr:8,volum:[37,16,53,62],implicitli:[81,0,64,23,38,41,108,43,2,47,48,11,12,13,14,15,16,17,18,19,20,73,25,87,26,84,107,62,29,111],postord:57,ddd:92,pbqp:[81,74],fortun:[38,64,45,47,48,11,12,13,15,16],veli:81,d
 w_virtuality__virtu:53,"0x3":[84,16],segmentreg:81,"0x1":[84,16,53],"0x0":[16,107],toplevelexpr:[39,41,108,45,2,47,48,12,13,14,15,18,19],"0x5":84,"0x4":84,append:[58,92,23,91,53,10,90,107,42,13,16,49,111],"0x1f84":76,resembl:98,unwound:23,access:[64,92,52,20,81,83,40,90,106,75],agg1:23,agg3:23,agg2:23,deduc:23,camlp4:[17,18],sint:23,closur:[27,38,11],"0xh":23,partialalia:40,"0xm":23,"0xl":23,"0xc":107,getsourc:24,sine:[23,51],"0xf":111,"0xe":107,"0xd":107,remark:[80,0],libc:[24,38,64,23,26,11,16],fpregsregclass:51,cerr:8,foundat:73,standpoint:16,tool_nam:24,quickstart:24,toshio:81,seamless:61,advoc:64,projlibspath:62,select_isd_stor:51,"_regoffset":6,at_encod:53,int32ti:16,trait:[64,87,16],attrspel:21,image_scn_align_512byt:104,trail:[67,87,98,16,20,1,53,64,23],train:25,iii:25,multiclassid:29,account:[24,97,79,70,32,26,109],scalabl:40,createlocalvari:39,rdynam:[14,15,2,48],obvious:[30,99,81,98,40,31,32,20,43,64,73,26,23,108,16,17,18,111],ch8:39,unread:[64,83],fetch:[24,3,23,81],aliv
 :[73,30,81,16,32],n2657:64,abcd:107,tarbal:[37,89,9,62],msvc:[22,25,81,16,64],formmask:51,serial:[99,32,25,87,21,62,49],everywher:[10,12,87,48,32],gcc:[64,100,42,20,81,83,90,103],rootcount:70,optyp:51,add32rm:6,inteldialect:23,llvm_lit_tools_dir:[35,58],typestack:99,add64mr:6,powerpc64:100,getehframesect:72,inst:[30,16,51,111],getsigjmp_buftyp:64,llvm_include_dir:58,redund:[81,20,57],bind:[64,23,93],correspond:[30,87,32,35,64,65,5,6,67,99,39,97,8,41,23,44,47,13,81,16,93,18,19,96,51,98,70,108,20,53,73,74,22,75,76,24,57,58,80,59,83,26,107,103,29],afterloop:[39,45,2,47,13,14,15],region1:67,region0:67,noitin:77,fallback:107,loopendbb:[39,45,2,47],writethunkoralia:32,machineconstantpool:81,symbolt:16,cpu_x86_64:87,bunch:[43,33,93,2,48,12,14,16,17],acycl:[81,57,51,101],outputdebuginfo:20,ilp32:[38,11],labor:20,i1942652:23,typemap:99,immtyp:6,basic_ss:111,uncategor:20,passnam:71,dbgopt:53,spell:[21,64],dai:[37,38,58,24,89,26,11,16],mention:[107,37,64,58,75,97,32,20,81,82,53,68,23,69,27,16,
 25,111],symbol1:22,nval:23,mylist:87,isimplicitdef:6,strive:[10,64],createfcmpult:[39,41,45,2,47,48],parseexpress:[39,41,108,45,2,47,48],mem2reg:70,destarchivelib:62,sin:40,dllvm_libdir_suffix:58,add16ri8:6,lie:20,intellig:[23,16],asymptomat:42,addtypenam:16,llvmbug:37,llvmsupport:[62,49],fluctuat:40,paramattr:107,twice:[24,31,32,48,73,35,23,12,62,16],createmyregisteralloc:73,rev:[75,12,13,14,15,18,19],ret:[93,98,70,81,75,5],stub:[32,81,16,100,51],typenam:[99,16],stuf:5,rel:[64,31,33,1,89,36,23,37,39,5,93,47,13,16,49,70,20,22,56,24,81,82,84,107,28],rem:81,rec:[12,13,14,15,17,18,19],dw_apple_property_assign:53,ref:[24,40,8],reg:[51,8,81,84,28,5,111],math:[77,20,74,64],clarifi:[83,53],insid:[30,64,31,32,33,1,23,67,37,9,94,10,81,16,97,52,70,53,73,21,24,87,107,29,111],flaghollow:87,standalon:[27,81,39],invas:[26,87],bleed:37,retain:[57,16,20,93,53,73,26,75,62,23],hex64:87,suffix:[73,99,64,58,92,51,41,23,20,1,10,90,91,74,88,62,16,19],createcompileunit:39,pgo:105,targetregsterinfo:81,pgr:
 37,secondlastinst:51,facil:[64,40,70,20,1,53,35,62,4,25,49,93],misoptim:3,llvm_enable_eh:58,target_data:[12,13,14,15],messag:[92,24,26,58,102,33,37,103,80,20,1,64,87,73,21,25,57,79,5,6,59],dw_apple_property_sett:53,llvmusedlib:62,comparefp:111,ogt:23,mytool:62,s32:8,pg0:32,pg1:32,"__objc_imageinfo":23,nontempor:23,image_file_aggressive_ws_trim:104,source_i386:76,rpass:0,structur:[64,92,52,5,81,40,63,83,107,80],"123mb":20,then_val:[13,14,15],plaintext:24,thereaft:84,subclassoptionaldata:32,deprec:[58,51,25,10,107,16,33],ispack:107,have:[93,1,90,64,36,5,67,99,92,40,44,80,70,20,71,106,22,75,56,58,103,81,83,26,107],tidi:73,min:[31,23],mib:22,mid:[23,46],in64bitmod:81,sspreq:[23,107],mix:[64,98,86,81,5,61,27,16],builtin:[1,83,107,52],startval:[39,45,2,47],p3i8:8,mit:26,poison_yet_again:23,unless:[30,64,33,89,23,7,5,93,45,47,10,68,13,15,16,51,98,20,73,74,24,58,102,80,26,84,103,62,110],setpreservescfg:73,eight:[81,23,92],transcript:[12,48],v8i32:23,arm_aapcs_vfpcc:107,gather:[32,20,10,21,2
 6,103,27,16,49],hardcod:[65,51],image_file_machine_mipsfpu16:104,getdirectori:[39,53],institer:16,instantiatetemplateattribut:21,occasion:[70,107],addpassestoemitmc:72,addtmp:[39,41,45,2,47,48,12,13,14,15,19],dllexport:[23,107],ifconvers:51,text:[64,58,92,81,106,5],ifconvert:51,sanitize_thread:23,llvm_map_components_to_libnam:58,setter:[21,16,53],dw_tag_pointer_typ:53,textual:[57,74,81,48,10,21,26,12,28,111,6,93],loweroper:51,src_root:24,"__morestack":82,cpunam:[77,74],inferior:94,data64bitsdirect:51,print_newlin:[12,13,14,15],lower_bound:16,litvalu:107,sysv:106,disagre:23,bear:5,dllvm_dir:58,image_sym_class_member_of_struct:104,increas:[30,64,0,41,59,26,95,77,86,6,19],build_sub:[12,13,14,15,19],at_end:[12,13,14,15,19],callpcrel32:111,integr:[58,63],printlabel:51,conform:[24,87,70,23,1,64,16,93],project_nam:49,emitfnstart:81,dw_tag_file_typ:53,reform:64,pattern:[81,64,83,75],boundari:[30,75,81,53,107,23],uninlin:23,progress:[57,58,43,1,89,26,68,100,81,16,17],"0b100":111,"0b101":111,
 switchtosect:81,resolvecycl:25,nvptx64:8,phase3:31,plugin:[42,71,77],equal:[64,32,3,23,39,51,40,108,93,45,2,47,13,14,15,16,18,97,20,56,103,81,107,111],instanc:[72,81,58,79,97,31,5,20,1,64,46,89,70,21,84,23,32,16,53],valuelistn:29,comment:81,revert:[24,26],guidelin:[16,64,9],vend:46,functionnam:[70,23],unreferenc:[62,23],defini:65,llvm_cmake_dir:58,type_info:103,autovector:0,upcom:[],component_1:27,component_0:27,createmul:16,assert:[81,58],determinist:[80,21,16,81,40],multi:[20,64,55],plain:[70,73,110,16],defin:[58,107,40,81,83,75,56],operandtyp:51,noimplicitfloat:[23,107],func_typ:69,helper:[64,32,1,72,39,40,41,108,45,2,47,48,10,14,15,16,17,18,19,51,20,53,21],almost:[24,99,57,70,25,81,64,75,4,16],irreduc:[30,51],maystor:6,isreturn:[6,111],build_alloca:15,substanti:[12,64,48,23,40],fiddl:[16,110,9],unneed:[15,45],dw_op_piec:53,llvm_enable_zlib:58,japanes:24,codepath:83,infer:[81,97,52,87,64,74,75,62,77],backtrac:[81,39],cmakecach:58,valueopt:20,dealloc:[70,23,16],default_branch_weig
 ht:3,sm_30:81,image_scn_align_32byt:104,sm_35:81,center:39,neural:33,nevertheless:23,getopcod:[16,51],builder:24,dfpregsregisterclass:51,setp:8,choos:[81,65,23,41,42,43,47,48,12,13,16,17,18,19,51,20,53,73,75,77,58,59,26,108,109,62],usual:[64,32,33,36,23,38,39,97,40,5,10,11,16,51,98,70,20,71,99,53,73,22,24,57,58,80,25,81,82,83,61,26,107,62,110,86,111],unari:[43,29],tarjan:73,test5:5,findcustomsafepoint:25,listconcat:[29,111],numberexprast:[39,41,108,45,2,47,48],p18:8,settabl:62,tough:[108,18],cortex:[9,34,54],gendfapacket:81,adt:[24,58],tight:86,add_cfg_simplif:[12,13,14,15],onward:58,uwtabl:[23,53],add:[99,71,58,92,40,70,42,20,1,64,83,80,90,26,107,103,94,81,5,93],cleanup:26,citizen:16,dced:16,c11:83,successor:[30,44,81,64,23,56],match:[80,83,107],apple_typ:53,hypersparc:51,fnscopemap:39,llvm_yaml_is_document_list_vector:87,image_file_net_run_from_swap:104,punctuat:[64,29],realiz:[12,14,99,2,48],llvalu:[12,13,14,15,19],canlosslesslybitcastto:32,insert:[80,83,75,40],like:[58,40,81,83,
 3,107,80],success:[87,64,23,39,41,108,45,2,47,48,12,13,14,15,18,19,51,52,73,24,59,26],sstream:64,registeranalysisgroup:40,inferenc:81,c1x:23,soft:[77,53],crawler:70,unreach:[67,7],convei:[103,23],registermcobjectstream:81,proper:[67,64,97,51,16,1,83,23],getparamtyp:16,release_1:24,tmp:[98,70,23,81,45,53,48,10,76,12,15,5,49,16],nvcc:81,llvmrock:64,esp:[81,5,6],nvcl:8,"__internal_accurate_powf":8,dw_tag_structure_typ:53,trap:98,prose:64,slight:22,dce:[42,20,99],noisi:[30,26,16],host:[64,81,58],"0xffff":84,isfloatingpointti:16,simpler:[30,99,25,81,45,2,53,14,15,23],about:[99,81,58,92,102,40,106,103,20,1,74,83,94,26,64,107,36,55,105,5,56],actual:[30,81,31,32,33,1,64,97,4,5,72,38,39,92,40,41,23,43,93,45,2,47,48,10,11,69,12,13,14,15,16,17,18,19,51,98,108,20,53,73,109,75,24,57,80,87,26,84,49,107,103,27,62,111],endcod:64,madechang:70,discard:[24,20,81,22,23],addendum:37,zext:54,abical:25,guard:[64,23,21,22,62,16],been:[30,64,32,1,89,36,5,72,99,92,8,23,93,94,80,49,98,70,20,71,103,75,24,79,16
 ,81,83,26,42,62],ifexpr:[39,45,2,47,13,14,15],rcx:6,pictur:[41,32,98,19],naveen:30,rcn:31,getelementptrinst:16,biggest:[81,46],calltwo:16,functionlisttyp:16,unexpect:[64,32,33,45,35,26,15],f4rc:81,bur:57,brand:73,machinefunctionpass:51,bui:34,bug:[42,64,81,5,80],wise:23,mcpu:[51,8,9,10,74,77],wish:[24,99,59,58,51,98,32,20,1,89,69,62,16,111],srcarglist:23,flip:64,install_prefix:58,emitjumptableinfo:51,pin:23,hashfunctiontyp:53,dure:[24,99,103,31,32,20,81,53,56,10,70,26,84,89,23,69,65,86,16,33],pic:[81,51,25,59,9,77],int64_t:[87,16],llvm_append_vc_rev:58,guidanc:64,detail:[58,40,81,83,80,56],virtual:40,dw_apple_property_strong:53,out:[107,80,83,75,40],result_int:69,apple_objc:53,zeroormor:20,winzip:35,ksdbginfo:39,al_aliasset:51,afterbb:[39,45,2,47],binoprh:[39,41,108,45,2,47,48,12,13,14,15,18,19],predsens:65,unshadow:[39,45,2,47,13,14,15],twoaddressinstructionpass:81,eliminateframeindex:51,liveout:[69,84],poorli:[25,64,56],getreginfo:81,undef:[103,5,83],patcher:84,isvi:51,spec:[87,16
 ,33,59,53,89,10,23,29,111],add_incom:[13,14],concret:[20,81,107,89],under:[64,69,1,23,6,67,38,8,42,93,46,10,11,18,50,51,20,73,109,24,58,25,81,61,26,108,27,62],runhelp:64,playground:[43,17],everi:[107,40,81,83,3,75,80,56],risk:[23,89],f934:51,rise:64,risc:[83,51],implicit:[64,51,23,81,47,21,13,111,5,16],capturestackbacktrac:25,upstream:24,printfunctionpass:30,llvm_yaml_strong_typedef:87,mygc:70,isv9:51,isdefinit:53,x86_64:[76,24,81,5,34],properti:[67,30,107,75,40,70,32,20,81,65,35,23,27,16],dw_form_ref4:53,xxxinstrinfo:[65,51],naiv:30,request:[72,92,70,23,26,107,103,86],nail:[13,47],xor32rr:81,hide:64,introspect:[28,86,54],foundfoo:64,hi16:81,conduct:26,asymmetri:32,functiontyp:[39,41,45,2,47,48,16],studio:[24,64,22,58],path:[30,64,9,33,1,90,35,23,92,8,42,93,45,10,69,15,16,49,96,52,70,53,73,74,76,77,24,58,103,25,40,83,61,62,101],dlopen:[73,62],forum:[37,23],typebuild:16,mypassopt:73,anymor:[73,25,16],pointcount:70,precis:[24,97,40,81,83,74,77],portabl:81,nontempl:20,distalwai:62,prin
 td:[38,39,45,2,11,14,15],strai:10,printf:[67,24,39,80,93,45,2,53,61,35,86,14,15,23],printabl:[23,92,51],ymin:[14,2],smallsetvector:16,describ:[30,87,32,33,1,63,89,64,65,23,6,67,37,38,39,92,8,41,108,43,98,2,47,48,11,69,12,13,14,81,16,17,18,19,72,51,52,70,97,20,99,53,73,74,22,75,56,24,103,25,59,26,84,49,107,27,62,86,111],would:[64,89,35,36,23,67,40,5,93,81,97,98,70,20,109,74,75,56,24,57,103,59,83,61,26,107,27,62],gcstrategi:[70,25],addincom:[39,45,2,47],llvm_doxygen_qhp_cust_filter_nam:58,p_reg:81,n1720:64,shoot:[12,48],join:[73,23,16,77],getnumoperand:16,image_file_machine_mipsfpu:104,runfunct:[16,94],introduc:[30,32,46,23,6,51,40,5,45,2,47,69,13,14,15,97,89,25,81,83,84,111],"__data":23,virtreg2indexfunctor:81,inadvis:98,registerehfram:72,dw_tag_label:53,attract:[70,26],makellvm:24,enc:53,end:[58,75,40,81,107,80],straightforward:[38,97,51,41,53,93,45,2,47,48,73,11,75,12,13,14,15,16,19],pipefail:1,compiler_rt:26,concis:[20,81,64,98],hasnam:16,env:31,frameless:81,ancestor:[23,97],colla
 ps:23,dialect:[28,23],memorydependencyanalysi:83,createfil:39,befor:[58,40,81,83,75,80],getreservedreg:51,attrspellinglistindex:21,parallel:[24,57,58,0,25,1,60,109,62,81,23,49],bootstrap:24,r_arm_thm_movw_abs_nc:9,parserclass:20,includedir:[62,96],environ:[81,58,70,20,1,83,90,64,22,93],reloc:[77,55,81],enter:[24,81,79,103,1,53,48,107,108,12,80,18],exclus:[69,20,23,83],frontend:[67,25,44,46,83,10,27,23],over:[81,80,107,75,40],commasepar:20,imul:81,blatent:[15,45],optional_dir:[62,49],str_offset:53,rfunc:7,parseparenexpr:[39,41,108,45,2,47,48],align32bit:107,imm:[28,81,51,111],baseinstrinfo:21,image_sym_type_dword:104,tramp:23,replaceinstwithinst:16,getorinsertfunct:16,llvmbitread:49,comprehens:[24,30],llvmbc:[25,107],settruncstoreact:51,cfgsimplifi:16,getlazyresolverfunct:51,echo:[24,110,62],const_global_iter:16,"0x60500020":104,alex:67,exampletest:1,modrefresult:40,each:[81,32,1,83,90,64,65,23,67,99,92,8,5,93,80,72,96,97,98,70,20,71,74,75,54,77,55,89,56,24,58,102,103,59,40,60,26,107
 ,27,62,86,106],use_begin:[64,16],sk_lastsquar:97,prohibit:[86,83],abbrevwidth:107,runtest:[31,9],ptrtoreplacedint:16,tag_pointer_typ:53,goe:[39,58,81,51,8,70,23,25,59,45,83,87,103,62,28,15,16,93,53],newli:[30,39,41,69,2,47,48,61,12,13,14,16,19],laid:[16,81,48,75,12,23],adjust:[93,46],has_disassembl:27,got:[24,20,81],debug_pubnam:53,precaut:16,threadidx:8,free:[64,69,89,38,100,40,41,43,48,10,11,12,16,17,19,70,73,57,79,25,81,83,62],getfilenam:[39,53],rangelist:29,galina:109,precompil:8,distract:26,puzzl:59,astdump:21,r9d:6,r9b:6,filter:[81,58],addrspac:[69,23,8],rais:[30,70,23,80,103,12,13,14,15,16,17,18,19],runtimedyldimpl:72,r9w:6,onto:[24,70,23,81,53,89,26,32,16],rang:[64,40,20,81,74,80,56],xnorrr:51,wordsiz:70,rank:30,restrict:[81,20,26,64,83],datastructur:16,alreadi:[87,32,46,64,97,23,6,99,39,81,40,41,43,93,45,2,47,48,10,12,13,14,15,16,17,49,19,51,70,20,53,73,24,58,25,59,82,26,84,110],hackabl:[43,17],createcfgsimplificationpass:[39,45,2,47,48],consecut:[0,5,53,73,75,23,29],primar
 i:[23,37,39,40,41,108,43,45,2,47,48,12,13,14,15,16,17,18,19,70,25,81,26],rewritten:81,top:[81,58,52,1,40,64,107,77,5],seq_cst:[23,83],downsid:16,tok:39,toi:[38,39,41,108,43,45,2,47,48,11,12,13,14,15,17,18,19],ton:[43,17],too:[81,32,34,35,64,4,23,38,39,108,45,10,11,15,80,18,20,73,24,16,25,87,61,26,62,111],tom:87,toc:[81,84],initialize_native_target:[12,13,14,15],createalloca:[39,45],tool:[107,40],usesmetadata:70,took:[39,41,45,2,47,48,12,13,14,15,19],targetgroup:27,localtarget:62,conserv:[64,40,70,69,83,89,73,86,84,23,56],expr:[7,39,108,45,2,47,101,12,13,14,15,18,19],zero:[64,88,1,90,36,5,67,7,91,42,44,96,52,20,71,74,75,77,102,81,106,107,101],fashion:[24,99,22,51,23],ran:[73,90],ram:109,dw_tag_string_typ:53,lbd:50,further:[24,64,58,107,98,70,32,5,35,26,23,103,62,16],unreloc:69,rax:[84,6,51],adc32mi:6,unresolv:[62,25,1,11,38],thorough:64,sk_somewhatspecialsquar:97,xfail:[10,33,1],expr0lh:67,thoroughli:[13,47],adc32mr:6,atom_count0:53,though:[30,64,32,33,23,99,39,41,108,45,47,10,12,15,
 16,18,19,97,98,70,20,53,73,56,103,81,83,86],visitfab:99,glob:7,"__apple_typ":53,bss:77,sethi:51,bsd:[24,106,26,92,62],"0x00000002":53,"0x00000003":53,"0x00000000":53,"0x00000004":53,"0x00000009":53,metal:23,roots_begin:70,getorcreatefoo:16,abbrev:[85,107],declar:[24,99,81,107,97,8,32,20,40,46,64,23,27,62,5,93],radix:64,pred_begin:16,shouldexpandatomicstoreinir:83,saga:[13,47],"0x70b298":73,random:[42,64,1,80,63],radiu:97,rst:[81,21,110],popq:84,radic:81,dfapacket:81,lit_config:1,absolut:[90,64,5,56],package_str:58,bitcoderead:99,createreassociatepass:[39,45,2,47,48],configur:[64,81,5],nextprec:[39,41,108,45,2,47,48],constant:[67,99,64,40,20,81,83,107,36],getreg:[81,51],llvm_yaml_is_sequence_vector:87,label0:23,twiddl:[39,45,2,47,48,12,13,14,15,23],watch:[26,64],image_scn_type_no_pad:104,hurdl:93,report:[67,40,1,89,61,74,36,80],reconstruct:[53,92,98],sparclet:51,aliasanalysisdebugg:40,start_val:[13,14,15],sunit:81,isoper:[39,45,2],basicblock:[70,24,64],stringwithcstr:53,lto_module_is
 _object_file_for_target:86,habit:[30,64],nuw:23,memory_order_releas:[23,83],storesdnod:51,richer:84,nul:[14,16,2],num:[70,23,51],libsampl:49,corrupt:[103,38,11,92],dumpattr:21,hopefulli:[30,64,40,20,83,107],databas:[38,87,11],image_file_machine_mips16:104,valb:8,tolmach94:70,mul:[5,98],approach:[64,97,98,20,81,75,65,80],weak:[107,32,25,45,83,86,23,106,15,16],protect:[64,51,81,83,53,107,4,23],critedge1:8,fault:[42,26,75],r7xx:100,"4gib":22,mybarflag:87,lto_module_cr:86,kwd:[12,13,14,15,17,18,19],coldcc:[23,107],max_int_bit:16,trust:[26,64],nake:[23,107],nonsens:[15,45,110],getglobalcontext:[39,41,45,2,47,48,16],accumul:[30,0,12,13,14,15,18,19],fnloc:39,oldbind:[15,45,39],quickli:[64,92,40,70,20,81,80],getsymbolt:16,"0x000003bd":53,msec:0,xxx:[33,64,5,51],uncommon:103,expected_v:23,testcaselength:16,craft:16,"catch":[20,26,94],upcast:97,image_sym_class_undefined_stat:104,simplevalu:29,basic_p:111,basic_r:111,lesser:75,curvar:[15,45,39],cumemalloc:8,cdecl:23,dwarfdump:63,image_sym_type
 _mo:104,svr4:[25,92],vk_argument:64,exterior:69,registermypass:73,tediou:87,list_property_nam:27,suggest:[73,24,64,40,23,9,60,26,95,16,6,49],armasmprint:21,complex:[70,99,81,64,89],disposit:26,dooneiter:80,complet:[30,81,32,1,63,89,90,35,64,4,23,72,37,39,8,41,42,43,45,2,47,48,10,68,69,12,13,14,15,17,18,19,51,70,20,71,53,73,85,56,57,103,25,40,26,107,108,62,86,111],sched:[77,81,51],darwin9:5,binaryexprast:[39,41,108,45,2,47,48],build_ret:[12,13,14,15,19],introductori:37,property_nam:27,redefin:[111,41,25,45,2,14,15,19],sethiddenflag:20,image_scn_mem_not_pag:104,bugzilla:[37,31,69,89,10,26],shortli:39,memarg:46,everyth:[89,35,23,37,8,41,108,43,2,47,10,13,14,17,18,19,98,20,73,24,81,83,61,62],spencer:4,addend:23,makevehicl:64,setcurrentdebugloc:39,finalizememori:72,"0x01":[67,6,53],meta:[70,16,25,81,53,84,23,6],numliveout:84,shorthand:111,"0x03":84,expos:[24,81,40,23,20,1,64,83,80,86,69,30,16],interfer:[103,98],patchpoint:23,elf:[72,100,81,53,10,107,55,23],"0x7fffffffe018":94,els:81,at_a
 rtifici:53,explanatori:33,elt:23,gave:32,xnor:51,setloadxact:51,disableencod:6,howtosubmitabug:24,"______________________":16,thumb2:[81,54],gr64:81,end_:[13,14,15],apart:[58,16,75,40],unindex:51,arbitrari:[64,69,1,23,38,40,41,108,43,98,45,48,11,12,15,16,17,18,19,51,52,70,20,53,73,103,25,81,26,84,107,27,111],loadlal:23,contradict:26,build_add:[12,13,14,15,19],unstabl:[31,34],hung:16,ifexprast:[13,39,45,2,47],scopelin:39,llvm_use_sanit:58,excerpt:8,"000000e":[41,45,47,48,12,13,15,19],enumcas:87,indirect:[93,51,23,81,22,84,16],successfulli:[59,40,25,0,9,2,89,109,14],live_end:70,"0x401000":76,icc:[24,53,0],attrparsedattrimpl:21,guaranteedtailcallopt:23,armv7:[34,75,89],armv6:34,armv8:[100,6],registerclass:[81,21,6,51],core:[24,58,40,9,34,109,26,27,100,23],who:[67,24,38,64,51,37,32,59,45,60,10,26,11,27,4,15,23],llvmld:62,subtmp:[39,41,45,2,47,48,12,13,14,15,19],cast210:23,"0x2":[84,16],meyer:64,chapter:[32,43],min_int_bit:16,canreserveresourc:81,surround:[30,98,23,83,84,5,6],unfortun:[3
 8,64,32,25,46,47,48,73,11,12,13,16],distinct:[30,107,98,40,5,81,23,27,62,16],g_inlined_into_f:76,algo:73,bitsetcas:87,approxim:[35,1],produc:[30,87,75,0,32,1,64,36,4,5,67,38,39,81,41,42,44,9,46,47,48,11,45,12,13,15,16,93,19,51,98,70,74,71,53,73,21,23,92,24,58,80,25,59,83,61,26,103,27,62,28],llvm_linker:25,addpsrr:111,ppa:24,instcombin:80,regist:[75,40],encod:75,othervt:51,parse_bin_rh:[12,13,14,15,18,19],createfmul:[39,41,45,2,47,48],objectso:62,storag:[81,107],addpsrm:111,git:58,dw_apple_property_copi:53,readattribut:21,stuck:[38,11],reli:[64,98,0,31,23,81,45,53,10,70,26,86,75,69,62,15,16,56,93],gid:92,image_sym_type_enum:104,synthesiz:25,"_build":24,head:[24,64,70,23,110,29,111],medium:77,modulepass:[40,8],p0i32:5,heap:40,icmp:107,n2541:64,counsel:26,attr:[21,23,53,107],fundament:[20,81,64],autoconf:[24,58,51,25,93,89],loadregfromstackslot:[81,51],adorn:110,uncoop:70,trig:51,eieio:23,"_ztv3bar":5,adjac:[29,16,23],trip:[30,64,23,75],readonli:[30,69,53,84,107,23],tirefactori:64,tip:
 [24,43,73,21,26,80],tid:8,snapshot:40,node:[81,56,3,40,36],benefici:0,uint8:84,consid:[30,64,0,31,32,34,65,4,23,6,67,38,39,40,42,43,93,45,46,47,94,10,11,69,13,15,16,17,18,97,98,70,20,53,73,106,75,56,57,25,81,84,107,108,62,29,111],idx3:98,cooper:[70,61],idx1:[23,98],idx0:23,uniformli:64,"0x0f":84,libcuda:8,faster:[24,64,92,23,53,34,80,103,32,109,62,16],bullet:[93,97],freebench:33,serious:35,backward:[20,107],getintrinsicid:70,impli:[24,51,40,70,29,81,26,84,23,62,76,4,98,16,85],focus:[81,51,69,44,10,16],catagor:30,movabsq:[84,82],signific:[99,64,107,75,40,70,32,25,43,2,47,73,26,86,23,14,16,17],computation:57,llc:[42,81,5,63,80],mips64el:24,n32:[25,23],lld:[24,25,64,58],addregisterclass:[81,51],readabl:[81,83],getorcreatetypearrai:39,pop_back:[20,39,16],sourc:[80,40],t1item:32,feasibl:[23,9],"00main":53,cool:[39,41,20,45,2,47,48,73,12,13,14,15,19],cuctxcreat:8,curop:51,level:[83,40],quick:[80,40],release_26:24,release_27:24,release_24:24,release_25:24,"__builtin_longjmp":103,release_23
 :24,release_20:24,release_21:24,release_28:24,release_29:24,get_subtarget_feature_nam:21,magnif:[14,43,2,17],endcond:[39,15,45,2,47],port:[24,38,93,0,25,81,35,11,109,4],llvmlib:[62,49],"64bit":31,alphajitinfo:51,exitcond:23,u32:8,declare_funct:[12,13,14,15,19],fmax:23,memory_order_relax:[23,83],testsut:62,fmag:92,dw_tag_restrict_typ:53,preorder:97,createbasicaliasanalysispass:[39,45,2,47,48],writethunk:32,switchsect:[70,81],strtod:[39,41,108,20,45,2,47,48,43],r6xx:100,legalizedag:99,dorit:0,weird:81,automaton:[81,21],semant:[64,70,103,81,83,27,93],targets_to_build:[9,51],builder_at:15,circumv:20,tweak:[60,24,20,97],visibl:[64,92,20,81,83,107],camlp4of:[12,13,14,15,18,19],pred:[8,23,45,47,13,15,16],preg:81,pref:[23,25,16],todai:[64,83,98],handler:[103,25,81,23,83],upheld:69,instalia:81,breviti:[75,8],msg:23,andw:5,prev:16,reorder:[5,25,53,83,69,23],plug:[41,19],capit:64,drown:33,prototyp:[7,64,23,99],build_br:[13,14,15],registerinfo:81,function_typ:[12,13,14,15,19],purpos:[30,64,31,3
 2,4,23,6,39,8,41,48,95,16,98,20,53,73,21,75,24,81,26,62],explor:[25,16,79],preemptibl:30,parse_binary_preced:[14,15],add8rr:81,critic:[70,77,64,89,40],alwai:[67,7,26,107,92,40,103,20,1,64,3,75,36,81,5,93],differenti:[27,4,79,62],stepval:[39,45,2,47],twoargfp:111,anyon:[25,26,83,51,53],fourth:[51,20,73,84,13,23],cstptr:23,"__nv_isinff":8,double_typ:[12,13,14,15,19],clone:[24,1,45,73,61,21,15,16],mcdisassembl:81,interconnect:25,geforc:8,testresult:37,colfield:65,practic:[30,64,23,41,43,93,47,48,12,13,16,17,19,98,70,20,53,57,25,83,26,84],firstlett:94,calltmp6:[15,45],predic:[83,75],the_fpm:[12,13,14,15],cse:[12,99,57,83,48],destmodul:62,preced:[30,64,1,23,39,40,41,108,43,45,2,47,48,12,13,14,15,16,17,18,19,52,53,106,84,29],combin:[80,58,107],practis:56,nextindvar:23,sphinx_execut:58,blocker:31,ymmv:64,size_t:[70,87,86],synthesizedcd:75,canari:23,foo_dtor:46,gte:23,branch_weight:[3,56],pinsrd:5,platform:83,"static":[81,80,83,40],gtu:8,gtx:8,ymm0:84,underneath:[10,24,49],maskedbitsetcas:8
 7,flagspointi:87,inoperandlist:[6,51],sourceleveldebug:39,term:[30,57,75,37,103,32,40,64,83,53,10,26,84,23,69,4,81,29,93,111],name:[58,107],getoperatornam:[39,45,2],realist:[70,108,18,111],varexprast:[39,45],the_execution_engin:[12,13,14,15],individu:[24,99,64,107,92,30,80,1,35,26,75,36,27,28,23],otherspecialsquar:97,const0:107,getdoubleti:[39,41,45,2,47,48],x86call:111,profit:[30,81,0],decimalinteg:29,hasloadlinkedstorecondit:83,profil:[3,63],roundp:0,iscxxclass:53,factori:[30,99,64,16],aliase:[32,23,107],"\u03c6":23,migrat:[25,26],write_escap:73,integertyp:16,theori:[32,38,87,11],getvalueid:32,boehm:70,synchron:[86,23,83],refus:[24,7,58,102,30,88,71,91],motion:[24,57,23,40],turn:[81,80,83,75],place:[30,81,0,31,32,1,64,23,6,67,38,92,41,108,43,45,2,48,10,11,69,12,14,15,16,17,49,19,51,98,70,20,99,53,73,109,75,77,24,80,25,87,61,26,84,103,27,62,111],ture:[12,108,18,48],imposs:[38,51,40,83,26,11,75],origin:[24,39,92,98,52,69,16,25,81,53,90,103,95,23,62,4,5,6],suspend:70,sanitize_memori:
 23,arrai:[107,81,92,75,40],bou_fals:20,rodata:51,predefin:[73,14,1,2],unrecogn:20,"0x00003550":53,given:[30,81,69,1,35,64,36,97,4,23,72,99,92,40,41,108,44,2,14,16,93,18,19,51,52,20,71,53,73,21,76,56,24,58,103,87,83,105,61,84,107,27,62,29,111],frameindex:51,image_sym_class_external_def:104,assort:39,necessarili:[24,64,98,31,93,53,39,23],llvm_int_ti:99,circl:97,white:100,cope:[20,16],copi:[80,81,58,107,40],dblty:39,image_scn_mem_execut:104,enclos:[64,5,10,84,107,16,111],grunt:20,releasei:31,serv:[30,98,37,16,25,1,53,10,84,75,62,29],wide:[34,83,23,37,38,8,47,48,11,12,13,16,98,70,53,24,25,81,40,107,62,29,111],image_sym_type_doubl:104,subexpress:[39,40,108,45,2,47,48,73,57,12,13,14,15,18],getoperationnam:99,posix:[106,58,92],balanc:[26,83],posit:[77,81,5,107],ebp:[81,6],xxxgenasmwrit:51,seri:107,pre:[24,99,57,30,59,89,26,77,62,81,16,49],pro:75,isfunct:53,subroutin:[70,53],doiniti:[70,51],techniqu:[0,32,23,40,108,43,45,2,47,48,12,13,14,15,80,17,18,51,70,73,16,81],ebx:[81,22,6],moreov:[30,
 81,23],datapath:25,codegen_proto:[12,13,14,15,19],instrprof:23,sure:[81,0,31,9,34,89,90,64,4,6,38,39,40,41,108,93,45,2,47,48,10,11,95,15,16,19,97,20,99,53,73,75,24,58,79,59,83,60,61,26,109,62],multipli:[30,99,57,23,81,16,56],clearer:64,fca:57,nproc:24,gunzip:[24,35],fco:51,bb0_30:8,later:[30,64,32,33,90,23,67,39,41,5,48,10,12,13,14,15,16,49,19,72,51,53,73,24,25,81,84,18,108,62,110],quantiti:23,mybison:33,runtim:[67,100,103,20,81,94,26,80],readjust:81,xxxasmprint:51,cs2:40,cmakelist:[58,52],apple_namespac:53,build_cal:[12,13,14,15,19],uncondit:[30,51,47,90,13,14,15,23],dw_lang_cobol74:53,cheap:[64,16,83],permiss:[72,24,26,92,109],culinkst:8,tend:[24,64,98,31,44,53,26,27,16],explicitli:[30,64,0,69,33,5,72,38,40,41,23,93,46,11,16,19,98,20,24,58,81,111],lua:70,derivedtyp:[99,39,41,45,2,47,48,16],written:[7,81,40,88,52,64,105,90,26,22,36],sk_circl:97,analyz:[81,63],abs_fp32:6,analys:[24,99,81,40,16,71,53,73,37,30,23,56],llvm_scalar_opt:[12,13,14,15],mcsectionmacho:81,jazz:49,ssp:[23,53,1
 07],allocat:[81,23,51],dyn:55,tailor:34,image_comdat_select_largest:23,use_llvm_executionengin:[12,13,14,15],sse:[81,23,51,54],tempor:23,regtyp:51,dw_tag_packed_typ:53,reveal:98,"0x00002023":53,dramat:[64,20,48,74,12,23],intrins:83,fastcc:[25,81,23,93,107],bison:33,scott:64,backedg:[30,2,47,13,14,56],drawback:[20,26,16],n16:8,rmw:83,noth:[73,30,98,70,23,43,81,45,10,62,4,15,16,17],maximum:[58,40,32,20,81,23,36,16,56],labori:16,atomic_:83,detect:[44,58,32,1,23,5],mov32ri:81,review:64,get_register_match:21,image_scn_cnt_uninitialized_data:104,abs_f:6,cycl:[86,25,23],isatleastacquir:83,bitset:[87,51],collect2:61,come:[81,32,90,64,65,23,38,92,8,41,42,43,45,46,47,48,10,11,12,13,15,16,17,49,19,98,70,99,53,73,24,58,87,26,107,111],latch:23,at_apple_runtime_class:53,region:107,quiet:[62,20,1,94],nocaptur:[30,23,107],entir:[30,59,0,33,1,90,64,36,23,38,92,8,41,93,48,10,11,12,81,16,19,51,98,70,20,53,73,75,24,40,87,26,107,27,62],image_scn_mem_purg:104,imgrel:22,image_file_machine_powerpcfp:104,nn
 n:92,color:[81,16],rescan:32,inspir:[30,23],period:[10,80,26,23],pop:[39,70,23,81,45,47,107,13,15,16],hblcnsviw:20,image_file_machine_sh4:104,image_file_machine_sh5:104,colon:[58,87,10,27,5,111],image_file_machine_sh3:104,pod:64,coupl:[38,39,23,2,47,83,73,26,11,13,14,16,86,111],test_source_root:1,sectionnumb:104,ounit:25,debug_str:53,savesomewher:64,variableexprast:[39,41,108,45,2,47,48],mytype1:87,andrew:70,mytype2:87,mrmdestmem:51,instrssrr:111,intertwin:57,"case":[64,58,107,40,80,81,83,3,75,5],addimm:81,push_back:[39,51,41,108,87,45,2,47,48,64,16],stackgrowsdown:51,registerwithsubreg:51,dw_apple_property_weak:53,cast:[20,64,75],tblgen:[81,58,63],anytim:93,emittrailingf:83,isextern:53,clutter:26,image_file_up_system_onli:104,rangepiec:29,d14:51,d15:51,addedcomplex:6,value_desc:20,d10:51,d11:51,d12:51,d13:51,alphabet:62,check:[64,81,58,83],html:[24,99,39,58,31,42,33,9,89,41,21,64,19],intreg:[65,51],eventu:[30,97,23,33,46,47,69,13,5],hasadsizeprefix:6,week:26,image_sym_class_label:1
 04,nest:[1,40,70,103,81,64,107],confidenti:26,driver:[100,8,43,10,86,49],devoid:81,viewgraph:16,moder:[64,16,79],justifi:[86,92],iterat:16,"__main":73,model:[59,98,70,20,1,46,83,64,22,107,65,77,81,93],unimpl:[73,64],when:[107,83,75,40],"0x000003f3":53,redwin:81,kill:[73,42,81,80],xxxbranchselector:51,dynamic_cast:[45,64,39,16,97],miscellan:92,widest:26,hint:[76,80,64,23,98],except:[58,75,40,81,83,107],cxx:[24,31,93,9,61,62],blob:[31,107],notori:4,disrupt:[110,23],image_sym_dtype_point:104,predrel:65,subtargetfeatur:[6,51],createbr:[39,45,2,47],image_sym_class_union_tag:104,"0x000003ff":81,saniti:[27,24,62],"0x1000":53,whitespac:[24,39,41,29,43,45,2,47,48,26,64,108,12,13,14,15,5,17,18,19],image_scn_align_256byt:104,evergreen:100,at_apple_property_attribut:53,gridsizei:8,slice:[29,16,111],easili:[73,24,59,30,70,32,20,52,9,53,87,10,64,84,69,27,4,81,16,25],legal:83,gridsizex:8,encodecompactunwindregisterswithoutfram:81,gridsizez:8,derferenc:16,freea:46,libfil:96,freed:[82,16,40],garbag:
 [93,107],inspect:[81,23,107,98],boolordefault:20,oneargfprw:111,immut:[73,23,16,54],execv:4,errata:100,cmptmp:[39,41,45,2,47,48,12,13,14,15,19],stanc:64,cuda:[25,81,100,8],image_scn_align_16byt:104,onon:23,routin:[30,81,70,32,1,26],llvmsetdisasmopt:28,dw_at_nam:53,tbcc:51,lastli:[10,73,39,54],overrod:111,idx2:98,cpu_powerpc:87,possbil:87,unconvent:[38,11],classess:51,"0xk":23,fcc_g:51,getbuff:87,strict:[41,32,53,5,75,95,27,16,6,19],mm4:[6,111],strictli:[24,8,69,23,62,53,47,70,13,4,5],blocklen_32:107,machin:[58,75],fcc_u:51,"__llvm_coverage_map":67,mm6:[6,111],tupl:23,regard:[37,64,93,46,89,21,23],ocaml_lib:[12,13,14,15,19],mm0:[81,6,111],setjmp_buf:103,mm3:[6,111],getdata:64,longer:[30,64,92,70,25,81,45,110,73,26,54,15,16,93,49],notat:[20,92],nmake:58,parsetoplevelexpr:[39,41,108,45,2,47,48],handletoplevelexpress:[39,41,108,45,2,47,48],make_uniqu:[39,45,2,47,48],image_file_machine_thumb:104,x86_stdcall:81,clrq:81,clrw:81,cbe:59,strongli:[38,57,70,9,45,47,64,11,13,15,111],clrb:81,int
 ro:[37,15,45,100],cbw:81,umax:23,encompass:[34,54],rearrang:57,intra:40,tok_eof:[39,41,108,43,45,2,47,48],clrl:81,call2:5,idiom:[41,20,16,19],symbol:[64,92,40,81,63,107,36,77],briefli:[67,32,73],mrmsrcreg:51,lexicalblock:39,llvmcreatedisasm:28,buildmi:81,getdisplaynam:53,callq:[84,82],directori:[96,1,58,81,64,90,26,101],invest:99,calle:[81,93,75],potenti:[30,64,69,1,89,23,40,108,43,93,47,13,80,17,18,20,24,103,25,81,26,84],degrad:70,"__sync_":83,metatada:3,all:[64,1,63,90,3,36,5,7,92,40,42,44,94,80,96,20,71,99,74,75,76,77,55,106,58,103,81,83,105,26,107,85,101],replacealluseswith:[32,57,16],dist:24,fp_to_sint:51,lack:[98,70,29,81,60,95,12,23,6,111],scalar:[57,70,20,81,27,23],basicblockutil:16,pty:23,ptx:[81,100],follow:[64,1,63,90,36,5,67,99,91,92,40,42,93,94,80,70,20,106,22,75,58,103,81,83,26,107],spcc:51,ptr:64,uint8_t:87,targetdescript:51,getaddressingmod:51,init:[24,20],program:[81,40,42,1,64,63,80,74,107,5],deepcheck:16,lsbit:16,far:[38,40,41,23,20,45,2,53,73,11,108,99,27,14,15,1
 6,25,18,19],urem:[99,81],worst:[16,38,11,82],toolbuildpath:62,failur:[73,24,59,87,31,5,33,1,34,80,10,35,26,23,42,89,16,17,18,53],unoffici:98,experimental_dir:62,isunpredicatedtermin:51,basicaliasanalysi:[73,30,40],lisp:[70,25,11,38],sectionnam:107,list:[58,40,81,83,3,107,80],lli:[42,74,63],llvmdev:[37,38,64,69,83,26,11,29,111],ten:98,use_llvm_analysi:[12,13,14,15,19],still_poison:23,tex:33,rate:[26,92,107,36],pressur:[81,64,0],design:[83,107,40],storageclass:104,hasard:70,proxi:81,what:[107,83,56,75,40],namedindex:51,sub:[81,1,5,83,107],sun:[10,73],sum:[0,16,90,107,23,56],brief:[24,64,58,40,70,32,20,59],tailcallopt:[81,23],asmprint:[70,81,21,51],version:[81,58,107,40],intersect:64,row:65,themselv:[81,107,32,20,1,53,26,23,108,27,62,16,6,18],behaviour:[20,64,75],xmm3:[6,111],shouldn:[72,64,40,20,9,17,62,23,43],jitcompilerfn:51,xmm6:[6,111],b32:8,xmm4:[6,111],xmm5:[6,111],build_config:35,xmm8:6,xmm9:6,asmpars:[24,99,21],misinterpret:[64,80],slave:109,instrsdrm:111,observ:[38,64,69,81,8
 3,11,23],xmm2:[6,111],magnitud:23,"0x0000006e":53,filenam:[64,88,5,36,66,6,67,7,39,91,42,96,20,71,53,74,85,77,55,58,102,105,106,62,101,111],heurist:[30,15,23,81,45],sparcasmprint:[81,51],dump_modul:[12,13,14,15,19],hexadecim:[20,106],proceed:[70,24,81],normalizedpolar:87,coverag:63,qch:58,forcefulli:98,llvmtargetmachin:51,flat:87,at_apple_property_sett:53,cxa_demangl:53,isload:81,"80x86":109,flag:[96,64,58,81,76,5],stick:[64,16,34],"0x00000067":53,known:[30,81,107,103,98,24,31,42,8,82,40,89,35,64,23,69,16,49],ensu:51,valuabl:[33,26],outlin:[73,87],outliv:[30,23],caveat:39,relocationtyp:51,dmpqrtx:92,image_scn_align_8192byt:104,ppc64:81,reevalu:29,dicompositetyp:39,pong:32,bjarn:16,revis:[24,64,58,79,53,89,26,84,16],operandti:81,goal:[67,81,26,64],divid:[30,99,23,33,81,10,36,4,5,56],rather:[30,64,31,1,34,35,23,39,40,108,93,18,51,98,70,53,73,56,81,26,107,29],anxiou:58,hash_map:16,divis:[14,81,23,2],targetasminfo:[70,51],goat:64,resourc:20,algebra:[30,23],ranlib:[24,62,61],reflect:[24,
 89,86,40],okai:[39,98,41,108,45,2,47,48,64,13,12,4,14,15,23,18,19],ptxstring:8,"short":[87,1,35,64,23,67,39,8,93,45,2,47,13,14,15,51,75,76,24,81,40,26,84,101],postfix:64,unhid:20,stash:97,ambigu:[97,108,20,2,10,14,29,18],caus:[30,59,0,81,1,5,90,64,36,4,23,72,99,39,92,8,42,44,45,2,47,10,15,16,93,18,70,20,71,73,75,77,24,80,25,40,83,87,61,26,49,108,62],callback:[51,40,70,81,84,16],prepass:81,fslp:0,gprof:[24,62],reachabl:[70,58,57,23,69],geomean:0,next_var:[13,14,15],dso_path:74,typedef:[64,87,16],lai:[39,98,23,81,45,2,47,48,64,12,13,14,15,16],harmless:30,anachronist:107,retti:107,might:[81,32,64,89,35,3,4,23,38,92,40,97,5,93,9,47,11,69,13,14,15,16,49,51,70,20,95,53,21,24,57,58,80,87,83,26,27,62,28,110],alter:[73,62,20,93,23],wouldn:[64,15,45,39],"return":[107,40,81,83,3,75,80],no_instal:62,setgraphattr:16,var_nam:[13,14,15],framework:[30,99,45,81,37,41,23,33,40,43,2,53,73,70,14,15,16,17,19],preheaderbb:[2,47],somebodi:26,bigger:[87,64],strr:51,complexpattern:[81,51],sourcebas:37,block
 dim:8,"__dwarf":53,refresh:86,const_float:[12,13,14,15,19],difficult:[39,40,23,20,64,2,83,26,86,14,110,16],truncat:[23,51,111],compriz:36,"2x3x4":23,stkmaprecord:[69,84],compute_20:8,linkag:[76,24,44,81,107],regmapping_f:81,asmparsernum:101,expect:[107,83,56,75,40],atom_count:53,constindex:84,resulttyp:23,foolproof:73,ccifinreg:51,lineno:39,image_file_line_nums_strip:104,benjamin:70,isempti:16,uncommit:24,advanc:[20,64],"0xxxxxxxxx":53,teach:[41,43,99,17,19],pre_stor:81,flagflat:87,thrown:[103,23],targetinfo:51,putchar:[39,41,45,2,47,48,12,13,14,15],thread:[1,58,40,70,81,83,94,107],vararg:[41,16,81,107,23,19],toolnam:[62,49],runtimedyldelf:72,machineframeinfo:81,ccifnotvararg:51,circuit:[14,2],precal:70,libclc:26,feed:[13,53,47,40],notifi:[26,89,40,0],ystep:[14,2],feel:[38,64,40,41,80,25,43,26,11,23,17,19],cuda_success:8,add16mi8:6,auroraux:25,cond_val:[13,14,15],construct:[83,107,40],stdlib:24,blank:[38,64,92,108,43,26,11,110,17,18],slower:[64,70,32,81,103,16,93],fanci:33,my_jit_to
 ol:62,superpos:16,script:[42,20,1,26,52],interact:[72,30,58,79,80,20,81,83,23],parsetyp:99,stori:[67,24,35],gpu:[37,100,51,8,25,21,68],gpr:[28,81,111],luckili:70,option:[80,107,75,40],iftru:23,syncthread:8,wswitch:64,st_gid:92,cmake_c_flag:58,mcasmpars:81,secondcondit:16,dsym:76,albeit:[15,45],kind:[30,64,32,3,36,23,6,67,39,92,93,45,2,14,15,16,97,70,20,53,21,74,54,103,81,83,26,84,27,62,110,86],assert_valid_funct:[12,13,14,15,19],doubli:[82,16],whenev:[64,40,5,20,94,10,65,84,23,42,27,62,16,43],remot:[72,24],remov:[64,32,89,90,23,7,92,8,5,93,88,81,80,97,20,71,74,54,24,57,58,103,40,60,26,62,86],empty_subregsset:51,dinkumwar:16,cleaner:[20,64,16],body_v:15,nnan:23,peculiar:29,ysvn:89,astwrit:21,dedic:51,"0b000100":51,violat:[64,98,70,47,26,13,23],intregsclass:51,paramidx1:107,paramidx0:107,exec:42,unsur:29,english:[24,64],reach:[30,64,51,70,32,25,84,27,23],flagsround:87,disttarbz2:62,shouldexpandatomicloadinir:83,image_rel_amd64_addr32nb:22,amaz:[14,2],dw_tag_enumeration_typ:53,xmm7:[6,
 111],blockid:107,destruct:[84,38,11,46],libopag:60,sandybridg:0,arg_empti:16,rtl:81,getcol:39,area:[64,31,103,81,45,10,70,26,75,4,15,23,93],intti:23,optimizationlevel:20,inapplic:34,brtarget:51,penalti:[23,16],dw_apple_property_retain:53,bfd:61,create_add:19,image_file_large_address_awar:104,hash_funct:53,stackoffset:70,shlibext:[10,62],address_s:8,pushfq:81,"0x0001023":53,hit:[64,56],aliasopt:20,spurious:10,mydoclist:87,mydoclisttyp:87,fastest:109,sizabl:16,stdcall:[81,23],sextload:[6,51],him:32,exactmatch:23,llvmdummi:51,sk_otherspecialsquar:97,getvaluetyp:51,getpointertonamedfunct:72,"0x1234":53,use_empti:16,arr:[23,16,98],stump:51,dump:[39,107,41,80,53,87,45,2,47,48,73,21,85,36,12,13,81,16,19],cleverli:75,shared_librari:[62,49],proactiv:[26,80],mutabl:[43,23,2,47],arc:[90,79],dumb:[38,11],arg:[64,69,1,94,23,39,41,42,43,45,2,47,48,32,12,13,14,15,17,18,19,20,77,59,105,108,29],unreserv:53,disadvantag:[86,20,16,54],icc_:51,unqualifi:81,arm:83,property_valu:27,setupmachinefunct:51,in
 conveni:[15,45,93],inst_end:16,old_valu:15,maprequir:87,pubtyp:53,condv:[39,45,2,47],extensioan:31,syntact:[12,23,25,5,48],unabbrev:107,sole:[26,16],aspir:[14,2],setbid:107,succeed:[73,1,23,56],outfil:66,solv:[38,98,40,53,81,45,2,89,26,11,14,15],setindexedloadact:51,v128:[23,8],isdopcod:99,interprocedur:[86,23,40],fragement:69,blissfulli:20,isomorph:93,available_extern:[23,107],context:[64,32,23,6,8,93,10,16,97,98,20,53,73,21,57,79,103,40,83,109,28,29,111],subclassref:29,internallinkag:16,tgt:101,getsrc:24,die_offset_bas:53,sweep:70,lbar:81,arbitrarili:[13,23,97,47,53],mistak:64,java:[30,38,70,23,83,11,16],due:[57,81,40,31,5,59,64,34,94,70,3,86,23,32,103,69,29],whom:32,brick:32,whoa:[12,48],strategi:[45,20,15,23,81],thunk:[30,81,32],flight:23,append_block:[12,13,14,15,19],llvm_map_components_to_librari:58,demand:[24,15,45,81,107],instructor:51,asmmatcheremitt:21,echocmd:62,eatomtypedietag:53,frozen:94,batch:35,dagtodagisel:99,abov:[30,87,75,31,32,33,64,65,5,6,72,38,39,81,40,41,42,43
 ,93,9,2,47,48,10,11,45,12,13,14,15,16,17,18,19,51,98,70,97,20,99,53,73,23,76,56,92,24,58,59,82,84,49,107,108,28,110,86,111],cmp32ri:81,getlinenumb:53,int32:84,runonfunct:[70,80,16,51,40],image_file_machine_am33:104,rip:[10,6],x8b:104,rid:32,illinoi:[26,64],mioperandinfo:51,dw_lang_c:39,minim:[67,64,92,98,86,81,83,53,84,77,23,49],getnumel:16,higher:[81,26,3,40],x83:104,x87:23,x86:[58,83],wherea:[23,81,16,75,103],robust:[10,28],wherev:[64,39,16],obit:23,lower:[99,64,40,81,83,75,101,93],buildmod:[10,62],machineri:[33,97],discourag:[4,20,16,62],find_packag:58,"try":[81,52,42,20,40,64,83,26,75,80],searchabl:62,chees:64,propos:[32,26,56],denser:[14,2],stripwarnmsg:62,inlinedat:[25,23],islocaltounit:53,succ_end:16,parse_var_init:15,xxxisellow:51,exposit:[43,17,48],getbinarycodeforinstr:51,lmalloc:20,filename1:67,finder:37,view_function_cfg_onli:13,complaint:[38,11],vendor:[64,23],erasefrompar:[39,51,41,45,2,47,48,70,16],int32x4_t:75,v64:[23,8],ispoint:32,mypassnam:16,preexist:30,awaken:103
 ,image_sym_class_bit_field:104,pers_fn:23,fbb:51,confront:98,llvm_yaml_is_flow_sequence_vector:87,short_wchar:23,xmm10:6,xmm11:6,xmm12:6,xmm13:6,xmm14:6,hatsiz:87,cst_code_wide_integ:107,"1st":53,global:[67,24,7,44,92,98,40,70,103,20,1,83,94,64,107,36,106,81,5,93],understood:[38,81,11,64],litter:26,unspecifi:[69,33,81,23,8],r221139:25,surpris:[16,38,11,23,32],condition_vari:24,multmp:[39,41,45,2,47,48,12,13,14,15,19],image_scn_mem_read:104,prof:56,patchset:24,proc:[24,34,51],studi:49,n3206:64,setdatalayout:[39,45,2,47,48],assignvirt2stackslot:81,runtimedyld:72,mustquot:87,lhs_val:[12,13,14,15,19],ispointertyp:64,"_unwind_resum":103,testfunc:[12,48],arg_begin:[39,41,45,2,47,48,16],image_file_machine_wcemipsv2:104,registerasmprint:51,getdatalayout:[39,51,70,45,2,47,48],threadid:8,tok_then:[39,45,2,47],plethora:[24,93,16],branchfold:51,prec:[39,14,15,45,2],artifici:53,operandmap:51,question:[26,64,40],fast:[81,74,64,34,101],lldb:[27,26,64,53,94],arithmet:[67,81],"__cxa_call_unexpect":1
 03,files:66,lto_codegen_set_pic_model:86,of_channel:[12,13,14,15,18,19],gcca:91,yrc1:89,delta:59,libclang:25,consist:[81,83,107,40],caller:[30,93,51,41,32,53,81,82,2,47,80,73,70,75,13,14,23,19],eqtyp:99,cmpnumber:32,parsedefinit:[39,41,108,45,2,47,48],mflop:0,arm64:24,tdrr:77,highlight:[67,24,39,81,21,110,16],worklist:[30,16,32],tooldir:62,icc_val:51,cleargraphattr:16,phieliminationid:81,o32:25,composit:16,numconst:84,simm13:51,cciftyp:51,pat:[81,6,51],sdvalu:[81,51],remove_if:16,registerdescriptor:51,nice:[30,64,5,38,41,108,43,45,2,47,48,11,12,13,14,15,16,17,18,19,20,73,24,111],ecosystem:[27,16],at_decl_fil:53,storeregtostackslot:[81,51],parseprimari:[39,41,108,45,2,47,48,14],containsfoo:64,ccpromotetotyp:51,meaning:[98,70,16,71,21,69,77,110,23],thedoc:87,ccifcc:51,difil:39,ternari:81,vice:83,elementtyp:23,gr8:[81,51],spillsiz:51,cmpq:82,pervert:[6,95],tag_structure_typ:53,edi:[81,5,6],numfilenam:67,block_begin:[12,13,14,15,19],gmake:[73,24,33,93],dispel:98,int8ti:16,edx:[81,6,111]
 ,uphold:23,xxxiseldagtodag:51,else_bb:[13,14,15],initializenativetargetasmprint:[39,45,2,47,48],needstub:51,outgo:[23,56],attributerefer:21,formbit:6,fpformbit:6,whichev:53,vadv:33,emitconstantpool:51,relev:[81,5,83,40],mandelhelp:[14,2],"0x0002023":53,maxsiz:64,loop_end_bb:[13,14,15],h_inlined_into_g:76,pleas:[81,31,69,34,83,35,64,65,23,38,8,41,9,10,11,16,19,50,51,109,89,24,78,101,79,25,59,40,26,27,110,29,111],smaller:[30,64,79,70,23,25,81,26,16,33],"_main":[76,104],lcuda:8,memset:83,dllvm_binutils_incdir:61,fold:[83,40],investig:[33,11,38],ctor:[64,23,46,93],compat:[64,92,107,20,81,83,90,75,77],pointer_offset:69,image_file_machine_i386:104,compar:[44,40,103,81,5,56],mainlin:[26,89],smallconst:84,dllvm_enable_doxygen_qt_help:58,result_ptr:69,proj_obj_root:[62,49],finishassembl:70,dllvm_targets_to_build:[58,9],chose:[12,31,48],sexi:[43,17],ocamlbuild_plugin:[12,13,14,15,19],destbitcodelib:62,libltdl:62,sse41:5,larger:[7,64,51,23,25,81,99,53,26,22,107,36,16],shader:[100,81,64],n2927:
 64,nsstring:53,unattend:80,typic:[30,64,89,36,23,72,38,92,40,97,5,10,11,16,49,51,98,70,53,73,106,24,57,58,102,103,81,84,27,62,28,86],n2928:64,apr:4,appli:[30,81,31,89,90,64,4,23,72,38,92,40,45,2,48,11,12,14,15,16,51,98,86,20,71,53,73,22,75,24,80,87,83,26,109,29,111],app:[60,64,16],inequ:81,loopcond:[39,45,2,47,13,14,15],api:[58,40],opcod:[39,97,51,41,32,81,45,2,83,64,23,108,65,14,111,16,6,18,19],transformutil:27,gnuwin32:[35,58],sourcefil:90,emitconstpooladdress:51,fed:81,from:[107,83,75,40],usb:34,ineg:81,few:[30,64,0,89,4,23,38,39,92,8,41,108,2,48,10,11,12,14,16,49,19,51,70,71,53,73,24,80,25,81,83,26,18,107,27,62],muclibc:25,usr:[24,58,8,20,9,61,62],regconstraint:81,my_addit:53,sort:[67,64,58,20,59,83,26,106,23,93],clever:[38,11,97],ap2:23,cimag:[14,2],adc64mi8:6,llvmtooldir:62,tok_identifi:[39,41,108,43,45,2,47,48],is_zero_undef:23,localdynam:[23,107],augment:[14,16,2],lbb0_2:82,annoi:64,no_dead_strip:23,typesequ:99,getregclass:81,proof:3,expr1lh:67,tar:[24,31,9,89,35,62],isindir
 ectbranch:6,movapd:5,tag:[64,107],proprietari:26,xmin:[14,2],tag_apple_properti:53,predicate_stor:51,featurefparmv8:6,six:[81,1,83],linaro:34,subdirectori:[27,24,1,58,89],instead:[58,40,81,83,107,80],constantfp:[39,41,45,2,47,48,16,19],dwo:85,chri:[38,64,81,89,73,26,11],sil:6,tension:[15,45],msdn:64,vehicletyp:64,hazard:57,singlethread:23,printdens:[14,2],attent:[10,26,23,51],hasiniti:16,initialize_ag_pass:73,mynewpass:42,light:[25,64,23],llvm_build_exampl:58,freebsd:[24,25,81,89],elid:[70,46,111],elig:30,elim:[74,53],dw_tag_memb:53,attrparsedattrlist:21,build_fsub:19,projlibsopt:62,reilli:16,"80x87":81,in32bitmod:81,attrpchread:21,nonneg:23,devel:31,createbasictyp:39,nfc:57,trac:109,automak:[24,62],edit:[24,16,58,92],polit:81,instsp:51,forcibl:23,image_scn_align_8byt:104,mylistel:87,virtregmap:81,"__stack_chk_fail":23,sahf:81,argumentlisttyp:16,const_use_iter:16,llvm_compiler_job:58,pointless:103,distnam:62,categori:64,sectalign:20,stroustrup:16,llvmbb:37,llvmconfig:58,dive:[43,17,
 97],proviso:26,ocamlfind:25,powerpc:[58,83],dictionari:[1,23],promptli:26,my86_64flag:87,image_sym_class_undefined_label:104,tailcalle:81,lto:107,isdef:81,mrm1r:51,flaground:87,isfoo:64,"0x2000":53,prioriti:[23,53,98],unknown:[92,20,81,34,61,23],printoperand:51,boil:[97,2,47,26,75,13,14],misunderstood:93,tidbit:[43,39,45,40],shell:[24,39,58,20,1,10,110,80,93],unabridg:[15,45],juli:70,global_iter:16,protocol:[69,64],emac:[24,64,6,62],probe:81,utf:[24,21],bitcodewrit:[99,16],clip:94,favorit:[13,57,47],cohen:4,linker:[96,64,81,63,74,80],appel89:70,peform:75,coher:[27,23],lowerfp_to_sint:51,disjoint:[40,23,0],inform:[81,3,58,107,40],diverg:[14,2,98],rout:40,"__unwind_info":81,anyregcc:[84,23,107],movsx32rm16:81,ncsa:26,llvmtarget:49,clash:[64,23],safepointaddress:70,clase:16,sunwspro:24,image_file_machine_ia64:104,dw_op_addr:53,hassideeffect:6,attributelist:[21,54],dens:[23,16,107],addregfrm:51,pipe:[4,1,5],osuosl:109,determin:[1,58,92,40,71,74,107,81],image_file_machine_amd64:104,const
 _arg_iter:16,setindexedstoreact:51,"30pm":87,mainloop:[39,41,108,45,2,47,48],filetyp:[35,74],arm_neon:[21,75],liveinterv:[77,81],mistyp:64,strtol:20,locat:[81,58,92,52,1,40,63,83,5],preserve_allcc:[23,107],much:[30,59,87,31,45,64,36,97,4,23,6,38,81,8,41,108,93,9,46,48,10,11,69,12,15,16,18,19,51,86,20,99,53,73,92,24,79,80,40,83,60,61,26,84,49,109,110,29],eatomtypetypeflag:53,multmp4:[12,48],local:[81,64,56,107,40],multmp1:[41,19],multmp2:[41,19],multmp3:[41,19],contribut:[30,50,23,81,73,26,37,16],pypi:93,succe:[88,7,39,91,92,102,97,42,71,45,96,101,10,74,108,36,109,103,15,5,18],buildtool:27,blarg:16,operating_system:23,dw_tag_user_bas:53,selectcod:51,regalloclinearscan:81,image_rel_i386_sect:22,partit:[81,74,80,34],view:[81,86,83,107],modulo:[81,23,53],knowledg:[67,30,38,64,81,10,26,11,107,62,28,110,23],maketir:64,objectcach:72,dw_form_xxx:53,int16_t:[87,51],p20:8,image_sym_class_enum_tag:104,becaus:[30,81,0,32,33,1,46,35,64,65,4,5,6,67,38,39,92,40,41,23,43,93,9,2,47,48,11,45,12,13,14
 ,15,16,17,18,19,72,51,98,70,97,20,53,73,106,75,54,89,24,69,80,87,83,26,84,108,107,103,62,86,111],gmail:24,closer:[25,57,98],entranc:23,framemap:70,mainli:[32,21,49],divisionbyzero:23,dll:107,favor:[33,26],structtyp:16,beginassembl:70,"__apple_nam":53,rppassmanag:73,image_sym_dtype_funct:104,llvm_enable_assert:58,amen:81,cudamodul:8,sprinkl:16,job:[73,4,58,97,24],mapopt:87,noalia:[98,107,40],externallinkag:[39,41,45,2,47,48,19],exclam:23,addit:[64,40,42,81,83,5,107,80],"0x00000120":53,thenbb:[13,39,45,2,47],constantint:[64,16],tgtm:24,mlimit:42,committe:16,libtinfo:9,uint16_t:[65,87,53,51],unclear:[15,45,40],wall:[73,38,1,11],wonder:[64,97,98,93,48,12],arriv:98,chmod:24,walk:[30,32,25,87,73,16],"00myglob":53,respect:[64,69,89,23,6,51,40,42,93,45,15,80,49,97,98,70,76,24,16,81,26,103,28],rpo:57,decent:[99,39,34,89,73,16],xxxcallingconv:51,compos:[67,92,53,35,62,23],compon:58,besid:[64,51,108,20,2,10,14,23,18],inbound:[67,23,98],presenc:[51,5,25,81,83,23,103,16,33],present:[24,59,98,70,
 23,20,1,107,77,76,62,81,5],xorrr:51,align:83,dfpregsclass:51,constprop:20,wili:98,wild:[14,20,2],xorri:51,bb3:23,bb2:[23,107],bb1:[23,107],d_ctor_bas:5,layer:40,avx:[10,0],instrinfo:81,cctype:[39,41,108,45,2,47,48],eptr:23,avl:16,motiv:65,dual:26,add64mi32:6,dinstinguish:53,incq:5,getattributespellinglistindex:21,uint16x4_t:75,headlight:64,xxxschedul:51,member:[99,81,64,92],binary_preced:[14,15],largest:[23,81,22],f64:[81,23,51,8],expcnt:68,"0x1b":107,hasjit:51,maptag:87,ssecal:51,hardcodedsmalls:16,bcpl:29,usecas:25,decoupl:111,outputtyp:99,debug_abbrev:85,extra_dist:62,inc4:5,immateri:32,"0x11":53,"0x10":[84,53],linkagetyp:16,getrawpoint:54,my_function_fast:8,getoffset:51,camel:64,obtain:[67,81],heavili:[70,37,38,93,11],simultan:[10,24,16,75,0],tcb:82,expr1rh:67,superset:[23,92],methodproto:51,amd64:24,eatomtypenul:53,smith:64,waypoint:80,emitobject:72,smart:64,llvm_on_win32:4,agnost:[4,81,53,75],strconcat:[29,51,111],intregsregisterclass:51,lightweight:[64,1,16],know:[67,24,59,58
 ,40,70,80,20,1,64,83,94,35,26,86,75,109,81,23,93],nor:[30,64,98,70,32,81,35,84,107,62,4,23,93],librarynam:[70,62,73,51,49],"7e15":20,hostc:8,hostb:8,hosta:8,incred:[26,64],repurpos:53,"0xff":111,createphi:[39,45,2,47],growth:[23,81,16],"export":[24,58,40,86,20,81,2,89,61,62,23],superclass:[51,40,73,16,6,111],package_vers:58,add64ri32:6,not_found:[12,13,14,15,18,19],leaf:[103,53],image_sym_class_struct_tag:104,lead:[30,39,98,23,20,87,83,61,64,108,62,81,16,18,111],leak:[70,1,46],leaq:82,leav:[30,59,79,51,24,70,32,20,1,53,61,8,23,93],prehead:[13,47,30],leader:64,getnam:[39,41,53,93,45,2,47,48,73,16],numstr:[39,41,108,43,45,2,47,48],acronym:37,"enum":[64,65,23,6,99,39,51,40,41,108,43,45,2,47,48,81,16,97,70,20,53,21,54,87,104,101],tdfile:62,xxxgencallingconv:51,obei:[25,23],eatomtypenameflag:53,rare:[64,107,51,70,5,81,23,103,16,111],add64mi8:6,column:[67,24,39,0,25,53,64,65,23,33],vset_lan:75,constructor:[81,83],spiller:[77,74,81],disabl:[24,59,58,40,70,42,20,1,9,80,61,74,75,71,77,64,89,
 5,93],stackentri:70,desrib:67,own:[67,24,99,64,58,79,97,30,70,20,81,72,61,26,107,27,62,89,23,56,93],automat:40,warranti:[73,26],dbuilder:39,build_mod:35,val:[39,51,8,41,23,20,45,2,47,48,64,84,108,107,54,16,111],transfer:[82,23,46,75,103],threadsanit:23,intention:[73,108,64,23,18],appl:[37,23,81,53,94,26,5],arg1:[43,23,17],incorr:3,varexpr:[15,45,39],mailer:26,"0x7fffffff":23,codegen_expr:[12,13,14,15,19],lazyresolverfn:51,"__cxa_throw":103,made:[30,81,32,89,64,23,6,37,38,39,40,41,93,45,2,47,48,11,95,13,15,16,49,97,98,53,73,21,75,103,87,82,26,107,62,110],temp:[25,59],whether:[81,58,92,40,71,64,74,107,77,80,56],troubl:[24,20,26,35],below:[30,81,0,31,32,33,34,46,35,64,5,67,7,92,8,97,23,45,2,10,68,69,12,14,15,16,18,51,20,53,73,21,89,24,58,74,40,82,26,84,49,107,108,27,62],libsystem:64,disttargzip:62,lvm:39,again:[32,33,89,23,38,41,5,45,47,48,11,12,13,15,16,20,73,75,103,25,59,82,110],llvmasmpars:[99,49],numberexpr:[39,41,108,45,2,47,48,12,13,14,15,18,19],significantli:[64,16,47,73,86,108,
 107,36,13,23,18],entiteti:69,link_libs_in_shar:62,meaningless:69,operand:[30,99,64,107,98,32,81,5,3,68,23,36,16],create_entry_block_alloca:15,rl7:8,mutual:[41,20,43,17,19],rl6:8,minsizerel:58,the_modul:[12,13,14,15,19],percent:40,constantfold:99,book:[73,37,64,57,16],bool:[87,32,64,99,39,97,40,41,45,2,47,48,12,13,14,15,16,19,51,70,20,53,73,58,81],llvmdisassembler_option_usemarkup:28,gline:0,neelakantam:30,inst_iter:16,keep_symbol:62,hacker:[37,26],junk:[12,13,14,15,18,19],xxxsubtarget:51,indexedmap:81,add_subdirectori:58,ptrreg:81,debian:[60,24,9],stringmap:[20,8],experienc:80,sass:8,reliabl:58,subregclasslist:51,pdata:22,emerg:94,auxiliari:51,invari:[24,40],istermin:[6,111]},objtypes:{"0":"std:option"},objnames:{"0":["std","option","option"]},filenames:["Vectorizers","CommandGuide/lit","tutorial/LangImpl6","BranchWeightMetadata","SystemLibrary","CommandGuide/FileCheck","TableGen/index","CommandGuide/llvm-extract","NVPTXUsage","HowToCrossCompileLLVM","TestingGuide","tutorial/OCamlLa
 ngImpl8","tutorial/OCamlLangImpl4","tutorial/OCamlLangImpl5","tutorial/OCamlLangImpl6","tutorial/OCamlLangImpl7","ProgrammersManual","tutorial/OCamlLangImpl1","tutorial/OCamlLangImpl2","tutorial/OCamlLangImpl3","CommandLine","TableGen/BackEnds","Extensions","LangRef","GettingStarted","ReleaseNotes","DeveloperPolicy","LLVMBuild","MarkedUpDisassembly","TableGen/LangRef","Passes","ReleaseProcess","MergeFunctions","TestSuiteMakefileGuide","HowToBuildOnARM","GettingStartedVS","CommandGuide/llvm-bcanalyzer","index","tutorial/LangImpl9","tutorial/LangImpl8","AliasAnalysis","tutorial/LangImpl3","CommandGuide/bugpoint","tutorial/LangImpl1","CommandGuide/llvm-diff","tutorial/LangImpl7","InAlloca","tutorial/LangImpl5","tutorial/LangImpl4","Projects","tutorial/index","WritingAnLLVMBackend","CommandGuide/llvm-build","SourceLevelDebugging","HowToUseAttributes","CommandGuide/llvm-readobj","BlockFrequencyTerminology","Lexicon","CMake","HowToSubmitABug","Packaging","GoldPlugin","MakefileGuide","Comm
 andGuide/index","CodingStandards","HowToUseInstrMappings","CommandGuide/llvm-stress","CoverageMappingFormat","R600Usage","Statepoints","GarbageCollection","CommandGuide/opt","MCJITDesignAndImplementation","WritingAnLLVMPass","CommandGuide/llc","BigEndianNEON","CommandGuide/llvm-symbolizer","CommandGuide/lli","TableGenFundamentals","Phabricator","Bugpoint","CodeGenerator","SegmentedStacks","Atomics","StackMaps","CommandGuide/llvm-dwarfdump","LinkTimeOptimization","YamlIO","CommandGuide/llvm-dis","HowToReleaseLLVM","CommandGuide/llvm-cov","CommandGuide/llvm-as","CommandGuide/llvm-ar","FAQ","DebuggingJITedCode","TableGen/Deficiencies","CommandGuide/llvm-config","HowToSetUpLLVMStyleRTTI","GetElementPtr","ExtendingLLVM","CompilerWriterInfo","CommandGuide/tblgen","CommandGuide/llvm-link","ExceptionHandling","yaml2obj","CommandGuide/llvm-profdata","CommandGuide/llvm-nm","BitCodeFormat","tutorial/LangImpl2","HowToAddABuilder","SphinxQuickstartTemplate","TableGen/LangIntro"],titles:["Auto-Ve
 ctorization in LLVM","lit - LLVM Integrated Tester","6. Kaleidoscope: Extending the Language: User-defined Operators","LLVM Branch Weight Metadata","System Library","FileCheck - Flexible pattern matching file verifier","TableGen","llvm-extract - extract a function from an LLVM module","User Guide for NVPTX Back-end","How To Cross-Compile Clang/LLVM using Clang/LLVM","LLVM Testing Infrastructure Guide","8. Kaleidoscope: Conclusion and other useful LLVM tidbits","4. Kaleidoscope: Adding JIT and Optimizer Support","5. Kaleidoscope: Extending the Language: Control Flow","6. Kaleidoscope: Extending the Language: User-defined Operators","7. Kaleidoscope: Extending the Language: Mutable Variables","LLVM Programmer’s Manual","1. Kaleidoscope: Tutorial Introduction and the Lexer","2. Kaleidoscope: Implementing a Parser and AST","3. Kaleidoscope: Code generation to LLVM IR","CommandLine 2.0 Library Manual","TableGen BackEnds","LLVM Extensions","LLVM Language Reference Manual","Getting S
 tarted with the LLVM System","LLVM 3.6 Release Notes","LLVM Developer Policy","LLVMBuild Guide","LLVM’s Optional Rich Disassembly Output","TableGen Language Reference","LLVM’s Analysis and Transform Passes","How To Validate a New Release","MergeFunctions pass, how it works","LLVM test-suite Makefile Guide","How To Build On ARM","Getting Started with the LLVM System using Microsoft Visual Studio","llvm-bcanalyzer - LLVM bitcode analyzer","Overview","9. Kaleidoscope: Conclusion and other useful LLVM tidbits","8. Kaleidoscope: Extending the Language: Debug Information","LLVM Alias Analysis Infrastructure","3. Kaleidoscope: Code generation to LLVM IR","bugpoint - automatic test case reduction tool","1. Kaleidoscope: Tutorial Introduction and the Lexer","llvm-diff - LLVM structural ‘diff’","7. Kaleidoscope: Extending the Language: Mutable Variables","Design and Usage of the InAlloca Attribute","5. Kaleidoscope: Extending the Language: Control Flow","4. Kaleidoscop
 e: Adding JIT and Optimizer Support","Creating an LLVM Project","LLVM Tutorial: Table of Contents","Writing an LLVM Backend","llvm-build - LLVM Project Build Utility","Source Level Debugging with LLVM","How To Use Attributes","llvm-readobj - LLVM Object Reader","LLVM Block Frequency Terminology","The LLVM Lexicon","Building LLVM with CMake","How to submit an LLVM bug report","Advice on Packaging LLVM","The LLVM gold plugin","LLVM Makefile Guide","LLVM Command Guide","LLVM Coding Standards","How To Use Instruction Mappings","llvm-stress - generate random .ll files","LLVM Code Coverage Mapping Format","User Guide for R600 Back-end","Garbage Collection Safepoints in LLVM","Accurate Garbage Collection with LLVM","opt - LLVM optimizer","MCJIT Design and Implementation","Writing an LLVM Pass","llc - LLVM static compiler","Using ARM NEON instructions in big endian mode","llvm-symbolizer - convert addresses into source code locations","lli - directly execute programs from LLVM bitcode","Tab
 leGen Fundamentals","Code Reviews with Phabricator","LLVM bugpoint tool: design and usage","The LLVM Target-Independent Code Generator","Segmented Stacks in LLVM","LLVM Atomic Instructions and Concurrency Guide","Stack maps and patch points in LLVM","llvm-dwarfdump - print contents of DWARF sections","LLVM Link Time Optimization: Design and Implementation","YAML I/O","llvm-dis - LLVM disassembler","How To Release LLVM To The Public","llvm-cov - emit coverage information","llvm-as - LLVM assembler","llvm-ar - LLVM archiver","Frequently Asked Questions (FAQ)","Debugging JIT-ed Code With GDB","TableGen Deficiencies","llvm-config - Print LLVM compilation options","How to set up LLVM-style RTTI for your class hierarchy","The Often Misunderstood GEP Instruction","Extending LLVM: Adding instructions, intrinsics, types, etc.","Architecture & Platform Information for Compiler Writers","tblgen - Target Description To C++ Code Generator","llvm-link - LLVM bitcode linker","Exception Handlin
 g in LLVM","yaml2obj","llvm-profdata - Profile data tool","llvm-nm - list LLVM bitcode and object file’s symbol table","LLVM Bitcode File Format","2. Kaleidoscope: Implementing a Parser and AST","How To Add Your Build Configuration To LLVM Buildbot Infrastructure","Sphinx Quickstart Template","TableGen Language Introduction"],objects:{"":{"--stats":[74,0,1,"cmdoption--stats"],"-D":[106,0,1,"cmdoption-llvm-nm-D"],"-A":[106,0,1,"cmdoption-llvm-nm-A"],"-B":[106,0,1,"cmdoption-llvm-nm-B"],"--vg-arg":[1,0,1,"cmdoption--vg-arg"],"-O":[74,0,1,"cmdoption-O"],"-seed":[66,0,1,"cmdoption-seed"],"-I":[101,0,1,"cmdoption-tblgen-I"],"-gen-register-info":[101,0,1,"cmdoption-tblgen-gen-register-info"],"-gen-subtarget":[101,0,1,"cmdoption-tblgen-gen-subtarget"],"-S":[71,0,1,"cmdoption-S"],"-mattr":[74,0,1,"cmdoption-mattr"],"-counts":[105,0,1,"cmdoption-llvm-profdata-show-counts"],"-d":[102,0,1,"cmdoption-d"],"-g":[106,0,1,"cmdoption-llvm-nm-g"],"--object-directory":[90,0,1,"cmdoption--object-
 directory"],"-a":[90,0,1,"cmdoption-a"],"-c":[90,0,1,"cmdoption-c"],"-demangle":[76,0,1,"cmdoption-demangle"],"--no-progress-bar":[1,0,1,"cmdoption--no-progress-bar"],"-l":[90,0,1,"cmdoption-l"],"-o":[106,0,1,"cmdoption-llvm-nm-o"],"-n":[90,0,1,"cmdoption-n"],"-h":[55,0,1,"cmdoption-h"],"--defined-only":[106,0,1,"cmdoption-llvm-nm--defined-only"],"-j":[1,0,1,"cmdoption-j"],"-u":[106,0,1,"cmdoption-llvm-nm-u"],"-t":[55,0,1,"cmdoption-t"],"-v":[106,0,1,"cmdoption-llvm-nm-v"],"-q":[1,0,1,"cmdoption-q"],"-p":[106,0,1,"cmdoption-llvm-nm-p"],"-s":[55,0,1,"cmdoption-s"],"-r":[55,0,1,"cmdoption-r"],"-gen-dag-isel":[101,0,1,"cmdoption-tblgen-gen-dag-isel"],"-use-symbol-table":[76,0,1,"cmdoption-use-symbol-table"],"--max-tests":[1,0,1,"cmdoption--max-tests"],"-class":[101,0,1,"cmdoption-tblgen-class"],"--max-time":[1,0,1,"cmdoption--max-time"],"-all-functions":[105,0,1,"cmdoption-llvm-profdata-show-all-functions"],"--show-xfail":[1,0,1,"cmdoption--show-xfail"],"--vg-leak":[1,0,1,"cmdoption--v
 g-leak"],"--branch-probabilities":[90,0,1,"cmdoption--branch-probabilities"],"-gen-instr-info":[101,0,1,"cmdoption-tblgen-gen-instr-info"],"-P":[106,0,1,"cmdoption-llvm-nm-P"],"--print-file-name":[106,0,1,"cmdoption-llvm-nm--print-file-name"],"-stats":[71,0,1,"cmdoption-stats"],"-gen-asm-writer":[101,0,1,"cmdoption-tblgen-gen-asm-writer"],"-symbols":[55,0,1,"cmdoption-symbols"],"-print-sets":[101,0,1,"cmdoption-tblgen-print-sets"],"-program-headers":[55,0,1,"cmdoption-program-headers"],"--disable-fp-elim":[74,0,1,"cmdoption--disable-fp-elim"],"-obj":[76,0,1,"cmdoption-obj"],"--check-prefix":[5,0,1,"cmdoption--check-prefix"],"--succinct":[1,0,1,"cmdoption--succinct"],"--x86-asm-syntax":[74,0,1,"cmdoption--x86-asm-syntax"],"--show-suites":[1,0,1,"cmdoption--show-suites"],"-relocations":[55,0,1,"cmdoption-relocations"],"-needed-libs":[55,0,1,"cmdoption-needed-libs"],"-nodetails":[36,0,1,"cmdoption-llvm-bcanalyzer-nodetails"],"--enable-no-nans-fp-math":[74,0,1,"cmdoption--enable-no-nans
 -fp-math"],"-asmwriternum":[101,0,1,"cmdoption-tblgen-asmwriternum"],"-debug-dump":[85,0,1,"cmdoption-debug-dump"],"--print-machineinstrs":[74,0,1,"cmdoption--print-machineinstrs"],"-asmparsernum":[101,0,1,"cmdoption-tblgen-asmparsernum"],"-section-symbols":[55,0,1,"cmdoption-section-symbols"],"--print-size":[106,0,1,"cmdoption-llvm-nm--print-size"],"--config-prefix":[1,0,1,"cmdoption--config-prefix"],"-sections":[55,0,1,"cmdoption-sections"],"-f":[71,0,1,"cmdoption-f"],"-function":[105,0,1,"cmdoption-llvm-profdata-show-function"],"-print-records":[101,0,1,"cmdoption-tblgen-print-records"],"-gen-dfa-packetizer":[101,0,1,"cmdoption-tblgen-gen-dfa-packetizer"],"--load":[74,0,1,"cmdoption--load"],"-dump":[36,0,1,"cmdoption-llvm-bcanalyzer-dump"],"--dynamic":[106,0,1,"cmdoption-llvm-nm--dynamic"],"--quiet":[1,0,1,"cmdoption--quiet"],"-b":[90,0,1,"cmdoption-b"],"--spiller":[74,0,1,"cmdoption--spiller"],"--all-blocks":[90,0,1,"cmdoption--all-blocks"],"-gen-intrinsic":[101,0,1,"cmdoption-t
 blgen-gen-intrinsic"],"--enable-unsafe-fp-math":[74,0,1,"cmdoption--enable-unsafe-fp-math"],"-verify-each":[71,0,1,"cmdoption-verify-each"],"--unconditional-branches":[90,0,1,"cmdoption--unconditional-branches"],"-strip-debug":[71,0,1,"cmdoption-strip-debug"],"--size-sort":[106,0,1,"cmdoption-llvm-nm--size-sort"],"-version":[55,0,1,"cmdoption-version"],"-size":[66,0,1,"cmdoption-size"],"--enable-no-infs-fp-math":[74,0,1,"cmdoption--enable-no-infs-fp-math"],"--path":[1,0,1,"cmdoption--path"],"-time-passes":[71,0,1,"cmdoption-time-passes"],"-march":[74,0,1,"cmdoption-march"],"--show-unsupported":[1,0,1,"cmdoption--show-unsupported"],"-disable-inlining":[71,0,1,"cmdoption-disable-inlining"],"--time-passes":[74,0,1,"cmdoption--time-passes"],"--vg":[1,0,1,"cmdoption--vg"],"--show-tests":[1,0,1,"cmdoption--show-tests"],"--no-output":[90,0,1,"cmdoption--no-output"],"-help":[36,0,1,"cmdoption-llvm-bcanalyzer-help"],"--undefined-only":[106,0,1,"cmdoption-llvm-nm--undefined-only"],"--shuffle"
 :[1,0,1,"cmdoption--shuffle"],"--extern-only":[106,0,1,"cmdoption-llvm-nm--extern-only"],"--preserve-paths":[90,0,1,"cmdoption--preserve-paths"],"--branch-counts":[90,0,1,"cmdoption--branch-counts"],"-load":[71,0,1,"cmdoption-load"],"-expand-relocs":[55,0,1,"cmdoption-expand-relocs"],"--disable-excess-fp-precision":[74,0,1,"cmdoption--disable-excess-fp-precision"],"--format":[106,0,1,"cmdoption-llvm-nm--format"],"-print-enums":[101,0,1,"cmdoption-tblgen-print-enums"],"-filetype":[74,0,1,"cmdoption-filetype"],"-gen-emitter":[101,0,1,"cmdoption-tblgen-gen-emitter"],"-unwind":[55,0,1,"cmdoption-unwind"],"-gen-pseudo-lowering":[101,0,1,"cmdoption-tblgen-gen-pseudo-lowering"],"-verify":[36,0,1,"cmdoption-llvm-bcanalyzer-verify"],"-gen-tgt-intrinsic":[101,0,1,"cmdoption-tblgen-gen-tgt-intrinsic"],"--help":[90,0,1,"cmdoption--help"],"--implicit-check-not":[5,0,1,"cmdoption--implicit-check-not"],"-section-data":[55,0,1,"cmdoption-section-data"],"-disable-opt":[71,0,1,"cmdoption-disable-opt"
 ],"-mcpu":[74,0,1,"cmdoption-mcpu"],"-file-headers":[55,0,1,"cmdoption-file-headers"],"--verbose":[1,0,1,"cmdoption--verbose"],"-debug":[71,0,1,"cmdoption-debug"],"--function-summaries":[90,0,1,"cmdoption--function-summaries"],"--param":[1,0,1,"cmdoption--param"],"--long-file-names":[90,0,1,"cmdoption--long-file-names"],"-dynamic-table":[55,0,1,"cmdoption-dynamic-table"],"-inlining":[76,0,1,"cmdoption-inlining"],"-":[71,0,1,"cmdoption-"],"-functions":[76,0,1,"cmdoption-functions"],"-section-relocations":[55,0,1,"cmdoption-section-relocations"],"--debug":[1,0,1,"cmdoption--debug"],"-dyn-symbols":[55,0,1,"cmdoption-dyn-symbols"],"-mtriple":[74,0,1,"cmdoption-mtriple"],"--numeric-sort":[106,0,1,"cmdoption-llvm-nm--numeric-sort"],"--threads":[1,0,1,"cmdoption--threads"],"--strict-whitespace":[5,0,1,"cmdoption--strict-whitespace"],"-gen-fast-isel":[101,0,1,"cmdoption-tblgen-gen-fast-isel"],"-gen-disassembler":[101,0,1,"cmdoption-tblgen-gen-disassembler"],"-gen-asm-matcher":[101,0,1,"cmdo
 ption-tblgen-gen-asm-matcher"],"--time-tests":[1,0,1,"cmdoption--time-tests"],"--no-sort":[106,0,1,"cmdoption-llvm-nm--no-sort"],"--object-file":[90,0,1,"cmdoption--object-file"],"-dsym-hint":[76,0,1,"cmdoption-dsym-hint"],"--input-file":[5,0,1,"cmdoption--input-file"],"-st":[55,0,1,"cmdoption-st"],"--debug-syms":[106,0,1,"cmdoption-llvm-nm--debug-syms"],"-sr":[55,0,1,"cmdoption-sr"],"-gen-enhanced-disassembly-info":[101,0,1,"cmdoption-tblgen-gen-enhanced-disassembly-info"],"--regalloc":[74,0,1,"cmdoption--regalloc"],"-output":[105,0,1,"cmdoption-llvm-profdata-show-output"],"-sd":[55,0,1,"cmdoption-sd"],"-default-arch":[76,0,1,"cmdoption-default-arch"]}},titleterms:{callingconv:21,prefix:[23,25,5],undef:93,"const":32,lsda:103,globalvari:16,concret:97,everi:64,"void":[32,23],module_code_funct:107,clangattrclass:21,type_code_numentri:107,vector:[30,98,16,23,0],verif:[30,69],x86_64:9,paramattr_block:107,bitstream:107,mcstreamer:81,direct:[0,23,81,22,84,5],getposit:20,ilist:16,aggreg:[3
 0,23],llvmbuild:27,blockinfo:107,scalarenumerationtrait:87,hide:20,neg:98,poison:23,"new":[73,30,99,40,31,25,93,45,53,10,15,16],postdomin:30,hasglobalalias:32,metadata:[25,3,23,8],elimin:30,mem:23,copysign:23,lowerswitch:30,accur:[70,23],studio:35,debugg:[30,23,53,80],valuemap:16,precis:[30,23],aka:25,portabl:[38,64,25,93,11,4],fsub:23,unit:[81,39,53],tst_code_entri:107,would:32,tail:[30,81],call:[30,81,51,40,23,0,46,64,16,93],callgraph:[73,30],simplifycfg:[30,93],type:[67,30,99,64,51,0,16,87,53,23,98,29,93,111],tell:98,relat:51,warn:[99,64],unpack:24,must:[20,40],word:107,setup:[41,39,97,19],work:[24,98,32],targetframelow:81,rework:25,root:70,overrid:[62,40],phabric:79,give:93,indic:[37,98],want:32,codegen:83,end:[64,98,8,16,74,59,53,21,68,23,93],turn:[64,16,93],how:[81,109,97,98,31,32,59,9,34,89,61,21,54,65,16,93],tbaa:23,type_symtab_block:107,verifi:[30,93,5],config:[62,96],updat:[89,93,40],attrdoc:21,after:[64,86,93],befor:64,wrong:93,domin:30,opaqu:23,alias:[32,20,81,23],enviro
 n:[73,24,25],reloc:[69,22],lambda:64,order:[87,23,83,75],composit:53,over:[64,16],type_code_opaqu:107,diagnot:[],ia64:100,flexibl:5,clangstmtnod:21,fix:[32,81,16,53,107],type_code_integ:107,fadd:23,comprehens:25,safe:70,"break":30,itanium:[103,100],spotless:62,each:30,debug:[30,39,40,53,63,94,10,16],foldingset:16,resum:23,extract:[30,7],content:[50,107,53,97,85],reader:55,inteqclass:16,dse:[30,40],umul:23,preservesourc:25,log2:23,barrier:[70,8],written:93,lto_module_t:86,reconfigur:62,filter:103,pointstoconstantmemori:40,fptoui:23,regress:10,cmpvalu:32,isa:16,size:[82,16],rang:[67,23],neededsafepoint:70,independ:[38,81,11,93],restrict:103,lto_code_gen_t:86,instruct:[30,99,93,51,98,23,81,83,3,68,75,65,28,16],rewritten:25,exp2:23,top:[20,29],type_code_struct:107,evolut:30,namespac:64,tool:[24,42,93,63,105,35,62,80],lower:[70,30,98],removeus:32,mergereturn:30,target:[30,38,93,51,8,25,81,89,22,62,11,98,101,23,77],keyword:64,provid:64,tree:[30,93,49,18,108],project:[24,58,52,25,61,27,62,
 49],aapc:75,consumeaft:20,modern:24,increment:26,strength:30,aliassettrack:40,preincrement:64,simplifi:[30,64],object:[72,24,50,23,25,98,53,106,107,55,16,49],lexic:29,breakpoint:73,phase:[81,86,51],tinyptrvector:16,don:[4,64,93,98],dom:30,doc:100,flow:[13,87,47],doe:[73,93,98],declar:[30,29,53],caml:50,dot:30,ldc:25,random:[32,66],syntax:[8,29,25,104,22,108,23,69,84,5,6,18,111],freeform:20,buildbot:109,dfapacket:21,getanalysisusag:73,absolut:20,layout:[30,81,24,23,8,53,16,49],acquir:83,machineinstr:81,configur:[24,93,33,1,9,74,109],rich:28,predecessor:16,ceil:23,smul:23,report:[31,59],x86_mmx:23,method:[73,4,64,16,40],basicblock:[32,16],commandlin:20,attributeset:54,bitvector:16,result:[69,1,93,40],miscompil:[59,80],respons:[30,20,40],fail:93,awar:97,hopefulli:110,discoveri:1,mul:23,irc:37,approach:86,attribut:[30,20,46,53,26,54,23],extend:[99,39,45,2,47,13,14,15],extens:[20,53,47,73,22,13],lazi:[30,25,16],rtti:[64,97],notatom:83,cov:90,llvm_deleted_funct:64,diff:44,guid:[30,8,37,20
 ,83,63,10,68,27,62,33],assum:23,duplic:[4,30],been:25,"__nvvm_reflect":8,basic:[107,30,58,97,51,32,43,53,63,17,73,23,108,16,6,18],quickli:24,deeper:97,type_code_x86_fp80:107,sparsemultiset:16,multithread:73,"catch":103,smallbitvector:16,read_regist:23,bitcod:[102,25,93,106,107,36,77,86],dissect:[67,8],properti:[38,11,53],slp:0,scalarrepl:30,anchor:64,mcsymbol:81,r600:[100,68],dwarfdump:85,globaldc:30,perform:[93,0],make:[64,26,16,93],complex:[23,16,53],codeemitt:21,fragil:10,reassoci:30,tune:74,readcyclecount:23,qualif:89,bewar:64,client:40,thi:[39,98,32,25,93,45,110,15],programm:16,identifi:[70,23],languag:[50,38,39,43,23,25,93,45,2,47,53,64,11,13,14,15,29,17,111],typeless:25,expos:4,patchpoint:84,els:[13,64,47],opt:[73,20,71,25],background:[97,94],shadow:70,specif:[38,58,92,100,81,53,89,10,74,11,22,4],manual:[23,20,100,16],unnecessari:64,underli:98,right:[93,16],old:[25,93],global_ctor:[93,23],interv:[30,81],argpromot:[30,40],type_code_fp128:107,intern:[30,20,64,62],global_dtor:23
 ,functioncompar:32,subclass:[16,51],constmerg:30,condit:30,core:16,replacedirectcal:32,memdep:30,tablegen:[78,81,21,95,29,6,111],promot:[30,51],post:30,chapter:[39,41,108,45,2,47,48,12,13,14,15,18,19],hard:[15,45,39],slightli:16,canonic:30,commit:[26,79],looppass:73,instcombin:[30,93],"float":[23,22,77],encod:[67,107],bound:98,storag:[23,20,16],git:24,wai:[16,98],support:[64,51,25,81,48,3,12,62,93],transform:[30,40],type_code_half:107,"class":[64,97,51,40,16,20,81,73,23,65,29,111],avail:[70,40],width:[64,23,107],memorydependenceanalysi:40,sitofp:23,analysi:[30,98,40,0,81,73,29],creation:72,form:[30,81],raw_ostream:64,modulepass:73,dead:30,heap:[70,16],icmp:23,profdata:105,inttoptr:[23,98],type_code_ppc_fp128:107,fundament:[99,78],sampl:[65,67],emit:[70,90],featur:[60,64,0,70,81,10],request:79,"abstract":[4,23,107,18,108],diagnost:[25,0],exist:[73,15,45,93,40],nvvmreflect:8,check:[30,62,5,0],bswap:23,assembl:[91,51,70,81,22,75,68,23],floor:23,tip:[38,11],test:[24,93,58,31,42,33,1,89,
 10,26],node:[30,25,23,99],stackrestor:23,intend:46,smallset:16,cmpgep:32,pseudo:67,time:[61,64,39,86,59],offsetof:[38,11],backward:26,concept:[67,62,73,6],nearbyint:23,chain:[24,35,16,40],ptrtoint:[23,98],global:[32,30,23,53,0],lli:77,llc:74,middl:93,depend:[60,30,22,40],graph:[30,25,16],readabl:[62,64],optparserdef:21,uadd:23,sourc:[67,24,39,58,25,93,53,64,76,49],string:[67,23,16],administr:89,level:[67,30,64,23,20,81,53,75,4,29,93],did:93,die:30,iter:[16,0],item:24,quick:[10,67,20,58,73],round:23,paramattr_code_entri:107,sign:[107,79],scev:[30,40],defici:[6,95],dwarf:[85,39,53],gener:[30,81,33,1,23,16,72,92,41,66,93,47,13,80,19,70,22,77,103,59,62,101,111],globalsmodref:[30,40],modif:3,address:[72,98,81,76,8,23],along:32,nondebug:30,safepoint:69,basiccg:30,semant:[69,4,23,84,8],maxnum:23,extra:[10,98],modul:[30,7,64,23,73,62,16],mdlocat:[25,23],prefer:64,visibl:23,marker:23,instal:[62,9],type_code_void:107,dagisel:21,emitt:51,memori:[30,40,23,45,15,16],univers:93,subvers:[24,93],li
 ve:81,criteria:89,scope:[23,53,111],checkout:24,share:60,enhanc:69,visual:[35,58],prototyp:30,logarithm:32,ibm:100,registerinfo:21,prepar:72,uniqu:87,descriptor:53,can:[93,98],topic:[50,16,58],critic:30,fp16:23,alwai:[30,98],multipl:16,targetsubtarget:81,write:[73,64,51,40,70,20,81,10,21,98,33,49,93],legalizetyp:81,foreach:29,map:[67,81,51,70,16,87,84,69,65,23],remap:72,armneonsema:21,memcpi:[30,23],smallstr:16,module_code_gcnam:107,mai:[30,40,32],data:[67,30,8,23,25,87,105,107,4,16],stress:66,autotool:61,assici:32,predic:64,inform:[30,39,100,25,64,53,10,90,26,16],"switch":[64,3,23],combin:[30,81],runonbasicblock:73,mapvector:16,callabl:16,comdat:[25,23],microscop:64,tta:25,pointer:[23,40,16,98,0],dynam:[73,81,93],entiti:111,armneontest:21,group:[73,20,23],thumb:97,fastisel:21,polici:26,precondit:62,gen:8,platform:[10,100,93,58],jit:[51,25,81,48,12,62,94,16],cmptype:32,mail:37,main:32,non:[70,30,25],synopsi:[88,1,5,90,36,66,7,91,92,42,44,96,52,71,74,76,77,55,102,105,106,85,101],init
 i:[70,64,81,16,40],half:23,now:[25,93],introduct:[30,59,87,31,32,64,34,46,3,65,23,6,67,99,39,81,8,41,108,43,9,2,47,48,68,45,12,13,14,15,16,17,18,19,72,51,98,70,20,95,53,73,109,21,22,75,54,89,56,58,103,25,40,82,83,61,26,27,62,28,110,29,111],name:[30,64,51,20,81,53,23],getanalysi:73,revers:0,sequentiallyconsist:83,sjlj:103,callsit:[30,103],compil:[24,96,39,58,70,25,59,9,53,48,60,74,12,100,64,23,93],replac:[30,16],individu:16,continu:64,releasememori:73,redistribut:93,operand:[69,84,51],happen:[93,98],switchinst:[30,3],armneon:21,space:[81,64,98,8],profil:[30,105],pocl:25,rational:[23,98],state:32,clangattrvisitor:21,frequenc:56,ocaml:25,motion:30,thing:93,gcmetadataprint:70,frequent:[93,58],first:[23,98],oper:[92,16,45,2,14,15,23],directli:[77,40],subrang:53,rint:23,arrai:[67,22,16,23,98],stringref:16,fast:23,crit:30,open:[25,93],module_code_datalayout:107,convent:[81,51,8,93,46,23],type_block:107,fma:23,clangsacheck:21,copi:[64,46],specifi:[70,73,20,40],pragma:0,than:98,xcore:100,pos
 it:20,seri:56,pre:31,loweratom:30,licm:[30,40],argument:[30,20,16,23,111],doiniti:73,bitcast:23,bitwis:23,engin:72,libcal:30,advic:[60,80],note:[25,81,100,34],printer:[30,51],normal:87,buffer:25,c99:22,insertel:23,"_global__i_a":93,cmpoper:32,runtim:[70,24,0],preverifi:30,mcjit:[72,94],lexicon:57,show:[93,105],atom:[30,23,83],concurr:[23,83],hack:[30,9],runonscc:73,slot:30,onli:[30,16],mergefunct:32,fenc:23,end_block:107,behind:53,analyz:36,customwritebarri:70,offici:100,gep:98,variou:30,get:[70,24,35,93,56],clang:[24,21,9,34,89],ssa:[30,81,93],targetjitinfo:81,requir:[24,98,40,20,81,10,35,73,25,49],intrins:[30,99,8,70,69,53,21,84,75,103,23],cmpconstant:32,where:93,summari:[24,98,75,36],kernel:8,gcwrite:[70,23],postdom:30,deadargelim:30,detect:30,review:[26,79],enumer:[64,53],label:[23,64,5],clangcommenthtmltagsproperti:21,enough:80,fdiv:23,volatil:23,between:[73,86,25,16,98],"import":16,spars:30,sparc:100,frameaddress:23,region:[67,30,73],contract:97,audienc:51,tutori:[50,38,8,43,1
 1,62,5,17],doesnotaccessmemori:40,acceler:53,pow:23,exploit:20,sccp:30,sentinel:16,rebuild:93,mark:[64,8],basicaa:[30,40],fptrunc:23,type_code_funct:107,module_code_vers:107,module_code_alia:107,trick:[38,11],cast:[16,98],invok:[30,16,23,8],tblgen:101,onlyreadsmemori:40,mergefunc:30,develop:[24,26,58,63,37],same:16,rgpassmanag:73,binari:[108,25,93,2,89,14,23,18],document:[37,64,100,32,87,89],immutableset:16,exhaust:30,srem:23,ssub:23,preassign:81,nest:46,driver:[41,108,18,19],sreg:8,driven:40,value_symtab_block:107,setversionprint:20,extern:[30,20,25,33,50],defm:29,runonmachinefunct:73,macro:[87,16],markup:28,clobber:81,without:93,model:23,dereferenc:98,customreadbarri:70,execut:[58,1,16,77,8],when:[64,80,93],s_waitcnt:68,neon:75,rest:[108,18],gdb:[73,94],smallvector:16,asmmatch:21,struct:[64,23,98],hint:[16,0],filecheck:5,except:[30,64,23,46,103],littl:64,versa:16,overview:[67,24,64,107,8,31,37,33,40,60,10,65,35,103,84,70,69,27,23,49],uncal:64,earli:64,read:[70,32,86,51,8],amd:100,
 va_start:23,world:73,mod:30,intel:[74,100],integ:[23,107,98],output:[1,20,87,36,28,33],targetinstrinfo:[81,51],deduct:64,trampolin:23,freez:93,gvn:[30,40],definit:[64,57,84,111,36],legal:[81,51],exit:[30,64,88,1,5,90,36,66,7,91,92,42,44,96,52,71,74,76,77,55,102,105,106,85,101],refer:[30,70,16,20,23,27,29],garbag:[38,70,69,25,11,23],inspect:16,fpmath:23,clangattrimpl:21,"throw":[4,103],comparison:32,patent:26,stacklet:82,routin:16,clangdiagsdef:21,effici:[46,40],terminolog:[24,56],strip:30,your:[24,58,97,70,73,109],compon:[27,96,81],log:[32,23],hex:87,nvvm:8,start:[67,24,58,70,20,73,10,35,23],interfac:[4,93,79,40],low:64,clear_cach:23,kaleidoscop:[50,38,39,41,108,43,45,2,47,48,11,12,13,14,15,17,18,19],resolut:86,addrequiredtransit:73,timelin:89,bundl:81,idea:[14,2],getmodrefinfo:40,epilog:81,conclus:[108,38,11,18],notat:[24,29],tripl:[81,23,8],runonregion:73,"default":[62,87,64],embed:58,loadabl:62,creat:[73,93,16,49,89],subprogram:53,deep:110,deletevalu:40,file:[67,24,81,92,30,66,20
 ,1,64,53,10,86,107,106,111,5,25,93],incorrect:59,collector:[70,23],multiclass:[29,111],field:32,cleanup:[103,46],copyright:26,you:110,architectur:100,formed:23,registri:73,sequenc:87,symbol:[76,30,106,86],ilist_trait:16,ilist_nod:16,reduc:30,ipsccp:30,directori:93,type_code_float:107,mask:23,llvm_shutdown:16,calle:46,mass:56,represent:[67,25,93,40],all:[30,93,62],dist:62,consider:[16,46,75],forbidden:64,scc:30,scalar:[30,87],ptx:8,follow:[32,98],ptr:[23,8],clangattrspellinglistindex:21,addescapingus:40,init:23,program:[77,24,6,49,37],datalayout:81,"case":[42,26],consum:53,faq:93,urem:23,util:[24,87,52,30],candid:89,mechan:64,got:59,fab:23,strang:93,induct:[30,0],list:[64,23,37,39,100,41,108,45,2,47,48,12,13,14,15,16,18,19,20,106,25,87],managedstat:16,adjust:[45,15,23],stderr:30,zero:103,design:[72,37,98,86,25,81,46,80],pass:[30,58,40,32,48,73,12,16],further:49,enter_subblock:107,type_code_point:107,what:[73,32,93,80,98],xor:23,sub:[67,23],abi:[103,25,81,100],section:[84,110,22,85],a
 st:[13,47,18,108],abl:32,delet:[30,16],abbrevi:107,version:[67,94,64,93,89],subtarget:[21,51],ctpop:23,"public":[64,16,89],full:[39,41,108,45,2,47,48,12,13,14,15,23,18,19],hash:53,behaviour:22,analysisusag:73,prologu:23,standard:[24,64,92,23,53,107,4,16],modifi:[20,93,92],valu:[30,93,98,32,20,87,53,23,62,111,29,25,16],trunc:23,search:32,ahead:39,shufflevector:23,pick:16,via:79,primit:[107,111],instrmap:65,select:[80,20,1,23,81],aggress:30,hexadecim:22,distinct:25,liber:64,regist:[30,93,51,8,81,73],two:[81,98],coverag:[67,90],unwindless:30,metadata_block:107,more:[64,16],tester:1,type_code_metadata:107,statepoint:69,flag:[60,20,23,0],known:95,minnum:23,def:[29,16],indirectbr:23,registr:[73,51],emiss:[81,39,22],addrspacecast:23,templat:[110,16,111],readobj:55,goal:70,anoth:16,immutablemap:16,reject:93,unswitch:30,simpl:[30,16,23,8],isn:80,replacewithnewvalu:40,resourc:100,mccontext:81,reflect:8,machinebasicblock:81,help:[20,93,16,49],through:64,constants_block:107,hierarchi:[16,97],pa
 ramet:[23,8],style:[64,97,40,22,23,49],late:81,clangcommenthtmltag:21,systemz:100,"return":[30,64],frem:23,complain:8,module_code_sectionnam:107,globalvalu:16,achiev:16,scalarevolut:30,fulli:64,subsystem:37,donoth:23,interleav:23,cost:103,clangattrparsedattrimpl:21,weight:[3,56],branchinst:3,monoton:83,phi:23,realli:93,linkag:23,expect:[3,23],longjmp:103,reduct:[30,42,0],safeti:[38,11],print:[73,30,96,85,40],subsubsect:110,occurr:20,qualifi:[93,89],advanc:[67,50,16],base:[30,93,97,98,25,81],ask:93,asm:[103,81,23],thread:[30,16,23],bitconvert:75,clangattrparsedattrkind:21,postdomtre:30,clangcommenthtmlnamedcharacterrefer:21,lifetim:[23,46,53],assign:[30,15,45],major:26,number:[30,20,107],smallptrset:16,module_block:107,differ:[33,93,98,40],script:[31,93],interact:[73,16],construct:[30,25,81,93],statement:3,cfg:[30,3],store:[30,93,23],option:[88,1,90,36,5,7,91,92,66,16,96,52,20,71,74,76,77,55,24,58,102,25,105,106,42,85,28,101],relationship:16,selector:51,pars:[108,20,81,18],std:[25,64
 ,16],cyclic:25,i32:98,remov:[30,25],bridg:25,valuesymbolt:16,tailcallelim:30,comput:[70,25,98,8],packag:60,"null":[70,98],built:[81,3,93,87],lib:[24,25],trip:0,self:93,lit:1,also:[88,7,64,91,92,42,1,74,36,77,106],exampl:[76,24,96,23,1,94,73,61,35,86,75,65,110,16,6],build:[58,109,52,93,9,34,89,73,61,27,49],extractvalu:23,extractel:23,brace:64,coff:[104,22],distribut:89,previou:93,setjmp:103,most:30,plan:73,mach:53,cover:64,sibl:81,exp:23,microsoft:[35,58],ctag:21,runonmodul:[73,32],gold:[61,25],clangattrparsedattrlist:21,stackprotectorcheck:23,fine:16,find:[30,93,16],write_regist:23,writer:100,solut:32,unus:[4,30],express:[67,30,41,23,53,47,108,13,111,5,18,19],nativ:[81,107],externalfnconst:30,diloc:25,common:[24,35,62,16,8],immutablepass:73,set:[24,97,51,40,20,73,30,16],clangattrpchwrit:21,mutabl:[15,45],see:[88,7,64,91,92,42,1,74,36,77,106],close:[41,30,19],arm:[22,100,9,34,75],deriv:[99,16,53],module_code_tripl:107,won:110,altern:[20,86],unrol:[30,23,0],miscellan:[73,20,100,25,49]
 ,both:24,interprocedur:30,inalloca:46,debug_typ:16,context:87,let:[29,111],machinefunct:[73,81],load:[72,73,25,23],point:[70,23,22,84,77],schedul:[81,51],header:[67,4,64,53],alloca:[82,23],classof:97,linux:100,backend:[51,98,81,21,6,111],aarch64:100,understand:93,func:25,atomicrmw:23,dequ:16,fptosi:23,passmanag:73,"while":16,unifi:30,kick:[14,2],behavior:40,error:[4,87,64,93],anonym:[30,64],loop:[30,64,0,47,73,13,23,56,111],prolog:81,subsect:110,propag:30,reg2mem:30,runonfunct:73,demot:30,illinoi:93,targetlow:81,minim:4,clangdiagsindexnam:21,decod:30,higher:93,x86:[100,81,22],optim:[30,38,71,53,59,83,48,61,11,12,81,86,93],va_copi:23,user:[30,8,37,87,45,2,74,68,14,15,16],function_block:107,specialis:23,stack:[30,38,70,69,81,82,84,22,11,23],stateless:30,travers:16,task:[16,89],entri:[30,84],parenthes:64,propos:53,always_inlin:30,functionattr:30,module_code_asm:107,ipconstprop:30,ldr:75,waymark:16,input:87,type_code_label:107,format:[67,81,92,69,20,1,53,64,84,107,103,27],big:75,bia:56,
 ld1:75,bit:[23,20,16,107],pcmarker:23,collect:[38,100,70,69,20,11,23,25],"boolean":20,clangdeclnod:21,often:98,cttz:23,back:[21,68,93,8],lowerinvok:30,mirror:24,densemap:16,sizeof:[38,11],instcount:30,addpreserv:73,scale:56,glibc:93,substitut:10,bcanalyz:36,machin:[81,22,51],run:[93,8,33,1,9,73,6],step:[109,51],prerequisit:51,copyvalu:40,deadtypeelim:30,bugpoint:[42,80,30],constraint:23,indirectbrinst:3,dofin:73,runonloop:73,block:[30,64,23,53,107,16,56],gcroot:[70,23],gcread:[70,23],chang:[79,41,25,53,26,16,19],announc:89,inclus:111,question:93,submit:[26,59],custom:[51,98,70,20,87,33],arithmet:[23,98],includ:[4,62,64,93,24],suit:[24,58,31,33,1,10],fmuladd:23,aliasanalysi:40,properli:64,lint:30,link:[24,102,8,61,35,86],cmpxchg:23,line:[79,0],info:[30,16,51,111],clangattrspel:21,consist:[4,64],fcmp:23,clangattrpchread:21,impl:30,constant:[30,23,53,48,22,12,16],debugtrap:23,parser:[108,20,81,47,13,18],doesn:[25,93],repres:81,clangattrlist:21,llvmlinux:25,cmake:[58,9],sequenti:16,llvm
 :[30,59,103,0,45,33,1,64,34,63,89,90,35,3,36,97,4,23,67,37,7,91,81,8,41,66,44,9,47,48,10,11,69,12,13,15,16,93,49,19,50,96,51,52,70,74,71,38,53,73,21,22,75,85,76,77,55,106,56,92,88,24,98,57,58,102,80,25,40,82,83,105,60,61,26,84,107,99,109,62,28,86],clean:62,domfronti:30,eval:[30,40],parseenvironmentopt:20,extrahelp:20,svn:24,typeid:103,lane:75,algorithm:[81,16],vice:16,intervalmap:16,hello:73,llvmcontext:16,code:[30,81,64,4,94,23,67,39,41,108,93,45,2,47,48,12,13,14,15,16,49,19,72,51,70,53,73,76,77,24,79,80,59,26,18,103,101,111],partial:[30,0],edg:30,module_code_globalvar:107,queri:30,privat:64,send:24,va_end:23,mcinst:81,probe:22,vla:98,relev:100,magic:107,"try":[103,93],udiv:23,natur:30,memset:23,jump:30,fold:[12,81,51,48],instnam:30,compat:26,index:98,twine:16,memcpyopt:[30,40],compar:[32,98],asmwrit:21,access:[32,26,23],experiment:84,deduc:30,targetregisterinfo:[81,51],bodi:[30,29],objects:23,sext:23,sink:30,convert:[76,23],convers:[8,23,51,0],vbr:107,implement:[72,50,38,75,51,40,
 70,32,81,82,73,86,11,23,108,4,16,56,18],domtre:30,dyn_cast:16,api:[28,81,16,93],from:[24,7,93,98,30,20,81,9,77,23,56],commun:[37,86,89],upgrad:93,next:5,websit:89,sort:16,insertvalu:23,mismatch:93,landingpad:23,debugloc:25,nvptx:[81,100,8],framerecov:23,alia:[30,81,98,40,20,0,23,25],annot:[28,23],endian:75,scatter:0,control:[13,20,47,62],quickstart:[10,61,110],process:[31,32,81,89,37],optioncategori:20,high:[67,4,64,81,23],tag:[67,87,53,89,62,16],tab:64,gcc:93,getregisteredopt:20,usub:23,subdirectori:49,instead:64,sin:23,fpext:23,overridden:32,targetdata:30,redund:30,philosophi:[86,80,53],physic:81,alloc:[82,81,16],sdiv:23,bind:25,counter:67,element:98,issu:[40,64,8],pseudolow:21,allow:20,move:78,stacksav:23,getanalysisifavail:73,elis:46,narr:32,define_abbrev:107,initroot:70,infrastructur:[10,109,25,1,40],dag:[81,5,56],crash:[59,80],python:25,auto:[64,0],front:[53,59,93,98],successor:16,module_code_purgev:107,mem2reg:30,trap:23,mnemon:81,basicblockpass:73,acquirereleas:83,unwind:25,
 denseset:16,postdomfronti:30,selectiondag:[99,81,51],clangcommentcommandlist:21,"static":[30,74,64],function_ref:16,patch:[24,26,84,89],special:[23,8],out:[58,98],variabl:[30,39,58,0,23,81,45,53,64,22,82,107,62,15,5,49],matrix:81,frontier:30,ret:23,categori:20,hardwar:[24,35,100],barrier0:8,ref:30,math:23,statist:[73,16],iostream:[64,93],lcssa:30,attrbuild:54,manipul:23,powerpc:[25,81,100],deadarghax0r:30,releas:[31,25,83,89],indent:64,could:32,lexer:[13,43,17,47],keep:[4,64,93],length:22,outsid:83,lto:61,softwar:[24,35],qualiti:26,fmul:23,lshr:23,owner:26,unknown:0,licens:[61,26,93],system:[4,35,111,23,24],wrapper:107,regionpass:73,termin:23,"final":[72,89],misunderstood:98,tidbit:[38,11],deconstruct:81,debuginfo:30,uitofp:23,arrayref:16,steen:40,prune:30,structur:[0,32,33,44,10,23,16],charact:107,framealloc:23,bitvalu:87,clangattrparserstringswitch:21,mergetwofunct:32,linker:[86,25,23,102],have:98,tabl:[37,50,103,81,53,106],need:[110,98],printvar:62,disassembl:[81,28,21,88],mix:0,
 builtin:20,which:[98,40],mip:[25,100],detector:25,singl:[30,23],preliminari:[30,51],segment:[81,82],why:[39,98,32,93,45,15],instrprof_incr:23,placement:[30,49],returnaddress:23,gather:0,yaml2obj:104,stackmap:84,determin:20,linkonc:22,text:20,dbg:[30,53],findregress:31,module_code_deplib:107,trivial:[12,48],locat:[76,24,39],tire:[14,2],getelementptr:[93,23],should:[32,93],stackprotector:23,local:[24,1,45,53,62,15,23],targetmachin:81,enabl:23,organ:[10,4,27],possibl:[32,20,64],stuff:93,integr:[27,30,1],partit:30,contain:16,shl:23,view:[30,16],type_code_arrai:107,frame:[103,38,81,11],packet:81,statu:[88,1,5,90,36,66,7,91,92,42,44,69,96,52,71,74,76,77,55,79,102,105,106,85,101],pattern:5,dll:23,callgraphsccpass:73,kei:87,clangattrdump:21,isol:16,noalia:23,endl:64,addit:[25,1],doxygen:64,plugin:[70,61,25],leb128:67,etc:[99,16],instanc:111,grain:16,comment:[62,64,111],parallel_loop_access:23,guidelin:110,hyphen:20,yaml:87,window:[100,22],va_arg:23,packedvector:16,treat:[64,16],assert:64,pt
 xa:8,present:32,multi:86,align:[107,75],contextu:28,defin:[64,51,45,2,14,15],layer:81,demo:[93,89],instrinfo:21,site:16,uglygep:98,archiv:[24,92],motiv:84,mutat:[15,45],cross:[24,9,58],sqrt:23,member:[16,98],handl:[30,87,23,81,103],clangsharp:25,nightli:31,clangdiaggroup:21,sopp:68,sadd:23,effect:98,expand:51,mcsection:81,sparsebitvector:16,builder:109,well:23,thought:[41,19],powi:23,command:[105,79,63,0],undefin:[23,8],setvector:16,libdevic:8,unari:[14,2],distanc:98,obtain:26,memmov:23,parsecommandlineopt:20,tce:25,web:79,adt:16,makefil:[10,62,33,93,49],add:[109,23,98],valid:[31,87],adc:[30,40],match:[81,5],llvmsharp:25,globalopt:30,indvar:30,clangcommentnod:21,know:32,insert:[81,16],like:[25,64,16,93],type_code_vector:107,registeranalysisgroup:73,unord:83,soft:4,page:[93,89],unreach:[93,23],unabbrev_record:107,functionpass:73,guarante:[38,11],librari:[24,64,23,20,93,60,62,4,16,49],leak:25,avoid:64,mode:[81,25,39,75],codegenprepar:30,win64:25,dce:30,usag:[58,0,46,61,84,80],host:[24
 ,93],prefetch:23,clangattrtemplateinstanti:21,about:[70,93],toolchain:24,uniquevector:16,type_code_doubl:107,lppassmanag:73,constructor:64,zext:23,disabl:23,ashr:23,metadata_attach:107,own:[25,16],automat:[42,23,80],merg:[30,105,32],machineinstrbuild:81,rotat:30,"var":23,log10:23,"function":[67,30,7,39,8,41,32,20,0,99,53,73,64,23,4,81,16,93,19],machinefunctionpass:73,gain:32,uninstal:62,overflow:[23,98],inlin:[30,64,81,23],bug:[59,97,31,69,44,106],liblto:86,count:[30,40,23,0],whether:20,record:[67,107],limit:40,problem:[24,39,93,45,73,35,75,95,15],evalu:[30,64,40],descript:[88,1,5,90,36,66,7,91,92,42,44,80,96,52,71,74,76,77,55,102,81,105,106,85,101,86],dure:0,constprop:30,sparseset:16,probabl:56,detail:[64,0,82,53,89,36,28],virtual:[4,81,64,93],other:[38,64,100,98,8,23,20,40,10,3,11,16,93],lookup:53,futur:[73,81],branch:[30,3,56,51,89],iplist:16,stat:16,indexedmap:16,clangcommentcommandinfo:21,addrequir:73,ctlz:23,stringmap:16,stai:26,sphinx:110,reliabl:81,customroot:70,rule:[97,98,
 93,89,62,23],vliw:81,invari:[30,23]}})
\ No newline at end of file

Added: www-releases/trunk/3.6.0/docs/tutorial/LangImpl1.html
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.6.0/docs/tutorial/LangImpl1.html?rev=230777&view=auto
==============================================================================
--- www-releases/trunk/3.6.0/docs/tutorial/LangImpl1.html (added)
+++ www-releases/trunk/3.6.0/docs/tutorial/LangImpl1.html Fri Feb 27 12:44:09 2015
@@ -0,0 +1,351 @@
+
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+  "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+
+<html xmlns="http://www.w3.org/1999/xhtml">
+  <head>
+    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+    
+    <title>1. Kaleidoscope: Tutorial Introduction and the Lexer — LLVM 3.6 documentation</title>
+    
+    <link rel="stylesheet" href="../_static/llvm-theme.css" type="text/css" />
+    <link rel="stylesheet" href="../_static/pygments.css" type="text/css" />
+    
+    <script type="text/javascript">
+      var DOCUMENTATION_OPTIONS = {
+        URL_ROOT:    '../',
+        VERSION:     '3.6',
+        COLLAPSE_INDEX: false,
+        FILE_SUFFIX: '.html',
+        HAS_SOURCE:  true
+      };
+    </script>
+    <script type="text/javascript" src="../_static/jquery.js"></script>
+    <script type="text/javascript" src="../_static/underscore.js"></script>
+    <script type="text/javascript" src="../_static/doctools.js"></script>
+    <link rel="top" title="LLVM 3.6 documentation" href="../index.html" />
+    <link rel="up" title="LLVM Tutorial: Table of Contents" href="index.html" />
+    <link rel="next" title="2. Kaleidoscope: Implementing a Parser and AST" href="LangImpl2.html" />
+    <link rel="prev" title="LLVM Tutorial: Table of Contents" href="index.html" />
+<style type="text/css">
+  table.right { float: right; margin-left: 20px; }
+  table.right td { border: 1px solid #ccc; }
+</style>
+
+  </head>
+  <body>
+<div class="logo">
+  <a href="../index.html">
+    <img src="../_static/logo.png"
+         alt="LLVM Logo" width="250" height="88"/></a>
+</div>
+
+    <div class="related">
+      <h3>Navigation</h3>
+      <ul>
+        <li class="right" style="margin-right: 10px">
+          <a href="../genindex.html" title="General Index"
+             accesskey="I">index</a></li>
+        <li class="right" >
+          <a href="LangImpl2.html" title="2. Kaleidoscope: Implementing a Parser and AST"
+             accesskey="N">next</a> |</li>
+        <li class="right" >
+          <a href="index.html" title="LLVM Tutorial: Table of Contents"
+             accesskey="P">previous</a> |</li>
+  <li><a href="http://llvm.org/">LLVM Home</a> | </li>
+  <li><a href="../index.html">Documentation</a>»</li>
+
+          <li><a href="index.html" accesskey="U">LLVM Tutorial: Table of Contents</a> »</li> 
+      </ul>
+    </div>
+
+
+    <div class="document">
+      <div class="documentwrapper">
+          <div class="body">
+            
+  <div class="section" id="kaleidoscope-tutorial-introduction-and-the-lexer">
+<h1>1. Kaleidoscope: Tutorial Introduction and the Lexer<a class="headerlink" href="#kaleidoscope-tutorial-introduction-and-the-lexer" title="Permalink to this headline">¶</a></h1>
+<div class="contents local topic" id="contents">
+<ul class="simple">
+<li><a class="reference internal" href="#tutorial-introduction" id="id1">Tutorial Introduction</a></li>
+<li><a class="reference internal" href="#the-basic-language" id="id2">The Basic Language</a></li>
+<li><a class="reference internal" href="#the-lexer" id="id3">The Lexer</a></li>
+</ul>
+</div>
+<div class="section" id="tutorial-introduction">
+<h2><a class="toc-backref" href="#id1">1.1. Tutorial Introduction</a><a class="headerlink" href="#tutorial-introduction" title="Permalink to this headline">¶</a></h2>
+<p>Welcome to the “Implementing a language with LLVM” tutorial. This
+tutorial runs through the implementation of a simple language, showing
+how fun and easy it can be. This tutorial will get you up and started as
+well as help to build a framework you can extend to other languages. The
+code in this tutorial can also be used as a playground to hack on other
+LLVM specific things.</p>
+<p>The goal of this tutorial is to progressively unveil our language,
+describing how it is built up over time. This will let us cover a fairly
+broad range of language design and LLVM-specific usage issues, showing
+and explaining the code for it all along the way, without overwhelming
+you with tons of details up front.</p>
+<p>It is useful to point out ahead of time that this tutorial is really
+about teaching compiler techniques and LLVM specifically, <em>not</em> about
+teaching modern and sane software engineering principles. In practice,
+this means that we’ll take a number of shortcuts to simplify the
+exposition. For example, the code leaks memory, uses global variables
+all over the place, doesn’t use nice design patterns like
+<a class="reference external" href="http://en.wikipedia.org/wiki/Visitor_pattern">visitors</a>, etc... but
+it is very simple. If you dig in and use the code as a basis for future
+projects, fixing these deficiencies shouldn’t be hard.</p>
+<p>I’ve tried to put this tutorial together in a way that makes chapters
+easy to skip over if you are already familiar with or are uninterested
+in the various pieces. The structure of the tutorial is:</p>
+<ul class="simple">
+<li><a class="reference external" href="#language">Chapter #1</a>: Introduction to the Kaleidoscope
+language, and the definition of its Lexer - This shows where we are
+going and the basic functionality that we want it to do. In order to
+make this tutorial maximally understandable and hackable, we choose
+to implement everything in C++ instead of using lexer and parser
+generators. LLVM obviously works just fine with such tools, feel free
+to use one if you prefer.</li>
+<li><a class="reference external" href="LangImpl2.html">Chapter #2</a>: Implementing a Parser and AST -
+With the lexer in place, we can talk about parsing techniques and
+basic AST construction. This tutorial describes recursive descent
+parsing and operator precedence parsing. Nothing in Chapters 1 or 2
+is LLVM-specific, the code doesn’t even link in LLVM at this point.
+:)</li>
+<li><a class="reference external" href="LangImpl3.html">Chapter #3</a>: Code generation to LLVM IR - With
+the AST ready, we can show off how easy generation of LLVM IR really
+is.</li>
+<li><a class="reference external" href="LangImpl4.html">Chapter #4</a>: Adding JIT and Optimizer Support
+- Because a lot of people are interested in using LLVM as a JIT,
+we’ll dive right into it and show you the 3 lines it takes to add JIT
+support. LLVM is also useful in many other ways, but this is one
+simple and “sexy” way to show off its power. :)</li>
+<li><a class="reference external" href="LangImpl5.html">Chapter #5</a>: Extending the Language: Control
+Flow - With the language up and running, we show how to extend it
+with control flow operations (if/then/else and a ‘for’ loop). This
+gives us a chance to talk about simple SSA construction and control
+flow.</li>
+<li><a class="reference external" href="LangImpl6.html">Chapter #6</a>: Extending the Language:
+User-defined Operators - This is a silly but fun chapter that talks
+about extending the language to let the user program define their own
+arbitrary unary and binary operators (with assignable precedence!).
+This lets us build a significant piece of the “language” as library
+routines.</li>
+<li><a class="reference external" href="LangImpl7.html">Chapter #7</a>: Extending the Language: Mutable
+Variables - This chapter talks about adding user-defined local
+variables along with an assignment operator. The interesting part
+about this is how easy and trivial it is to construct SSA form in
+LLVM: no, LLVM does <em>not</em> require your front-end to construct SSA
+form!</li>
+<li><a class="reference external" href="LangImpl8.html">Chapter #8</a>: Conclusion and other useful LLVM
+tidbits - This chapter wraps up the series by talking about
+potential ways to extend the language, but also includes a bunch of
+pointers to info about “special topics” like adding garbage
+collection support, exceptions, debugging, support for “spaghetti
+stacks”, and a bunch of other tips and tricks.</li>
+</ul>
+<p>By the end of the tutorial, we’ll have written a bit less than 700 lines
+of non-comment, non-blank, lines of code. With this small amount of
+code, we’ll have built up a very reasonable compiler for a non-trivial
+language including a hand-written lexer, parser, AST, as well as code
+generation support with a JIT compiler. While other systems may have
+interesting “hello world” tutorials, I think the breadth of this
+tutorial is a great testament to the strengths of LLVM and why you
+should consider it if you’re interested in language or compiler design.</p>
+<p>A note about this tutorial: we expect you to extend the language and
+play with it on your own. Take the code and go crazy hacking away at it,
+compilers don’t need to be scary creatures - it can be a lot of fun to
+play with languages!</p>
+</div>
+<div class="section" id="the-basic-language">
+<h2><a class="toc-backref" href="#id2">1.2. The Basic Language</a><a class="headerlink" href="#the-basic-language" title="Permalink to this headline">¶</a></h2>
+<p>This tutorial will be illustrated with a toy language that we’ll call
+“<a class="reference external" href="http://en.wikipedia.org/wiki/Kaleidoscope">Kaleidoscope</a>” (derived
+from “meaning beautiful, form, and view”). Kaleidoscope is a procedural
+language that allows you to define functions, use conditionals, math,
+etc. Over the course of the tutorial, we’ll extend Kaleidoscope to
+support the if/then/else construct, a for loop, user defined operators,
+JIT compilation with a simple command line interface, etc.</p>
+<p>Because we want to keep things simple, the only datatype in Kaleidoscope
+is a 64-bit floating point type (aka ‘double’ in C parlance). As such,
+all values are implicitly double precision and the language doesn’t
+require type declarations. This gives the language a very nice and
+simple syntax. For example, the following simple example computes
+<a class="reference external" href="http://en.wikipedia.org/wiki/Fibonacci_number">Fibonacci numbers:</a></p>
+<div class="highlight-python"><div class="highlight"><pre># Compute the x'th fibonacci number.
+def fib(x)
+  if x < 3 then
+    1
+  else
+    fib(x-1)+fib(x-2)
+
+# This expression will compute the 40th number.
+fib(40)
+</pre></div>
+</div>
+<p>We also allow Kaleidoscope to call into standard library functions (the
+LLVM JIT makes this completely trivial). This means that you can use the
+‘extern’ keyword to define a function before you use it (this is also
+useful for mutually recursive functions). For example:</p>
+<div class="highlight-python"><div class="highlight"><pre>extern sin(arg);
+extern cos(arg);
+extern atan2(arg1 arg2);
+
+atan2(sin(.4), cos(42))
+</pre></div>
+</div>
+<p>A more interesting example is included in Chapter 6 where we write a
+little Kaleidoscope application that <a class="reference external" href="LangImpl6.html#example">displays a Mandelbrot
+Set</a> at various levels of magnification.</p>
+<p>Lets dive into the implementation of this language!</p>
+</div>
+<div class="section" id="the-lexer">
+<h2><a class="toc-backref" href="#id3">1.3. The Lexer</a><a class="headerlink" href="#the-lexer" title="Permalink to this headline">¶</a></h2>
+<p>When it comes to implementing a language, the first thing needed is the
+ability to process a text file and recognize what it says. The
+traditional way to do this is to use a
+“<a class="reference external" href="http://en.wikipedia.org/wiki/Lexical_analysis">lexer</a>” (aka
+‘scanner’) to break the input up into “tokens”. Each token returned by
+the lexer includes a token code and potentially some metadata (e.g. the
+numeric value of a number). First, we define the possibilities:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">// The lexer returns tokens [0-255] if it is an unknown character, otherwise one</span>
+<span class="c1">// of these for known things.</span>
+<span class="k">enum</span> <span class="n">Token</span> <span class="p">{</span>
+  <span class="n">tok_eof</span> <span class="o">=</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span>
+
+  <span class="c1">// commands</span>
+  <span class="n">tok_def</span> <span class="o">=</span> <span class="o">-</span><span class="mi">2</span><span class="p">,</span> <span class="n">tok_extern</span> <span class="o">=</span> <span class="o">-</span><span class="mi">3</span><span class="p">,</span>
+
+  <span class="c1">// primary</span>
+  <span class="n">tok_identifier</span> <span class="o">=</span> <span class="o">-</span><span class="mi">4</span><span class="p">,</span> <span class="n">tok_number</span> <span class="o">=</span> <span class="o">-</span><span class="mi">5</span><span class="p">,</span>
+<span class="p">};</span>
+
+<span class="k">static</span> <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">IdentifierStr</span><span class="p">;</span>  <span class="c1">// Filled in if tok_identifier</span>
+<span class="k">static</span> <span class="kt">double</span> <span class="n">NumVal</span><span class="p">;</span>              <span class="c1">// Filled in if tok_number</span>
+</pre></div>
+</div>
+<p>Each token returned by our lexer will either be one of the Token enum
+values or it will be an ‘unknown’ character like ‘+’, which is returned
+as its ASCII value. If the current token is an identifier, the
+<tt class="docutils literal"><span class="pre">IdentifierStr</span></tt> global variable holds the name of the identifier. If
+the current token is a numeric literal (like 1.0), <tt class="docutils literal"><span class="pre">NumVal</span></tt> holds its
+value. Note that we use global variables for simplicity, this is not the
+best choice for a real language implementation :).</p>
+<p>The actual implementation of the lexer is a single function named
+<tt class="docutils literal"><span class="pre">gettok</span></tt>. The <tt class="docutils literal"><span class="pre">gettok</span></tt> function is called to return the next token
+from standard input. Its definition starts as:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// gettok - Return the next token from standard input.</span>
+<span class="k">static</span> <span class="kt">int</span> <span class="nf">gettok</span><span class="p">()</span> <span class="p">{</span>
+  <span class="k">static</span> <span class="kt">int</span> <span class="n">LastChar</span> <span class="o">=</span> <span class="sc">' '</span><span class="p">;</span>
+
+  <span class="c1">// Skip any whitespace.</span>
+  <span class="k">while</span> <span class="p">(</span><span class="n">isspace</span><span class="p">(</span><span class="n">LastChar</span><span class="p">))</span>
+    <span class="n">LastChar</span> <span class="o">=</span> <span class="n">getchar</span><span class="p">();</span>
+</pre></div>
+</div>
+<p><tt class="docutils literal"><span class="pre">gettok</span></tt> works by calling the C <tt class="docutils literal"><span class="pre">getchar()</span></tt> function to read
+characters one at a time from standard input. It eats them as it
+recognizes them and stores the last character read, but not processed,
+in LastChar. The first thing that it has to do is ignore whitespace
+between tokens. This is accomplished with the loop above.</p>
+<p>The next thing <tt class="docutils literal"><span class="pre">gettok</span></tt> needs to do is recognize identifiers and
+specific keywords like “def”. Kaleidoscope does this with this simple
+loop:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="k">if</span> <span class="p">(</span><span class="n">isalpha</span><span class="p">(</span><span class="n">LastChar</span><span class="p">))</span> <span class="p">{</span> <span class="c1">// identifier: [a-zA-Z][a-zA-Z0-9]*</span>
+  <span class="n">IdentifierStr</span> <span class="o">=</span> <span class="n">LastChar</span><span class="p">;</span>
+  <span class="k">while</span> <span class="p">(</span><span class="n">isalnum</span><span class="p">((</span><span class="n">LastChar</span> <span class="o">=</span> <span class="n">getchar</span><span class="p">())))</span>
+    <span class="n">IdentifierStr</span> <span class="o">+=</span> <span class="n">LastChar</span><span class="p">;</span>
+
+  <span class="k">if</span> <span class="p">(</span><span class="n">IdentifierStr</span> <span class="o">==</span> <span class="s">"def"</span><span class="p">)</span> <span class="k">return</span> <span class="n">tok_def</span><span class="p">;</span>
+  <span class="k">if</span> <span class="p">(</span><span class="n">IdentifierStr</span> <span class="o">==</span> <span class="s">"extern"</span><span class="p">)</span> <span class="k">return</span> <span class="n">tok_extern</span><span class="p">;</span>
+  <span class="k">return</span> <span class="n">tok_identifier</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>Note that this code sets the ‘<tt class="docutils literal"><span class="pre">IdentifierStr</span></tt>‘ global whenever it
+lexes an identifier. Also, since language keywords are matched by the
+same loop, we handle them here inline. Numeric values are similar:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="k">if</span> <span class="p">(</span><span class="n">isdigit</span><span class="p">(</span><span class="n">LastChar</span><span class="p">)</span> <span class="o">||</span> <span class="n">LastChar</span> <span class="o">==</span> <span class="sc">'.'</span><span class="p">)</span> <span class="p">{</span>   <span class="c1">// Number: [0-9.]+</span>
+  <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">NumStr</span><span class="p">;</span>
+  <span class="k">do</span> <span class="p">{</span>
+    <span class="n">NumStr</span> <span class="o">+=</span> <span class="n">LastChar</span><span class="p">;</span>
+    <span class="n">LastChar</span> <span class="o">=</span> <span class="n">getchar</span><span class="p">();</span>
+  <span class="p">}</span> <span class="k">while</span> <span class="p">(</span><span class="n">isdigit</span><span class="p">(</span><span class="n">LastChar</span><span class="p">)</span> <span class="o">||</span> <span class="n">LastChar</span> <span class="o">==</span> <span class="sc">'.'</span><span class="p">);</span>
+
+  <span class="n">NumVal</span> <span class="o">=</span> <span class="n">strtod</span><span class="p">(</span><span class="n">NumStr</span><span class="p">.</span><span class="n">c_str</span><span class="p">(),</span> <span class="mi">0</span><span class="p">);</span>
+  <span class="k">return</span> <span class="n">tok_number</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>This is all pretty straight-forward code for processing input. When
+reading a numeric value from input, we use the C <tt class="docutils literal"><span class="pre">strtod</span></tt> function to
+convert it to a numeric value that we store in <tt class="docutils literal"><span class="pre">NumVal</span></tt>. Note that
+this isn’t doing sufficient error checking: it will incorrectly read
+“1.23.45.67” and handle it as if you typed in “1.23”. Feel free to
+extend it :). Next we handle comments:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="k">if</span> <span class="p">(</span><span class="n">LastChar</span> <span class="o">==</span> <span class="sc">'#'</span><span class="p">)</span> <span class="p">{</span>
+  <span class="c1">// Comment until end of line.</span>
+  <span class="k">do</span> <span class="n">LastChar</span> <span class="o">=</span> <span class="n">getchar</span><span class="p">();</span>
+  <span class="k">while</span> <span class="p">(</span><span class="n">LastChar</span> <span class="o">!=</span> <span class="n">EOF</span> <span class="o">&&</span> <span class="n">LastChar</span> <span class="o">!=</span> <span class="sc">'\n'</span> <span class="o">&&</span> <span class="n">LastChar</span> <span class="o">!=</span> <span class="sc">'\r'</span><span class="p">);</span>
+
+  <span class="k">if</span> <span class="p">(</span><span class="n">LastChar</span> <span class="o">!=</span> <span class="n">EOF</span><span class="p">)</span>
+    <span class="k">return</span> <span class="n">gettok</span><span class="p">();</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>We handle comments by skipping to the end of the line and then return
+the next token. Finally, if the input doesn’t match one of the above
+cases, it is either an operator character like ‘+’ or the end of the
+file. These are handled with this code:</p>
+<div class="highlight-c++"><div class="highlight"><pre>  <span class="c1">// Check for end of file.  Don't eat the EOF.</span>
+  <span class="k">if</span> <span class="p">(</span><span class="n">LastChar</span> <span class="o">==</span> <span class="n">EOF</span><span class="p">)</span>
+    <span class="k">return</span> <span class="n">tok_eof</span><span class="p">;</span>
+
+  <span class="c1">// Otherwise, just return the character as its ascii value.</span>
+  <span class="kt">int</span> <span class="n">ThisChar</span> <span class="o">=</span> <span class="n">LastChar</span><span class="p">;</span>
+  <span class="n">LastChar</span> <span class="o">=</span> <span class="n">getchar</span><span class="p">();</span>
+  <span class="k">return</span> <span class="n">ThisChar</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>With this, we have the complete lexer for the basic Kaleidoscope
+language (the <a class="reference external" href="LangImpl2.html#code">full code listing</a> for the Lexer
+is available in the <a class="reference external" href="LangImpl2.html">next chapter</a> of the tutorial).
+Next we’ll <a class="reference external" href="LangImpl2.html">build a simple parser that uses this to build an Abstract
+Syntax Tree</a>. When we have that, we’ll include a
+driver so that you can use the lexer and parser together.</p>
+<p><a class="reference external" href="LangImpl2.html">Next: Implementing a Parser and AST</a></p>
+</div>
+</div>
+
+
+          </div>
+      </div>
+      <div class="clearer"></div>
+    </div>
+    <div class="related">
+      <h3>Navigation</h3>
+      <ul>
+        <li class="right" style="margin-right: 10px">
+          <a href="../genindex.html" title="General Index"
+             >index</a></li>
+        <li class="right" >
+          <a href="LangImpl2.html" title="2. Kaleidoscope: Implementing a Parser and AST"
+             >next</a> |</li>
+        <li class="right" >
+          <a href="index.html" title="LLVM Tutorial: Table of Contents"
+             >previous</a> |</li>
+  <li><a href="http://llvm.org/">LLVM Home</a> | </li>
+  <li><a href="../index.html">Documentation</a>»</li>
+
+          <li><a href="index.html" >LLVM Tutorial: Table of Contents</a> »</li> 
+      </ul>
+    </div>
+    <div class="footer">
+        © Copyright 2003-2014, LLVM Project.
+      Last updated on 2015-01-21.
+      Created using <a href="http://sphinx-doc.org/">Sphinx</a> 1.2.2.
+    </div>
+  </body>
+</html>
\ No newline at end of file






More information about the llvm-commits mailing list