[www-releases] r246586 - Commit 3.7.0
Hans Wennborg via llvm-commits
llvm-commits at lists.llvm.org
Tue Sep 1 13:55:36 PDT 2015
Added: www-releases/trunk/3.7.0/docs/_static/jquery.js
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/jquery.js?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/_static/jquery.js (added)
+++ www-releases/trunk/3.7.0/docs/_static/jquery.js Tue Sep 1 15:55:31 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.7.0/docs/_static/lines.gif
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/lines.gif?rev=246586&view=auto
==============================================================================
Binary file - no diff available.
Propchange: www-releases/trunk/3.7.0/docs/_static/lines.gif
------------------------------------------------------------------------------
svn:mime-type = application/octet-stream
Added: www-releases/trunk/3.7.0/docs/_static/llvm-theme.css
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/llvm-theme.css?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/_static/llvm-theme.css (added)
+++ www-releases/trunk/3.7.0/docs/_static/llvm-theme.css Tue Sep 1 15:55:31 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.7.0/docs/_static/llvm.css
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/llvm.css?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/_static/llvm.css (added)
+++ www-releases/trunk/3.7.0/docs/_static/llvm.css Tue Sep 1 15:55:31 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.7.0/docs/_static/logo.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/logo.png?rev=246586&view=auto
==============================================================================
Binary file - no diff available.
Propchange: www-releases/trunk/3.7.0/docs/_static/logo.png
------------------------------------------------------------------------------
svn:mime-type = application/octet-stream
Added: www-releases/trunk/3.7.0/docs/_static/minus.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/minus.png?rev=246586&view=auto
==============================================================================
Binary file - no diff available.
Propchange: www-releases/trunk/3.7.0/docs/_static/minus.png
------------------------------------------------------------------------------
svn:mime-type = application/octet-stream
Added: www-releases/trunk/3.7.0/docs/_static/navigation.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/navigation.png?rev=246586&view=auto
==============================================================================
Binary file - no diff available.
Propchange: www-releases/trunk/3.7.0/docs/_static/navigation.png
------------------------------------------------------------------------------
svn:mime-type = application/octet-stream
Added: www-releases/trunk/3.7.0/docs/_static/plus.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/plus.png?rev=246586&view=auto
==============================================================================
Binary file - no diff available.
Propchange: www-releases/trunk/3.7.0/docs/_static/plus.png
------------------------------------------------------------------------------
svn:mime-type = application/octet-stream
Added: www-releases/trunk/3.7.0/docs/_static/pygments.css
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/pygments.css?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/_static/pygments.css (added)
+++ www-releases/trunk/3.7.0/docs/_static/pygments.css Tue Sep 1 15:55:31 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.7.0/docs/_static/searchtools.js
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/searchtools.js?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/_static/searchtools.js (added)
+++ www-releases/trunk/3.7.0/docs/_static/searchtools.js Tue Sep 1 15:55:31 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.7.0/docs/_static/underscore.js
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/underscore.js?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/_static/underscore.js (added)
+++ www-releases/trunk/3.7.0/docs/_static/underscore.js Tue Sep 1 15:55:31 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: {
+ '&': '&',
+ '<': '<',
+ '>': '>',
+ '"': '"',
+ "'": ''',
+ '/': '/'
+ }
+ };
+ 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.7.0/docs/_static/up-pressed.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/up-pressed.png?rev=246586&view=auto
==============================================================================
Binary file - no diff available.
Propchange: www-releases/trunk/3.7.0/docs/_static/up-pressed.png
------------------------------------------------------------------------------
svn:mime-type = application/octet-stream
Added: www-releases/trunk/3.7.0/docs/_static/up.png
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/up.png?rev=246586&view=auto
==============================================================================
Binary file - no diff available.
Propchange: www-releases/trunk/3.7.0/docs/_static/up.png
------------------------------------------------------------------------------
svn:mime-type = application/octet-stream
Added: www-releases/trunk/3.7.0/docs/_static/websupport.js
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/_static/websupport.js?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/_static/websupport.js (added)
+++ www-releases/trunk/3.7.0/docs/_static/websupport.js Tue Sep 1 15:55:31 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.7.0/docs/genindex.html
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/genindex.html?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/genindex.html (added)
+++ www-releases/trunk/3.7.0/docs/genindex.html Tue Sep 1 15:55:31 2015
@@ -0,0 +1,2582 @@
+
+
+<!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.7 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.7',
+ 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.7 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-llvm-cov-gcov--help">llvm-cov-gcov 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>
+ --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-llvm-cov-gcov-a">llvm-cov-gcov 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>
+ -arch=<name>
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-report-arch">llvm-cov-report command line option</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-arch">llvm-cov-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-llvm-cov-gcov-b">llvm-cov-gcov command line option</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ -binary (default)
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-binary">llvm-profdata-merge command line option</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ -c, --branch-counts
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-c">llvm-cov-gcov 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>
+ -D NAME, -D NAME=VALUE, --param NAME, --param NAME=VALUE
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/lit.html#cmdoption-D">command line option</a>, <a href="CommandGuide/lit.html#cmdoption-D">[1]</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-llvm-cov-gcov-f">llvm-cov-gcov 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>
+
+ <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>
+ -gcc
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-gcc">llvm-profdata-merge 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>
+ </dl></td>
+ <td style="width: 33%" valign="top"><dl>
+
+ <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>
+ -instr (default)
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-instr">llvm-profdata-merge command line option</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-instr">llvm-profdata-show 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-llvm-cov-gcov-l">llvm-cov-gcov command line option</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ -line-coverage-gt=<N>
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-line-coverage-gt">llvm-cov-show command line option</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ -line-coverage-lt=<N>
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-line-coverage-lt">llvm-cov-show 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-llvm-cov-gcov-n">llvm-cov-gcov command line option</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ -name-regex=<PATTERN>
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-name-regex">llvm-cov-show command line option</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ -name=<NAME>
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-name">llvm-cov-show 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-llvm-cov-gcov-o">llvm-cov-gcov 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/opt.html#cmdoption-p">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, --preserve-paths
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-p">llvm-cov-gcov 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>
+ -region-coverage-gt=<N>
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-region-coverage-gt">llvm-cov-show command line option</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ -region-coverage-lt=<N>
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-region-coverage-lt">llvm-cov-show 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>
+ -sample
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-sample">llvm-profdata-merge command line option</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-sample">llvm-profdata-show 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>
+ -show-expansions
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-show-expansions">llvm-cov-show command line option</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ -show-instantiations
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-show-instantiations">llvm-cov-show command line option</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ -show-line-counts
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-show-line-counts">llvm-cov-show command line option</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ -show-line-counts-or-regions
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-show-line-counts-or-regions">llvm-cov-show command line option</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ -show-regions
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-show-regions">llvm-cov-show 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>
+ -text
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-text">llvm-profdata-merge 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-llvm-cov-gcov-u">llvm-cov-gcov 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-color[=VALUE]
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-report-use-color">llvm-cov-report command line option</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-use-color">llvm-cov-show 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>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-version">llvm-cov-gcov command line option</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/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--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/lit.html#cmdoption-D">-D NAME, -D NAME=VALUE, --param NAME, --param NAME=VALUE</a>, <a href="CommandGuide/lit.html#cmdoption-D">[1]</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-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-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/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-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-symbolizer.html#cmdoption-obj">-obj</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/opt.html#cmdoption-p">-p</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-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>
+ </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-cov-gcov command line option
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov--help">--help</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-a">-a, --all-blocks</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-b">-b, --branch-probabilities</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-c">-c, --branch-counts</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-f">-f, --function-summaries</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-l">-l, --long-file-names</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-n">-n, --no-output</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-o">-o=<DIR|FILE>, --object-directory=<DIR>, --object-file=<FILE></a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-p">-p, --preserve-paths</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-u">-u, --unconditional-branches</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-gcov-version">-version</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ llvm-cov-report command line option
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-report-arch">-arch=<name></a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-report-use-color">-use-color[=VALUE]</a>
+ </dt>
+
+ </dl></dd>
+
+ <dt>
+ llvm-cov-show command line option
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-arch">-arch=<name></a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-line-coverage-gt">-line-coverage-gt=<N></a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-line-coverage-lt">-line-coverage-lt=<N></a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-name-regex">-name-regex=<PATTERN></a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-name">-name=<NAME></a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-region-coverage-gt">-region-coverage-gt=<N></a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-region-coverage-lt">-region-coverage-lt=<N></a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-show-expansions">-show-expansions</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-show-instantiations">-show-instantiations</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-show-line-counts">-show-line-counts</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-show-line-counts-or-regions">-show-line-counts-or-regions</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-show-regions">-show-regions</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-cov.html#cmdoption-llvm-cov-show-use-color">-use-color[=VALUE]</a>
+ </dt>
+
+ </dl></dd>
+ </dl></td>
+ <td style="width: 33%" valign="top"><dl>
+
+ <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>
+
+ <dt>
+ llvm-profdata-merge command line option
+ </dt>
+
+ <dd><dl>
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-binary">-binary (default)</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-gcc">-gcc</a>
+ </dt>
+
+
+ <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-instr">-instr (default)</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-output">-output=output, -o=output</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-sample">-sample</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-merge-text">-text</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-instr">-instr (default)</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-output">-output=output, -o=output</a>
+ </dt>
+
+
+ <dt><a href="CommandGuide/llvm-profdata.html#cmdoption-llvm-profdata-show-sample">-sample</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-2015, LLVM Project.
+ Last updated on 2015-08-31.
+ 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.7.0/docs/index.html
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/index.html?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/index.html (added)
+++ www-releases/trunk/3.7.0/docs/index.html Tue Sep 1 15:55:31 2015
@@ -0,0 +1,389 @@
+
+<!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.7 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.7',
+ 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.7 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="BuildingLLVMWithAutotools.html"><em>Building LLVM With Autotools</em></a></dt>
+<dd>An addendum to the Getting Started guide with instructions for building LLVM
+with the Autotools build system.</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>
+<dt><a class="reference internal" href="Frontend/PerformanceTips.html"><em>Performance Tips for Frontend Authors</em></a></dt>
+<dd>A collection of tips for frontend authors on how to generate IR
+which LLVM is able to effectively optimize.</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>
+<dt><a class="reference internal" href="LibFuzzer.html"><em>LibFuzzer – a library for coverage-guided fuzz testing.</em></a></dt>
+<dd>A library for writing in-process guided fuzzers.</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>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="AMDGPUUsage.html"><em>User Guide for AMDGPU Back-end</em></a></dt>
+<dd>This document describes how to use the AMDGPU 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>
+<dt><a class="reference internal" href="InAlloca.html"><em>Design and Usage of the InAlloca Attribute</em></a></dt>
+<dd>Description of the <tt class="docutils literal"><span class="pre">inalloca</span></tt> argument attribute.</dd>
+<dt><a class="reference internal" href="FaultMaps.html"><em>FaultMaps and implicit checks</em></a></dt>
+<dd>LLVM support for folding control flow into faulting machine instructions.</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.llvm.org/mailman/listinfo/llvm-dev">Developer’s List (llvm-dev)</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.llvm.org/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.llvm.org/pipermail/llvm-bugs/">Bugs & Patches Archive (llvm-bugs)</a></dt>
+<dd>This list gets emailed every time a bug is opened and closed. It is
+higher volume than the LLVM-dev list.</dd>
+<dt><a class="reference external" href="http://lists.llvm.org/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.llvm.org/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-2015, LLVM Project.
+ Last updated on 2015-08-31.
+ 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.7.0/docs/objects.inv
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/objects.inv?rev=246586&view=auto
==============================================================================
Binary file - no diff available.
Propchange: www-releases/trunk/3.7.0/docs/objects.inv
------------------------------------------------------------------------------
svn:mime-type = application/octet-stream
Added: www-releases/trunk/3.7.0/docs/search.html
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/search.html?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/search.html (added)
+++ www-releases/trunk/3.7.0/docs/search.html Tue Sep 1 15:55:31 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.7 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.7',
+ 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.7 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-2015, LLVM Project.
+ Last updated on 2015-08-31.
+ 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.7.0/docs/searchindex.js
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/searchindex.js?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/searchindex.js (added)
+++ www-releases/trunk/3.7.0/docs/searchindex.js Tue Sep 1 15:55:31 2015
@@ -0,0 +1 @@
+Search.setIndex({envversion:42,terms:{orthogon:86,interchang:[66,84,69],four:[84,112,53,41,42,20,1,74,69,78,8,103,71,19],prefix:[69,84,61,112,87],configstatusscript:66,is_open:8,francesco:31,repetit:84,add32ri8:6,globalvari:103,identityprop:16,foldingsetnodeid:16,build_fcmp:[12,13,14,15,19],dbx:104,digit:[71,20,111,16],intregsregclass:53,emitconst:53,basic_:116,n2118:69,delv:[12,26,49],f110:8,grokabl:69,distcheckdir:66,fpmad:104,mli:12,seper:71,second:[31,84,0,33,34,1,94,69,70,4,71,67,39,40,97,42,5,98,46,48,11,73,13,16,19,53,103,74,20,104,56,76,23,108,25,92,85,88,112,106],x86ii:53,r15d:6,functionfaultinfo:91,r15b:6,alignstack:[71,112],thefpm:[40,46,2,48,49],constrast:41,r15w:6,errorf:[40,42,55,46,2,48,49],xchg:[71,86],cull:69,ongo:[73,26],noreturn:[71,50,112],visitxor:83,here:[92,33,34,35,94,36,69,70,4,99,71,6,72,38,39,40,84,8,42,5,44,98,46,2,48,49,10,11,50,73,12,13,14,15,16,18,19,67,53,102,74,90,20,100,104,76,103,97,23,61,24,83,30,41,85,86,87,109,88,55,114,66,29,25,116],gnu_hash:10
4,image_file_machine_r4000:109,dllvm_build_runtim:23,iseldagtodag:21,"0x20":104,golden:69,unic:20,bou_tru:20,unif:41,brought:33,substr:67,unix:[23,61,97,71,20,98,10,66,4,5,16],machinecodeemitt:53,content_disposition_typ:26,uint64_max:59,unit:[61,78],ldri:53,fstream:8,subpath:[27,1],destarglist:71,get_ptr:91,until:[31,69,32,1,71,72,40,42,113,44,46,2,48,49,10,50,12,13,14,15,16,17,18,19,53,55,20,76,21,78,57,111,23,82,24,83,30,84,26,112,108],new_else_bb:[13,14,15],emitlabelplusoffset:74,jmp:71,relat:[31,26,84,103,8,32,16,1,69,41,104,10,70,21,94,33,27,108,73,71],notic:[98,61,102,8,42,33,84,46,26,50,103,15,16,19],hurt:69,exce:[30,69,71,104],hole:[20,71],hold:[31,33,71,6,72,40,42,55,44,46,2,48,49,10,12,13,14,15,16,18,19,53,74,20,104,76,23,25,84,51,27,116],image_scn_align_128byt:109,generalis:[14,2],talli:34,dagtodag:65,conceptu:[69,103,5,20,84,108,78,71,16],forexpr:[40,46,2,48,13,14,15],oftc:38,rework:[20,26],get_matcher_implement:21,al_superregsset:53,phabric:26,dtor:[98,71],createfunct:4
0,replaceusesofwith:[60,16],doubletyp:16,caution:[66,86,73],fibonacci:[66,36,17,44],want:[62,35,95,36,69,70,71,65,41,5,98,9,47,50,102,103,20,23,61,24,25,84,87,26,112,114,66],umin:71,hasfp:53,motion:[23,60,71,41],mcasmstream:84,fucompi:84,hoc:[31,84,16],classifi:41,i686:[10,84,5],how:[61,112,41,86,87,3,78,83,59],hot:[71,50,59],actionscript:[39,11],macosx10:71,perspect:[102,41,73,76,108,71],lhse:[40,46],bpf_stx:84,tls1_process_heartbeat:25,wrong:[69,41],beauti:[42,44,2,14,17,19],adc32rm:6,outoperandlist:[6,53],weakanylinkag:16,index2virtreg:84,passopt:76,isvalid:40,apint:16,alias:[112,41],"18th":103,prototypeast:[40,42,55,46,2,48,49],tok_for:[40,46,2,48],"0x3f":22,feedback:[76,114,25,26,94],assing:33,affect:[29,98,61,8,32,71,20,62,9,86,48,94,76,78,13,33,4,16,116],vari:[39,98,71,84,86,11,112,4,83,16],z196:30,exported_symbol_list:66,sanitize_memori:71,fit:[31,69,82,103,71,20,84,104,48,26,78,13,16,30],fix:86,"200000e":[13,48],ortogon:30,hidden:[69,16,20,84,47,68,104,76,95,112,57,71],easi
er:[31,62,32,86,69,71,6,65,40,8,42,55,98,46,99,10,15,16,18,19,101,74,21,82,30,84,41,26,27],aliasesset:41,proce:[60,61,32,33,74,108],imagstart:[14,2],interrupt:[91,69,25,1,4,71],sellect:21,kernelparam:8,loopinfo:76,sparclite86x:53,dcmake_install_prefix:[23,9,61],exprast:[40,42,55,46,2,48,49,18],accommod:[84,22,112,8],timeout:[25,30],"0x7ffff7ed404c":99,build_fadd:19,openfileforwrit:4,resum:[108,99],llvmfuzzertestoneinput:25,pinsrd_1:5,numentri:112,whip:[14,2],intregssuperclass:53,dst:[70,84,6,53,116],smp:76,only_tool:[23,66],llvm_lit_arg:61,adapt:[4,98,16,31],aliasdebugg:41,impract:16,committ:26,navig:[27,20,82],selectionkind:71,omiss:[26,71],targetloweringobjectfil:84,adc64ri32:6,f3_1:53,sahf:84,f3_3:53,proj_src_root:[66,51],reformul:41,realstart:[14,2],att:[80,77,71],unabl:[60,71,18,116],disablelazycompil:16,confus:[69,97,53,103,16,26,33,71],s3_pkt:25,configurescriptflag:66,clariti:[13,71,48],wast:[72,106,46,104,88,15,16],psubusw:10,mingw:[36,84,61,94],mklib:66,wasn:[40,41,33,46,2,
14,15],vhdl:30,isalnum:[40,42,55,44,46,2,48,49],llvmmemorymanagerallocatedatasectioncallback:88,signext:[71,112],setargstr:20,nobuiltin:71,master:[10,23,114,51,38],image_scn_mem_discard:109,similarli:[38,40,102,53,41,16,20,62,69,83,26,78,66,94,71,34],getnod:[65,53],image_sym_class_stat:109,linpack:0,addrrr:53,arrayidx1:71,arrayidx3:71,arrayidx2:71,arrayidx4:71,"0x3500000001652748":99,ntid:8,crawl:74,technic:[38,25,26],lvalu:16,tree:[1,61,54,84,69,87,26],wchar_t:71,image_rel_i386_secrel:22,sdnode:[83,84,16,6,53],recheck:[31,66,33],uniniti:[74,69,71,116,103],libllvmcor:16,aforement:23,increment:[69,84,83],infring:26,dcmake_toolchain_fil:23,incompat:[63,30,71],dozen:[35,50],sig_atomic_t:71,implicitus:84,musttail:71,browsabl:61,get_instrinfo_operand_types_enum:53,simplifi:84,shall:[71,20,61,11,39],cpu2:92,object:[78,24,41],numloc:88,specifi:24,letter:[40,53,20,46,2,69,112,66,14,15,71],breakpoint:[83,99],alwaysinlin:[71,112],errorv:[40,42,46,2,48,49],getelementtyp:16,expr0rh:67,purgev:11
2,dummi:[31,98,53,25,84,10,116],lpm:76,mayreadfrommemori:86,detriment:69,came:[13,39,111,11,48],s_endpgm:24,addr2:79,klimek:82,matchinstructionimpl:84,layout:[61,78],ccmake:61,apach:[4,26],somefil:98,theme:[6,100],busi:26,image_sym_type_word:109,exctyp:108,recursivetarget:66,plate:20,selectiondagbuild:84,enable_profil:[66,98,87],addri:53,replaceusesofwithonconst:60,addrr:53,ldm:71,smallvectorimpl:16,ppc_fp128:[33,71,112],hasopsizeprefix:6,patch:69,emitstorecondit:86,sligtli:78,bpf_ja:84,respond:[31,82,41],sjljehprepar:108,mandatori:[71,36,16,53],fprofil:[67,95],fail:[69,61,113,20,1,86,87,26,108,80,5],best:[31,84,41,74,108,44,62,69,104,87,88,26,11,78,55,80,16,98,18],dw_tag_reference_typ:[71,104],wikipedia:[27,13,71,48],copyleft:26,figur:[76,84,53,16,20,62,83,10,69,78,66,71],irc:[26,50,82],sysroot:[9,6],glasgow:71,xvf:36,never:[91,31,92,33,34,95,69,71,67,39,97,41,102,98,49,11,12,16,53,103,74,76,78,84,86,64,90],extend:86,mandat:84,extens:[84,69,77,61,95],extent:[74,26,71,103,54],toler:
[74,71,94],advertis:108,rtti:61,"0f3f800000":8,accident:[76,4,20,69],atomicexpandpass:86,logic:[31,69,33,1,71,42,5,46,2,48,13,14,15,16,19,102,103,108,84,26,55,27,66],hh567368:69,seri:112,compromis:16,with_assert:61,assur:92,mattr:[80,77,5,53],creategvnpass:[40,46,2,48,49],"2nd":[71,30,16,116],dibuild:[40,104],makelight:69,diff:[69,68],summat:71,assum:[3,23,65,69,103,41,74,108,77,84,87,36,26,50,112,80,83,59,98],summar:[74,31,1,84],duplic:[90,69,97,41,33,20,84,26,22,50,71],frc:84,frb:84,fra:84,bewilder:66,union:[69,41,84,46,104,15,71],n_hash:104,frt:84,bpf_mod:84,life:[26,69,50],regul:76,mrm6m:53,worker:25,ani:[69,93,1,35,94,95,36,37,70,71,67,65,97,41,5,45,50,83,98,101,103,74,20,75,77,22,78,57,111,59,23,60,61,24,108,84,86,87,110,26,112,113,27],cufunct:8,"25x":30,lift:50,legacypassmanag:[40,46,2,48,49],"0x16151f0":99,objectfil:72,hasfparmv8:6,image_scn_mem_not_cach:109,commerci:26,employ:26,one_onli:22,debug_metadata_vers:40,emit_22:53,unop:[40,14,15,46,2],bio:25,rediscov:[39,11],filen
ame0:67,lto_module_is_object_file_in_memori:90,createret:[40,42,46,2,48,49],format:78,bikesh:102,generalcategori:20,falsedest:71,split:[31,65,53,103,33,20,84,85,86,83,26,78,71,51],immtypebit:6,functionpassmanag:[40,46,2,48,49],mmsa:30,annoat:28,reassoci:[60,71],cxx0x:69,dest1:71,fairli:[53,41,55,44,98,2,48,86,11,50,27,13,14,16,17,18],dest2:71,"07b":30,refil:33,ownership:[40,46,2,48,49,26,16],printdeclar:53,tune:[84,61],tokvarnam:29,nuzman:0,gzip:[23,94],unchang:[71,16,41],modnam:49,ordin:20,phinod:[69,40,46,2,48],previous:[61,53,42,71,20,48,94,95,108,29,34,19],typeless:30,easi:[84,32,33,34,1,69,71,39,46,42,55,44,9,48,49,10,11,12,13,15,16,17,18,19,102,74,104,76,21,23,61,25,92,87,64,26,112,27,106,30],bitwidth:[33,71,112],had:[8,73,33,30,92,86,76,88,78,37,4,106,71],ideal:[27,73,69,16,53],har:[23,51],hat:92,sanit:[25,61,30],ocamlbuild:[12,13,14,15,18,19],issimpl:86,preserv:[23,39,84,97,103,41,73,20,54,76,95,11,78,108,88,71],instrumen:67,st_mode:97,attrparsedattrkind:21,isdeclar:16,measu
r:97,specif:[112,87,86,24],fcmpinst:16,nonlazybind:71,remind:[26,94],underli:[69,61,74,20,84,56,26,78],right:[65,69,97,113,20,84,86,26,78],old:[95,26,99,41],getargumentlist:16,unabashedli:66,attornei:26,olt:71,paralleltarget:66,dominatorset:76,txt:[23,69,61,54,20,94,10,79,26,27,106,25],sparcsubtarget:53,bottom:[31,60,82,53,0,33,20,76,13,4,71,59,80],undisturb:69,lto_module_get_num_symbol:90,stringsort:69,subclass:[69,102,41,74,20,84],cassert:[69,8],armv7l:35,topleveltarget:66,op_begin:16,condit:[23,60,61,103,8,33,20,84,69,86,95,3,90,50,108,71,98],foo:[92,0,73,69,3,71,67,8,42,5,98,47,48,49,10,12,13,84,16,18,19,102,103,74,20,104,56,22,78,79,59,108,62,41,55,29,116],"0f00000000":8,armv7a:[9,94],sensibl:16,leftr:33,egregi:26,tablegen:61,bindex:53,emitt:[116,21,71,115,99],image_scn_mem_lock:109,llvmanalysi:51,true_branch_weight:3,slightli:[69,71],xor64rr:84,dw_tag_array_typ:[71,104],selectiondagisel:21,basenam:104,expandop:65,mbb:[84,53],creativ:53,mcinstlow:84,wrap:[72,23,69,103,44,42,71,
20,92,47,104,26,112,55,4,16,17,18,19],msp430:[23,84,71,87],data32bitsdirect:53,suffici:[23,103,62,102,31,74,5,20,41,44,86,83,50,71,73,66,28,16,17,116],support:[112,86,78,24,41],sub_rr:116,happi:[15,46,51],sub_ri:116,width:[86,78],cpprefer:16,distsubdir:66,icon:82,use_back:16,headach:32,setxyzzi:69,"0x2413bc":76,fpga:84,offer:[74,30,92,16,86],refcount:74,strike:[42,19],dllstorageclass:[71,112],multiprocessor:[74,76],reserveresourc:84,profdata:[95,68],mymod:66,insidi:69,reiter:71,handili:69,fermi:84,dump_valu:[12,13,14,15,19],rerun:66,isexternalsymbol:53,adopt:[4,26,69,84],mirror:74,proven:[31,46,111,50,15,71],flagsflat:92,ericsson:71,build_phi:[13,14,15],bswap:65,role:[69,32,33,104,55,29,18],finalizeobject:[72,40,46,2,48,49],presum:71,smell:16,roll:[69,102],mri:84,legitim:69,notif:41,intend:[23,65,84,61,97,41,74,108,20,45,86,26,50,5],createargumentalloca:[40,46],intens:[16,50,0],intent:[97,71,84,46,26,90,78,15,29],keycol:70,dyn_switch:69,"1s100000s11010s10100s1111s1010s110s11s1":16,c
umemcpyhtod:8,pre_stor:84,time:[61,41,84,86,87,56,3,112,83,59],push:[40,74,30,84,69,83],image_file_dl:109,corpu:25,breadth:[80,44,17],mrmsrcmem:53,ptrtoint:50,sparctargetmachin:53,osi:98,aptr:71,const_nul:[13,14,15],image_sym_type_short:109,decid:[65,92,61,82,0,71,20,62,46,2,49,76,55,78,73,12,14,15,16,18,104],herebi:69,pem:25,decim:[97,20,92,22,71,116],x08:109,decis:[69,0,73,84,83,49,26,78,108,12,71],x03:109,x01:109,macho:[72,84],oversight:26,x04:109,painlessli:20,uint32_max:104,cudevicecomputecap:8,vmcore:[20,61],fullest:69,exact:[31,69,54,74,16,20,104,86,76,90,108,27,71,34],numlin:67,solver:84,tear:108,unsupport:[84,53,32,1,86,94,10,36],team:[51,94],cooki:[71,16],prevent:[31,69,0,73,4,71,40,41,42,5,98,46,10,15,16,19,74,20,104,76,30,84,85,26,88,66],dcmake_cxx_flag:9,"_abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz0123456789":49,numroot:74,heavyweight:16,relocat:[72,80,71,53],regex_t:25,filenameindex1:67,lazili:[16,30,49,112,12,90],currenc:[12,84,26,49],thecu:40,merge_bb:[13,1
4,15],current:[91,31,92,32,33,1,77,47,36,3,70,4,69,71,6,72,38,39,40,84,8,42,5,44,98,9,2,48,49,10,11,50,46,12,13,14,15,16,17,18,19,67,53,103,74,55,20,65,104,76,114,21,22,78,80,111,94,97,23,61,24,73,108,25,41,85,86,87,63,64,26,88,51,112,113,27,66,29,30,116],image_scn_cnt_cod:109,i256:71,objdir:[66,87],boost:30,oeq:71,intraprocedur:83,adc64rr:6,cudevicegetnam:8,dropdown:82,autogener:26,live_begin:74,splice:[71,16],address:[61,78,41,56,86,112],along:[72,23,84,61,102,74,62,86,69,50,112,70,111,71],ffast:0,cur_var:15,volumin:16,commentstr:53,queue:[76,16,53],throughput:50,replaceinstwithvalu:16,safepoint:[74,71],mipsel:87,bpf_ld:84,commonli:[69,53,74,16,112,71],ourselv:[69,104,8],ipc:4,ipa:60,love:16,"2ap3":22,pentium:[23,53],prefer:[86,41],ipo:[33,60],src2:[84,6,116],regalloc:[76,80,77,84],src1:[84,6,116],fake:[80,71],instal:[101,23,65,61,98,35,87,64,36,114],llvm_lib_search_path:23,callstack:108,anothercategori:20,virtreg:84,image_sym_class_nul:109,abbrevid:112,scope:[69,41,74,5,26,112,10
8,115,83],tightli:[40,42,55,46,2,48,49,69,12,13,14,15,71,18,19],"66ghz":114,peopl:[23,39,84,82,103,38,32,20,44,69,65,94,76,26,11,4,71,17,98],n2627:69,claus:[84,26,71,108],refrain:[71,94],enhanc:[26,69,115],dagarg:29,linkmodul:66,langref:[30,65,86],easiest:[23,39,53,86,94,76,11,106],behalf:[26,82],b_ctor_bas:5,subel:71,descriptor:[40,53,108,104,88,112,71],valuet:16,whatev:[31,92,61,103,23,71,20,41,4,5],problemat:69,encapsul:[69,102,57],test_fuzz:25,recycl:84,setrecordnam:112,optnon:71,fpm:49,r11b:6,r11d:6,"0x00001c00":84,fpu:[71,9,35],parameter:116,r11w:6,vec0123:71,remap:84,motohiro:84,getsigjmp_buftyp:69,dw_apple_property_gett:104,spot:[31,25,94],mrm4m:53,mrm4r:53,succ:69,isfloatingpointti:16,date:[23,97,41,32,30,48,94,36,87,66,13,83,116],shuffl:[1,71],data:[86,78,41],codes:6,stress:[69,68],rc2:[32,94],indexloc:16,ssl:25,disable_auto_depend:66,stdio:[23,64,36,13,12,4,14,15,90],stdin:[40,104,10,12,13,14,15,5,18,19],mangl:[111,69,26,71,104],fp4:[6,116],sandbox:[32,9],fp6:[6,116],fp1:
[6,116],fp0:[6,116],fp3:[6,116],fp2:[6,116],callabl:[69,71,8],iftmp:[40,46,2,48,13,14,15],untest:32,operand_type_list_end:53,my_funct:8,llvm_library_vis:74,revisit:73,numbyt:88,x86retflag:116,overhaul:94,thumb:[84,26,69],image_sym_class_block:109,precedecnc:[40,46,2],instantli:16,"__stack_chk_guard":71,jit:[83,61,87],canonicalis:78,image_sym_class_end_of_struct:109,mips32r2:30,mips32r3:30,outli:108,mips32r5:30,mips32r6:30,smarter:20,isbinaryop:[40,46,2],"0x00000147":104,inpredsens:70,therebi:[20,88],"0x00000140":104,mcode:22,revers:[31,60,103,5,78,16],llvm_src_dir:[98,35,87],separ:[84,34,95,69,4,71,8,5,9,47,10,51,53,103,74,20,104,76,21,111,59,23,61,25,92,86,87,26,88,18,112,55,27,66,106,90,116],dwarf2:40,image_sym_class_end_of_funct:109,complextyp:109,sk_squar:102,compil:[83,112,78,41],argvalu:[20,99],registertarget:53,"__has_attribut":21,blx:22,movsx64rr32:84,"0x100":104,toolchain:[69,84,61],blk:16,"0x1c2":22,libxxx:9,getschedclass:53,pseudocod:53,million:[71,16],removefrompar:16,cr
azier:[13,48],micromip:30,"byte":[73,37,71,67,65,97,41,12,13,14,15,16,18,19,53,103,104,56,78,25,84,85,86,88,112,30],subregist:[88,53],reusabl:84,departur:66,jitcompilerfunct:53,ifuzz:25,sysconfdir:66,modest:69,recov:[91,108,5,88,71,16],neglect:34,arraytyp:16,oper:[3,69,61,112,41,84,86,56,77,78,80],onc:[91,92,108,32,33,34,1,94,95,36,69,4,71,6,72,38,7,84,41,42,113,98,46,48,49,11,73,12,13,15,16,18,19,53,103,74,90,20,75,39,76,23,60,61,83,25,62,87,64,26,55,112,65,66,106,29,116],iaddroff:84,coveragemappingdataforfunctionrecord1:67,coveragemappingdataforfunctionrecord0:67,printinformationalmessag:20,symmetri:10,open:[113,69,26,61,84],lexicograph:[33,69],rmw:86,addtmp4:[42,19],f89:8,f88:8,convent:112,bite:98,f80:71,enable_optim:[63,66,87,94],optlevel:20,draft:[23,104,86],addtmp1:[12,49],lnt:[10,32,30,9,34],getsubtarget:[30,53],conveni:[31,69,1,71,67,39,8,98,2,48,10,11,13,14,16,51,102,20,23,25,84,26,116],goldberg91:74,usenamedoperandt:53,fma:84,sometest:34,programat:[30,14,84,2],artifact:[33
,103],"__apple_namespac":104,jscop:30,vec012:71,third:[92,33,34,94,69,71,67,39,40,42,11,73,16,51,19,53,103,74,20,104,56,76,23,108,84,26,88,112],rival:16,rzi:8,param2:16,param1:16,"0x12345678":104,sai:[39,40,102,97,34,44,42,5,20,84,11,71,66,70,4,103,106,16,17,19],nicer:[20,40,16,92],argument:[101,84,61,24,41,113,1,68,95,69,78,37,80,111,115,5],second_tru:71,sar:84,saw:[76,13,90,48],entrytoken:84,notw:5,xxxgenregisterinfo:53,wrapcolumn:92,destroi:[84,53,16,92,47,76,108,71,98],note:[61,112,24,41,86,87,78,83],denomin:69,take:[31,92,108,32,33,102,1,77,47,36,69,37,70,71,72,7,40,84,8,42,5,44,98,46,2,48,49,11,73,12,13,14,15,16,17,18,19,53,103,74,90,20,75,39,104,76,21,78,57,80,93,23,107,83,25,41,109,86,87,110,64,26,88,55,112,65,66,106,29,30,116],llvmcreatesimplemcjitmemorymanag:88,funcion:8,printer:[27,74,28,84],buffer:[71,39,40,42,55,46,2,48,49,11,12,13,14,15,16,17,18,19,104,108,25,90],fcc_ug:53,compress:[23,61,112,37,66,16],private_segment_align:24,insertel:[5,78],abus:16,homepag:[23,36],al
levi:[71,20,84,16],"_function_nam":22,drive:[27,73,35],axi:0,event:[61,16,88,73],behe:73,merit:69,identifierstr:[40,42,55,44,46,2,48,49],cclib:[14,15],objptr:71,slot:[108,84,71,47,37],xmm:[71,5,53],xmo:105,transact:30,activ:[38,69,53,41,74,16,52,84,47,76,26,88,108,71],v2size:41,freebsd5:84,ubla:30,sdk:[23,36],v16f32:71,flagscpu2:92,flagscpu1:92,clang:[67,26,61,103,108,77,1,69,86,87,99,95,3,5,98],x86reloc:53,run_long_test:10,amdkernelcodet:24,borrow:71,specialsquar:102,getframes:74,openorcreatefileforwrit:4,xmax:[14,2],clenumvalend:20,where:[67,112,65,26,61,97,108,83,20,1,69,86,87,115,95,3,78,75,84,5,59],compute_pgm_rsrc2_user_sgpr:24,sinbio:25,deadlin:26,dw_at_apple_property_sett:104,callseq_start:73,arglist:71,xxxtrait:92,x86targetmachin:84,x24:109,build_mul:[12,13,14,15,19],getindex:53,assumpt:[39,40,71,84,69,104,77,11,5],screen:32,secnam:22,imm32:84,opval:53,sparc:[84,86,87],uncondition:[84,40,22,41],dcommit:23,genericvalu:[12,13,14,15],eflag:[6,116],do_safepoint:73,extern_weak:[
71,112],mani:[91,31,62,0,32,46,34,69,47,36,3,102,4,71,98,39,84,8,42,5,44,45,9,2,48,49,10,11,73,12,13,14,15,16,17,18,19,53,103,74,55,20,65,104,76,78,59,23,82,83,25,41,86,92,88,112,108,27,66,30],qhelpgener:61,dw_at_mips_linkage_nam:104,unistd:4,sccp:60,sentinel:108,constant:[67,65,69,41,20,84,86,112,37],boat:69,curs:[113,1],printstar:[13,48],fib:[31,40,44,46,48,13,15,17],add16mr:6,image_scn_align_4096byt:109,ismod:116,parseifexpr:[40,46,2,48],xxxinstrdescriptor:53,inst_begin:16,add16mi:6,reflex:33,constantfoldcal:65,symobl:22,thousand:31,release_15:23,ppcisellow:65,cxx_fuzzer_token:25,former:[73,84,86,50,55,18],standard:[86,78,41],combine1:84,combine2:84,emitalign:74,columnstart:67,polli:61,view_function_cfg:13,movsx16rm8w:84,lto_module_get_symbol_attribut:90,canon:[71,16,104,78,31],blah:[20,69],pthread:71,ascii:[40,97,42,55,44,46,2,48,49,104,112,12,13,14,15,71,17,18,19],binari:[67,7,84,61,107,93,20,75,69,101,110,95,26,22,105,112,79,96,83],devcount:8,srem:84,unhandl:108,irread:61,"0x1
603020":99,getfunct:[40,42,46,2,48,49,76,74,16],extern:[69,97,112,84,111,78,80],defi:71,sret:[71,112],defm:116,fnname:[40,42,55,46,2,48,49],dw_form_ref_udata:104,clobber:41,dimension:[30,14,103,2,8],runtimedyldmacho:72,noencod:84,resp:[71,16],remov:[69,33,94,95,5,7,97,8,71,98,50,93,84,83,102,20,75,77,57,23,60,61,108,41,87,63,26,66,90],rest:[23,74,71,25,84,104,26,90,112,33,4,106,5,16],checkcudaerror:8,fmadd:84,gdb:84,unmaintain:6,invalid:[31,69,73,1,71,72,40,41,42,55,46,2,48,49,12,13,14,15,16,18,19,53,103,20,75,104,76,23,60,108,25,92,110,88],loadable_modul:[10,66,76,74],cond_fals:[15,46],r13w:6,"__builtin_trap":25,ghostli:16,"__imp_":71,littl:[84,112,78],instrument:[67,23,31,25,103,110,95,3,71],r13d:6,r13b:6,exercis:[10,39,11],dwarfdebug:104,featurev8deprec:53,mrm2m:[53,116],around:[31,69,33,94,4,71,39,40,41,55,98,47,48,11,13,16,53,103,74,20,104,76,57,23,30,86,26,27],libm:[12,42,49,71,19],libc:[23,39,69,71,26,11,108,16],unveil:[44,17],libz:71,traffic:[46,30,15,16],dispatch:[88,16,18,
55],llvm_lib:61,world:[67,23,74,104,36,106,71],mrm2r:[53,116],find_program:61,intel:61,"__gxx_personality_v0":108,integ:24,timepassesisen:20,inter:[4,26,3,60,41],manag:[91,32,73,94,36,72,39,41,113,98,46,49,11,15,83,53,103,74,76,23,60,82,16,88,108,114],pushq:73,attrlist:21,a64:78,handshak:25,pushf:84,pred_iter:16,constitut:[10,16,112,78],pod:69,stryjewski:31,exig:16,seterrorstr:[40,46,2,48,49],issiz:16,definit:[78,84,86,56,3,112],exim:25,parseextern:[40,42,55,46,2,48,49],evolv:90,noop:71,nonintuit:38,notabl:[65,61,103,16,30,84,87,71],ddd:97,pointnum:74,power:[31,35,47,71,6,105,41,42,5,44,46,2,48,49,100,12,13,14,15,16,17,18,19,20,82,24,30,84,55,90],isloopinvari:16,blockaddress:71,image_sym_type_union:109,n1984:69,n1987:69,n1986:69,ispic:53,standpoint:16,isset:20,mingw32msvc:84,acc:16,spiffygrep:20,gplv3:64,aco:41,acm:[74,84],printmethod:53,compuat:60,act:[31,69,33,84,104,71,59,16],libtool:[23,98,66],industri:38,invert:[10,71,50],specialfp:116,srcloc:71,cflag:[66,51],surviv:[108,18,55]
,homeless:16,asymptomat:113,basictyp:71,ehptr:108,hex:71,movsx64rr16:84,kaleidoscop:[33,30,16],isloadfromstackslot:53,verbatim:[20,53],thedoclist:92,mantissa:71,conclud:[13,14,2,48],htpasswd:26,createjit:72,clenumv:20,categor:[31,20,21,53],conclus:[33,44],ifunequ:71,pull:[23,69,86,82],tripl:[112,87],dirti:[69,49],rage:37,agrep:34,inaccuraci:71,emitprologu:53,gcolumn:0,puls:25,uid:97,creat:[67,101,75,61,97,108,20,1,77,56,87,95,26,22,78,69,84],certain:[73,1,71,67,65,97,41,5,46,49,12,15,16,74,20,76,22,78,23,30,84,63,88,66,116],numregion:67,getnamedoperandidx:53,creal:[14,2],movsx32rr8:84,googl:82,discrimin:[69,84,71,102],collector:[98,112],emphas:[69,106],collis:[42,71,69,16,104],writabl:104,freestand:71,genuin:16,of_list:[12,13,14,15,18,19],benchspec:34,bpf_ldx:84,numexpress:67,spiffysh:20,allowsanysmalls:16,mask:[74,69,84,5,57],shadowlist:53,tricki:[74,76,69,86],mimic:69,createuitofp:[40,42,46,2,48,49],prealloc:16,cpp:[69,0,33,4,99,5,65,40,8,42,55,98,46,2,48,49,10,101,53,74,20,104,76
,21,23,61,25,84,87,66],cpu:[92,53,33,25,1,9,35,76,77,112,57,80,84,71,30],illustr:[44,42,71,20,46,104,49,76,90,78,55,12,15,16,17,18,19],labeltyp:16,scc:60,dw_at_apple_properti:104,mno:30,fntree:33,astcontext:69,rewrit:[31,60,102,53,73,30,46,69,15],add16ri:6,incap:[39,11,112],add16rm:6,dsl:[6,100],tail:112,add16rr:6,norm:[66,29,116],getframeinfo:[84,53],"102kb":20,gcov_prefix_strip:95,candid:91,element_typ:[12,13,14,15,19],attr0:112,attr1:112,strang:[69,78],condition:[74,1],misoptim:3,quux:69,pedant:61,sane:[44,61,17,86],small:[69,33,34,94,37,4,71,67,38,40,8,113,44,10,50,16,17,102,103,74,20,104,76,80,83,25,84,110,26,88,112,27,30],release_xi:94,dsa:60,mount:23,"__image_info":71,sync:[23,25,92,86,8],past:[40,82,53,103,16,69,2,26,73,14,71,116],pass:24,howev:[91,69,0,73,34,47,36,70,4,71,6,72,39,97,41,98,46,2,48,49,10,11,12,13,14,15,16,103,74,20,104,76,22,78,23,82,83,84,85,86,63,64,26,88,112,27,66,106],suboptim:30,trick:[38,46,102,71,44,9,21,26,16],deleg:[108,69,71,86],xor:84,registerregal
loc:76,clock:[76,71],section:[84,61,97,24,54,112,1,41,68,86,69,78,80],delet:[23,84,97,8,33,25,41,5,83,64,69,71,98],succinct:1,letlist:29,contrast:[102,42,108,84,76,19],hasn:[76,103,16,49],full:[23,101,69,61,99,24,41,84,9,47,87,86,79,26,27,111,94,115,98],hash:[23,41,33,30,84,26,71,16],vtabl:[69,5,56],unmodifi:73,tailcal:84,blocknam:112,inher:[71,98,16],parenthesi:[55,69,18],dw_tag_arg_vari:[40,71],islvalu:69,simpleproject:61,myownp3sett:104,shufflevector:[5,78],prior:[67,23,108,20,84,47,76,26,112,27,71],lto_module_get_symbol_nam:90,pick:[84,61,103,74,25,62,9,69,78,80],action:[84,3,69],narrowaddr:71,token_prec:[12,13,14,15,18,19],via:[72,31,84,23,90,75,9,87,99,64,91,22,108,79,66,71],depart:[69,97],dw_tag_namespac:104,ifcond:[40,46,2,48,13,14,15],vim:[23,106,6,66],memrr:53,image_sym_class_member_of_union:109,ifcont:[40,46,2,48,13,14,15],unbias:59,decrement:108,select:78,x44:109,functionaddress:91,llvm_doxygen_qch_filenam:61,targetselect:[40,46,2,48,49],objectivec:71,isconst:[16,112],mo
re:[61,24,41,84,86,87,112,83],isintegerti:16,door:102,tester:68,hundr:50,f3_2:53,zeroext:[71,112],addcom:74,webkit:[88,71],multiset:16,compani:26,cach:[72,31,40,61,41,16,84,35,104,76,88,86,71],uint64:[91,88],llvm_on_unix:4,enable_if:102,sparcv8:71,at_apple_properti:104,x86callingconv:53,isnullvalu:33,returntyp:[74,71],learn:[23,39,69,82,71,46,106,11,33,15,16],cmpinst:16,add_librari:61,bogu:76,scan:[76,39,84,74,33,25,1,77,49,10,21,11,12,80,69,30],challeng:[73,14,69,2],registr:[74,98,105,99],accept:[23,69,102,24,8,5,20,98,94,64,36,26,22,71,33,82,28,16,29,116],pessim:[91,31],x86instrinfo:53,v_reg:84,huge:[23,69,10,21,26,6],llvmgrep:23,readobj:68,attrpchwrit:21,clangxx:10,appenduniqu:71,simpl:[69,1,36,5,67,65,41,83,102,103,74,20,77,78,80,111,59,23,61,84,86,26,112,27],isn:86,loophead:[71,2,48],plant:76,referenc:[33,71,40,42,55,46,2,48,49,12,13,14,15,16,18,19,53,20,104,56,111,60,90,64,112,29],spillalign:53,variant:[76,31,53,16,20,10,27,88,71,13,12,4,14,15,5,17,18,19],unsound:73,plane:[14,
2],dllvm_use_sanit:25,maywritetomemori:[16,86],thought:[29,84,71,73],circumst:[53,5,46,49,76,71,108,12,66,15,16],github:[23,25,16,82,52],arcanist:[38,82],author:[84,26,69,98],llvmbitcod:65,imm_eq0:6,atan2:[44,17],nvidia:[84,8],returns_signed_char:71,constitu:[13,48],ith:16,trade:[83,16],i386:[79,84,71],paper:[38,69,84,16,105],vec2:[71,16],vec0:71,vec1:[71,16],bou_unset:20,nifti:[76,13,39,11,48],bpf_jmp:84,alli:71,bypass:71,superflu:103,slight:22,targetselectiondag:[65,84,53],image_sym_type_void:109,argsv:[40,42,46,2,48,49],cond_next:[15,46],authent:[114,105],achiev:[70,61,90,71,86],tokcodefrag:29,lto_module_is_object_file_in_memory_for_target:90,found:[31,62,108,0,32,84,94,36,37,70,4,71,38,40,97,8,42,5,46,2,10,14,15,16,51,19,53,74,20,104,76,23,61,107,83,30,41,87,92,26,113,66,90,25],gettermin:16,errata:105,bpf_mem:84,quesion:33,"0b000011":53,procedur:[60,105,44,33,20,94,3,78,16,17,51],realli:[65,69,61,20,86,26],notabili:30,loweralloc:76,getcalleesavedreg:53,reduct:69,reconstitut:71,f
tp:23,massiv:[66,21,45],ftz:8,stackframes:74,research:[38,34,65],sparingli:50,x86genregisterinfo:[84,53],occurr:[5,112],ftl:[88,71],loopbb:[40,46,2,48],isfirstclasstyp:33,distoth:66,mrm0r:53,polyhedra:30,numabbrevop:112,believ:[69,71,2,48,49,26,12,13,14,16],"__cxa_begin_catch":108,mrm0m:53,fnptrval:71,xxxend:16,struggl:23,amper:35,testament:[44,17],ge_missing_jmp_buf:69,new_then_bb:[13,14,15],instprint:21,dw_at_high_pc:104,curesult:8,unprofit:31,number:[78,41],sometim:[23,26,112,102,53,31,5,20,92,69,83,10,21,71,33,66,103,84,16,98],obj_root:[23,87],horribl:69,dw_at_low_pc:104,"0xxxxxxxxx":104,exponenti:[31,20,71],checkpoint:108,unrecogniz:111,functionast:[40,42,55,46,2,48,49],illeg:[31,84,103,8,16,20,0,49,73,71,25,98],mcjit_module_:49,dfa:[84,21,115],fptr:[40,46,2,48,49],relationship:[70,71,5,74,33],"0x7":84,bio_writ:25,dagarglist:29,consult:[23,60,97,38,76,36,66],compute_pgm_rsrc1_vgpr:24,aad:84,llvm_svn_rw:99,tokstr:29,seamlessli:90,reus:[84,104,76,26,88,71],arrang:[76,31,102,74,20
,84,10,71],comput:[67,69,105,41,84,50,37,83,59,98],packag:[23,61,9,35,94,66,59],qpx:[30,71],returns_twic:71,flto:64,equival:[31,69,33,71,39,8,49,11,16,103,74,20,22,78,80,23,24,108,84,86,112,66,29,116],odd:[20,26,69,30,62],self:[67,84,112],also:[61,112,24,41,84,86,87,3,78,83],without:[67,112,101,69,61,97,113,20,84,86,87,83,95,26,78,108,80,99,5,59],ex2:8,ptrb:8,ptrc:8,coff:[84,105,112],ptra:8,pipelin:[76,31,40,53,8,73,30,46,2,48,49,10,50,112,37,12,13,14,15,71],unset_vari:66,rhs_val:[12,13,14,15,19],plai:[39,33,44,76,11,29,17],"_z3foov":71,plan:[23,98,8,74,30,84,47,26,16,6],exn:71,ptr7:71,alu32_rr:70,"0x14c":109,ptr2:71,ptr3:71,ptr0:71,ptr1:71,ext:78,abnorm:[4,50],exp:3,rewritestatepointsforgc:74,pubnam:104,gold:[23,84],getsymbolnam:53,xcode:[23,61,99],gcmetadaprint:74,session:[106,16,99],tracevalu:31,affin:30,ugt:71,impact:[69,74,16,104,50,71],cr0:71,cr7:71,addrri:53,writer:[84,45,86,112,115],solut:[23,98,61,20,84,86,78],printdatadirect:53,baseregisterinfo:21,llvm_executionengin:[12,1
3,14,15],factor:[69,0,16,84,71,6,116],bernstein:104,i64imm:53,llvm_obj_dir:98,agg3:71,agg2:71,mainten:[70,26,90],bitmap:112,n1757:69,f2_1:53,synthet:53,f2_2:53,synthes:[12,65,69,104,49],"__stack_chk_fail":71,machinememoperand:86,coerce_offset0:5,link_compon:[66,51],set:24,image_sym_class_member_of_enum:109,seq:109,creator:[76,61],overwhelm:[44,17],startup:[23,69,8,1,63,71],cbpf:84,see:[61,112,24,41,84,86,87,3,78,83,59],sed:[23,98,66],sec:71,sea:[105,24],overboard:69,analog:[74,71,116,16,73],seh:[108,71],v_mov_b32:24,reglist:53,parsenumberexpr:[40,42,55,46,2,48,49],lto_codegen_cr:90,topmost:74,restructur:[108,30],subdir:66,documentlisttrait:92,thrive:38,signatur:[23,97,73,30,84,76,78,37,71],machineoperand:[84,53],javascript:[71,39,11,88],libnam:[76,66,101],myocamlbuild:[12,13,14,15,19],disallow:[103,73,20,88,27,71],nohup:32,dividend:[84,71],proj_src_dir:66,sparctargetlow:53,last:[69,0,73,1,94,102,71,40,97,42,5,44,2,10,14,16,19,53,20,76,108,30,84,26,112,106,29,116],operarand:3,cmake_c
xx_flags_relwithdebinfo:23,whole:[31,69,33,34,71,65,97,55,9,48,49,10,12,13,16,18,74,76,57,25,84,26,27],lower16:22,sink:[20,41],load:[61,78,41,86,112,83],episod:[13,48],nakatani:84,dw_tag_namelist:104,hollow:92,lex:[40,44,12,13,14,15,29,17,18,19],functionpass:[31,16,53,41],"0x100000f24":79,getsourc:23,worthless:69,static_cast:[40,46],devic:[7,96,107,8,93,75,35],perpetu:26,"0xf":116,llvm_abi_breaking_check:61,devis:51,firm:66,gettokpreced:[40,42,55,46,2,48,49],fire:[108,69,83],func:[67,7,71,76,12,13,14,15,16,18,19],registerpass:76,rdtsc:71,uncertain:69,straight:[41,42,33,44,84,116,55,57,4,73,16,17,18,19],erron:[23,20],histor:[69,103,16,86,10,71],durat:[76,84,41],passmanag:[72,20,16],seed:[25,43],error:[84,61,86,87,41],dvariabl:61,v1size:41,pound:[66,92],binutil:[114,23,105,9,64],genregisternam:84,miscommun:26,inst_invok:112,chase:62,i29:71,decor:104,irrelev:[103,41],initializerconst:71,i20:71,i24:71,x64:[114,23,5,108],shorter:30,funni:[15,46],decod:[71,112],dllvm_enable_sphinx:23,buil
t_sourc:66,global_end:16,bitread:27,predreg:70,dw_at_declar:104,stack:41,recent:[23,32,108,25,92,74,26,71],call32r:116,eleg:[39,55,48,49,11,12,13,18],rdi:[84,88,6],dw_apple_property_readwrit:104,llvm_unreach:[33,69],person:[108,62,112],parse_prototyp:[12,13,14,15,18,19],expens:[91,31,69,53,33,20,86,76,108,16],call32m:116,llvm_tablegen:61,crosscompil:[84,9],else_v:[13,14,15],debug_level:20,simd:[80,77,71,0],numshadowbyt:88,sidebar:94,lfoo:84,smooshlab:38,eager:16,input:[98,93,1,95,37,70,5,7,96,41,113,45,83,20,75,77,79,80,58,23,84,110,111,89,115],earlycs:50,transpar:[65,69,82,103,16,20,90],subfield:116,intuit:71,dw_tag_ptr_to_member_typ:[71,104],"0x00000048c979":25,formal:[71,116,16,6,33],llvmgettargetmachinedata:30,todefin:21,atomicexpand:86,ivar:104,stylist:69,threadsaf:74,image_sym_type_nul:109,parse_toplevel:[12,13,14,15,18,19],ii32:116,x86framelow:84,moduleid:[10,42,19],encount:[71,111,84,16,53],image_file_debug_strip:109,sampl:[20,3,110],sight:[15,46],itanium_abi_tripl:10,attrvi
sitor:21,libssl:25,"_bool":[15,46],p5i8:8,llvm_obj_root:[10,66,34,51],xxxgendagisel:53,agreement:26,wget:[23,25],materi:33,codeemittergen:21,find_first_of:49,image_sym_type_long:109,condbranch:53,oneormor:20,getinsertblock:[40,46,2,48],putchard:[39,40,42,46,2,48,49,11,12,13,14,15],primarili:[23,7,45,31,74,47,25,1,2,54,35,27,14,84,16,58,116],seamless:64,xxxinstrformat:53,requires_rtti:63,contributor:26,volcan:24,pcre:25,occupi:[71,97],span:[76,69,6],submit:83,custom:[113,69,84,5,61],getpointeetyp:30,createcondbr:[40,46,2,48],parse_arg:[12,13,14,15,18,19],expound:104,subgraph:31,atop:74,nodupl:71,atoi:71,link:[101,69,61,97,41,113,84,86,68,56,95,87,83],atom:24,line:[84,93,1,95,36,69,37,5,67,7,96,97,8,113,98,99,83,74,20,75,77,71,57,79,80,58,111,23,60,61,107,108,25,62,86,87,110,63,64,26,27,66,115],mitig:74,workitem_vgpr_count:24,cie:60,cin:98,intim:69,hex8:92,"0xffffffff":[71,112],doc:[113,61,87],call_site_num:108,"char":[69,0,99,71,67,40,97,8,42,55,46,2,48,49,12,13,14,15,16,17,18,19,53,
103,20,104,76,25,41,90],gcfunctioninfo:74,srcvalu:73,linkonceodrlinkag:16,tok_unari:[40,46,2],intrepid:[55,18],int32ti:16,xxxcodeemitt:53,ud2a:84,kwalifi:109,scrape:1,download_prerequisit:23,disp32:84,isnotduplic:6,"0x000000000059c583":99,caml:[17,18],lang:20,mayalia:41,land:[73,26,71,47,108],x86codeemitt:53,algorithm:41,agg:71,getregisterinfo:[84,53],fresh:[23,25,66],hello:[67,23,36,71,116],mustalia:41,llvmcontext:71,"0xffff000000000002":88,code:[112,24,41,56,86,3,78],partial:[84,60,71,115],resultv:71,scratch:[71,84,16,53],personalityfn:112,setcc:[84,16],globallisttyp:16,printimplicitdef:53,young:16,send:[7,96,93,77,84,86,26,50,115],tr1:16,sens:[39,86,61,97,103,41,42,71,20,84,47,104,69,11,73,16,98,19],getprocesstripl:40,sent:[38,26,82,93,94,77,73,110],unzip:[32,23],flagscpumask:92,clearresourc:84,registeredarg:74,tri:[31,61,53,33,44,84,83,76,106,71,17],bsd4:97,setconvertact:53,dname:20,complic:[23,65,69,102,53,0,74,25,47,86,10,36],trc:84,scalabl:41,tre:31,fewer:[74,31,73],"__llvm_c
ovmap":67,race:[71,16,86],build_uitofp:[12,13,14,15,19],vehicl:69,use_s:16,monospac:106,natur:[23,69,102,103,74,5,20,86,26,90,108,71],odr:71,wors:[69,84,71,78],proj_obj_dir:66,psubu:10,rauw:[33,60,16],video:16,ueq:[46,15,71],index:[67,112,97,41,74,108,20,84,110,22,50,78],step_val:[13,14,15],targetregisterclass:[84,53],asmwrit:[74,65],getanalysisusag:41,henceforth:[85,71],paramti:112,image_scn_align_64byt:109,dyn_cast_or_nul:16,lllexer:65,leb:67,dw_tag_gnu_template_param_pack:71,mappingtrait:92,len:71,short_enum:71,bitstreamwrit:65,rglob:7,let:[67,62,82,102,8,33,20,41,104,5,106,63,114,90,71,73,70,103,84,16],ubuntu:[23,9,35],ptx30:84,openmp:26,great:[69,74,44,84,2,76,26,50,66,14,16,17],survei:105,dllvm_enable_doxygen:61,force_off:61,technolog:[90,39,11,30],rdx:[73,84,88,6],flagshollow:92,cta:8,ifloc:40,somemap:69,sgt:71,pf1:33,pf0:33,sgn:71,llvm_enable_cxx1i:61,sge:71,movsx32rr16:84,"__________":16,getnumparam:16,eltti:[40,112],zip:[23,66],commun:[69,41,98,99,26,50],my_fmad:8,doubl:[3
1,84,33,36,71,39,40,105,102,42,5,44,46,2,48,49,11,12,13,14,15,16,17,18,19,53,20,92,112,55,66,116],upgrad:[26,54],next:[69,83,112],doubt:[106,102],n2439:69,commut:[31,84,53,41],fpregsclass:53,ebp:[84,6],avx512:71,gladli:[23,36],firstcondit:16,bunzip2:23,objectslo:66,uvari:61,get_instrinfo_operand_enum:53,folder:[23,61],devmajor:8,erasur:16,intregssuperregclass:53,thin:16,gc_root:73,statepoint_token:73,dw_form_data4:104,n2431:69,weaker:71,dw_form_data1:104,dw_form_data2:104,n2437:69,process:[83,59,87,86],shadowbyt:88,preformat:106,high:[112,41],wavefront_s:24,fprintf:[40,42,55,46,2,48,49],streamer:84,dw_ate_signed_char:71,msvc:[22,69,84,16],adc32mi8:6,visitsrl:65,delai:[33,30,16],"__builtin_call_with_static_chain":30,saveguard:30,infeas:60,allocainst:[69,16,46,40,15,71],stand:[76,69,16,84,10,26,55,71,18],npo:49,nullpointerexcept:91,overridden:[23,71,41],singular:[69,16],add32ri:6,xc3:109,loc0:88,loc1:88,xc7:109,xc4:109,x86registerinfo:[84,53],dw_at_apple_property_attribut:104,dw_tag_c
lass_typ:[71,104],alloc:41,essenti:[53,74,16,75,86,112,33,29],sdiv:84,counter:[3,83,86,24,110],robot:38,element:[65,69,112,41,74,84,56,78],liveintervalanalysi:84,unaccept:26,allow:[112,84,61,97,41,113,77,1,69,86,56,95,3,78,5],retval:[40,42,46,2,48,49,71],stepexpr:[40,15,46,2,48],movl:[71,5,88,73],decltyp:[69,71],fstrict:71,movi:69,typecod:65,move:[23,84,97,31,74,16,30,41,69,86,94,26,88,100,73,71,6,98],stacksav:47,movz:[71,78],movw:[71,22],movt:22,ofstream:20,movq:[73,88],perfect:[26,78],disambigu:[50,41],chosen:[69,74,84,1,78,71],cond_tru:[15,46],lastinst:53,decad:6,therefor:[67,31,84,103,8,74,16,20,92,86,76,26,88,78,108,28,71],python:[23,39,32,30,1,9,10,74,36,11,29],initializenativetarget:[40,46,2,48,49],overal:[82,103,74,108,84,48,21,26,13,71],innermost:0,facilit:[69,16,92,104,26,71,51],smovq:84,fcc_val:53,anyth:[31,69,36,6,42,98,48,49,12,13,16,19,102,104,77,80,23,84,86,87,26,88],cross_ov:25,xvjf:23,truth:[13,71,48],"0b111":116,llvminitializesparcasmprint:53,compute_xx:8,idxmask:7
1,subset:[39,103,8,71,34,1,41,104,10,26,11,16],"0x7fffffffe040":99,bump:[74,85,16],"0x400":104,lsampl:51,"static":[84,83,86,41],uiuc:26,differ:24,unique_ptr:[40,46,2,48,49],variabl:[86,41],contigu:[71,16,104],myregalloc:76,tok_if:[40,46,2,48],tok_in:[40,46,2,48],memorysanit:71,shut:[69,53],initializepass:41,bpf_dw:84,unpars:[55,1,18],tempt:[4,69,23],image_file_system:109,greedi:[84,20,77],shtest:1,spill:[73,84,88,53,80],runtimevers:[71,104],could:[91,69,1,70,5,41,71,98,47,83,102,103,74,20,57,23,61,25,84,86,87,64,26,114],lexer:25,scari:[39,11,17,44],length:[67,97,20,1,78,112],enforc:[69,74,5,20,84,86,26,88,71,16,116],outsid:41,scare:26,spilt:84,softwar:[74,80,26,69],denorm:[92,71],add_pt:70,spaghetti:[44,17],selectiondagnod:53,fcontext:40,owner:[84,97],stringswitch:21,add_pf:70,featurev9:53,sparcgensubtarget:53,licens:69,system:[65,84,61,97,103,54,74,105,20,41,77,87,26,78,80,69,98],parse_oper:[14,15],gcse:[76,31,16],termin:[7,45,96,107,24,108,93,20,1,69,3,50,75,84,83,97],f_inlined_in
to_main:79,llvmgcc:66,returnindex:57,ldrex:86,gotcha:69,endexpr:[40,15,46,2,48],baseclasslist:29,"12x10":71,haven:[76,34,69,71],datatyp:[20,84,16,17,44],bother:[15,46],arg_end:16,setfoo:71,featurevi:53,stricter:[5,86],f1f2:33,xxxregisterinfo:53,tdtag:21,getzextvalu:16,viewer:69,op_end:16,var_arg_function_typ:19,clearli:[69,26,88],optimis:12,mdstring:3,"0x00002200":104,tramp1:71,accuraci:[31,71],at_typ:104,rvalu:69,type_of:[12,13,14,15,19],courtesi:26,griddim:8,poison4:71,poison3:71,poison2:71,zec12:30,incfil:66,setloadextact:53,comparison:[102,103,86,3,50,71],placement:[66,50],stronger:[71,16,86,73],parsevarexpr:[40,46],face:[76,4,69,21,85],isbranch:6,orcmcjitreplac:30,brew:16,linkonc:112,fact:[69,71,39,97,41,42,98,46,2,49,11,50,12,14,15,16,102,103,20,76,23,60,108,30,84,26,27,29,116],movslq:88,dbn:23,borderlin:69,truedest:71,dbg:[83,71],bring:[39,69,74,73,11,16],rough:[116,29,86,103],trivial:[31,65,69,82,53,41,71,20,84,47,104,76,55,78,86,4,103,16,44,98],redirect:[10,113,25,40,94],is
stor:84,getelementptr:[67,41,84,56,37,5],image_sym_class_argu:109,should:[69,1,95,3,65,97,41,113,83,20,75,77,78,80,59,61,24,108,84,86,87,26,112,115],jan:97,suppos:[84,102,33,92,76,108,27,4,71],create_funct:[12,13,14,15],find_first_not_of:49,opreand:16,nonzero:[112,116],hope:[69,74,33,63,26,73],meant:[67,29,23,32,33,75,36,38,66,106,71,116,16],insight:[67,71],notat:[20,97],familiar:[23,40,102,24,8,33,44,84,48,76,66,13,17],memcpi:[86,41],autom:[23,82,84,21,26,6,51],group_segment_align:24,smash:71,isatleastreleas:86,symtab:16,machineconstantpool:84,reid:4,dw_ate_sign:[71,104],stuff:[20,84],booltmp:[40,42,46,2,48,49,12,13,14,15,19],inlni:79,comma:[20,92,48,87,13,28,71,116],unimport:[32,73],cmake_cxx_compil:23,temporarili:[66,83],binary_nam:79,oprofil:[63,61],writetypet:65,wire:98,op_iter:16,fakesourc:66,compute_factori:99,verilog:30,live_iter:74,sectionmemorymanag:[72,40,46,2,48,49],unrecurs:[15,46,40],email:[23,39,60,82,38,86,26,11],superword:[60,0],dislik:26,linkonceanylinkag:16,memri:
[84,53],mrecip:30,use_iter:16,doxygen:[61,87],scalaropt:101,valgrind:[10,113,1,62],sdtc:53,etc:[69,61,41,113,84,86,26,112,89,5],"0fbf317200":8,vk_basicblock:69,preheader_bb:[13,14],position_at_end:[12,13,14,15,19],exprprec:[40,42,55,46,2,48,49],indici:112,distil:10,bininteg:29,rpcc:71,llvm_external_:61,triniti:105,insuffici:[4,71,35,53,104],path_to_llvm:23,immedi:[31,69,73,86,71,72,39,97,8,98,46,49,11,12,15,16,53,76,24,108,84,41,88,112,28,116],hex16:92,deliber:[69,88],image_sym_type_char:109,togeth:[31,69,0,33,34,71,67,39,97,41,42,5,44,2,48,10,11,13,14,16,17,18,19,74,55,20,75,104,76,111,78,59,107,83,25,84,110,26,113,27,30,116],allocationinst:16,sphinx_output_man:61,rbx:[84,6],dataflow:[46,15,71],cvt:8,reloc_absolute_dword:53,rbp:[84,6],suport:16,llvm_tools_binary_dir:61,p0f_isvoidf:73,lto_module_create_from_memori:90,objmakefil:66,auxiliarydata:109,cbtw:84,site:[31,41,74,108,1,47,56,36,71],sn_map:33,archiv:68,mybuilddir:61,incom:[53,71,84,46,48,26,13,14,15,16],surprisingli:[23,55,49
,50,12,18],greater:[31,69,112,53,8,74,33,84,95,3,78,37,103,71],mutat:[74,69],referenti:31,basicblocklisttyp:16,lex_com:[12,13,14,15,17,18,19],dbgopt:104,preserve_mostcc:[71,112],phi:[84,69,112,37],kernarg_segment_align:24,expans:[67,53,71,84,95,57,29],upon:[72,98,53,74,16,75,104,26,66,71,51],foldmemoryoperand:[84,53],php:82,expand:[67,65,84,116,5,57,10,95,69,50,37,33,66,58,115,71,6,98],micromips32:30,off:[69,73,71,6,39,40,97,8,42,44,46,2,48,49,10,11,12,13,14,15,16,17,19,23,61,83,30,84,63,26],mention:[112,38,69,61,102,24,73,16,20,84,85,104,78,33,27,71,116],diversifi:25,argnam:[40,42,55,20,46,2,48,49],exampl:[86,24,41],command:[69,61,41,113,84,5,87,83],svnup:23,filesystem:[1,9],outputfilenam:20,newest:22,paus:[74,41],xec:109,glue:[84,98],web:26,makefil:[101,84,61,87,54],blockfrequencyinfo:[38,59],exempt:69,ptx31:84,target_opt:87,nonnul:[71,50],nvt:53,unintrus:71,dest:71,goingn:16,piec:[62,94,69,71,40,42,55,44,46,2,48,10,13,14,15,83,17,18,19,103,104,23,25,84,26,112,27,116],placesafepoi
nt:74,core2:10,five:[108,20,84,16],addsdrr:116,xe8:109,recurr:31,desc:[76,20,53],addsdrm:116,resid:[112,8,74,25,104,76,78,71],emmc:35,loopinfobas:16,isus:84,objectbuff:72,byteswap:65,resiz:69,"0x29273623":104,captur:[71,39,40,42,5,46,2,48,49,10,11,12,13,14,15,83,18,19,55,20,104,84,88,112,65],vsx:[30,71],main_loop:[12,13,14,15,18,19],build_exampl:66,destarchivelib:66,i64:[53,8,5,84,104,3,88,78,73,103,71,6],emitglobaladdress:53,safepoint_token:73,flush:[72,69,8,35,12,13,14,15,71,18,19],guarante:[23,26,108,103,31,74,16,20,41,46,104,86,76,21,88,73,66,84,71,98],transport:30,ltmp1:73,"__syncthread":8,avoid:[84,83,112,78,41],image_sym_class_fil:109,arg_siz:[40,42,46,2,48,49,74,16],barlist:69,cmake_minimum_requir:61,stage:[38,53,8,32,33,20,84,94,95,55,113,90,18],"0x4200":104,c_str:[40,8,42,55,20,46,2,48,49,16,44],interven:88,nullari:[55,18],declcontext:102,bpf_mov:84,getbitwidth:16,not_nul:91,handleextern:[40,42,55,46,2,48,49],dw_tag_base_typ:[71,104],insidebundl:84,retcc_x86_32:53,takecall
back:16,waterfal:114,mere:[31,103,42,73,36,71,19],merg:[95,61,84,5,41],behind:[84,8,5,62,69,71,57,70,16],createsubroutinetyp:40,relpo:97,valuesuffix:29,multidef:116,textfileread:69,getmodulefornewfunct:49,p4i8:8,mandel:[14,2],mdnode:[3,71,104],"function":[78,24,41,86,112,59],reduc:[67,7,60,97,103,8,33,20,62,69,83,26,113,70,84,71],documentlist:92,getenv:4,dw_at_entry_pc:104,inst_cal:112,data16bitsdirect:53,lookup_funct:[12,13,14,15,19],evidenc:103,localexec:[71,112],otherwis:[31,92,33,1,35,94,95,69,37,71,67,7,40,96,42,5,44,45,9,2,48,49,50,46,12,13,14,15,16,17,18,19,101,54,74,90,20,75,76,77,89,80,58,59,93,60,61,107,24,73,83,25,62,86,108,55,112,113,66,115,29,116],problem:41,"int":[92,0,33,47,36,69,70,99,71,6,67,39,40,84,8,42,5,44,98,46,2,48,49,11,73,12,13,14,15,16,18,19,53,103,74,90,20,104,78,79,23,83,25,41,109,86,64,55,113,106,29,116],rightli:66,ini:27,ind:40,insertdeclar:40,ing:[31,69,42,46,49,12,15,19],inc:[23,53,84,76,21,70,66],bzip2:[23,66],nonetheless:71,optsiz:[71,112],libcxx:[3
2,30],lookup:[31,69,23,33,71,16],varieti:[69,35,39,105,97,41,42,2,48,49,11,12,13,14,16,19,74,104,23,60,108,30,84,86,88,112,27,29],getopt:20,liblzma:9,computearea:102,"0f3fb8aa3b":8,repeat:[31,32,33,104,83,108,28,71],defaultlib:36,kernarg_segment_byte_s:24,emitsymbolattribut:84,fexist:33,in0:71,in1:[84,71],in2:84,eof:[40,42,55,25,46,2,48,49,44],header_data:104,cumemfre:8,dumpabl:76,rabfik:97,eor:71,hashes_count:104,sourceloc:40,sm_20:[84,8],sm_21:84,untrust:26,child:[14,71,2,102],show_bug:25,rapid:26,"const":[67,65,69,102,41,74,90,20,84,47,71,25],r8b:6,r8d:6,deviat:[69,84,22],matlab:30,binoppreced:[40,42,55,46,2,48,49],thefunct:[40,42,46,2,48,49],r8w:6,rowfield:70,emploi:[71,16],printnextinstruct:16,getpar:[46,40,16,2,48],glibcxx_3:23,llvm_enable_ffi:61,cmd:82,upload:82,reg:[53,8,84,88,28,5,116],"0x2a":78,unmanag:73,red:71,add_rr:116,add_char:[12,13,14,15,17,18,19],externally_initi:[71,112],callcount:16,cmp:[71,84,16,31],abil:[65,75,84,44,74,71,20,92,46,2,48,104,99,28,13,14,15,16,17,
51],soutbio:25,hork:116,consequ:[23,41,16,83,10,88,108,66,71],image_scn_mem_shar:109,llvmbuild:54,disk:[69,90,25,1,104,27,4,71],runfunctionasmain:99,loop_bb:[13,14,15],qux:71,topolog:5,told:69,ontwo:71,somefunc:[69,16],mcoperand:84,pred_end:16,dw_op_bit_piec:71,myregisteralloc:76,dw_virtuality_pure_virtu:71,optzn:[40,62,46,2,48,49,12,13,14,15],"0f7f800000":8,aka:[40,41,42,71,44,84,46,2,48,49,55,12,13,14,15,16,17,18,19],werror:64,dcmake_cxx_link_flag:23,idnam:[40,42,55,46,2,48,49],instr:[67,74,84,110,95,115,116],setgc:74,sspstrong:71,ftoi:53,total:[31,33,34,85,104,86,76,112,37,71,16],bra:8,highli:[74,16,25,84,46,50,15,71,51],bookkeep:[31,16],plot:[14,2],postincr:69,afterward:31,foster:[4,26],shortest:[33,29],simplifycfg:113,setreg:84,v_mul_i32_i24_e32:24,iscommut:6,llvm_enable_p:61,reinterpret:78,numberofauxsymbol:109,toolkit:[16,8],tblegen:21,valueenumer:65,armgenasmmatch:21,insignific:[88,45,71],err:[76,25,16,8],restor:[40,53,85,84,46,2,48,47,112,108,13,14,15,71],next_prec:[12,13,1
4,15,18,19],work:[69,1,95,37,5,67,65,105,41,113,98,83,54,74,20,77,59,61,24,108,84,86,87,110,26],foo_ctor:47,coalesc:[80,45,16,84],viewcfgonli:[16,48],unnam:[29,20,69,71,31],"16gb":114,novic:61,autodetect:[80,77,95],dllvm_enable_assert:23,u64:8,indic:[67,26,61,97,41,108,20,1,69,112,3,22,78,37,84,59],llvmcore:[32,51],liter:[91,69,71,40,97,42,55,44,46,2,48,49,12,13,14,15,16,17,18,19,20,92,112,28,29,116],unavail:[86,53],constantstruct:16,createinstructioncombiningpass:[40,46,2,48,49],str2:116,ordinari:[67,92,71],lexloc:40,sever:[31,69,32,33,34,1,37,4,71,6,67,38,39,97,41,42,98,48,10,11,13,16,51,19,53,74,20,65,104,76,21,57,23,61,107,83,25,84,87,110,112,108,66,90,30,116],verifi:[84,83,56,112],bindir:[66,101],ssl_set_bio:25,recogn:[31,40,34,44,33,20,84,48,90,13,71,17],superreg:53,rebas:23,lad:20,chines:23,after:[61,112,24,41,84,86,87,78,83,59],hex32:92,lab:[114,38,25],law:69,demonstr:[67,102,53,42,16,30,49,12,71,19],sparccallingconv:53,domin:[74,23,69,71],sgpr:71,opaqu:[112,78],lto_module_d
ispos:90,recompil:[91,41,30,48,88,78,13],icmpinst:16,buildslav:114,noitinerari:[6,53],order:41,movhpd:5,ud2:84,diagnos:[76,45,0],use_camlp4:[12,13,14,15,18,19],offici:84,opnod:53,llvmsystem:66,pascal:71,noimm:6,getnexttoken:[40,42,55,46,2,48,49],flexibl:84,getattribut:33,bytecod:[30,112,87],isellow:21,setoperationact:[84,53],induct:[23,41],them:[31,92,108,32,33,34,95,36,69,70,4,55,71,67,38,39,40,84,8,42,5,44,98,9,2,48,49,10,11,50,46,12,13,14,15,16,17,18,19,53,103,74,102,20,104,76,111,78,57,97,23,61,107,73,83,30,41,85,86,87,110,63,26,88,51,112,113,27,66,28,90,116],dw_apple_property_atom:104,thei:[91,31,84,108,0,32,33,34,1,35,94,69,37,70,4,71,6,67,38,39,102,97,41,42,5,45,46,47,48,49,10,11,50,73,12,13,15,16,98,18,19,53,103,74,55,20,75,104,76,21,78,80,111,23,60,83,25,92,86,87,26,88,51,112,113,27,66,28,30,116],fragment:[29,54,74,16,34,84,104,71,116],safe:[41,113,20,84,86,26,50,112,83],printccoperand:53,scene:16,"break":[23,65,26,61,74,108,20,84,69,94,63,3,78,57,28,71],bang:29,astread:21,
selti:71,lifelong:38,stdarg:71,"__cxa_rethrow":108,sequentialtyp:16,monolith:[26,85],"0x000003cd":104,const_op_iter:16,network:[30,84],visiticmpinst:83,sprintf:49,lib64:[23,61],forth:78,image_file_relocs_strip:109,multilin:[1,29,116],srcmakefil:66,registeralias:21,ms_abi_tripl:10,barrier:86,multilib:9,lltok:65,nth:69,fixm:[23,53,49],shadowstackgclow:74,debuglev:20,mvt:[84,53],lock:[76,71,16,86],angl:[92,69],zerodirect:53,regress:[23,69,32,83,34,1,87,94,26,66,5,51],gcregistri:74,subtl:[39,103,55,25,48,49,11,12,13,18],boiler:20,render:[71,14,84,16,2],refin:[84,16,41],subreg:53,i48:71,setcondcodeact:53,llvm_build_32_bit:61,"0x00000000016677e0":99,ispredic:6,libllvmir:16,image_file_bytes_reversed_hi:109,isalpha:[40,42,55,44,46,2,48,49],baseclasslistn:29,power7:30,john:[26,69],"40th":[44,17],headerdata:104,getdatasect:74,inexact:71,tee:83,registerpasspars:76,gcmetadataprinterregistri:74,analyzebranch:53,hashdata:104,llvm_build_root:61,target:[61,112,24,56,87,86,78],provid:[61,24,41,84,86
,87,3,112],cppflag:[66,51],minut:23,uint64_t:[33,92,49,57,16,59],hassse2:116,hassse3:116,emitfunctionstub:53,contenti:69,frontend:[67,91,45,86],n1737:69,manner:[67,23,53,103,108,16,84,86,87,26,73,71],strength:[20,84,71,50,86],recreat:[23,92,71],is_nul:91,laden:[39,11],latter:[53,73,84,86,55,33,71,18,16],image_rel_amd64_secrel:22,"0x400528":79,postcal:74,llvm_doxygen_qhp_namespac:61,smul_lohi:84,attrdump:21,bruce:16,cumodul:8,dllvm_use_sanitize_coverag:25,lexic:[69,73,84,104,71,98],keystrok:69,retcc_sparc32:53,passthru:71,valuerequir:20,instritinclass:6,bracket:[69,108,92,104,26,27,71],argmemonli:71,notion:[69,102,84,104,48,49,76,26,12,13,71],bpf_jeq:84,confront:[50,103],md_prof:3,opposit:[66,60,97,92],"__cxa_throw_except":108,overload:[65,102,53,8,16,2,76,73,66,14,71],buildbot:1,identifi:[84,61,97,83,20,1,56,69,112,108,5],involv:[31,92,73,94,69,70,4,71,65,40,41,55,46,48,50,13,15,16,18,53,103,74,59,30,84,86,66],just:[31,92,32,33,34,1,95,36,69,37,102,4,71,6,98,67,39,40,84,41,42,5,44,4
5,9,2,48,49,10,11,46,12,13,14,15,16,17,18,19,53,103,55,20,104,76,21,22,78,80,111,59,97,23,82,73,83,25,62,85,86,87,64,26,88,51,112,108,27,66,106,116],the_funct:[12,13,14,15,19],"41m":20,wzr:71,sroa:60,baseopcod:[70,53],latenc:[80,84,71],callbackvh:16,govern:71,instlisttyp:16,predecessor:[31,84,71,50,59],showdebug:99,likewis:[23,71],tag_memb:104,llvm_include_tool:61,subtarget:[30,84,71,115],"__mips_isa_rev":30,didescriptor:104,numregionarrai:67,lit_arg:10,fomit:84,isosdarwin:40,emb:[71,39,11,112],cleanli:[76,69,26,71,94],st_uid:97,cudevicegetcount:8,memorywithorigin:61,chapuni:38,dw_ate_float:[40,71],eatomtypedieoffset:104,awar:[23,69,103,41,20,84,86,26,5],sphinxquickstarttempl:[106,87],unordered_set:16,awai:[31,69,102,74,5,44,104,59,76,90,71,16,17],getiniti:16,accord:[61,102,53,32,16,20,92,94,74,88,112,73,71,59],unsett:76,newnam:49,preprocessor:[67,39,61,53,20,98,49,95,11,12,66,16],isjumptableindex:53,memorybuff:69,image_file_machine_armnt:109,cov:68,ill:97,xmm0:[10,88,5,6,116],xmm1:
[6,116],calltmp:[40,42,46,2,48,49,12,13,14,15,19],ilp:[30,0],themself:26,com:[23,69,82,52,25,26,16],ctxt:92,con:[29,78],testcleanup:71,widen:[84,0],solari:23,resultti:71,excess:[80,25,77],getbasicblocklist:[46,40,16,2,48],permut:71,prologu:[74,112],wider:[65,86,103],add_instruction_combin:[12,13,14,15],goodby:106,speak:[13,14,2,48],degener:[31,15,46],"__builtin_expect":3,uint16:[91,88],debug_info:104,subscrib:[26,82],mallocbench:34,compatible_class:84,machineblockfrequencyinfo:59,hoist:[31,16,86,88,41],unclutt:4,binaryoper:[69,16],inhibit:71,ident:[31,69,33,71,97,41,5,46,48,49,10,12,13,14,15,16,17,18,19,74,104,78,84],aix:[84,105],gnu:[76,23,69,61,97,53,108,84,35,87,10,64,111,114,66,71,116],zlib:[23,61],cxx_statu:69,aim:[67,69,113,83,26,78,4,71],scalarrepl:86,pairwis:41,publicli:[16,104],aid:[74,30],vagu:26,keytyp:104,opt:[113,69,83,68,41],xstep:[14,2],printabl:[71,97,53],conv:98,theexecutionengin:[40,46,2,48,49],extractloop:31,shadowstackgc:74,uint32x2_t:78,cond:[40,53,98,46,2,48,13
,14,15,71,59],int_of_float:[14,15],dw_tag_label:104,old_val:[13,14,15],descent:[55,44,2,14,17,18],incorrectli:[42,44,69,19],perform:[65,75,61,97,24,41,108,20,1,77,86,87,26,78,69,84,83],amount:[31,62,33,69,71,6,65,44,98,49,12,83,17,74,20,75,76,77,80,16,84,85,21,88,108,66],descend:71,doxgyen:61,addintervalsforspil:84,fragil:[25,5],code_own:26,evil:[16,6,78],hand:[31,84,32,33,69,4,6,102,42,55,44,2,49,11,12,14,16,17,18,19,53,103,74,21,57,61,30,92,86],fuse:[31,71,80],use_llvm_scalar_opt:[12,13,14,15],disassembleremitt:21,operandv:[40,46,2],kept:[76,26,69,60,41],undesir:71,scenario:[10,83,98,16,86],incorpor:[84,16,102],thu:[31,84,33,69,71,67,41,42,55,98,2,48,49,10,50,73,12,13,14,15,16,18,19,74,20,104,76,59,82,83,62,26,112,108,66],hypothet:[76,33,84,16,73],whizbang:69,get_reginfo_target_desc:21,contact:[76,114,30,26],thi:[69,93,1,95,3,37,5,67,7,96,97,41,113,45,99,105,83,101,54,20,75,65,56,77,22,78,79,80,58,111,59,61,107,24,108,84,86,87,110,26,112,115],gettok:[40,42,55,44,46,2,48,49],clenum
valn:20,value_load:71,destsharedlib:66,basetyp:71,mandelbrot:[14,44,2,17],stack_loc:84,ifdef:[67,4,20,11,39],sparctargetasminfo:53,getkei:16,opencl:[30,8],spread:31,board:[9,35],parse_primari:[12,13,14,15,18,19],relwithdebinfo:[23,61],mayb:[39,21,11,25,65],stringwithspecialstr:104,fusion:[30,71],fsin:[77,53],mip:[84,86,87],ppc32:84,bpf:[23,84],sectnam:20,parsetypetyp:65,bucket_count:104,bpl:6,image_file_machine_ebc:109,openfil:69,prefixdata:112,negat:[14,84,71,2,112],percentag:37,cfrac:34,bork:[20,116],flatten:[84,71,0],bore:76,pos2:20,pos1:20,getmodulematchqu:53,colloqui:71,fpic:61,loadregfromaddr:53,mandleconverg:[14,2],dopartialredundancyelimin:20,trunk:[23,38,25,84,104,94,10,36,26,34],peek:[12,13,14,15,18,19],plu:[112,53,74,71,48,26,55,78,108,13,16,18],aggress:[91,23,60,41,74,84,69,71],memdep:41,someclass:29,pose:[74,60],confer:[74,84],fastmath:8,repositori:[23,98,82,38,108,25,62,9,104,87,10,26,30],post:[80,26,71,84],obj:[101,32,73,34,74,36,77,79,71],literatur:84,image_scn_align
_4byt:109,gc_transition_end:73,canonic:[84,5],s64:8,deltalinestart:67,nctaid:8,sames:71,curiou:33,xyz:[70,80,77],"float":[84,77,59,112],profession:26,bound:74,emitinstruct:[84,53],unittestnametest:61,opportun:[31,53,0,49,50,12,71],accordingli:[70,71,16,74],wai:[67,91,69,112,97,41,74,113,20,84,86,83,26,50,110,108,79,99,5,98],copycost:53,callexprast:[40,42,55,46,2,48,49],n2764:69,lowest:[67,40,42,55,46,2,48,49,69,78,86,12,13,14,15,71,18,19],asmwriternum:115,raw_ostream:84,end_amd_kernel_code_t:24,maxim:[80,44,17,112],"true":[31,92,33,69,3,70,71,6,40,84,8,102,113,9,48,10,12,13,14,15,16,19,53,103,74,20,104,76,79,80,23,41,86,64,29],reset:[25,112,116],absent:16,optimizationbit:20,legalizeop:65,x86_fastcal:84,anew:104,absenc:[84,83],llvm_gc_root_chain:74,emit:[112,24,83,84,86,68,77,78,80,5],hotter:59,alongsid:112,wcover:69,thunderbird:26,noinlin:[99,71,112,57],xxxjitinfo:53,postscript:31,valuelist:29,function_entry_count:3,encrypt:26,refactor:[15,46,60],instr0:33,instr1:33,instr2:33,entryp
oint:71,test:[56,83,87,24,41],shrink:84,realiti:94,xxxtargetasminfo:53,fpreg:53,sync_command:25,"2acr96qjuqsym":26,sanitizercoverag:25,debugflag:[20,16],clang_cl:10,pathnam:[23,101,87],set_value_nam:[12,13,14,15,19],libgcc1:9,concept:[84,69,112,78],mayload:6,consum:[54,16,20,103,35,36,37,28,71],dw_tag_inlined_subroutin:104,supplement:105,value_typ:92,middl:69,zone:71,graph:[23,60,61,83,84,115,71,59],certainli:[74,31,39,11,50],jvm:[39,11],"0x200":104,dootherth:69,munger_struct:103,generateuniquenam:49,brows:[42,61,82,19],seemingli:53,dw_apple_property_readonli:104,avx1:10,avx2:10,administr:114,aad8i8:84,gui:[36,69,61],libthread_db:99,adc64ri8:6,gut:66,sparcinstrformat:53,usescustominsert:6,upper:[69,53,16,113,66,71],isvolatil:71,brave:[55,18],bpf_jgt:84,htm:30,preservemost:71,cost:[84,69],build_fmul:19,bpf_jge:84,cov_flag:25,after_bb:[13,14,15],gr16:84,appear:[67,31,45,97,53,41,71,20,1,69,35,98,104,86,83,30,73,103,29,25,16],scaffold:[55,18],"23421e":71,constantarrai:16,uniform:[69,16
],isoptim:[71,104],va_list:71,image_sym_class_funct:109,defici:74,faultingpcoffset:91,gener:[112,24,41,56,86,3,78],inputcont:92,satisfi:[91,41,46,86,94,26,4,15],pcre_fuzz:25,roots_end:74,precursor:26,plotter:[14,2],hash_data_count:104,mach_universal_binari:79,behav:[91,69,41,108,62,86,95,71],myvar:103,triag:84,regardless:[31,7,69,61,107,74,93,75,46,104,63,36,96,15,71],extra:[69,61,108,20,3,50,112],stingi:16,stksizerecord:88,marker:[84,20,1,69],legal_el:49,llvm_on_xyz:4,regex:[95,20,5,34],prove:[31,41,33,34,47,50,71],nothrow:86,naddit:20,subvers:[26,87],live:[61,87,78,41],tape:23,lgtm:[60,82],tlsv1_method:25,"0xl00000000000000004000900000000000":71,cxxabi:23,finit:[84,21,71],getfunctionaddress:49,viewcfg:[16,48],geordi:38,iffals:71,logarithm:112,graphic:[14,11,2,39],at_nam:104,canconstantfoldcallto:65,prepar:[71,25,108,9,103],focu:[84,90,106,0],cat:[23,74,20,10,79,25],ctfe:30,can:[69,93,1,5,95,3,37,43,67,65,97,41,113,45,99,83,101,54,20,75,77,22,78,79,111,59,61,24,108,84,86,87,110,26,
112,115],debug_symbol:[63,66],boilerpl:[102,74,20,49,21,12],heart:[73,66,54],underestim:71,basemulticlasslist:29,chip:[53,8,84,9,35,10,77,80],spu:53,abort:[69,71,25,84,108,83,116],spl:6,occur:[31,84,73,1,69,3,37,4,71,7,96,97,5,98,10,93,16,51,101,103,74,55,75,76,77,60,107,108,62,26,88,18,112,113,66,115,29],multipl:[31,69,33,95,71,72,7,97,41,5,47,67,102,103,20,114,111,22,79,59,23,25,84,86,87,26,112,27],image_sym_class_regist:109,ge_missing_sigjmp_buf:69,regioninfo:31,"0x80":[104,97],x86instrss:53,product:[74,71,30,84,2,94,76,26,55,33,66,14,29,59,18],multiplicand:71,southern:[105,24],uint:77,drastic:4,lto_codegen_compil:90,breakag:26,voidtyp:16,newlin:[69,97,1,2,112,14,5],copyphysreg:53,getcalledfunct:16,explicit:[91,69,33,71,39,40,8,98,46,2,48,49,11,12,13,14,15,16,102,103,74,20,76,22,23,60,24,30,84,86,26,27],is_base_of:102,objectimag:72,somewhat:[38,69,41,16,34,98,2,86,26,55,73,14,71,18],ghc:[84,71],thread_loc:[73,84,71],approx:8,arch_nam:79,approv:[26,94],graphviz:[31,16],localtarget
:66,svnrevert:23,cold:[71,50,59],still:[31,92,0,33,34,1,47,95,36,69,4,71,72,39,84,98,46,2,48,11,13,14,15,16,67,102,74,20,104,76,78,23,82,83,30,62,63,64,26,88,66,25],ieee:[77,71,50,97],dynam:[83,112],mypass:[76,16],conjunct:[54,32,71,66,4,5,116],precondit:69,getoperand:[69,84,16,53],window:[20,84,61,69],addreg:84,curli:[10,71,69,16,116],val_success:71,llvm_doxygen_qhelpgenerator_path:61,has_asmprint:27,non:[91,69,93,1,95,37,5,67,7,96,97,41,113,45,50,83,101,54,20,75,65,77,80,61,24,107,108,84,86,87,26,112,115],evok:71,recal:[42,33,92,48,49,12,19],halv:65,half:[95,84,69,112],recap:78,superset:[71,97],nop:[71,22,88,73],discuss:[67,23,69,102,53,38,16,20,104,76,26,88,25,73,55,71,6,18,50],mybranch:23,organ:[108,69],drop:[69,26,71,82],reg1024:84,reg1025:84,reg1026:84,reg1027:84,image_scn_align_1024byt:109,dw_tag_vari:[71,104],domain:[39,53,74,84,11,100,71,6],replac:[95,23,60,61,97,8,74,33,20,84,86,64,26,90,50,57,108,111,71,25],arg2:[44,71,17],condmovfp:116,degen:71,backport:9,reallyhidden:20
,year:[69,6],operand:[31,65,84,112,24,103,5,30,37,69,3,71,33,16],rl4:8,happen:[84,69,26,5,86],rl6:8,rl1:8,rl3:8,rl2:8,shown:[67,92,53,34,8,58,71,20,1,2,104,95,36,88,25,78,102,14,106,16,6],accomplish:[23,102,31,74,44,87,26,16,17],"_e32":24,oldval:[46,40,71,2,48],rational:[84,26],ldrr:53,release_34:23,fiddl:[16,106,9],release_31:23,release_30:23,release_33:23,release_32:23,ssl_filetype_pem:25,argu:69,argv:[67,8,20,104,99,80,83],ldrd:86,mandelconverg:[14,2],argc:[67,8,20,104,99,71],card:[73,35],care:[23,39,69,53,41,5,34,84,46,86,94,76,116,11,71,4,28,15,16,6,98],xor16rr:84,couldn:[33,41],adc32rr:6,enginebuild:[72,40,46,2,48,49],unwis:[71,97],adc32ri:6,blind:84,subrang:71,yourself:[23,65,16,26,71,116],stringref:[20,69],size:[31,84,33,69,37,43,67,65,97,8,113,50,83,103,74,20,56,111,22,78,60,24,25,41,86,71,63,112,90],yypvr:106,silent:[26,71,116,41],caught:[108,69,71],yin:92,himitsu:23,checker:[21,103,62],cumul:84,friend:98,editor:[23,26,69,106,66],nummeta:74,ariti:74,especi:[31,26,53,71,20,
98,69,35,104,86,3,50,33,4,16,60,51],dw_tag_interface_typ:104,apple_nam:104,cpu0:52,cpu1:92,llvmtop:76,mostli:[23,39,40,61,53,31,33,20,84,86,48,36,60,11,13,25],quad:[73,71,53],than:[67,112,65,69,61,97,41,74,108,20,84,77,86,95,26,50,78,37,83,59,98],png:61,"0x432ff973cafa8000":71,d02:56,xcore:[84,87],spisd:53,optimist:30,browser:[38,82],anywher:[106,5,46,10,90,50,33,66,55,15,71,6,18],getint32ti:69,cc_sparc32:53,bitcast:[103,74,108,41,56,78,5],engin:[23,101,60,98,103],fldcw:84,mccodeemitt:[84,21],begin:[84,33,94,36,69,4,71,72,40,97,41,102,45,46,48,49,12,13,14,15,16,18,19,53,74,20,104,23,60,24,108,92,87,26,88,112,29],importantli:[13,26,69,48,41],numrecord:88,toplevel:[12,13,14,15,18,19],setdebugloc:40,henderson2002:74,cstdlib:55,getpointers:74,renam:[23,69,32,16,46,104,42,66,15,71],"_p1":104,"_p3":104,steadi:91,callinst:16,llvm_libdir_suffix:61,add_reassoci:[12,13,14,15],image_file_bytes_reversed_lo:109,fifth:[67,71,53,8],onli:[91,84,33,1,69,94,95,36,3,37,70,71,67,65,97,8,5,45,9,47,50,83
,98,103,102,54,74,20,75,77,22,78,79,80,58,111,23,60,61,24,108,25,41,86,26,112,27,66,115,90],ratio:59,image_rel_i386_dir32nb:22,expr_prec:[12,13,14,15,18,19],llvm_enable_abi_breaking_check:16,endloop:[40,15,46,2,48],overwritten:[88,84,71],llvminitializesparctargetinfo:53,cannot:[31,69,0,95,36,4,5,72,39,41,71,47,11,83,53,103,74,20,76,111,22,78,16,84,86,110,26,113],truli:16,mrm6r:53,inttoptr:50,operandlist:116,seldom:33,intermitt:23,bio_new:25,object_addr:74,gettypenam:16,rrinst:116,"0x0000000000d953b3":99,dllvm_include_exampl:23,hierarchi:[23,65,1,87],istreambuf_iter:8,"0x48c978":25,foo_test:10,concern:[103,74,16,26,27,71],"1svn":94,dityp:40,mrminitreg:53,printinstruct:[21,53],regcomp:25,between:[67,65,84,112,41,74,20,45,77,86,110,26,78,69,5,98],"import":[31,69,62,33,1,35,94,36,70,71,41,45,50,83,74,20,78,23,61,25,84,86,26,112],modulelevelpass:76,paramet:[84,61,103,74,108,20,1,69,3,112,57],constantpoolsect:53,clang_cpp:10,"__text":84,intregssubclass:53,dw_tag_subrange_typ:104,mono:30,p
ertain:[66,26,104,108],inputfilenam:20,nearbi:[91,33],inconsist:[69,104,103],qualtyp:69,image_sym_type_struct:109,gr32:[84,6,116],my86flag:92,mutate_depth:25,caret:95,clarif:[105,26,69],rebuild:87,classic:[30,84],valuekind:69,invers:[31,71],fixabl:50,uglifi:[12,49],getentryblock:[46,40,16],derefer:[71,16,104,103],normalformat:20,rubi:74,getjitinfo:[84,53],thischar:[40,42,55,44,46,2,48,49],eip:6,global_context:[12,13,14,15,19],retcc_x86_32_c:53,fastemit:21,fneg:71,initializenativetargetasmpars:[40,46,2,48,49],dw_at_artifici:104,stdout:[23,25,109,36,12,13,14,15,71,18,19],metric:[76,25,59,94],henc:[23,29,20,98,87,88,90],worri:[23,40,82,55,20,71,18],eras:[40,42,20,98,46,2,48,104,86,66,16],bigblock:80,antisymmetri:33,develop:87,proto:[40,42,55,46,2,48,49,12,13,14,15,18,19],"__nv_powf":8,sizeofimm:53,bpf_lsh:84,cc1:99,epoch:[92,97],cindex:53,externalstorag:20,document:[61,112,41,84,86,87,78,59],finish:[0,32,33,94,99,71,72,40,42,46,2,48,49,12,13,14,15,83,18,19,76,61,82,108,84,106],futhermo
r:73,closest:[40,71],someon:[39,69,74,84,65,26,11,106],removebranch:53,freeli:[26,86],tradition:[30,84,41],pervas:[16,102],whose:[67,29,69,53,41,111,16,84,46,2,104,26,83,112,55,14,15,71,18,116],createstor:[40,46],destreg:84,bodi:[69,5,20,83,26,112,33,71,25],ccc:[71,9,112],noaa:31,tpoff:73,touch:[31,69,16,104,76,71],tool_verbos:[66,87],speed:[23,69,20,46,10,26,30,15,25],create_modul:[12,13,14,15,19],death:25,struct:[84,112],bb0_29:8,bb0_28:8,getx86regnum:53,bb0_26:8,desktop:63,identif:[71,9,29,23],gettoknam:40,treatment:[74,53],versa:[71,86],real:[23,69,53,8,5,20,41,44,2,104,25,71,14,16,6],imul16rmi8:84,frown:26,"0x82638293":104,read:[91,69,93,95,37,5,65,96,97,41,45,99,105,83,98,20,75,7,77,78,79,80,58,84,86,87,110,26,112,115],cayman:105,amd:24,regfre:25,googletest:1,bangoper:29,funcresolv:16,benefit:[31,69,41,74,25,103,104,16,51],lex_numb:[12,13,14,15,17,18,19],output:[69,61,41,113,84,5,87,83,59],debug_pubtyp:104,matur:[74,20],initid:112,cmake_install_prefix:[23,36,9,61],viral:26,lib
stdc:[23,69,9],debug_with_typ:16,extralib:66,blockidx:8,lto_codegen_set_debug_model:90,v2i32:71,n64:30,tdm:114,tok_binari:[40,46,2],sixth:53,objectbufferstream:72,asan:25,flagprototyp:40,"throw":84,dw_tag_subprogram:104,src:[101,53,32,34,84,94,71,51],sra:[29,116],central:[4,104,108],greatli:[73,30,104],underwai:30,image_sym_class_sect:109,srl:[29,116],numbit:16,chop:104,degre:[114,86,50,0],dw_tag_subroutine_typ:[71,104],sixkind:71,backup:64,processor:[23,61,53,0,74,105,20,84,104,87,21,30,78,80,66,71,6],valuecol:70,bodylist:29,op3val:53,llibnam:20,localaddress:71,xxxbegin:16,outloop:[40,15,46,2,48],yout:92,your:[83,86,87,41],parsebinoprh:[40,42,55,46,2,48,49],verifyfunct:[40,42,46,2,48,49],loc:[73,40,104,53,89],log:[26,1,83,41],opengl:[39,69,11],aren:[23,39,84,103,31,74,71,41,69,48,49,36,26,11,12,16],haskel:[16,39,11,71],start:[112,83,87,24,41],low:[84,112],lot:[31,84,34,35,69,71,6,39,40,102,42,55,44,98,46,2,49,11,12,14,15,16,17,18,19,53,103,74,20,65,104,76,57,23,83,30,92,63,26,66],c
older:59,submiss:26,satur:[14,2],addresssanit:[25,71],"default":[61,24,41,84,87,3,112],tok_def:[40,42,55,44,46,2,48,49],start_bb:[13,14,15],bucket:[16,104],v31:71,v32:8,loadabl:74,scanner:[44,17],decreas:80,opnam:53,producess:87,value_1:27,prepend:[95,16,104],valid:[31,33,94,5,72,8,71,98,16,101,103,20,56,77,80,59,23,61,24,25,84,26],release_19:23,release_18:23,release_17:23,release_16:23,you:[31,62,32,33,1,35,68,94,95,36,69,5,67,65,97,8,113,98,9,99,50,93,84,16,51,102,103,74,20,75,104,71,57,79,80,23,61,82,24,83,30,41,86,87,63,64,26,112,114,66,25],release_14:23,release_13:23,release_12:23,release_11:23,poor:[13,69,48],polar:92,lowerbound:71,registri:74,base_offset:73,bpf_st:84,multidimension:71,binfmt:23,pool:[53,84,76,88,112,37],namedvalu:[40,42,46,2,48,49],bulk:[46,15,16,84],adc64mr:6,value_n:27,skeleton:23,osx:97,messi:84,ssl3_read_byt:25,month:[38,94],correl:[74,71],"__cxa_end_catch":108,getglob:53,pandaboard:35,paramidx:112,getnullvalu:[46,40,16,2,48],"_ri":116,cpufrequtil:35,spar
cinstrinfo:53,articl:[31,23,33,46,48,13,15],sdisel:60,gcfunctionmetadata:[74,88],phielimin:84,"_rr":116,datalayout:[56,112],verb:[66,69],mechan:[84,56,112],veri:[31,84,0,33,34,35,94,69,71,6,98,38,39,41,42,5,44,45,46,2,48,49,10,11,50,100,12,13,14,15,16,17,18,19,102,103,74,55,20,104,76,21,23,83,25,92,86,26,112,108,28,116],passmanagerbas:53,targetregisterdesc:[84,53],methodbodi:53,masterhelp:49,eatomtypetag:104,emul:[71,65,84,16,69],cosin:[71,53],customari:[20,26,71],dimens:71,unnorm:71,fixedt:104,preserveal:71,casual:[66,26],kistanova:114,dofin:53,nand:71,fpformat:[6,116],isobjcclass:104,llvmlibspath:66,fp128:[33,71,112],"0x00000100":104,signextimm:84,modular:[27,76,75,69,41],exeext:[10,66],mclabel:84,strong:[5,98,86,26,50,33,71],modifi:[69,84,83,86,41],divisor:71,ahead:[23,69,55,44,62,76,36,26],dform_1:84,t1_lib:25,helperfun:49,sphinx_warnings_as_error:61,initializealiasanalysi:41,put:[91,31,84,33,94,69,71,67,39,40,41,5,44,46,48,99,10,11,13,15,16,17,74,20,104,76,82,83,92,86,106],fami
li:[39,24,71,104,36,11,73,16],sequencetrait:92,dangl:[13,16],"0x710":79,is64bitmod:53,isimmedi:53,zorg:114,massag:69,formul:4,bash:[4,106],libxml2:9,taken:[31,39,84,97,53,41,32,71,20,66,108,3,11,50,33,4,73,16,6],distfil:66,zork:116,vec:[71,16],build_arch:[66,51],apfloat:[23,40,42,46,2,48,49,19],valuetyp:[65,84,6,53],regoffset:28,oblivi:78,targetcallingconv:53,"0b000111":53,x00:109,x86instrmmx:53,histori:[23,26,82],ninf:71,indirectbr:108,reindent:69,templat:[69,102,41,20,87,95],vectortyp:16,unreli:[25,41],parsabl:73,phrase:69,anoth:[31,84,33,35,95,36,69,70,71,67,65,97,8,5,98,9,47,74,20,75,22,78,23,60,108,25,41,86,26,112,27,66,90],llvm_enable_rtti:61,snippet:[74,26,16],reject:[20,5],getarg:40,rude:108,personlist:92,secondlastopc:53,unlink:[42,23,16],retcc_x86common:53,"0x00003500":104,lifetim:[74,84,50],machinepassregistri:76,help:[69,93,1,68,95,37,5,7,96,41,113,83,101,54,75,77,78,80,58,61,107,86,110,111,89,115],mbbi:84,soon:[32,55,48,76,26,13,90,18],mrmdestreg:[6,53],held:[26,71,82,7
8],ffi:98,foo4:[64,90],foo1:[64,90],foo2:[64,90],foo3:[64,90],dfpreg:53,complex:[74,65,84,69,94],segfault:30,eatomtypecuoffset:104,tok_els:[40,46,2,48],mergebb:[40,46,2,48],systemz:[84,87],finer:[30,41],cee:16,dexonsmith:104,sentenc:69,wideaddr:71,ystep:[14,2],ninja:[23,25,9,61],gmon:66,libllvm:[63,23],stopper:32,addenda:105,x0c:109,iff:71,scalarevolut:[103,41],fulli:[84,59,112],heavi:[66,16,73],succ_iter:16,llvm_build_tool:61,beyond:[106,103,16,84,108,28,115,71,6],todo:[31,65,32,25,84,9,104,76,21,100],ific:20,isunaryop:[40,46,2],ppcinstrinfo:65,safeti:[91,30,71,50],publish:[32,69,16],debuglevel:20,astnod:21,regexec:25,unreview:26,labf:20,ast:[30,21,44,60],errorp:[40,42,55,46,2,48,49],dw_tag_volatile_typ:[71,104],mystruct:103,pub:104,mips64:[30,87],reason:[69,33,4,71,65,40,41,42,55,44,9,48,49,10,50,46,12,13,15,16,17,18,19,102,103,74,20,104,76,21,23,73,108,25,84,85,86,26,27,106,116],base:[61,24,41,87,3,112,83],configmaxtest:16,ask:[65,26,87,41],asi:53,intermodular:[38,90],wglobal:69,
asm:112,basi:[44,73,16,20,2,74,37,14,71,17],launch:8,"_z4testb":108,warpsiz:8,undergo:[31,71],assign:[3,60,103,8,33,20,84,69,86,26,112,70,71,59,98],myawesomeproject:71,obviou:[31,39,26,41,33,104,84,83,2,49,21,11,69,78,86,12,88,14,71,98,55],ultrasparc3:53,islazi:53,isregist:84,placehold:108,uninterest:[44,17],implementor:[12,13,6,48,49],miss:[46,24,0,71,30,9,2,83,64,69,50,55,14,15,16,34,18],st6:6,save_minimized_corpu:25,st4:6,st5:6,nodetail:37,st7:6,st0:[6,53,116],st1:[84,78,6,53],st2:6,st3:6,scheme:[69,53,74,16,57,46,108,37,15,71],schema:[92,1,109,104,54],adher:[4,26,16,6,100],xxxgencodeemitt:53,getter:[71,21,16,104],bidirect:16,newabbrevlen:112,adc32ri8:6,grep:[23,61,20,84,35,10,5,34],stl:[23,69,31,25,92,16,98],stm:71,do_something_with_t:91,rootmetadata:74,store:[61,112,24,41,86,78,59],str:[67,40,8,42,16,25,92,46,2,48,49,109,78,55,71],consumpt:[76,25,84],aliaseeti:71,toward:[71,26,16,59,38],grei:32,randomli:43,gofmt:69,"null":[91,69,41,108,77,50,80],dllvm_target_arch:9,attrimpl:21,
imagin:33,mips32:30,unintend:31,bz2:23,lib:[65,61,24,74,20,84,101,87,99,37,58],lic:31,ourfunctionpass:16,lit:[61,68],"__apple_objc":104,useless:[39,104,48,11,78,13],numfunct:[91,88],mixtur:116,c_ctor_bas:5,maco:[23,98,16],alpha:[71,53],filenameindex0:67,isbarri:[6,116],hipe:[84,71],clear:[69,73,47,71,40,42,55,46,2,48,49,12,13,14,15,16,18,19,103,74,75,26,27,66],implicitdef:84,clean:[23,84,113,62,87,94,108,90,98],latest:[32,23,30,5],v4f64:71,test1:[10,73,106],unsimm:84,v16:8,v15:71,instrins:71,i32imm:[53,116],"3x4":71,get_instrinfo_named_op:53,test5:5,ptrval:71,coerc:33,delin:1,pretti:[31,33,34,4,42,55,44,46,2,48,49,12,13,14,15,17,18,19,103,76,57,25,28,106,29,116],setnam:[40,42,46,2,48,49,16],less:[31,69,32,33,1,35,47,95,71,6,67,39,40,97,41,42,55,44,98,46,2,48,49,10,11,12,13,14,15,16,17,18,19,74,20,104,78,23,25,84,112,106,30],lastopc:53,createfsub:[40,42,46,2,48,49],suspect:75,darwin:[91,40,84,10,88,79,66,71],ymm:71,defaultdest:71,dinod:40,prolang:34,parenexpr:[40,42,55,46,2,48,49,12,
13,14,15,18,19],durint:3,has_asmpars:27,nativ:86,same_cont:22,"133700e":[42,19],setdata:69,rejit:[12,49],llvmlibdir:66,setpreservescfg:76,kawahito:84,"__llvm_profile_name_bar":67,ctaid:8,compute_pgm_rsrc1_sgpr:24,xword:53,close:[23,69,103,54,84,60,71],"0x0b17c0de":112,whatsoev:71,deriv:[69,97,24,84,56,26],libcmt:36,particip:[10,71,26,16,66],parse_unari:[14,15],pifft:34,won:[69,103,41,32,30,84,9,104,26,57,66,71],isprefix:20,cst_code_integ:112,honour:30,emitint32:74,makeup:16,fpform:6,numer:[36,71,6,40,42,55,44,46,2,48,49,50,100,12,13,14,15,16,17,18,19,53,20,111,30,29],isol:[69,84,83,59],lowercas:[12,53,49],numel:71,distinguish:[67,39,74,16,11,78,73,4,71],both:[67,84,61,97,103,41,74,83,20,1,69,86,87,95,26,50,112,108,5,98],clang_attr_identifier_arg_list:21,delimit:[23,24,29,108,28,71],fancyaa:76,lako:69,sty:6,getnumvirtreg:84,protector:[71,104],lexidentifi:65,block_par:[13,14,15],"__objc":71,jeff:4,byval:[84,71,112],header:[112,61,86,87],instrsch:16,"100mb":66,linux:[69,84,61],test_cor
pu:25,forgiv:33,llvm_enable_thread:61,stamp:97,territori:23,empti:[69,33,1,71,40,42,55,46,2,48,49,10,73,13,16,18,19,53,74,20,104,79,61,108,25,92,26,66,29,116],destructor:[69,16,98,76,108,71],newcom:[15,46,6,100],sslverifi:23,newinst:16,as_float:[12,13,14,15],box:[84,104,82],lattner:[39,11],imag:[72,84,2,111,22,14,71],ada:108,imac:0,coordin:[74,73,92],modrefv:116,imap:23,look:[31,92,33,1,94,36,69,102,99,71,67,38,65,40,84,8,42,5,46,2,48,49,10,11,73,12,13,14,15,16,18,19,53,103,74,55,20,104,76,21,79,23,60,61,82,24,90,25,41,85,86,87,64,26,88,51,112,108,27,106,29,116],flat_store_dword:24,ramif:103,"while":[91,31,69,33,1,70,5,41,71,47,99,83,103,20,75,23,60,61,82,25,84,63,26,112,66,90],smart:[69,71],loos:[66,6],loop:[86,41],pack:[32,84,42,50,112,71,19],malloc:[39,74,30,76,11,16],pragmat:30,readi:[33,94,72,40,42,55,44,46,2,48,49,12,13,14,15,17,18,19,20,104,76,64,26],readm:[10,23,26,106],"__gcmap_":74,thesparctarget:53,hideaki:84,"0x00001203":104,quadrat:[84,77,16],targetlow:83,fedora:23,gran
t:[33,26],tokinteg:29,belong:[71,20,16,33],llvm_site_config:[10,36],indvar:71,octal:[20,97,116],curloc:40,conflict:[23,40,116,42,71,84,46,2,48,49,10,26,12,13,14,15,16,6,19],"0b10":116,goodwil:26,ccif:53,optim:41,image_sym_class_type_definit:109,temporari:[31,60,92,16,34,1,10,69,108,66,84,71,98],"3gb":36,vreg:84,numarg:[40,88],"0x16677e0":99,older:[23,53,74,20,35,26,66,28],mctargetstream:84,cmake_toolchain_fil:23,pointtoconstantmemori:41,reclaim:[60,71],use_:16,positionaleatsarg:20,weakest:[84,86],predetermin:41,safestack:71,cout:[92,69,98,8],isunord:86,accumulateconstantoffset:33,afre:47,dw_ate_unsigned_char:71,undeclar:[42,71,19],tick:97,recurs:[31,73,1,71,39,42,55,44,46,2,48,11,13,14,15,16,17,18,19,74,21,66],shortcut:[44,17,18],supersparc:53,subsequ:[72,31,103,53,0,20,84,104,88,28,71,116],gnueabihf:[9,35],march:[23,30,62,104,77,80,5],arm_aapcscc:112,mcsectionelf:84,xterm:69,game:26,optimizationlist:20,characterist:[65,53,16,84,109,71],isproto:112,outright:103,success:[92,69,71,40,
42,55,46,2,48,49,12,13,14,15,18,19,53,54,76,23,62,26],signal:[91,20,86,99,10,71,25],resolv:[72,84,42,71,1,48,49,76,26,90,66,12,13,16,6,19],"______________________________________":16,popular:[23,84,35,41],bpf_alu:84,regionsforfile1:67,regionsforfile0:67,ptroff:84,some:[91,31,92,0,32,33,34,1,77,35,47,95,36,3,70,4,69,71,6,111,38,39,40,84,41,42,5,44,98,9,2,48,49,10,11,50,46,12,13,14,15,16,17,18,19,53,102,74,90,20,100,65,104,76,21,78,57,103,94,97,23,60,61,82,24,73,83,25,62,85,86,87,63,26,88,55,112,108,27,66,106,29,30,116],urgent:26,"__llvm_faultmap":91,mnemonicalia:84,getfunctionlist:16,mem_address:84,uselistorder_bb:71,addpreserv:41,printinlineasm:53,pathsep:10,n2930:69,slash:[71,97],castinst:16,bcanalyz:[112,68],cgi:25,run:[69,61,41,113,84,86,5,87,78,83],stem:16,"_ztii":[108,71],movsx64rr8:84,curtok:[40,42,55,46,2,48,49],assignvirt2phi:84,subtract:[67,25,84,71,65],"_ztif":108,"_ztid":71,blocksizei:8,idx:[40,103,42,46,2,48,49,69,71],nnnnnn:84,shini:76,blocksizez:8,f31:[71,53],blocksize
x:8,block:41,use_llvm:[12,13,14,15,19],gcroot:74,aq2:71,within:[31,92,33,34,1,69,71,40,84,8,5,44,98,46,2,48,49,73,12,13,14,15,16,51,102,103,74,75,104,56,78,23,60,83,41,88,112,108,66,116],loadsdnod:16,proj_install_root:51,ensur:[91,31,84,0,73,94,69,37,71,40,8,42,5,98,46,2,10,15,16,19,101,53,74,20,75,76,22,23,108,41,86,87,26,88,112,66],llvm_package_vers:61,mach:[79,105,71,112],properli:[84,83,86,41],loopunswith:50,pwd:[23,25,9],bio_s_mem:25,vfprintf:71,newer:[23,36,26,99],cmpxchg:86,flagsfeatureb:92,flagsfeaturec:92,flagsfeaturea:92,specialti:16,info:[23,60,61,74,90,1,99,112,108,79,84,71,115],fde:[84,60],"0xc3":116,i65:71,abs_fp64:6,similar:[31,84,0,33,35,69,4,71,40,97,8,42,5,44,2,48,49,10,12,13,14,16,17,51,19,101,53,103,74,20,76,21,22,23,108,30,92,86,26,112,25,116],createdefaultmypass:76,obviat:51,reflectparam:8,doesn:[67,26,97,41,83,20,1,69,86,3,78,108,84,5],repres:[78,41,86,3,112,59],arg_iter:[40,42,46,2,48,49,16],incomplet:69,nextvari:[2,48],minsiz:71,titl:[30,26,82],speccpu2006:3
4,nan:[80,30,77,71,104],accross:71,setenv:66,"0x00007fff":84,dosometh:69,resign:26,xtemp:86,drag:82,canfoldasload:6,rnnnn:26,svn:[26,61],typeid:112,infrequ:76,svg:61,addmbb:84,orbit:[14,2],devminor:8,depth:[31,33,20,84,48,64,13,71,6],loadobject:72,unconnect:103,mystringtyp:92,msbuild:[36,61],getkind:[21,102],image_scn_mem_preload:109,compact:[39,40,74,84,11,37,88,16],friendli:[38,69,55,26,100,28,18],"__llvm_profile_name_foo":67,breakcriticaledg:76,aris:[71,26,16,103],instr_iter:84,yoyodyn:26,then_bb:[13,14,15],roots_siz:74,runnabl:[23,87],nonatom:104,llvmdisasminstruct:28,weakvh:16,button:82,llvm_enable_doxygen:[23,61],use_llvm_target:[12,13,14,15],dw_tag_const_typ:[71,104],ccifnest:53,relink:[101,83],vgpr:71,calleef:[40,42,46,2,48,49],jump:112,imper:[69,74,46,48,13,15],download:[23,61,53,32,30,9,94,10,64,114,66,16],click:[36,82],hasoneus:69,poke:112,image_scn_lnk_nreloc_ovfl:109,espresso:34,cell:53,experiment:[65,24],registerschedul:76,ramsei:84,init_v:15,legalizeact:53,becom:[31,6
9,0,35,71,6,53,55,46,48,10,50,13,15,16,18,102,103,20,76,78,84,88,66],accessor:[76,55,84,104],"_source_dir":61,startexpr:[40,15,46,2,48],convert:[1,93,84,86,87,95,68,78],convers:[91,20,84,69,50],converg:[14,71,2],solaris2:76,findings_dir:25,chang:[101,45,61,112,41,113,20,1,69,86,54,83,3,87,78,96,84,5],hexagon:[23,21,71,84,87],epilogu:[74,71,53],chanc:[72,3,44,92,17,26,6],testcase_dir:25,selectinst:69,n3272:69,"0xffff":[88,71],danger:[16,5,71],revok:26,win:[69,16,41],dyn_cast:[69,102],"boolean":[84,69,77,61,112],llvmtyperef:65,basic_block:19,externallyiniti:71,getrawsubclassoptionaldata:33,implic:[84,26],recordid:112,fibi:[15,46],remaind:[67,23,65,53,108,84,10,27,71],llvm_enable_warn:61,"0x00ff0000":84,gc_transition_start:73,numelt:112,benchmark:[23,0,32,34,104,10,26,16,51],landingpad:108,dcmake_osx_architectur:23,nvptx:87,findlead:16,retriev:[72,97,82,8,73,20,92,76,88,108,16],image_scn_gprel:109,perceiv:[39,11],memory_order_acq_rel:[71,86],linearscan:[76,80,84],meet:[76,23,26,84,33],
machine_kind:24,control:[45,61,1,69,87,77,80,84,83],malform:[31,83],sudo:[23,35],typeprint:65,llvm_use_intel_jitev:61,compactli:116,myfooflag:92,sought:71,emitepilogu:53,clang_attr_arg_context_list:21,egrep:23,dw_op_deref:71,addpreemitpass:53,dissolv:66,tag_base_typ:104,templatearglist:29,lto_module_is_object_fil:90,live_s:74,eliminatecallframepseudoinstr:53,space:112,aliasanalysiscount:41,"0x3feaed548f090ce":49,filterclass:70,syscal:[30,84],image_scn_lnk_info:109,vsetq_lane_s32:78,subtyp:[108,53],primaryexpr:[55,18],mcjithelp:49,jne:84,onzero:71,distzip:66,outer:[40,30,92,46,47,48,76,69,13,15,71],consensu:26,pushfl:84,topdistdir:66,foreach:[69,116],dw_tag_auto_vari:[71,104],label_branch_weight:3,handl:[61,86,78],auto:84,handi:[42,66,106,16,19],memberlist:53,armgenregisterinfo:21,p15:8,p16:8,p17:8,front:[108,84,69,87],p19:8,modr:84,somewher:[76,102,42,5,34,2,10,108,14,71,19],faultkind:91,slide:16,ourfpm:[40,46,2,48,49],upward:1,unwind:[31,60,53,108,84,47,22,50,58,71],globl:[73,22,8]
,selectiondag:86,grok:[42,98,19],chunk:[31,69,112,42,84,85,104,78,19],special:[91,23,62,112,103,41,74,20,1,9,86,87,99,26,78,27,84],image_sym_type_byt:109,"0x00000130":104,image_scn_lnk_oth:109,influenc:[76,60,104,78],discharg:50,suitabl:[72,31,8,74,16,20,84,10,95,112,71,67],hardwar:[80,84],armhf:9,llvmtransformutil:51,spec95:34,lcssa:60,"__cuda_ftz":8,manipul:[23,98,57,84,54],undo:78,typebuild:[65,16],ssl_set_accept_st:25,ecx:[84,22,6,116],image_scn_mem_writ:109,bodyexpr:[40,15,46,2,48],bclinklib:66,membership:16,keep:[84,41],counterpart:71,bpf_and:84,wrote:[65,40,71,103],dumpmymapdoc:92,svptr:71,linkallcodegencompon:76,qualiti:84,arr:[71,16,103],fmul:84,art:74,find_a:16,rs1:53,rs2:53,scalartrait:92,perfectli:[69,103,5,84,55,71,98,18],mkdir:[23,61,25,87,94,64,66],second_end:71,attach:[23,69,82,8,30,46,104,99,26,15,71],functionpassctor:76,"final":[67,23,84,97,74,108,20,1,9,26,112,69,83],prone:[20,84,6,98,35],my_valu:69,rsi:[84,6],methodolog:108,qualifi:[84,69],exactli:[69,112,102,41,
74,71,20,1,22,78,27,5],rsp:[73,84,85,6,88],ehashfunctiondjb:104,bloat:69,a_ctor_bas:5,instvisitor:[65,16],openssl_add_all_algorithm:25,dubiou:97,bare:[71,101,16,53,88],f16:71,exhibit:[83,86],multhread:16,xor8rr:84,reg2:5,procnoitin:6,reg1:5,goldberg:74,lightli:[32,71],tabl:[112,78,41],need:[91,69,95,5,65,97,41,98,99,50,83,101,54,74,20,75,77,78,80,58,59,61,108,84,86,87,26,112,115],altivec:[30,84,71],ind4:71,createfunctiontyp:40,ind1:71,reloc_pcrel_word:53,"0x04":104,"0x05":88,"0x06":88,"0x07":88,"0x00":[67,88,97],parse_extern:[12,13,14,15,18,19],"0x02":[67,104],fileit:20,unawar:71,lgkcmt:24,platformstripopt:66,llvmgold:64,detector:33,equal_rang:16,singl:[69,1,95,5,67,65,97,47,83,103,74,20,78,57,23,24,107,108,84,86,87,110,26,112],parseidentifierexpr:[40,42,55,46,2,48,49],discop:40,discov:[84,74,25,1,46,104,48,94,13,4,15],rigor:84,x86_ssecal:53,deploi:82,x86_fp80:[33,71,112],promoteop:65,url:[26,82,106],hasrex_wprefix:6,"0xe8":116,indx:92,inde:25,llvm_parallel_link_job:61,unoptim:[23,7
7,87],"0x0d":88,"0x0e":88,constrain:[63,42,98,10,116,71,19],disable_assert:[63,66,87,94],"0x0a":[88,97],"0x0b":88,"0x0c":67,ssl_load_error_str:25,cute:[39,11],verbos:[92,97,107,1,87,66],objc:[38,106,104],lsb:84,molest:71,anywai:[31,69,9],varnam:[40,46,2,48,13,15],tire:[69,6],losslessli:33,bpf_alu64:84,envp:99,x86_thiscal:84,themodul:[40,42,46,2,48,49],add_to_library_group:27,llvmtypekind:65,q31:71,tbb:53,shr:69,enabl:[91,69,93,1,35,95,67,7,96,113,98,99,74,20,75,77,78,80,23,61,107,84,87,64,26],getmbb:53,cppbackend:23,she:[114,6],contain:[84,1,69,35,94,95,36,3,70,71,67,96,97,41,5,9,99,50,102,103,74,20,56,114,111,22,78,79,59,23,60,61,108,62,87,110,64,26,112,27,115],shapekind:102,grab:[40,32,98,94,21,13,14,15,16],image_file_local_syms_strip:109,shl:69,legaci:[40,46,2,48,49,71],nolink:20,flip:69,vectorize_width:0,target_link_librari:61,image_scn_mem_16bit:109,mileston:33,statu:61,correctli:[92,73,69,71,55,98,48,10,33,13,16,51,103,20,104,76,61,108,30,84,85,86,26,18],writter:20,sectvalu:20
,realign:[30,71],written:[7,84,41,93,54,69,110,95,26,22,37],neither:[31,112,41,33,36,88,50,78,71],tent:71,vfp3:9,kei:[102,24,73,16,25,84,76,26,30,33,70,71,6],header_data_len:104,parseabl:[73,71],popcnt:30,setgraphcolor:16,monitor:41,xxxreloc:53,admin:114,handledefinit:[40,42,55,46,2,48,49],dw_tag_inherit:71,test_format:1,unglamor:26,multi_v:20,orig:71,quit:[33,4,71,38,39,41,42,48,99,11,50,13,16,19,103,74,65,23,25,84,88,66,106],slowli:[23,26],addition:[23,84,31,74,16,20,41,86,64,26,27,66,71],classnam:115,libdir:[66,101],image_sym_dtype_nul:109,treat:[112,84,61,86,78],cputyp:112,alphacompilationcallback:53,otp:71,createcal:[40,42,46,2,48,49,16],acq_rel:[71,86],replic:[62,90,116,92],novel:[74,71,16],dw_tag_typedef:[71,104],harder:[31,73,25,98,55,4,71,18],print_str:[12,13,14,15,18,19],engag:26,demo:20,rootstackoffset:74,povray31:34,revis:[23,69,61,82,30,104,94,26,88,16],inf:[80,20,77,71,104],welcom:[33,36,39,40,105,42,55,44,46,2,48,49,11,50,12,13,14,15,17,18,19,76,23,26],parti:[73,26,69
,51],reloc_picrel_word:53,print_float:[12,13,14,15],ro_signed_pat:6,llvm_all_target:23,setcategori:20,matcher:[84,25,21,115],nightli:[26,94],http:[23,40,82,52,32,38,25,9,94,10,36,26,114,69,34],tokprec:[40,42,55,46,2,48,49],effect:[69,61,41,74,20,84,50,112,80],isopt:20,llvm_use_oprofil:61,global_s:16,bitpack:10,spreg:30,appendinglinkag:16,dllvm_enable_p:9,callgraphscc:76,isrematerializ:6,dw_form_strp:104,fom:31,well:[91,23,65,84,41,113,20,75,69,86,94,64,26,50,112,27,99,83,95,98],makefileconfig:66,undefin:[69,61,103,62,86,111,78,98],memory_order_consum:86,mistaken:[12,49],diflagartifici:71,aform_1:84,aform_2:84,namedvar:40,xs1:105,size1:71,size2:71,size3:71,outstream:74,dcmake_build_typ:[23,25],densiti:[14,69,2],warrant:65,nodebuginfo:20,takelast:16,bpf_xadd:84,howto:[52,21,106],mcsectioncoff:84,add_gvn:[12,13,14,15],burden:[26,71],n2343:69,zchf:9,n2346:69,n2347:69,loss:[74,16],lost:[39,108,98,11,66,71],aliasresult:41,ldflag:[101,40,42,46,2,48,49,66],necessari:[84,73,94,95,69,4,71,72,
65,40,97,41,5,98,9,99,10,50,16,67,53,74,20,76,78,57,59,23,60,61,108,62,86,26,88,66,106,90],fp5:[6,116],martin:23,profraw:[67,95],page:[69,61,20,68,26,22,105],hasdelayslot:6,didn:[69,42,33,84,46,104,49,76,15,16,18,19],revert:[23,26],"04e":71,notfp:116,"__cxa_allocate_except":108,home:[23,34,99,10,50,16],librari:[61,112,87,41],hannob:25,win32:[10,4,36,84,23],setmcjitmemorymanag:[72,40,46,2,48,49],broad:[44,74,20,49,12,17],createexpress:40,overlap:[41,0,84,47,76,88,71],estim:[33,30,59,0],asmstr:[6,53,116],myfunct:8,encourag:[23,39,69,31,30,62,26,11,16],ifequ:71,nutshel:16,offset:[39,97,53,103,73,71,30,84,85,104,56,10,74,11,112,33,88,5,6,16],zeroormor:20,image_file_32bit_machin:109,testsuit:[66,5],bcreader:101,freedom:[71,16],viewvc:38,bodyitem:29,cocoa:71,cmake_cxx_flag:61,attrtemplateinstanti:21,pointless:108,"0x00000110":104,gcov_prefix:95,image_file_removable_run_from_swap:109,"_cuda_ftz":8,downgrad:98,dbuild_shared_lib:23,ndebug:[63,20,61],global_iter:16,interleave_count:0,pty2:71,
addpassestoemitfil:76,eax:[53,71,84,22,5,6,116],gain:20,spuriou:[69,71],overflow:[26,50],highest:[40,42,55,46,2,48,49,78,12,13,14,15,71,18,19],eat:[40,44,42,55,20,46,2,48,49,12,13,14,15,17,18,19],liblto:64,dmb:86,displac:84,displai:[67,31,84,53,34,44,58,20,1,69,110,114,95,26,37,102,28,111,17],sectiondata:109,w31:71,w30:71,cruel:106,"0xffbef174":76,llvm_enable_assert:[61,16],add_llvm_loadable_modul:61,tmp9:[5,103],unconditionali:71,atyp:103,isconvertibletothreeaddress:6,reciproc:[30,71],lastchar:[40,42,55,44,46,2,48,49],intregsregclassid:53,fourinarow:34,rule:[69,96,54,84,86,26,5],acloc:23,tok_var:[40,46],arctan:92,hash_set:16,getjmp_buftyp:69,futur:[61,112],rememb:[69,73,34,36,71,40,55,98,9,48,46,13,15,16,18,103,20,76,23,25,84,26],parse_id:[12,13,14,15,18,19],tmp2:[15,46],stat:[97,41,75,77,80,83],cmake_build_typ:[23,61],dw_tag:104,stab:104,same_s:22,dyld:72,sphinx:[23,61,87],"_ztv3foo":5,indirectli:[30,69,71,86,116],portion:[67,23,53,31,113,20,84,83,49,26,108,12,28,71],image_file_ma
chine_sh3dsp:109,perhap:[69,41,74,16,33,71],callingconv:112,getpointertofunct:[72,40,46,2,48,49,16],enable_sgpr_kernarg_segment_ptr:24,secondli:40,use_bind:[12,13,14,15],accur:[74,95,108,41],unaryexprast:[40,46,2],parse_var_nam:15,sorri:[39,11],swap:[30,71,35,78],getllvmcontext:69,preprocess:[30,62,98],aux:16,doubleword:71,downstream:[45,59],"void":[67,91,65,69,112,103,41,74,108,20,84,47,86,64,78,56,5,59,98],llbuilder:15,build_stor:15,appar:[15,46],x86_stdcallcc:112,theier:31,pinvok:30,bpf_x:84,stageselectioncat:20,image_file_machine_m32r:109,bpf_w:84,correct:[31,84,0,32,73,34,94,69,4,71,65,41,98,9,49,10,12,16,20,104,76,78,23,60,61,30,62,85,86,64,26,114,66],scalarbitsettrait:92,vector:[69,78,20,84,50,112],bpf_h:84,bpf_k:84,llvm_build_test:61,mllvm:0,initialis:[20,6],bpf_b:84,whirlwind:[55,18],likeli:3,cpu_x86:92,aggreg:[108,69],binop_preced:[12,13,14,15,18,19],bpf_imm:84,dw_apple_property_unsafe_unretain:104,even:[91,84,0,33,34,1,36,69,4,71,6,39,46,97,41,5,44,9,2,48,49,10,11,50,73,1
2,14,15,16,17,102,74,100,76,21,80,59,23,25,92,111,112,66,28,106,90,30,116],rope:16,fcur:33,addllvm:61,neg:[108,26,5,50,112],asid:[71,16],transcrib:[42,19],nex:76,libpo:20,net:[91,38,30,114],ever:[39,69,41,71,26,11,27,16],metadata:[59,112,56],elimin:[23,60,41,74,83,20,8,77,64,26,50,69,84,71,98],centric:71,old_bind:15,henrik:4,restat:69,q15:71,met:[74,33,84,71],ccassigntostack:53,image_scn_cnt_initialized_data:109,interpret:[73,1,71,6,67,39,40,42,113,45,46,2,48,49,10,11,12,13,14,15,16,18,19,101,20,104,78,80,23,61,84,63,88,112,55,27,66,29],dcmake_crosscompil:9,gcname:112,getunqu:16,credit:26,ebenders_test:99,permit:[77,40,74,71,30,84,46,10,60,22,15,16,116],parlanc:[44,17],volunt:[32,114],immin:94,bpf_jset:84,machineregisterinfo:84,quickcheck:16,fcoverag:[67,95],handlerpcoffset:91,createnvvmreflectpass:8,icc_n:53,overhead:[74,25,98,49,70,12,16],calm:[15,46],recommend:[69,73,1,71,8,55,46,47,49,10,12,15,18,103,74,76,23,61,25,84,63,26,66,30],icc_g:53,type:[61,112,41,84,56,87,3,78,83],tell:
[67,65,69,61,41,74,113,20,84,87,26,83],"__eh_fram":84,columnend:67,warn:61,all_build:36,wari:50,gpl:[26,98],dw_tag_apple_properti:104,room:[76,55,18,57],rightr:33,floattyp:16,dw_apple_property_nonatom:104,setup:[64,22],worth:[83,69,16,35,102],librarygroup:27,root:[101,1,61,54,84,87,26],risbgn:30,clang_cc1:[10,5],defer:[12,33,72,49],give:[67,41,108,20,84,86,26,112,83],dlsym:[12,66,76,49],binpath:99,subtmp5:[15,46],force_on:61,dragonegg:[38,98,26,84,94],unsign:[92,0,33,69,3,71,67,40,8,42,46,2,48,49,84,16,19,53,103,74,20,104,21,25,41,112,90],secidx:22,gcn:24,quot:[24,20,92,104,10,27,71,116],tbaa:50,dependfil:66,answer:[31,69,102,38,33,20,41,46,48,49,50,106,12,13,103,15,71,98],registerlist:53,config:[1,61,87,68,54],confid:26,reloc_absolute_word:53,attempt:[31,69,73,4,71,72,41,113,98,49,83,53,75,76,23,108,30,84,87,88,112,66],unnamed_addr:[71,112],"0x7fffe3e85ca8":25,maintain:[65,69,41,74,71,20,84,104,86,76,26,88,112,33,4,16,6],yourregex:5,vfp:[71,35,78],decl:[6,102],stlextra:[40,46,2,48]
,privileg:[4,71],gcda:95,unexpetedli:10,sigplan:[74,84],better:[31,62,0,33,34,69,99,5,39,71,46,48,49,11,13,15,16,18,76,60,25,84,86,26,55],argti:71,persist:[25,16],vmcnt:24,newtoset:69,dummytargetmachin:53,promin:[10,34],overestim:71,promis:26,then_:[13,14,15],usertarget:66,"0x7f":[71,116],mapsectionaddress:72,isel:[84,60,116,53,115],"instanceof":16,grammat:[55,34,18],grammar:[65,55,25,2,14,18],meat:12,build_for_websit:94,setdescript:20,getvalu:[69,16],somefancyaa:76,went:[13,48],thenv:[40,46,2,48],side:[31,84,8,42,71,41,2,48,10,74,69,55,33,13,14,73,16,18,19],bone:[88,53],mean:[31,84,33,1,94,69,102,4,71,6,39,40,97,41,42,5,44,46,47,48,49,11,73,12,13,15,16,17,51,19,53,103,74,20,100,104,76,111,22,78,23,61,24,90,92,64,26,112,108,66,29,116],rev64:78,awri:66,add_ri:116,taught:84,f108:8,f107:8,extract:[97,68],getsextvalu:16,unbound:[84,71,53],crucial:71,bpf_end:84,content:[78,41],dw_lang_c99:[71,104],mtripl:[71,77,5,80],dfpregsregclass:53,reader:[69,112,68],end_cond:[13,14,15],parseforexpr:
[40,46,2,48],nodetyp:53,linear:[23,103,41,30,84,76,77,80,16],parse_definit:[12,13,14,15,18,19],mytyp:71,verif:[31,20,71,24],situat:[31,102,53,0,16,20,84,86,49,76,64,108,33,12,66,103,71],infin:71,ineffici:[0,84,46,112,15,16],insttoreplac:16,getfunctiontyp:[16,49],retcc_x86_32_fast:53,dw_at_rang:104,nummodulevalu:112,typesaf:71,ish:[14,2],prefetch:105,isl:30,isa:[69,105,24,102,74,84],getinstrinfo:[84,53],isd:[65,84,53],cpuinfo:35,floorf:0,my_kernel:8,targetregistri:[84,53],hook:[13,84,83,51,48],unlik:[31,69,73,71,46,49,12,15,16,102,74,76,23,108,84,86,64,26,88,112,66,29],featureb:92,featurec:92,featurea:92,agre:[31,26,92],payload:[84,71],hood:[10,67],global_empti:16,tsc701:53,sevenkind:71,ieee754:[30,71],distchecktop:66,sphinx_output_html:61,arm_apcscc:112,dwell:42,filepo:20,llvm_enable_pedant:61,bodyv:[40,46],a32:78,namespac:[61,112],build_cond_br:[13,14,15],isascii:[40,42,55,46,2,48,49],buildmod:[10,66],dllvm_tablegen:9,ri_inst:116,symptom:23,enjoi:114,r14d:6,silli:[44,69,17,98,41],r
14b:6,keyword:[84,41],mcdesc:53,r14w:6,matter:[65,69,86,76,26,88,12,71],emitjumptableaddress:53,pointkind:74,modern:[69,105,98,99],mind:[69,55,46,26,15,16,18],stackar:74,bitfield:86,signature_invalid:23,seen:[39,69,53,73,71,20,84,2,49,76,11,112,33,14,16],seem:[84,61,102,41,74,33,20,45,78,103,83],seek:[31,61,38,103,26,22,66],minu:[85,71],ty2:71,memcheck:[10,1],image_sym_class_register_param:109,rethrow:108,myset:69,myseq:92,distsourc:66,fnstrart:84,cudevic:8,regular:[23,7,69,97,34,71,20,92,39,86,95,11,33,66,5,25],ccassigntoreg:53,secrel32:22,tradit:[23,31,30,84,104,17,76,111,16,44],simplic:[42,44,74,88,16,19],don:[84,41],pointe:[71,112],simplif:[76,31,83],pointi:92,alarm:35,obtus:103,dog:20,expandinlineasm:53,digress:[14,2],dot:[66,94],mypassmanag:30,hunger:[39,11],visitor:[65,42,30,17,74,21,83,44],esoter:116,llvm_enable_werror:61,speedup:30,syntax:[84,69,24],selftl:25,errstr:[40,46,2,48,49],image_sym_class_weak_extern:109,istruncatingstor:53,despit:[73,20,84,104,76,100,71,6,116],llv
m_parallel_compile_job:61,explain:[38,69,61,97,82,41,33,44,84,46,76,85,78,15,16,17,98],sugar:71,regnum:88,safepoint_pol:73,emissionkind:[71,104],pinst:16,hasgc:33,stop:[23,65,69,61,74,16,45,76,26,55,108,71,98,18],bar:[69,0,73,1,71,67,8,42,5,98,47,48,10,13,84,16,19,20,104,56,22,61,92,29],sacrific:[33,71],bpf_div:84,baz:[69,0,20,104,48,13,29],reload:[40,74,25,84,46,60,15],bad:[113,40,32,71,92,69,2,104,83,33,4,14,16,98],dw_tag_shared_typ:104,bam:69,newengin:49,addinstselector:53,flagpointi:92,cstdio:[40,42,55,46,2,48,49],instalias:84,"0x40":104,"0x42":112,"0x43":112,v8f64:71,msan:25,subject:[84,69,26,16,92],p1i8:[73,8],said:[39,69,71,104,11,108,16],xarch:23,simplest:[84,53,42,55,20,92,49,36,12,18],attribut:[80,77,45,112],add_memory_to_register_promot:15,triplet:[20,71],howtousejit:101,lazi:[71,41],gr1:71,diflagprototyp:[71,104],abs_fp80:6,configurescript:66,imagmag:[14,2],against:[23,101,26,61,97,102,8,5,25,92,47,10,63,3,50,71,108,31,16,34,98],fno:0,uni:8,readnon:[31,8,73,104,56,50,112
,71],constantindex:88,uno:71,foobaz:69,createload:[40,46],devbufferc:8,devbufferb:8,devbuffera:8,foobar:[92,69],int32_t:[74,92],"16b":78,loader:23,theoret:[4,16],"__________________________________________________________":16,three:[31,32,33,34,5,113,98,48,10,73,83,18,53,103,55,20,56,76,21,71,23,16,25,84,87,110,112,108,66],objc_properti:104,specul:[108,86,71,50,41],succ_begin:16,trigger:[72,7,92,61,41,74,83,30,62,10,69,88,71,34],interest:[31,84,73,34,1,68,36,69,37,71,72,38,39,40,41,42,5,44,98,46,2,48,49,10,11,12,13,14,15,16,17,18,19,102,74,20,104,76,78,23,108,25,92,86,26,55,114],basic:86,mo_registermask:84,tini:[33,102],llvmpassnam:61,build_load:15,suppress:[74,69,1,71,92],mce:53,multithread:[74,16],lpae:86,lpad:[108,71],argumentexpr:[12,13,14,15,18,19],llvm_include_test:61,ugli:[16,14,98,5,2],codegener:62,intregsvt:53,itinerari:[84,6,53],noredzon:[71,112],slt:71,servic:[4,98,41],lex_id:[12,13,14,15,17,18,19],slp:60,splitdebugfilenam:71,calcul:[76,31,60,53,41,71,30,84,104,48,59,10,1
3,103,16,34],typeflag:104,occas:69,sle:71,spawn:25,r600:[87,24],gninja:25,folk:[25,82],xxxkind:102,disappear:[23,98,35],grown:[14,11,2,39],receiv:[72,16,30,84,6,112,108,71,25,18],make:[61,112,41,84,86,87,78,83],bitmask:71,isspac:[40,42,55,44,46,2,48,49],initialexec:[71,112],kevin:84,ssl_ctx_new:25,zlib1g:9,kib:20,overs:16,revector:[31,16],binopprototyp:[14,15],vehiclemak:69,ea_r:84,addrawvalu:57,inherit:[76,69,102,41,16,20,84,63,21,30,4,29,6,116],llvm_dir:[33,61],endif:[67,39,40,20,69,11,4],programm:[84,102,24,74,20,75,86,69,66,83],paradigm:[30,16,103],left:[31,40,97,53,0,42,33,34,92,69,48,83,26,112,55,13,84,71,6,18,19],projusedlib:66,op0:112,op1:[71,112],op2:71,op3:53,bandwidth:71,human:[93,23,69,96,107,31,33,92,76,37,89,71,6],nowadai:9,yet:[31,69,73,34,47,71,72,2,48,49,33,12,13,14,16,101,53,74,20,76,114,108,25,84,87,110,27],languag:[84,86,87],macport:63,save:[84,0,47,36,37,71,72,65,40,8,46,2,48,49,12,13,14,15,16,53,20,104,78,23,61,82,108,30,62,63,88,112,25,116],vpsubusw:10,u999999
:82,applic:[91,69,33,34,95,71,6,72,38,39,105,97,44,2,49,10,11,50,73,12,14,16,17,101,53,74,20,76,78,61,108,25,84,26,88,112,27,66,116],segnam:20,winehprepar:108,opc:[40,46,2,116],wojciech:31,fact1:33,fact0:33,getinstlist:16,manual:[83,69,75,61,84],dindex:53,tolmach:74,machinepassregistrynod:76,choic:[93,23,39,69,73,16,25,35,48,88,77,11,65,13,71,44],jumptabl:71,unnecessari:84,cxxflag:[101,40,42,46,2,48,49,66],printd:[39,40,46,2,11,14,15],www:[25,94],deal:[91,31,69,112,102,108,46,104,86,21,26,78,15,16],somehow:[76,16],dead:[23,60,41,90,20,8,50,84,71,98],intern:[61,41,84,56,87,112],interg:67,make_pair:[33,40,46],ldststoreupd:84,insensit:41,collect:[95,69,59,41],tempor:71,tracker:[26,82],getchar:[40,42,55,44,46,2,48,49],xmm15:6,creatur:[14,44,2,17],burg:60,idiomat:[10,69],bold:106,identifierexpr:[40,42,55,46,2,48,49,12,13,14,15,18,19],uncompress:[23,16,61],mappingnorm:92,buri:69,strippointercast:69,promot:[65,60,41,84,26,50,71],burr:80,"super":[84,90,53],fnty:71,unsaf:[39,104,86,88,77,11,
80,71],dw_tag_formal_paramet:71,movsd:5,argv0:80,culaunchkernel:8,ppcf128:71,compilecommonopt:66,simul:[84,71,78],movsx:84,commit:69,marshal:88,movsq:84,mrm7m:53,contriv:[98,116],f128:[71,53],down:[31,84,33,6,67,38,39,40,102,41,113,2,48,11,13,14,16,18,53,103,55,20,104,76,77,78,80,23,82,83,25,62,63,26,108,66,30],f3_12:53,indexreg:84,mrm7r:53,nomodref:41,contrib:23,subl:[84,5],parsesubtargetfeatur:53,precomput:41,perldoc:23,frameinfo:53,xpass:1,imit:[106,29],ssl_do_handshak:25,r173931:21,fraction:[70,25,59,102],amazingli:[13,48],"_els":[40,46,2,48],fork:[4,25],numxform:16,creation:[74,94,71,57],form:[61,112,41],sub1:5,forc:[23,69,61,24,0,71,20,92,9,47,104,76,108,88,73,66,16,80],retarget:[38,84],nounwind:[8,5,104,56,10,50,112,71],phid:69,emitbyt:53,berk:30,autoinsert:16,addmoduleflag:40,bugfix:94,writeattribut:21,processrelocationref:72,llvma:66,multisourc:[10,34,26,104,62],"__i386__":[39,11],unrel:[26,16,104,53,94],classid:29,classif:[4,71],featur:24,semicolon:[23,40,61,116,42,55,46,2
,48,49,12,13,14,15,18,19],shim:31,visitgcroot:74,diagnost:[21,1,5,6,45],glanc:[39,69,11],ship:[23,39,74,87,99,11],dwarfnumb:53,vista:30,shlib:23,excel:[23,16,53,41],image_scn_align_2048byt:109,stackrestor:47,journei:[15,46],subdivid:34,"0fc2d20000":8,iteri:[12,13,14,15,19],libffi:63,setinsertfencesforatom:86,furthermor:[71,103,5,31],pseudo:[84,59,78,115],ignor:[91,0,33,37,71,38,40,41,42,5,44,45,46,2,48,49,12,13,14,15,16,17,18,19,53,20,104,59,23,84,26,112,55,27,66,28],image_sym_type_int:109,include_directori:61,value_2:27,skip:[69,0,73,71,67,40,42,55,44,46,2,48,49,12,13,14,15,17,18,19,53,74,104,78,84,112],"0x00000150":104,inlineasm:33,skim:69,createvirtualregist:84,mill:20,primer:106,pldi:74,hierarch:[31,112],misread:69,libit:20,fancier:[76,106],intermedi:[38,7,98,61,107,53,32,16,75,47,74,55,112,57,73,71,18],targetinstrformat:53,hasinternallinkag:16,image_scn_align_2byt:109,letitem:29,mandlebrot:[14,2],llvmbuilder:12,aspx:69,llvmdummycodegen:53,string:[84,61,97,24,20,1,77,56,110,3,11
2,79,80,69,5],bpf_add:84,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:[108,69,41],dif:31,dig:[44,17,116],iter:[72,31,60,41,74,33,20,84,69,83,26,90,71,59],item:[97,20,78,50,112,37],s_load_dword:24,div:[84,16],kernel_code_version_major:24,round:[67,84,78,94],dir:[23,61,32,25,1,9,104,87,95,66,71,51],sparclit:53,max_len:25,originput:20,nozero:80,sideeffect:71,addr:[79,71,53],addq:88,filler:30,insertbranch:53,favour:[6,100],addx:116,respres:16,rephras:103,addi:[71,116],xml:112,dwarf:[84,68],oversimplifi:16,elsev:[40,46,2,48],slow:[76,23,25,63,77,16],imul16rmi:84,wait:[69,24,32,55,114,4,18],patleaf:53,jumpi:30,insan:69,canadian:[23,87],shift:[31,65,33,30,84,6,59,112,71,20],bot:[38,26,69],storeregtoaddr:53,extrem:[91,23,84,53,31,16,25,41,46,104,83,76,26,112,86,70,15,71,29,116],bob:92,else_:[13,14,15],opcstr:53,stb_local:71,elect:26,modul:[61,41,84,56,112,83],"__jit_debug_register_cod":99,patchabl:[73,88],"0baz":16,"
0x60":97,"0x800":104,sake:[76,16],allocinst:15,getsubtargetimpl:[74,30,53],visit:[74,83,65,16],tokidentifi:29,deplib:112,perl:74,everybodi:[33,26],numfaultingpc:91,zeroargfp:116,checkout:87,rpath:23,makelegalfunctionnam:49,fcomi:84,com_fir:84,appel:74,oop:73,examin:[72,53,16,20,84,83,10,95,73,94,71],effort:[72,31,65,69,42,98,104,26,88,50,4,19],fly:[55,30,84,49,12,18],reviewe:26,ulp:71,uniqu:[84,112,0,73,5,57,104,70,90,22,71,33,27,88,16,6],ult:[46,48,12,13,14,15,71,19],sparcisellow:53,imped:71,nextvar:[40,46,2,48,13,14,15],nearest:[67,71],makefileconfigin:66,predict:[76,38,3,69,50],crazi:[20,44,11,17,39],subregion:71,dominatortre:76,exctype1:108,strikingli:[14,2],delete_funct:[12,13,14,15,19],subnorm:[71,8],binarypreced:[40,46,2],"0x000034f0":104,ping:[33,26],f32:[84,71,53,8],idiv:84,brain:69,till:[114,16,99],purg:69,attrparserstringswitch:21,pure:[31,60,53,42,73,30,84,26,27,29,19],ptr_is_nul:91,tile:30,doclist:92,testingconfig:1,map:[112,41],exctypen:108,max:[67,20,1,71],usabl:[53,2
0,84,77,16,30],intrus:[71,16],mac:[23,97,99,76,94,16],mag:71,mai:24,underscor:[66,69,104],maj:32,grow:[71,20,84,47,48,13,28,16],man:[10,23,20,61,38],noun:69,"0x00001000":104,myglob:104,targetframeinfo:53,purifi:62,containingtyp:71,talk:[39,69,42,55,44,46,65,48,49,76,11,12,13,15,16,17,18,19],image_sym_class_automat:109,abbrevop0:112,abbrevop1:112,config_fil:66,shield:[4,84],iptr:71,comdat:[22,112],"123kkk":20,recoup:112,nbsp:84,gcmetadata:74,entiti:[71,69,16,112,88],group:[69,84,5,97],thank:62,polici:[69,41],build_shared_lib:61,report_fatal_error:49,mail:[23,69,82,32,73,30,26,114,106,51],inlinehint:[71,112],main:[67,23,69,99,95,90,20,84,47,59,79,64,36,26,78,108,27,56,94,71,25],irbuild:[40,42,46,2,48,49,12,13,16,19],recoveri:[40,42,55,46,2,48,49,12,13,14,15,18,19],parseunari:[14,40,46,2],prime:[40,42,55,46,2,48,49,12,13,14,15,18,19],remateri:86,sooner:114,initv:[40,46],possess:[67,16],lo16:84,subproject:[23,30,26,94,38],xlc:23,careless:69,x11:16,myflag:92,misbehav:32,loopunswitch:31,l
lvm_dylib_compon:23,continu:[84,112,41],redistribut:26,libgcc:85,tmp8:103,bpf_or:84,arcp:71,tmp7:[5,103],tmp6:103,tmp1:[69,5],tmp3:5,baselin:[84,94],getbinarypreced:[40,46,2],"3rd":71,mess:[23,31],bespok:74,numval:[40,42,55,44,46,2,48,49,112],dw_tag_unspecified_typ:[71,104],arminstrinfo:53,uint32:[91,88],earlier:[27,67,71,50,53],"goto":[40,0,33,46,2,48,69,15],orr:71,tmpb:[40,46],ori:84,org:[23,40,61,82,38,32,25,64,9,87,92,10,42,36,26,114,69,94,34],ord:71,orc:30,befor:[61,24,41,84,86,78,83],v8deprecatedinst:53,sn_mapr:33,createasmstream:84,thing:[67,84,112,41,83,20,1,69,26,78,5],sn_mapl:33,principl:[69,105,33,44,4,17],think:[69,70,4,71,67,39,8,44,48,11,13,84,16,17,102,103,74,65,60,61,82,41,26],first:[69,93,1,95,3,5,67,97,41,98,83,74,20,75,56,78,80,61,108,84,86,26,112],reimplement:30,carri:[71,28,16,97,103],fast:[69,84,35,77,50,115],oppos:[23,60,29,20,111,13,71,51],getfoo:71,numop:[112,53],const_iter:16,indiviu:84,indivis:47,numindic:67,averag:[13,30,48,37],daunt:61,"0f42d20000":8,bro
adcast:71,my_kei:69,attrkind:[21,57],foldingsetnod:16,getpredopcod:70,vbr6:112,vbr4:112,vbr5:112,vbr8:112,redefinit:[40,42,46,2,48,49,12,13,14,15,19],valuedisallow:20,targetsubtargetinfo:30,were:[31,84,0,33,1,95,36,69,5,6,67,39,71,47,11,73,16,54,20,75,104,78,89,23,25,62,86,26,66,30],lcpi0_0:10,mcexpr:84,mrm5m:53,dw_tag_set_typ:104,llvmlibsopt:66,dash:[20,92],mageia:23,greet:116,gettargetlow:53,exclud:[5,84,26,113,70,66,71],mrm5r:53,repeatedli:[91,71],unadorn:71,weak_odr:[71,112],squar:[27,26,71,102,92],cumoduleloaddataex:8,llvm_target:[12,13,14,15],"_crit_edg":71,bpf_op:84,advis:[13,94,97,48,57],interior:[74,60,102],immsext16:84,channel:38,sparciseldagtodag:53,llvm_analysi:[12,13,14,15,19],ptrloc:[74,71],pain:[20,16,82,99],norman:84,trace:[60,73,20,104,76,30],normal:[91,69,0,73,1,95,4,5,7,96,97,71,50,93,16,74,20,75,104,76,21,78,111,23,61,82,107,108,84,85,86,87,26,88,112,66,28,90,116],track:[31,84,33,1,69,71,6,40,41,42,98,46,2,50,73,14,15,16,19,74,104,76,23,83,25,62,26,88,108,30],nes
tabl:[29,116],cucontext:8,pair:[31,69,73,71,5,40,41,55,46,48,33,13,84,16,18,53,78,57,24,108,92,86],r31:[84,71],isglobaladdress:53,synonym:97,cumodulegetfunct:8,dw_form_:104,rev128:78,getmetadata:104,llvmgxx:66,isphysicalregist:84,defaultconfig:16,gracefulli:16,show:[3,84,1,5],occumul:25,shoe:92,threshold:[31,71,95],corner:88,getadjustedanalysispoint:41,emitexternalsymboladdress:53,dice:16,fenc:[69,50,86],enough:86,frexp:71,adc64mi32:6,parametr:[30,29],ftest:95,hello_world:24,sourcewar:64,intptr_t:[40,0,46,2,48,49],gep:98,variou:[69,70,71,72,105,41,113,50,84,83,67,75,23,61,108,25,8,86,87,112,27,66,90],get:[86,78,41],mung:[31,103],secondari:[26,88],repo:23,emitlabel:84,wheezi:9,inreg:[84,71,112,53],gen:[115,24],r10b:6,nullptr:[69,40,71],yield:[31,103,73,20,112,71,34,16],r10d:6,stupid:83,mediat:41,r10w:6,wiki:[23,61],kernel:[80,84,71],setpreservesal:76,"__builtin_setjmp":108,intrinsicsnvvm:8,spars:[23,65,60,84],msa:[30,71],sean:16,testcas:[42,113,26,19,71,16],"0b1001011":116,infinit:[3
1,25,84,71,41],expandatomicrmwinir:86,allroot:34,innov:30,maskedbitset:92,datalayoutpass:[30,40],enumer:[84,112],label:[112,84,59,24],innoc:[13,48],enumem:53,volatil:[74,98,84,86,41],across:[31,0,73,37,71,6,39,8,49,11,50,12,16,20,104,76,78,23,60,84,86,88,27],august:72,parent:[23,69,42,71,1,48,108,27,13,16,59],fpregsregisterclass:53,modref:[116,86,41],parseprototyp:[40,42,55,46,2,48,49],copyabl:16,false_branch_weight:3,llvm_enable_sphinx:[23,61],blocklen:112,audienc:50,library_nam:27,litloc:40,p0i64:5,improv:[23,39,82,53,31,74,33,25,1,41,49,76,108,11,50,73,12,94,71,30],peephol:[65,40,84,46,2,48,49,76,12,13,14,15,16],among:[31,90,84,23,33,8,69,41,87,21,22,50,16],acceler:94,undocu:69,unittest:61,tsflag:53,getnumsuccessor:69,cancel:108,iscal:[6,116],inadvert:[4,5],mctargetdesc:21,xadd:86,ultim:[69,32,1,49,12,66,71,6],cleargraphattr:16,p0i8:[71,8],mark:[67,23,84,24,74,33,1,86,99,91,69,50,112,108,28,71],certifi:98,"0x4004f4":79,dw_tag_structure_typ:[71,104],calledcount:83,fadd:[65,84],squ
ash:[23,78],f92:8,f93:8,f90:8,f91:8,f96:8,f97:8,f94:8,f95:8,univers:[67,79,26,69,95],f98:8,f99:8,those:[31,84,33,1,35,95,69,37,4,71,6,67,38,40,97,41,5,45,46,10,73,15,16,53,103,74,20,104,76,23,61,83,92,86,26,88,108,27,66],sound:[25,41],isvararg:16,interoper:[39,74,71,11,108,16],invok:[23,69,61,41,74,83,20,84,47,87,95,3,50,112,108,5],"0x3feb":104,"0x3fea":104,invoc:[23,61,113,84,5,83,76,66,71],isdoubl:116,gvneedslazyptr:53,advantag:[39,69,103,74,71,20,84,46,2,86,26,11,78,57,14,15,16,90],mfloat:9,bytecode_libdir:66,destin:[40,97,53,108,84,46,10,3,50,15,71],llvm_gcc_dir:34,variable_op:116,my_function_precis:8,cudeviceget:8,liveoffset:74,same:[69,112,41,84,86,87,78,83],ssl_library_init:25,image_file_machine_unknown:109,pad:[67,97,108,47,88,112,71],emitloadlink:86,pai:[10,26,69,53],oneargfp:116,add32mi:6,exhaust:[74,23,84],assist:[69,62,2,66,14,115],executionengin:[23,40,61,99,30,84,46,2,48,49,12,13,14,15,16],capabl:[71,39,105,8,42,46,2,49,11,12,14,15,16,19,53,20,65,76,23,84,41,87,90],ker
nel_code_entry_byte_offset:24,executeprogramandwait:4,runonmachinefunct:[84,53],appropri:[31,92,32,9,1,94,69,70,4,71,6,65,84,8,102,55,46,2,50,73,14,15,16,18,53,74,20,104,76,78,57,23,108,30,41,86,26,114,66,90],macro:[67,23,69,61,20,75,95,71],markup:[69,87],spadini:31,getobjfilelow:74,asmnam:53,dllvm_include_test:23,roughli:[60,102,108,84,86,94],emitleadingf:86,release_22:23,execut:[86,83,59,87,41],speccpu2000:34,mo1:53,mul_ri:116,mygcprint:74,subblock:112,aspect:[29,39,40,61,42,16,30,84,104,48,74,26,11,55,13,71,18,19],mul_rr:116,flavor:[71,16,104,116],"125000e":71,xxxtargetmachin:53,critial:94,param:[69,8,74,1,114,36,12,13,14,15,16,19],cumoduleunload:8,sparcregisterinfo:53,"__cxa_throw":108,dclang_tablegen:9,setrequiresstructuredcfg:53,mcregaliasiter:84,mov:[8,71,84,86,22,5],coverage_pc:25,libsfgcc1:9,mod:[71,41],cast_or_nul:16,is_ptr64:24,ifstream:8,qnan:71,server:[25,16],bb0_4:8,bb0_5:8,prologuedata:112,either:[31,62,33,34,1,94,69,71,6,72,39,40,97,8,55,44,98,48,49,10,11,73,12,13,84
,16,17,18,101,53,103,74,20,75,65,77,78,79,23,61,83,25,41,86,64,26,88,112,108,66,116],bb0_2:8,physreg:84,nice:[31,69,5,39,42,55,44,46,2,48,49,11,12,13,14,15,16,17,18,19,20,76,23,116],mappingnormalizationheap:92,fulfil:[4,102],exitcod:1,fastcal:[84,71],ascend:[67,71],substitu:10,llvm_enable_doxygen_qt_help:61,adequ:[74,36,61,53],confirm:69,llvmscalaropt:51,recomput:[76,16,41],ffi_library_dir:61,"__llvm_stackmap":88,inject:69,dw_op_plu:71,ret_val:[12,13,14,15,19],overli:26,broken:[38,98,53,1,10,26,78,76,116],cuinit:8,selectaddrrr:53,cornerston:103,x32:5,x30:71,dw_ate_address:71,island:[105,24],loadinst:69,pluginfilenam:80,deopt:73,llvm_targets_to_build:[23,36,61],lcamtuf:25,livecount:74,hashtbl:[12,13,14,15,18,19],strip:[23,20,75,87,95,66,90],"0x3fe9":104,ymax:[14,2],mingw32:[10,114,84],overwrit:[20,88,51],legalact:53,savethi:5,x86inst:6,source_x86_64:79,dw_ate_boolean:71,jite:[38,99,49],gori:26,buggi:62,stringmapentri:16,gprc:84,reappli:26,possibl:[61,112,41,84,86,87,78,83],optnum:20,
poolalloc:41,unusu:[39,74,84,85,11,66,16],sanitize_address:71,embed:112,i32mem:116,emitpseudoexpansionlow:21,machinefunctioninfo:84,emitloc:40,threadloc:[71,112],subprogram:[40,71,104],deep:[31,69,102],simpletyp:109,deem:[65,62,71,94],emitvalu:84,release_xyz:94,proport:[66,20],fill:[40,41,42,16,30,44,46,2,48,49,76,69,55,114,92,62,71,20,104],again:[33,34,94,71,39,42,5,46,48,49,11,12,13,15,16,20,76,78,108,25,62,85,106],mangler:53,field:[67,84,97,103,41,74,1,111,50,112,70,71],xxxgeninstrinfo:53,"0xc0de":112,riinst:116,architectur:[84,61,24,1,86,95,77,78,79,80,5],reextern:[40,42,46,2,48,49,12,13,14,15,19],"0th":103,sequenc:[31,69,0,73,5,67,41,71,50,33,16,53,103,74,76,21,78,80,108,84,88,29,116],arrayidx:71,unload:[76,71],descript:[86,112,41],v2f64:71,version_less:61,winzip:36,getreturntyp:16,unset:[40,29],insertbefor:16,forget:[74,40,69,102],mrm3m:53,dollar:35,dw_form_ref2:104,sunk:41,llvmdummyasmprint:53,dw_form_ref1:104,regno:84,mrm3r:53,dw_form_ref8:104,dinstinguish:71,children:[66,10
2],edg:[74,5,25,84,83,71,59],image_sym_class_clr_token:109,at_byte_s:104,cmake_c_compil:23,daniel:104,brtarget8:53,immt:6,image_scn_lnk_comdat:109,r14:[84,6],r15:[84,71,6],r12:[71,84,22,6],r13:[84,6],r10:[84,85,6,8],r11:[85,71,6,88],fals:[31,69,46,1,35,3,70,71,40,102,41,42,113,98,9,2,48,49,33,13,16,53,20,104,76,21,80,23,83,66,90],offlin:[84,8],util:[80,41,97,68,37],fall:[31,40,53,74,16,20,46,2,48,49,59,69,71,12,13,14,15,5,30],"0x629000004748":25,"__clear_cach":71,basereg:84,run_funct:[12,13,14,15],dereferenceable_or_nul:71,gcno:95,use_end:16,stderr:25,fuzzerinterfac:25,quiet2:20,webkit_jscc:[71,112],rawfrm:[53,116],globalalia:76,lawyer:26,val3:71,val2:71,val1:71,val0:71,val7:71,excit:[39,11,30,94],abc:71,parsedattrinfo:21,excis:71,abi:[61,78],worthwhil:16,abl:[67,23,60,97,103,41,74,71,20,62,9,47,83,26,90,50,27,84,5,98],desttool:66,cont1:108,abu:97,g0l6pw:23,cont2:108,hurdl:98,exit5:8,cumemcpydtoh:8,valc:8,variat:[53,41,0,84,4,106],vala:8,sophist:[74,34,84,76,106,71],analysisusag:41,
memory_order_acquir:[71,86],test_exec_root:1,variad:69,xemac:[23,66],valu:[69,93,1,95,3,37,5,7,96,97,41,113,45,101,54,75,77,78,80,61,24,107,84,86,87,110,112,115],quieta:20,search:[23,60,61,74,5,20,1,83,70,26,108,27,66,71],unabbrevi:112,image_rel_amd64_sect:22,createfcmpon:[40,46,2,48],r12w:6,r12b:6,val_:15,r12d:6,codebas:[69,82],narrow:[23,65,69,103,41,113,62,86,83,16],iuml:84,quotient:71,primit:86,transit:[33,30,84,70,27,71],inappropri:30,establish:[53,74,73,84,49,26,50,12,71],memor:69,vptr:[71,16],mylib:66,zeroiniti:71,parse_expr:[12,13,14,15,18,19],tackl:[12,15,46,98,49],two:[61,112,24,41,86,3,78,83,59],x86targetasminfo:53,getbit:20,saptr:71,desir:[31,69,73,1,70,71,6,72,39,5,10,11,50,16,53,74,20,104,76,22,83,88],upper16:22,penultim:53,reconfigur:[27,114],anon_func_:49,particular:[31,62,33,34,1,95,69,71,6,72,84,8,102,55,46,47,49,10,50,73,12,15,16,18,67,53,103,74,20,104,76,21,23,83,30,41,86,88,112,108,27,29],ultrasparc:[23,53],dictat:[85,69,16],none:[84,73,1,94,70,4,71,97,12,13,14,
15,16,18,19,103,74,20,76,79,80,23,108,62,66,116],dep:[12,13,14,15],elsebb:[40,46,2,48],dev:[38,39,86,82,74,16,77,9,65,104,76,26,11,50,73,80,69,29,116],remain:[67,31,69,112,97,74,5,30,46,2,94,10,26,88,71,108,14,15,16,116],paragraph:[33,69,106],deb:9,binfmt_misc:23,def:[70,84,65,60,111],share:[23,84,61,8,113,62,9,86,87,83,77,90,112,80,70,66,69,99,71,98],sln:36,loopend:[40,15,46,2,48],mcobjectstream:84,minimum:[23,65,69,61,53,113,25,62,104,26,88,55,71,30,18],image_file_executable_imag:109,dw_ate_unsign:71,strlen:16,retcc_x86_32_ss:53,calltmp1:[42,13,48,19],calltmp2:[12,49],kcc:25,awkward:[20,69,103],secur:[31,20],cse:[12,65,60,86,49],comfort:33,unittestnam:61,cst:71,csv:34,bar_map:69,regener:[62,53,94],"0x0000000000000002":99,number2:33,number1:33,add32mr:6,memory_order_seq_cst:[71,86],bloom:84,ccpassbyv:53,sse4:0,binloc:40,sse2:[10,71],mislead:69,hfc:91,cs1:41,image_sym_dtype_arrai:109,rotat:[65,84],intermediari:16,isconstantpoolindex:53,mydoctyp:92,through:[61,41,84,86,112,83,59],suf
fer:74,llvm_src_root:[66,34,51],patfrag:53,pch:104,ssl_free:25,good:[23,65,60,105,41,113,20,84,69,35,83,26,50,94,71],pollut:[69,87],compound:67,nor:[31,69,103,74,33,84,36,88,112,66,4,71,98],adventur:16,complain:[23,64],cmpflag:33,mysteri:103,micro:69,token:[65,84],distdir:66,subsystem:[84,71],harm:84,mm5:[6,116],unequ:71,mm7:[6,116],hard:[84,97,82,44,33,25,92,9,2,35,63,26,83,50,100,4,69,71,6,51,98],mm1:[6,116],idea:[31,65,69,32,33,20,35,48,49,42,59,26,112,55,116,71,34,104],functor:69,mm2:[6,116],image_file_machine_thumb:109,connect:[114,31,60,16,82],orient:[16,39,69,11,102],sparcgenregisterinfo:53,usedlib:[66,51],dw_tag_xxx:104,isref:116,variable_nam:61,dagcombin:65,isinlin:104,cconv:71,mmx:[84,71,53],intregssubregclass:53,suspici:4,roots_iter:74,cuctxdestroi:8,dw_tag_union_typ:[71,104],omit:[31,7,84,96,93,75,48,110,76,77,88,55,37,79,13,58,111,71,18],intermingl:71,buildmast:114,testfnptr:71,llvmgccdir:34,vmov:5,perman:[98,94],"__c_specific_handl":108,callon:16,registerasmstream:84,p
rintsth:31,exchang:[23,16],argstart:20,done:[31,84,32,33,34,35,94,69,70,4,99,71,72,65,40,97,42,55,46,2,48,49,10,73,12,13,14,15,16,18,19,102,74,90,20,75,104,76,61,82,83,92,85,86,26,108,66,29,116],dylib:[10,63],stabl:[90,26,16,45,94],rootnum:74,functionindex:57,image_sym_type_uint:109,somewhatspecialsquar:102,expansionregiontag:67,least:[31,69,32,46,1,35,94,71,40,97,41,42,55,9,2,48,49,73,12,13,14,15,16,18,19,53,20,21,78,23,84,86,26,88,112,116],createpromotememorytoregisterpass:[40,46,49],unalign:86,cfe:[23,26,82,94],binop:[40,42,55,46,2,48,49,12,13,14,15,18,19],power8:30,selector:[23,108,84,104,21,115,71],part:[31,84,33,1,36,69,71,6,39,40,102,41,42,113,44,46,2,48,49,10,11,50,73,12,13,14,15,16,17,18,19,53,103,74,55,20,104,76,21,78,23,61,83,25,92,86,26,112,108,27,66,90,30],pars:112,toolset:[30,61],contrari:84,cyclic:23,i32:[67,91,98,74,108,84,56,3,78,5,59],"_tag":[12,13,14,15,18,19],horizont:5,i8mem:84,"_runtim":88,fpinst:6,constval:16,xxxtargetlow:53,uncontroversi:74,char6:112,debug_lo
c:89,consol:[12,38,84,106,49],built:112,build:[56,112,41],extractel:78,distribut:[23,69,113,1,9,87,99,36,26,59,98],significand:71,previou:[67,65,69,97,112,84,86,78,5],chart:0,most:[84,33,1,35,86,36,69,37,71,72,65,8,5,98,9,99,50,101,102,103,74,20,75,78,57,94,23,24,108,25,62,41,87,63,26,27,66,28,115],cygwin:[23,36,84],undetect:25,charg:84,dereferenc:[91,50],"234000e":[42,19],resolvereloc:72,t2item:33,sector:4,visitbasicblock:16,carefulli:[74,46,104,26,15,71],particularli:[69,53,5,86,76,50,71,16],fine:[69,61,102,103,20,36,50,78],find:[67,65,45,61,41,113,20,1,69,115,95,26,108,84,83],realmag:[14,2],merger:33,filesizepars:20,printmemoperand:53,hasctrldep:[6,116],unus:[7,60,8,25,84,69,27],express:[84,69,41],cheaper:[91,16],wrinkl:47,restart:[76,114,25,16],misnam:84,mycustomtyp:92,image_file_machine_arm:109,diloc:5,common:[65,69,112,97,103,41,74,108,20,84,86,87,26,50,78,111,98],intptrsiz:74,"_frame_handler3":108,printout:[75,16],decompos:[65,26],atomtyp:104,reserv:[91,53,73,84,94,88,112,71]
,mrm1m:53,ccdelegateto:53,someth:[31,92,33,36,69,70,4,71,39,40,84,41,42,5,46,2,48,49,11,73,12,13,14,15,16,18,19,53,102,20,65,21,111,23,25,62,26,55,106,29,116],someti:71,debat:69,smallest:[62,71],subscript:[31,71,41],experi:[106,61,33,104,35,73,12,66,49],altern:[83,84,61,95],dw_at_apple_property_gett:104,bourn:[23,20,98],appreci:26,complement:[71,16,103],enginevector:49,popul:[23,65,8,108,25,1,87,21],alon:[55,20,84,10,26,66,18],foreign:[98,61],densemapinfo:16,cpufreq:35,libcrypto:25,simpli:[31,69,73,34,4,71,97,41,42,5,98,9,49,10,12,16,51,19,53,103,55,20,75,104,76,23,83,84,26,88,18,108,66,28],fldcww:84,point:[69,61,41,84,86,77,112,83,59],instanti:[72,92,102,53,20,1,76,95,21,16,6,116],linkagenam:71,alloca:[69,103,74,84,47,50],suppli:[108,62,35,87,94,112,71],setinternallinkag:16,throughout:[72,67,112,23,78,66,4,71],backend:[83,86],global_begin:[69,16],dovetail:[15,46],aarch64:[87,78],linkonce_odr:[71,50,112,8],retq:73,val1l:71,globalvarnam:71,reformat:28,multiclassobject:29,image_sym_cl
ass_extern:109,lto_codegen_add_must_preserve_symbol:90,unnecessarili:[76,41],gap:[69,71],understand:[65,1,41,108,84,69,26,112],atomicrmw:86,isstoretostackslot:53,raw:[72,67,7,84,96,107,93,20,75,95,21,57,28,34],autoregen:53,unifi:[71,50,112],fun:[39,44,22,11,66,12,13,14,15,17,19],everyon:[39,26,11,69],subsect:16,propag:[23,60,61,108,20,84,71],lto_codegen_add_modul:90,mystic:[39,11],semispac:74,itself:[92,32,33,1,47,95,69,71,39,40,84,41,42,113,98,9,2,48,49,10,11,50,46,12,13,14,15,16,18,19,102,54,74,55,20,65,104,76,78,103,23,61,73,90,30,62,87,26,88,112,108,27,66,29,25,116],codegen_func:[12,13,14,15,19],"0x00007ffff7ed40a9":99,case_branch_weight:3,myseqel:92,incarn:65,benign:34,getlin:40,flag2:33,flag1:33,nameflag:104,keyr:23,"0x3fed":104,sym:[32,111,22],keyt:16,moment:[74,73,71,86,19],travers:[31,84,102,74,33,1,27],task:[108,65,69],n_bucket:104,entri:[112,59,24,41],"16mib":22,uint32_t:[92,104],apply_token:25,spend:1,instr_begin:15,explan:[61,102,24,33,30,98,71],obscur:16,shape:[94,16,6
,102,104],at_decl_lin:104,depriv:16,stwu:84,cut:[20,59,53],shiftinst:69,snan:71,singlesourc:[10,34],"0b000000":53,restructuredtext:[106,87],objectbodi:29,largeconst:88,realloc:41,rgm:76,bin:[23,95,32,113,20,9,87,10,64,36,25,6,51],"0x00001023":104,xcodebuild:61,llvm_tarball_nam:66,judgement:26,transmit:71,fucomip:84,bit:[78,24,86],ccassigntoregwithshadow:53,knock:69,writealia:33,semi:[27,74,39,11],sema:21,has_jit:27,aliasset:[53,41],often:[65,69,61,41,74,83,20,84,86,26,50,78,5,98],steensgaard:41,weakodrlinkag:16,dllimport:[71,112],bach:4,"0x00002000":104,breviti:[78,8],sizeof:[71,98,16,8],sparcreg:53,arcmt:35,cont:[71,47],per:[84,73,34,37,71,67,97,8,49,12,16,102,74,20,104,76,21,59,61,90,30,92,86,111,88,112,108,27,66,29,25],usernam:[23,26],substitut:[31,84,5,25,1,86,88,71,116],mathemat:[8,33,98,55,71,18],larg:[69,113,20,84,86,26,22,112,37,80,83],chandlerc:82,cmake_instal:61,reproduc:[25,62,46,10,26,15,83],createentryblockalloca:[40,46],bb0_1:8,intial:16,patient:76,dw_tag_template_valu
e_paramet:71,initialse:43,addpdrr:116,unvectoriz:0,s15:71,llvm_definit:61,adc64rm:6,addpdrm:116,float_of_str:[12,13,14,15,17,18,19],impos:[71,26,16,84,88],usb:35,constraint:[84,65,75],preclud:[73,78],createfadd:[40,42,46,2,48,49],litconfig:1,forexprast:[40,46,2,48],disclosur:26,timberwolfmc:34,fmin:71,add32mi8:6,ostream:[69,40,16],nsz:71,frames:74,n2242:69,nsw:[26,71,50,103],inclus:[95,66,4,115,71,51],errno:[71,41],megabyt:[113,87],x86_fastcallcc:112,subst:[29,6,116],includ:[61,41,84,86,87,3,78,83],cptmp0:53,cptmp1:53,forward:[31,69,73,4,71,65,41,42,55,44,48,16,17,18,19,74,104,57,108,84,112,29,116],image_scn_align_1byt:109,llvm_build_doc:61,reorgan:92,dwarfdump:68,int8_t:92,translat:[31,69,71,67,39,40,96,41,98,11,84,16,53,103,20,104,21,23,30,92,86,115],llvmfoldingbuild:12,codeblock:74,concaten:[29,23,16,10,78,71,116],internaltarget:66,mfenc:86,exported_symbol_fil:66,movsx16rr8w:84,movnt:71,v8i16:53,curr:17,xxxiter:16,attrinfomap:21,flow:[72,31,45,53,8,108,16,30,0,69,41,83,76,91,26,9
0,50,73,84,71,106],debug_nam:104,functioninfo:91,codgen:19,isdigit:[40,42,55,44,46,2,48,49],prevail:97,singli:74,cmake:87,crypt:26,sequenti:[71,84,5,112,108],declas:71,llvm_target_arch:61,bpf_rsh:84,vg_leak:1,asymmetr:103,deseri:21,image_scn_lnk_remov:109,functionnod:33,mismatch:[78,110],globalvar:112,formatt:71,tok_numb:[40,42,55,44,46,2,48,49],cater:21,mymodul:30,deserv:[71,50],image_sym_type_float:109,image_comdat_select_associ:71,machine_version_step:24,debugloc:40,downcast:102,i16:[84,71,53,8],tradeoff:[12,74,86,49],required_librari:27,dwarfregnum:53,"0fb5bfbe8e":8,queri:[69,41,20,84,86,50,57,70,71],strex:86,regallocregistri:76,demangl:[79,111,104],privat:112,antisymmetr:33,sensit:[76,92,45,61,41],elsewher:[66,53,73],createtargetasminfo:53,granular:4,cumoduleloaddata:8,exit:[84,59],priority_queu:16,loopinfowrapperpass:76,bpf_sub:84,immsubreg:53,vla:22,named_valu:[12,13,14,15,19],cudeviceptr:8,volum:[38,16,66],implicitli:[84,0,69,71,39,42,55,44,2,48,49,11,12,13,14,15,16,17,18,19
,20,76,92,26,88,112,66,29,116],postord:60,refer:[84,61,112,41,113,1,83,69,78,80,111,5,59],pbqp:[84,77],"0x9":84,"0x8":84,fortun:[39,69,46,48,49,11,12,13,15,16],veli:84,"0x3":[88,84,16],segmentreg:84,"0x1":[88,84,16,104],"0x0":[84,16,112,24],toplevelexpr:[40,42,55,46,2,48,49,12,13,14,15,18,19],"0x6":84,"0x5":[84,88],"0x4":[84,88],append:[61,97,71,96,10,95,112,113,13,16,51,116],"0x1f84":79,resembl:103,unwound:71,access:[86,78,41],agg1:71,microprocessor:[84,71,53],regstat:84,deduc:[71,50],camlp4:[17,18],sint:71,"0xk":71,"0xh":71,partialalia:41,"0xm":71,jonathan2251:52,"0xc":[84,112],"0xb":84,"0xa":84,sine:[71,53],sinc:[62,92,32,33,35,94,36,69,70,4,71,6,72,40,84,8,42,55,44,98,9,2,48,49,46,12,13,14,15,16,18,19,53,103,74,102,20,104,76,59,97,23,73,108,30,41,85,26,88,112,66,106,29,25],"0xe":112,"0xd":[84,112],remark:[83,0],fpregsregclass:53,cerr:8,foundat:76,mov64ri:53,tool_nam:23,expr1lh:67,toshio:84,getimm:53,faddr:49,advoc:69,projlibspath:66,select_isd_stor:53,"_regoffset":6,at_encod:104
,elfv2:30,bpf_jne:84,trait:[69,92,16],attrspel:21,image_scn_align_512byt:109,trail:[67,92,103,16,20,1,69,71],account:[23,102,82,74,33,26,114],dcmake_c_compil:25,komatsu:84,createlocalvari:40,rdynam:[14,15,2,49],obvious:[31,65,84,103,41,32,16,20,44,69,49,76,26,55,33,71,17,18,116],ch8:40,unread:[69,86],fetch:[23,3,71,84],aliv:[76,31,84,16,33],n2657:69,abcd:112,tarbal:[38,94,9,66],virtualindex:71,onlin:[15,46],formmask:53,serial:[65,33,92,21,66,51],everywher:[10,12,92,49,33],surfac:84,rootcount:74,optyp:53,add32rm:6,inteldialect:71,llvm_lit_tools_dir:[36,61],ssl_ctx_use_privatekey_fil:25,add32rr:6,add64mr:6,powerpc64:105,getehframesect:72,inst:[31,25,16,53,116],nothidden:20,llvm_include_dir:61,redund:[84,20,60,50],bind:[69,71,38,40,42,55,98,46,2,48,49,12,13,14,15,18,19,53,30,92,29,116],correspond:[31,92,33,36,69,70,5,6,67,65,40,102,8,42,71,45,48,73,13,84,16,98,18,19,101,53,103,74,55,20,104,56,76,77,22,78,79,23,60,61,83,62,86,87,26,112,108,29],afterloop:[40,46,2,48,13,14,15],region1:67,
region0:67,noitin:80,fallback:112,loopendbb:[40,46,2,48],writethunkoralia:33,jithelp:49,declet:71,ptr_rc:84,symbolt:16,cpu_x86_64:92,bunch:[44,34,98,2,49,12,14,16,17],tok1:25,acycl:[84,60,53,115],outputdebuginfo:20,labor:20,i1942652:71,typemap:65,immtyp:6,basic_ss:116,uncategor:20,passnam:75,dan:92,spell:[26,21,69],dai:[38,39,61,23,94,26,11,16],symbol2:22,symbol1:22,nval:71,mylist:92,isimplicitdef:6,strive:[10,69],createfcmpult:[40,42,46,2,48,49],parseexpress:[40,42,55,46,2,48,49],mem2reg:74,mem2ref:73,sin:41,dllvm_libdir_suffix:61,add16ri8:6,lie:20,getloopinfo:76,intellig:[71,16],cmake_module_path:61,addtypenam:16,llvmsupport:[23,51,66],fluctuat:41,rex:71,paramattr:112,twice:[23,32,33,49,76,36,12,66,71,16],createmyregisteralloc:76,rev:[78,12,13,14,15,18,19],ret:[98,103,74,84,56,3,78,5],stub:[33,84,16,105,53],typenam:16,stuf:5,rel:[69,32,34,1,94,37,71,38,40,5,98,48,13,16,51,74,20,22,59,23,25,84,85,88,112,28],rem:84,image_file_machine_powerpc:109,rec:[12,13,14,15,17,18,19],dw_apple_p
roperty_assign:104,ref:[23,41,8],defens:26,math:[80,20,77,69,50],clarifi:[104,86],insid:[31,84,32,33,34,1,69,71,67,38,9,99,10,73,16,102,54,74,104,76,21,25,92,87,112,29,116],workflow:25,flaghollow:92,standalon:[39,40,44,84,50,27],invas:[26,92],bleed:38,setinsertpoint:[40,42,46,2,48,49],i128:30,retain:[60,16,20,98,76,26,78,66,71],hex64:92,suffix:[76,65,69,61,53,24,42,16,20,1,97,10,95,96,77,93,66,71,19],createcompileunit:40,pgo:110,targetregsterinfo:84,pgr:38,ualpha:29,secondlastinst:53,facil:[69,41,74,20,1,104,36,66,4,30,51,98],suffic:78,llvm_enable_eh:61,stencil:30,target_data:[12,13,14,15],messag:[69,61,97,107,83,20,1,5],sadli:82,dw_apple_property_sett:104,llvmusedlib:66,comparefp:116,ogt:71,mytool:66,s31:71,s32:8,pg0:33,pg1:33,"__objc_imageinfo":71,nontempor:71,image_file_aggressive_ws_trim:109,source_i386:79,rpass:0,structur:[69,97,54,5,84,41,68,86,112,83],ssl_ctx_use_certificate_fil:25,"123mb":20,then_val:[13,14,15],plaintext:87,thereaft:88,subclassoptionaldata:33,ehobj:108,depre
c:[61,53,30,10,112,16,34],ispack:112,have:[91,69,1,95,37,5,67,65,97,41,45,50,83,98,74,20,75,111,22,78,59,61,24,108,84,86,87,26,112],tidi:76,llvm_build_dir:23,bpf_jsge:84,min:[32,25,71],mib:22,mid:[71,47],in64bitmod:84,sspreq:[71,112],mix:[69,103,90,84,5,64,27,16],builtin:[1,86,112,54],bpf_jsgt:84,startval:[40,46,2,48],p3i8:8,mit:[30,26],isloc:[71,104],poison_yet_again:71,unless:[31,69,73,34,94,95,71,7,5,98,46,48,10,50,13,15,16,53,103,74,20,76,77,61,107,24,83,25,87,26,88,108,66,106],eight:[84,71,97],transcript:[12,49],v8i32:71,arm_aapcs_vfpcc:112,gather:[27,108,20,26],request:[72,23,97,74,71,26,112,108,90],image_file_machine_mipsfpu16:109,getdirectori:[40,104],institer:16,instantiatetemplateattribut:21,occasion:[74,112],addpassestoemitmc:72,addtmp:[40,42,46,2,48,49,12,13,14,15,19],dllexport:[71,112],elid:[74,47,116],ifconvers:53,text:[69,61,97,24,84,110,111,5],ifconvert:53,sanitize_thread:71,llvm_map_components_to_libnam:61,setter:[71,21,16,104],dw_tag_pointer_typ:[71,104],textual:[6
0,77,84,49,10,95,21,26,12,28,116,71,6,98],loweroper:53,src_root:23,"__morestack":85,cpunam:[80,77],inferior:99,data64bitsdirect:53,print_newlin:[12,13,14,15],lower_bound:16,litvalu:112,sysv:111,disagre:71,bear:5,dllvm_dir:61,image_sym_class_member_of_struct:109,increas:[31,69,0,42,30,62,26,50,100,80,90,6,19],build_sub:[12,13,14,15,19],at_end:[12,13,14,15,19],callpcrel32:116,blogspot:25,integr:[61,68],printlabel:53,conform:[23,1,74,16,92,69,71,98],project_nam:51,emitfnstart:84,ssl_ctx:25,dw_tag_file_typ:104,reform:69,pattern:[84,86,78],boundari:[31,78,16,84,112,71],progress:[60,61,74,108,44,1,94,26,105,84,16,17],"0b100":116,"0b101":116,switchtosect:84,nvptx64:8,phase3:32,plugin:[113,75,80],equal:[69,33,3,71,40,102,41,55,98,46,2,48,50,13,14,15,16,18,53,20,59,24,108,84,112,116],instanc:[72,84,61,82,102,32,5,20,1,69,47,104,74,21,88,71,33,94,16],valuelistn:29,comment:[84,24],guidelin:[16,69,26,9],vend:47,functionnam:[74,71],unreferenc:[66,71],gc_transit:73,defini:70,isnul:69,llvm_cmake_d
ir:61,type_info:108,autovector:0,component_1:27,component_0:27,tranform:71,createmul:16,assert:[84,61,87],statist:[67,41,75,77,37,80],determinist:[83,21,16,84,41],multi:[108,20,69,58],plain:[76,106,16],defin:[61,112,41,84,86,56,3,78,59],operandtyp:53,noimplicitfloat:[71,112],func_typ:73,helper:[69,33,1,72,40,41,42,55,46,2,48,49,10,14,15,16,17,18,19,53,20,104,21],almost:[23,65,60,74,30,84,69,26,78,4,16],irreduc:[31,53],maystor:6,isreturn:[6,116],build_alloca:15,substanti:[69,41,74,49,12,71],prose:69,unneed:[15,46],llvm_enable_zlib:61,japanes:23,"__cxxframehandler3":108,whenev:[69,41,5,20,99,10,70,88,71,113,27,66,16,44],codepath:86,infer:[84,102,54,73,92,69,77,50,78,80,66],backtrac:[84,40],denot:[23,84,74,92,112,71],valueopt:20,dealloc:[74,71,16],default_branch_weight:3,sm_30:84,image_scn_align_32byt:109,sm_35:84,center:40,neural:34,nevertheless:71,getopcod:[16,53],builder:23,col:40,dfpregsregisterclass:53,setp:8,choos:[84,70,71,42,113,44,48,49,12,13,16,17,18,19,53,74,20,104,76,78,80,
61,62,26,55,114,66],usual:[69,33,34,37,71,39,40,102,41,5,10,11,16,53,103,74,20,75,65,104,76,22,23,60,61,82,83,25,84,85,86,64,26,112,66,106,90,116],unari:[44,29],tarjan:76,getgloballist:16,listconcat:[29,116],numberexprast:[40,42,55,46,2,48,49],p18:8,settabl:66,tough:[55,18],cortex:[9,35,57],gendfapacket:84,adt:[23,61],tight:[90,50],add_cfg_simplif:[12,13,14,15],onward:61,uwtabl:[71,104],add:[91,69,1,95,5,65,97,41,113,98,99,50,83,74,20,75,22,61,24,108,84,86,26,112],cleanup:26,voila:25,citizen:16,dced:16,c11:86,successor:[31,45,108,84,69,50,71,59],polybench:30,match:[83,86,112],apple_typ:104,hypersparc:53,fnscopemap:40,pcre2posix:25,image_file_net_run_from_swap:109,punctuat:[29,69,71],realiz:[12,14,49,2,65],llvalu:[12,13,14,15,19],coldcc:[73,71,112],insert:[83,86,78,41],like:[61,41,84,86,87,3,112,83],studi:51,sstream:69,registeranalysisgroup:41,inferenc:84,c1x:71,soft:[80,104],crawler:74,unreach:[67,7],vec01:71,convei:[74,108,26,71,50],registermcobjectstream:84,"_m4enum":71,proper:[67
,69,102,53,16,30,1,86,71],getparamtyp:16,release_1:23,tmp:[61,103,74,71,84,46,49,10,79,12,15,5,51,16],nvcc:84,llvmrock:69,esp:[84,5,6],nvcl:8,"__internal_accurate_powf":8,esi:[84,6],trap:103,intregsregisterclass:53,dce:[113,20,65],noisi:[31,26,16],host:[69,84,61,87],although:[69,73,1,36,71,65,2,10,16,19,102,54,74,20,76,23,84,86,26,112,27,66,106],geometr:[39,11],simpler:[31,65,84,46,2,104,14,15,71],about:[69,1,37,5,65,97,41,99,26,20,111,58,59,61,107,108,84,86,87,110,77,112],actual:[91,31,84,32,33,34,1,69,102,4,71,72,39,40,97,41,42,5,44,98,46,2,48,49,10,11,50,73,12,13,14,15,16,17,18,19,53,103,74,55,20,104,76,114,78,23,60,83,25,92,26,51,112,108,27,66,116],endcod:69,discard:[71,20,84,22,23],addendum:38,vocabulari:71,guard:[69,71,21,22,50,66,16],been:[31,84,108,32,33,1,94,69,37,4,99,71,6,72,39,97,8,42,5,98,2,48,49,11,100,73,12,13,14,16,18,19,53,103,74,55,20,75,65,104,76,78,23,82,83,30,92,86,87,26,88,51,113,66,106,29,116],ifexpr:[40,46,2,48,13,14,15],leverag:[74,30,16],rcx:[84,6],eh_fram:
[108,30],naveen:31,rcn:32,getelementptrinst:16,"__cxxthrowexcept":108,gene:30,biggest:[84,47],calltwo:16,functionlisttyp:16,unexpect:[69,33,34,46,36,26,15],f4rc:84,bur:60,brand:76,machinefunctionpass:53,bui:35,bug:[69,24,113,84,83,5],wise:71,mcpu:[24,53,8,9,10,77,80],wish:[23,65,62,61,53,103,33,20,1,87,94,50,73,66,116,71,16],srcarglist:71,rc1:[32,94],install_prefix:61,emitjumptableinfo:53,instead:[61,41,84,86,112,83],pin:71,hashfunctiontyp:104,dure:[91,32,33,34,94,70,71,65,10,73,16,74,20,104,59,23,108,30,84,87,26,88,90],pic:[84,53,30,62,9,104,80],int64_t:[30,92,16],llvm_append_vc_rev:61,guidanc:[69,50],detail:[61,41,84,86,87,83,59],virtual:41,dw_apple_property_strong:104,out:[112,41,56,87,86,78,83],apple_objc:104,gcc:[69,105,113,20,84,86,87,110,95,108],pi8:56,escap:[23,41,29,5,2,10,74,90,14,71,28],ksdbginfo:40,al_aliasset:53,afterbb:[40,46,2,48],binoprh:[40,42,55,46,2,48,49,12,13,14,15,18,19],predsens:70,"_zfoov":71,old_c:49,unshadow:[40,46,2,48,13,14,15],twoaddressinstructionpass:8
4,eliminateframeindex:53,distnam:66,liveout:[73,88],n2756:69,poorli:[69,59],bpf_arsh:84,getreginfo:84,undef:[108,5,86],patcher:88,isvi:53,spec:[29,92,16,34,62,104,94,10,71,116],add_incom:[13,14],concret:[20,84,112,94],under:[69,73,1,71,6,67,39,8,113,98,47,10,11,18,52,53,20,76,114,23,61,30,84,87,64,26,55,27,66],runhelp:69,testabl:[30,82],playground:[44,17],everi:[112,41,84,86,87,3,78,83,59],risk:[71,94],f934:53,rise:69,risc:[84,86,53],implicit:[69,84,5],upstream:23,printfunctionpass:31,llvm_yaml_strong_typedef:92,z13:30,mygc:74,isv9:53,isdefinit:[71,104],x86_64:[84,35,87,50,79,5],properti:[67,31,69,112,41,74,33,20,84,70,36,78,27,71,16],x86call:116,xxxinstrinfo:[70,53],naiv:31,nail:[13,48],xor32rr:84,llvm_yaml_is_document_list_vector:92,blue:30,hide:69,introspect:[73,28,90,57],foundfoo:69,hi16:84,conduct:26,asymmetri:[91,33],functiontyp:[40,42,46,2,48,49,16],studio:[23,69,22,61],path:[91,31,69,73,34,1,95,36,71,97,8,113,98,46,10,50,15,16,51,101,54,74,76,77,79,80,23,61,108,25,41,86,87,9
,64,66,115],dlopen:[76,66],forum:[38,71],parallel_dir:[66,51],mypassopt:76,anymor:[76,30,16,49],pointcount:74,precis:[23,102,41,74,84,86,77,80],portabl:[84,61],nontempl:20,bitset2:56,julia:30,distalwai:66,insertion_block:[13,14,15],strai:10,printf:[67,23,40,83,98,46,2,104,64,36,90,14,15,71],dllvm_enable_backtrac:23,ymin:[14,2],smallsetvector:16,describ:[91,31,92,33,34,1,68,94,69,70,71,6,72,38,39,40,97,8,42,5,44,103,2,48,49,11,50,73,12,13,14,84,16,17,18,19,67,53,54,74,102,20,65,104,76,77,22,78,59,23,60,24,108,30,62,26,88,51,112,55,27,66,90,116],would:[91,84,94,36,69,37,5,67,41,71,98,50,102,103,74,20,114,77,78,59,23,60,108,62,86,64,26,112,27,66],gcstrategi:74,addincom:[40,46,2,48],llvm_doxygen_qhp_cust_filter_nam:61,autogen:25,n1720:69,must:24,shoot:[12,49],join:[76,71,16,80],getnumoperand:16,"0x4db504":25,image_file_machine_mipsfpu:109,runfunct:[16,99],introduc:[31,73,47,71,6,53,41,5,46,2,48,33,13,14,15,16,102,94,84,86,88,116],localrecov:108,"__data":71,helpingmemorymanag:49,virtreg2
indexfunctor:84,inadvis:103,registerehfram:72,attract:[74,26],makellvm:23,uselistord:71,straightforward:[102,53,42,104,98,46,2,48,49,76,11,78,12,13,14,15,16,19],pipefail:1,compiler_rt:26,concis:[84,20,26,69,103],hasnam:16,env:32,frameless:84,ancestor:[71,102],collaps:71,dialect:[28,71],memorydependencyanalysi:86,createfil:40,badli:50,getreservedreg:53,attrspellinglistindex:21,parallel:[23,60,61,0,25,1,87,63,114,66,84,71,30,51],bootstrap:23,r_arm_thm_movw_abs_nc:9,parserclass:20,includedir:[66,101],environ:[84,61,74,20,1,86,87,95,69,22,98],reloc:[80,58,84],enter:[23,84,82,108,1,104,87,49,112,55,12,83,18],exclus:[73,20,84,71,86],hasexternallinkag:16,composit:[71,16],wavefront_sgpr_count:24,over:[84,83,112,78,41],commasepar:20,imul:84,blatent:[15,46],optional_dir:[66,51],str_offset:104,rfunc:7,parseparenexpr:[40,42,55,46,2,48,49],align32bit:112,imm:[28,84,53,116],baseinstrinfo:21,image_sym_type_dword:109,tramp:71,replaceinstwithinst:16,getorinsertfunct:16,llvmbitread:51,comprehens:[23,
31],llvmbc:112,settruncstoreact:53,cfgsimplifi:16,getlazyresolverfunct:53,echo:[23,106,66],const_global_iter:16,"0x60500020":109,cmake_cxx_flags_releas:23,alex:67,exampletest:1,modrefresult:41,each:[62,33,1,94,95,69,70,5,72,65,97,8,71,98,84,83,67,101,102,103,74,20,75,56,77,78,57,80,58,111,59,23,60,61,107,108,25,41,86,87,63,26,112,27,66,90],use_begin:[69,16],sk_lastsquar:102,prohibit:[90,86],abbrevwidth:112,runtest:[32,9],tag_pointer_typ:104,goe:[40,61,84,53,8,74,16,25,62,46,104,92,108,86,66,28,15,71,98],llvm_optimized_tablegen:23,newli:[31,40,42,73,2,48,49,64,12,13,14,16,19],laid:[16,84,49,78,12,71],adjust:[98,47],has_disassembl:27,got:[23,20,84],unimagin:73,debug_pubnam:104,precaut:16,threadidx:8,free:[69,73,94,39,105,41,42,44,49,10,11,12,16,17,19,74,76,60,82,30,84,86,66],getfilenam:[40,104],rangelist:29,galina:114,precompil:8,distract:26,puzzl:62,astdump:21,r9d:6,r9b:6,openssl:25,filter:61,addrspac:[73,71,8],rais:[31,74,71,83,108,12,13,14,15,16,17,18,19],runtimedyldimpl:72,r9w:6,a
pp:[63,69,16],onto:[23,74,33,84,104,94,26,71,16],rang:[69,24,41,20,84,77,83,59],xnorrr:53,wordsiz:74,rank:31,restrict:[84,20,26,69,86],datastructur:16,alreadi:[92,33,47,69,102,71,6,65,40,84,41,42,44,98,46,2,48,49,10,73,12,13,14,15,16,17,51,19,53,74,20,104,76,23,61,30,62,85,26,88,106,25],hackabl:[44,17],createcfgsimplificationpass:[40,46,2,48,49],consecut:[29,0,5,25,104,56,76,78,71],primari:[71,38,40,41,42,55,44,46,2,48,49,12,13,14,15,16,17,18,19,74,84,26],rewritten:[30,84],top:[84,61,54,1,41,69,112,80,5],seq_cst:[71,86],downsid:16,tok:40,ton:[44,17],too:[91,84,33,35,36,69,4,71,39,40,55,46,10,11,15,83,18,20,76,23,16,25,92,64,26,66,116],tom:92,toc:[30,84],corpus:25,initialize_native_target:[12,13,14,15],createalloca:[40,46],tool:[112,41],usesmetadata:74,took:[40,42,46,2,48,49,12,13,14,15,19],targetgroup:27,conserv:[69,41,74,73,86,94,76,90,88,71,59],dw_tag_gnu_template_template_param:71,reinterpret_cast:25,expr:[7,40,55,46,2,48,115,12,13,14,15,18,19],zero:[69,93,1,95,37,5,67,7,96,113,4
5,101,54,20,75,77,78,80,107,84,111,112,115],misunderstood:98,fashion:[71,65,22,53,23],ran:[76,95],ram:114,dw_tag_string_typ:104,lbd:52,further:[23,69,61,112,103,74,5,25,108,87,36,26,71,33,66,16],unreloc:73,rax:[53,73,84,88,71,6],adc32mi:6,unresolv:[66,39,1,11],thorough:69,sk_somewhatspecialsquar:102,xfail:[10,34,1],expr0lh:67,thoroughli:[13,48],adc32mr:6,atom_count0:104,though:[31,69,33,34,71,65,40,42,55,46,48,10,12,15,16,18,19,102,103,74,20,104,76,59,108,30,84,86,90],visitfab:65,glob:7,"__apple_typ":104,bss:80,sethi:53,bsd:[23,26,97,30,111,66],"0x00000002":104,"0x00000003":104,"0x00000000":104,"0x00000004":104,"0x00000009":104,metal:71,roots_begin:74,getorcreatefoo:16,abbrev:[89,112],declar:[65,84,102,8,33,20,41,47,5,56,69,87,112,27,66,71,98],radix:[84,69],pred_begin:16,shouldexpandatomicstoreinir:86,saga:[13,48],"0x70b298":76,random:[113,69,1,83,68],radiu:102,smallvectorhead:16,rst:[84,21,106],popq:[73,88],radic:84,dfapacket:84,lit_config:1,absolut:[95,69,5,59],package_str:61,bitc
oderead:65,createreassociatepass:[40,46,2,48,49],nextprec:[40,42,55,46,2,48,49],multiclassid:29,getreg:[84,53],llvm_yaml_is_sequence_vector:92,label0:71,twiddl:[40,46,2,48,49,12,13,14,15,71],watch:[26,69],image_scn_type_no_pad:109,pointertyp:[30,16],report:[77,1,83,41,37],reconstruct:[103,104,97],sparclet:53,aliasanalysisdebugg:41,start_val:[13,14,15],sunit:84,isoper:[40,46,2],basicblock:[23,69],stringwithcstr:104,lto_module_is_object_file_for_target:90,habit:[31,69],nuw:[71,50],memory_order_releas:[71,86],storesdnod:53,richer:88,nul:[14,16,2],num:[74,73,71,53],libsampl:51,corrupt:[108,39,11,25,97],dumpattr:21,hopefulli:[31,69,41,20,86,112],databas:[39,92,11],image_file_machine_mips16:109,valb:8,tolmach94:74,mul:[5,103],approach:[69,102,103,71,20,84,78,108,70,83],weak:[16,30,46,86,90,50,112,33,111,15,71],protect:[69,53,25,84,86,112,4,71],critedge1:8,fault:[113,26,78],lgkmcnt:24,r7xx:105,"4gib":22,mybarflag:92,lto_module_cr:90,kwd:[12,13,14,15,17,18,19],callseq_end:73,canlosslesslybi
tcastto:33,max_int_bit:16,trust:[26,69],nake:[71,112],nonsens:[15,46,106],getglobalcontext:[40,42,46,2,48,49,16],accumul:[31,0,25,12,13,14,15,18,19],fnloc:40,oldbind:[15,46,40],quickli:[69,97,41,20,84,83],getsymbolt:16,"0x000003bd":104,msec:0,xxx:[34,69,5,53],uncommon:108,expected_v:71,testcaselength:16,craft:16,"catch":[20,26,99],upcast:102,image_sym_class_undefined_stat:109,simplevalu:29,bpf_exit:84,basic_p:116,basic_r:116,lesser:78,weren:26,curvar:[15,46,40],cumemalloc:8,cdecl:71,p_reg:84,image_sym_type_mo:109,svr4:97,vk_argument:69,exterior:73,registermypass:76,tediou:92,list_property_nam:27,suggest:[76,23,69,41,71,100,9,63,26,73,16,6,51],armasmprint:21,ilp32:[39,11],disposit:26,dooneiter:83,complet:[31,92,33,1,68,94,95,36,69,4,71,72,38,40,84,8,42,113,44,46,2,48,49,10,50,73,12,13,14,15,17,18,19,53,74,20,75,104,76,89,59,60,108,30,41,26,112,55,66,90,116],asan_opt:25,sched:[80,84,53],darwin9:5,xyzzi:69,binaryexprast:[40,42,55,46,2,48,49],build_ret:[12,13,14,15,19],"0x08":104,introd
uctori:38,property_nam:27,redefin:[116,42,46,2,14,15,19],sethiddenflag:20,image_scn_mem_not_pag:109,bugzilla:[38,32,73,94,10,26],shortli:40,memarg:47,everyth:[94,36,71,38,8,42,55,44,2,48,10,13,14,17,18,19,103,20,76,23,84,86,87,64,66],spencer:4,addend:71,makevehicl:69,setcurrentdebugloc:40,finalizememori:72,"0x01":[67,6,104],meta:[74,16,30,84,104,88,71,6],numliveout:88,shorthand:116,"0x03":88,expos:[23,84,31,74,16,20,1,69,41,83,86,90,73,71,30],interfer:[108,50,103],patchpoint:71,elf:[58,84,105,112],"0x7fffffffe018":99,els:84,at_artifici:104,explanatori:[34,26],elt:71,gave:33,xnor:53,setloadxact:53,disableencod:6,howtosubmitabug:23,"______________________":16,thumb2:[84,71,57],rip:[10,71,6],thumb1:71,gr64:84,end_:[13,14,15],apart:[61,16,78,41],unindex:53,arbitrari:[69,73,1,71,39,41,42,55,44,103,46,49,11,12,15,16,17,18,19,53,54,74,20,104,76,108,30,84,26,88,112,27,116],loadlal:71,contradict:26,build_add:[12,13,14,15,19],unstabl:[32,35],entry_block:15,hung:16,ifexprast:[13,40,46,2,48],sc
opelin:[40,71,104],llvm_use_sanit:61,excerpt:8,"000000e":[42,46,48,49,12,13,15,19],enumcas:92,indirect:[108,84,22,98],successfulli:[41,0,73,62,9,2,94,114,89,14],live_end:74,"0x401000":79,icc:[23,104,0],attrparsedattrimpl:21,guaranteedtailcallopt:71,armv7:[23,71,35,78,94],armv6:35,armv8:[105,6],registerclass:[84,21,6,53],core:[23,65,61,41,25,9,35,114,26,27,105,71],clase:16,tour:[55,18],subtmp:[40,42,46,2,48,49,12,13,14,15,19],cast210:71,"0x2":[88,84,16],meyer:69,chapter:[33,44,38],min_int_bit:16,canreserveresourc:84,surround:[31,103,5,86,88,71,6],unfortun:[39,69,33,47,48,49,76,11,12,13,16],distinct:[31,112,103,41,42,5,84,104,10,71,27,66,16,19],g_inlined_into_f:79,algo:76,bitsetcas:92,produc:[31,92,108,0,33,1,69,37,4,71,67,40,84,42,5,45,9,47,48,49,11,46,12,13,15,16,98,19,53,103,74,77,75,104,76,21,78,97,23,61,73,83,25,62,86,87,64,26,113,27,66,28,30],addpsrr:116,ppa:23,instcombin:83,regist:[78,41],encod:[78,24],othervt:53,parse_bin_rh:[12,13,14,15,18,19],createfmul:[40,42,46,2,48,49],ob
jectso:66,storag:[84,112],addpsrm:116,git:[26,61],closur:[27,39,11],why:[26,69,41],stuck:[39,11],reli:[69,108,103,0,32,16,25,84,46,104,10,74,26,90,78,73,66,15,71,59,98],gid:97,image_sym_type_enum:109,synthesiz:30,"_build":87,synthesis:25,head:[23,69,74,29,106,71,116],medium:80,tokens_fil:25,heal:91,unconvinc:25,modulepass:[41,8],p0i32:5,add_definit:61,heap:41,icmp:[91,112],n2541:69,counsel:26,attr:[21,71,104,112],lsan:25,fundament:[20,84,69],autoconf:[23,61,53,98,87,94,16],loadregfromstackslot:[84,53],adorn:[106,71],uncoop:74,trig:53,eieio:71,"_ztv3bar":5,adjac:[71,16,29],trip:[31,69,71,78],readonli:[31,73,104,88,50,112,71],tirefactori:69,add_execut:61,when:[112,86,78,41],in32bitmod:84,tid:8,tie:71,node:[41,84,56,3,37,59],v_mul_i32_i24_e64:24,uint8:[91,88],consid:[67,91,69,112,24,41,113,20,84,99,111,78,59,98],idx3:103,cooper:[74,64],idx1:[71,103],idx0:71,uniformli:69,"0x0f":88,libcuda:8,faster:[23,69,97,33,25,35,104,83,108,114,66,71,30,16],bullet:[98,102],freebench:34,seciton:22,bac
kward:[20,112],impli:[53,41,74,29,84,87,26,88,71,66,79,4,103,16],focus:[84,53,74,73,45,10,16],catagor:31,movabsq:[88,85],signific:[65,69,112,108,41,73,16,25,44,2,48,76,74,26,90,78,33,14,71,17],computation:60,llc:[113,84,87,83,68,5],mips64el:87,n32:[30,71],lld:[23,69,61],addregisterclass:[84,53],readabl:[84,86],getorcreatetypearrai:40,pop_back:[20,40,16],sourc:[83,41],t1item:33,fnaddr:49,feasibl:[71,9],cool:[40,42,20,46,2,48,76,12,13,14,15,19],cuctxcreat:8,curop:53,level:[86,41],quick:[83,41],release_26:23,release_27:23,release_24:23,release_25:23,"__builtin_longjmp":108,release_23:23,release_20:23,release_21:23,release_28:23,release_29:23,hsa:24,magnif:[14,44,2,17],endcond:[40,15,46,2,48],port:[23,39,98,0,30,84,36,11,114,4],llvmlib:[66,51],repli:26,"64bit":[32,71],exitcond:71,sgi:16,alphajitinfo:53,eckel:16,pratik:30,u32:[84,8],llvmld:66,negeightkind:71,declare_funct:[12,13,14,15,19],fmax:71,memory_order_relax:[71,86],testsut:66,fmag:97,dw_tag_restrict_typ:[71,104],preorder:102,crea
tebasicaliasanalysispass:[40,46,2,48,49],writethunk:33,switchsect:[74,84],strtod:[40,42,55,20,46,2,48,49,44],r6xx:105,legalizedag:65,dorit:0,weird:84,automaton:[84,21],machine_version_minor:24,semant:[69,74,108,84,86,50,27,98],inlinedat:[71,5],builder_at:15,globallayoutbuild:56,tweak:[63,23,20,102],visibl:[69,97,20,84,86,112],memori:24,camlp4of:[12,13,14,15,18,19],pred:[8,71,46,48,13,15,16],preg:[25,84],pref:[71,16],todai:[69,86,103],handler:[91,108,84,71,86],upheld:73,instalia:84,diflagvector:71,msg:71,andw:5,prev:16,msb:84,reorder:[71,86,5,104,73],plug:[42,19],capit:[26,69],drown:34,prototyp:[7,69,71,65,50],build_br:[13,14,15],registerinfo:84,function_typ:[12,13,14,15,19],purpos:[31,69,32,33,4,71,6,40,8,42,49,50,73,16,103,20,100,76,21,78,23,108,84,87,26,66],explor:[16,82],preemptibl:31,sidelength:102,parse_binary_preced:[14,15],add8rr:84,critic:[69,41,74,94,50,80],gettyp:[69,16],alwai:[67,7,26,112,97,24,41,108,20,1,69,3,50,78,37,84,5,98],differenti:[27,4,22,82,66],localescap:108,s
tepval:[40,46,2,48],twoargfp:116,anyon:[26,104,53,86],fourth:[53,20,76,88,13,71],cstptr:71,"__nv_isinff":8,no_switch:0,double_typ:[12,13,14,15,19],clone:[23,25,1,46,76,64,21,15,16],mcdisassembl:84,"4th":84,interconnect:30,geforc:8,testresult:38,colfield:70,practic:[91,31,69,73,71,42,44,98,48,49,12,13,16,17,19,102,103,74,20,104,60,25,86,26,88],firstlett:99,calltmp6:[15,46],predic:[86,78],the_fpm:[12,13,14,15],programmat:[74,92,8],destmodul:66,preced:[31,69,1,71,40,41,42,55,44,46,2,48,49,12,13,14,15,16,17,18,19,54,104,111,88,29],combin:[83,61,112],practis:59,image_file_machine_amd64:109,sphinx_execut:61,blocker:32,ymmv:69,size_t:[74,25,92,90,49],synthesizedcd:78,canari:71,fsanit:25,foo_dtor:47,gte:71,branch_weight:[3,59],passag:69,pinsrd:5,platform:[86,87],gtu:8,getsymboladdress:[50,49],ymm0:88,debug_abbrev:89,maskedbitsetcas:92,flagspointi:92,inoperandlist:[6,53],sourceleveldebug:40,term:[31,69,73,4,71,38,41,98,10,33,74,104,78,60,82,108,84,86,26,88,29,116],name:[61,24,56,87,3,112],ge
toperatornam:[40,46,2],realist:[74,55,18,116],varexprast:[40,46],the_execution_engin:[12,13,14,15],individu:[23,65,69,112,97,31,83,25,1,95,36,26,50,78,37,27,28,71],otherspecialsquar:102,const0:112,getdoubleti:[40,42,46,2,48,49],hacker:[38,26],profit:[91,31,84,50,0],decimalinteg:29,hasloadlinkedstorecondit:86,profil:[95,3,87,68],sctx:25,roundp:0,iscxxclass:104,factori:[31,69,16],aliase:[33,71,112],numberofcpucor:25,"\u03c6":71,migrat:[74,30,26],write_escap:76,integertyp:16,theori:[33,39,92,11],getvalueid:33,boehm:74,synchron:[90,25,71,86],refus:[23,7,61,107,31,93,75,96],codegen:24,turn:[83,84,61,86,78],place:[31,84,0,32,33,1,69,71,6,67,39,97,42,55,44,46,2,49,10,11,73,12,14,15,16,17,51,19,53,103,74,20,65,104,76,114,78,80,23,24,83,30,92,87,64,26,88,108,27,66,116],ture:[12,55,18,49],imposs:[39,53,41,86,26,11,78],str1:116,origin:[23,40,97,103,54,73,71,30,84,104,87,95,26,100,66,4,108,5,6,16],suspend:74,redhat:63,dw_apple_property_copi:104,arrai:[112,84,97,78,41],bou_fals:20,rodata:[30,53]
,readattribut:21,predefin:[76,84,14,1,2],unrecogn:20,"0x00003550":104,given:[31,84,73,1,95,36,69,37,102,4,71,72,65,97,41,42,55,45,2,50,14,16,98,18,19,53,54,20,75,104,56,76,21,79,59,23,61,108,25,92,86,110,64,88,112,27,66,29,116],frameindex:53,image_sym_class_external_def:109,associ:[31,69,73,3,4,71,72,97,55,49,33,16,18,67,53,74,20,77,22,78,57,59,60,108,84,88,112,27,116],assort:40,necessarili:[23,40,103,32,73,98,104,69,71],llvm_int_ti:65,circl:102,white:105,cope:[20,16],copi:[83,84,61,112,41],dblty:40,image_scn_mem_execut:109,enclos:[69,5,10,88,112,16,116],grunt:20,releasei:32,serv:[38,103,31,16,1,104,10,88,78,108,66,29],wide:[35,86,71,38,39,8,48,49,11,12,13,16,103,74,104,23,30,84,41,112,66,29,116],image_sym_type_doubl:109,subexpress:[40,41,55,46,2,48,49,76,60,12,13,14,15,18],getoperationnam:65,posix:[111,61,97],balanc:[26,86],posit:[80,84,5,112],bahtu:30,xxxgenasmwrit:53,p20:8,pre:[23,65,60,108,62,94,26,80,84],pro:78,isfunct:104,subroutin:[74,71],doiniti:53,bitwis:84,techniqu:[0,33,7
1,41,55,44,46,2,48,49,12,13,14,15,83,17,18,53,74,76,16,25,84],ebx:[84,22,6],moreov:[31,84,71],datapath:30,codegen_proto:[12,13,14,15,19],instrprof:71,sure:[84,0,32,9,35,94,95,69,4,6,39,40,41,42,55,98,46,2,48,49,10,11,50,100,15,16,19,102,20,65,104,76,78,23,61,82,25,62,86,63,64,26,114,66],multipli:[31,65,60,16,84,71,59],"__asan_memcpi":25,clearer:69,fca:60,nproc:23,llvm_build_llvm_dylib:23,gunzip:[23,36],fco:53,bb0_30:8,later:[31,69,33,34,95,71,72,40,42,5,49,10,50,73,12,13,14,15,16,51,19,67,53,104,76,23,30,84,88,18,55,66,106],quantiti:71,mybison:34,runtim:[67,3,20,84,87,99,95,26,105,83],readjust:84,"0x90":73,xxxasmprint:53,cs2:41,cmakelist:[23,61,54],apple_namespac:104,build_cal:[12,13,14,15,19],uncondit:[31,53,73,84,48,95,13,14,15,71],cheap:[69,16,86],permiss:[72,23,26,97,114],culinkst:8,tend:[91,23,69,103,32,45,104,26,27,16],explicitli:[31,69,0,73,34,5,72,39,41,42,71,98,47,11,50,16,19,103,74,20,23,61,82,30,84,87,116],lua:74,derivedtyp:[65,40,42,46,2,48,49,16],state:[91,69,41,74,108,
20,84,86,87,94,26,78,66,71,25],sk_circl:102,analyz:[84,68],abs_fp32:6,analys:[31,65,75,38,16,30,41,104,76,23,84,71,59],llvm_scalar_opt:[12,13,14,15],mcsectionmacho:84,jazz:51,ssp:[71,104,112],allocat:[84,71,53],bpf_xor:84,dyn:58,tailor:35,image_comdat_select_largest:71,use_llvm_executionengin:[12,13,14,15],sse:[84,71,53,57],regtyp:53,dw_tag_packed_typ:104,reveal:103,"0x00002023":104,dramat:[23,69,20,49,77,12,71],intrins:86,irrespect:61,fastcc:[84,71,98,112],bison:34,scott:69,backedg:[31,73,2,48,13,14,59],drawback:[20,26,16],n16:8,pane:82,noth:[76,31,103,74,71,44,84,46,10,66,4,15,16,17],maximum:[61,41,16,20,84,59,37,33,71,25],labori:16,atomic_:86,detect:[45,61,24,5,25,1,33,71],mov32ri:84,review:69,get_register_match:21,image_scn_cnt_uninitialized_data:109,abs_f:6,cycl:[90,71],isatleastacquir:86,collect2:64,come:[84,33,95,69,70,71,39,97,8,42,113,44,46,47,48,49,10,11,12,13,15,16,17,51,19,103,74,65,104,76,23,61,25,92,26,112,116],latch:71,at_apple_runtime_class:104,region:[95,112],quiet:
[66,20,1,71,99],nocaptur:[31,71,112],entir:[31,62,0,34,1,95,69,37,71,39,97,8,42,98,49,10,11,12,84,16,19,53,103,74,20,104,76,78,23,41,92,26,112,27,66],image_scn_mem_purg:109,imgrel:22,image_file_machine_powerpcfp:109,nnn:97,color:[95,84,16],rescan:33,inspir:[31,30,71],period:[74,83,25,10,26,71,30],pop:[40,74,71,84,46,48,112,13,15,16],hblcnsviw:20,image_file_machine_sh4:109,image_file_machine_sh5:109,colon:[61,92,10,27,5,116],image_file_machine_sh3:109,dw_form_ref4:104,poll:[74,73],coupl:[39,40,16,2,48,86,76,26,11,13,14,71,90,116],pend:[23,40,99,42,55,46,2,48,49,12,13,14,15,18,19],test_source_root:1,sectionnumb:109,debug_str:104,hexinteg:29,savesomewher:69,variableexprast:[40,42,55,46,2,48,49],mytype1:92,andrew:74,mytype2:92,mrmdestmem:53,instrssrr:116,intertwin:60,"case":[69,61,112,41,83,84,86,87,56,3,78,5],addimm:84,push_back:[40,53,42,55,92,46,2,48,49,69,16],stackgrowsdown:53,registerwithsubreg:53,dw_apple_property_weak:104,cast:[20,69,78],tblgen:[84,61,68],anytim:98,emittrailingf:
86,isextern:104,clutter:26,image_file_up_system_onli:109,rangepiec:29,d14:53,d15:53,addedcomplex:6,value_desc:20,d10:53,d11:53,d12:[56,53],d13:53,alphabet:66,ubsan:[25,30],check:[69,84,61,86,87],html:[23,65,40,61,32,113,25,9,87,94,21,69,34],intreg:[70,53],eventu:[31,102,71,34,47,48,73,13,5],hasadsizeprefix:6,week:26,image_sym_class_label:109,nest:[1,41,74,108,84,69,112],confidenti:26,driver:[105,8,25,10,95,90,44,51],devoid:84,viewgraph:16,moder:[69,16,82],justifi:[90,97],iterat:16,"__main":76,model:[62,103,74,108,20,1,47,86,69,22,112,70,80,84,98],unimpl:76,tip:[26,83],"0x000003f3":104,redwin:84,kill:[76,113,84,83],xxxbranchselector:53,dynamic_cast:[46,69,40,16,102],blow:25,miscellan:97,widest:26,hint:[79,83,69,71,103],except:[61,112,24,41,84,86,78],cxx:[23,32,98,9,87,64,66],blob:[32,112],notori:4,disrupt:[106,71],image_sym_dtype_point:109,predrel:70,subtargetfeatur:[6,53],createbr:[40,46,2,48],image_sym_class_union_tag:109,"0x000003ff":84,saniti:[27,23,66],whitespac:[23,40,42,29,44,
46,2,48,49,26,69,55,12,13,14,15,5,17,18,19],image_scn_align_256byt:109,evergreen:105,at_apple_property_attribut:104,gridsizei:8,slice:[29,16,116],easili:[76,23,62,31,74,33,20,54,9,104,92,10,69,88,50,73,27,4,84,16,30],benefici:0,legal:[86,87],gridsizex:8,encodecompactunwindregisterswithoutfram:84,gridsizez:8,derferenc:16,freea:47,libfil:101,freed:[85,16,41],ffi_include_dir:61,llvm_doxygen_svg:61,garbag:[98,112],inspect:[84,71,50,112,103],boolordefault:20,bpf_mul:84,oneargfprw:116,immut:[76,71,16,57],execv:4,mergabl:31,cmptmp:[40,42,46,2,48,49,12,13,14,15,19],stanc:69,cuda:[84,105,8],image_scn_align_16byt:109,onon:71,routin:[31,84,74,33,1,26],llvmsetdisasmopt:28,dw_at_nam:104,tbcc:53,lastli:[10,76,40,57],overrod:116,idx2:103,cpu_powerpc:92,possbil:92,unconvent:[39,11],classess:53,fcc_g:53,getbuff:92,strict:[42,33,104,5,50,78,100,27,16,6,19],v_mul_i32_i24:24,mm4:[6,116],strictli:[23,8,73,5,66,104,48,71,13,4,16],blocklen_32:112,machin:[61,87,78],fcc_u:53,"__llvm_coverage_map":67,mm6:[6,
116],tupl:71,regard:[38,69,98,47,94,21,71],ocaml_lib:[12,13,14,15,19],mm0:[84,6,116],setjmp_buf:108,mm3:[6,116],getdata:69,longer:[31,69,97,74,30,84,46,106,76,26,57,15,16,98,51],cmakecach:61,nmake:61,parsetoplevelexpr:[40,42,55,46,2,48,49],handletoplevelexpress:[40,42,55,46,2,48,49],make_uniqu:[40,46,2,48],dstindex:53,x86_stdcall:84,clrq:84,clrw:84,cbe:62,frighten:25,strongli:[39,60,74,9,46,48,69,11,13,15,116],clrb:84,intro:[38,15,46,105],cbw:84,umax:71,encompass:[35,57],rearrang:60,intra:41,tok_eof:[40,42,55,44,46,2,48,49],clrl:84,call2:5,idiom:[42,20,16,19],"0xabcdef00":73,symbol:[69,97,41,84,87,68,112,37,80],briefli:[67,33,76],mrmsrcreg:53,lexicalblock:40,llvmcreatedisasm:28,serious:36,buildmi:84,llvm_include_exampl:61,unbalanc:30,callq:[73,85,88],directori:[101,1,61,84,69,87,95,26,115],invest:65,calle:[84,98,78],potenti:[31,69,73,1,94,71,41,55,44,98,48,50,13,83,17,18,20,23,108,25,84,26,88],degrad:74,"__sync_":86,"0xl":71,metatada:3,all:[69,1,68,95,3,37,5,7,97,41,113,45,99,83,101
,20,75,65,77,22,78,79,80,58,111,61,24,108,84,86,87,110,26,112,89,115],replacealluseswith:[33,60,16],dist:87,fp_to_sint:53,lack:[103,74,71,84,63,100,12,29,6,116],ala:30,scalar:[60,74,20,84,69,27,71],basicblockutil:16,pty:71,ptx:[84,105],follow:[91,69,1,68,95,37,5,67,65,96,97,41,113,98,99,83,74,20,111,22,78,61,24,108,84,86,87,26,112],spcc:53,ptr:[91,69,56],uint8_t:[25,92],doe:[65,45,61,97,41,83,20,1,69,86,87,99,95,26,22,112,108,96,111,84,5],getaddressingmod:53,init:[23,20],program:[24,41,56,87,112,83],neglig:[91,25],deepcheck:16,lsbit:16,far:[39,41,42,71,20,46,2,104,76,11,55,65,27,14,15,16,18,19],urem:[65,84],getbasicblock:84,worst:[16,39,11,85,73],toolbuildpath:66,failur:[76,23,62,92,32,5,34,1,35,87,104,10,36,26,83,71,113,94,16,17,18],unoffici:103,experimental_dir:66,isunpredicatedtermin:53,basicaliasanalysi:[76,31,41],lisp:[74,39,11],sectionnam:112,list:[61,24,41,84,86,87,3,112,83],lli:[113,77,68],snapshot:41,ten:103,use_llvm_analysi:[12,13,14,15,19],eas:35,still_poison:71,tex:34,ra
te:[26,97,112,37],pressur:[84,69,0],design:[86,112,41],storageclass:109,hasard:74,proxi:84,what:[112,86,59,78,41],namedindex:53,sub:[1,84,86,87,112,5],sun:[10,76],sum:[0,16,95,112,71,59],brief:[23,69,61,41,74,33,20,62],tailcallopt:[84,71],asmprint:[74,84,21,53],version:[61,24,41,84,87,112],intersect:69,row:70,themselv:[84,16,20,1,104,26,55,112,33,27,66,71,6,18],behaviour:[20,69,78],xmm3:[6,116],shouldn:[72,69,41,20,9,17,66,71,44],jitcompilerfn:53,xmm6:[6,116],b32:8,xmm4:[6,116],xmm5:[6,116],build_config:36,xmm8:6,xmm9:6,asmpars:[23,65,21],misinterpret:[69,83],slave:114,instrsdrm:116,bb2:[71,112],xmm2:[6,116],magnitud:71,"0x0000006e":104,pr22262:30,filenam:[69,93,37,5,6,67,7,40,96,113,43,101,20,75,104,77,71,89,80,58,61,107,110,111,66,115,116],heurist:[31,15,71,84,46],sparcasmprint:[84,53],dump_modul:[12,13,14,15,19],hexadecim:[20,111],proceed:[74,23,84],normalizedpolar:92,coverag:68,imath:30,qch:61,forcefulli:103,llvmtargetmachin:53,at_apple_property_sett:104,cxa_demangl:104,isload:8
4,"80x86":114,flag:[101,69,61,84,87,95,79,5],stick:[69,16,35],"0x00000067":104,known:[31,69,32,73,94,36,71,8,113,50,16,51,102,103,74,23,108,84,85,41,87,112],ensu:53,valuabl:[34,26],"_e64":24,outlin:[76,84,26,108,92],outliv:[31,25,71],caveat:40,relocationtyp:53,dmpqrtx:97,image_scn_align_8192byt:109,ppc64:84,reevalu:29,pong:33,bjarn:16,invokeinst:16,cours:[39,61,41,33,20,44,65,76,11,25,55,66,16,17,18],goal:[67,84,26,69],divid:[31,65,71,34,84,10,37,4,5,59],rather:[31,69,32,1,35,36,71,40,41,55,98,50,16,18,53,103,74,104,76,59,23,84,26,112,29],anxiou:61,hash_map:16,divis:[14,84,71,2],targetasminfo:[74,53],goat:69,resourc:20,algebra:[31,71],ranlib:[23,66,64],reflect:[23,94,90,41],okai:[40,103,42,55,46,2,48,49,60,69,13,12,4,14,15,71,18,19],ptxstring:8,"short":[92,73,1,36,69,71,67,40,8,98,46,2,48,13,14,15,53,78,79,23,84,41,26,88,115],postfix:69,unhid:20,stash:102,ambigu:[102,55,20,2,10,14,29,18],caus:[31,62,0,84,1,95,69,37,4,71,72,65,40,97,8,5,45,46,2,48,10,15,16,98,18,74,55,20,75,56,76,78,
80,23,83,41,86,92,64,26,51,113,66],callback:[53,41,74,84,88,16],prepass:84,classllvm_1_1dibuild:40,fslp:0,headlight:69,reachabl:[74,61,60,71,73],s_load_dwordx2:24,geomean:0,next_var:[13,14,15],dso_path:77,typedef:[30,92,16,69,49],lai:[40,103,71,84,46,2,48,49,56,60,69,12,13,14,15,16],d31:71,harmless:31,anachronist:112,retti:112,scop:30,might:[84,33,69,94,36,3,4,71,39,97,41,102,5,98,9,48,11,73,13,14,15,16,51,53,74,20,100,104,21,23,60,61,82,83,25,92,86,26,27,66,28,106],alter:[16,20,98,76,66,71],wouldn:[69,15,46,40],"return":[112,41,84,86,87,56,3,78,83],no_instal:66,var_nam:[13,14,15],framework:[31,65,46,84,34,38,42,71,30,41,44,2,104,76,74,14,15,16,17,19],preheaderbb:[2,48],somebodi:26,bigger:[92,69],strr:53,complexpattern:[84,53],sourcebas:38,blockdim:8,"__dwarf":104,refresh:90,const_float:[12,13,14,15,19],difficult:[40,41,16,20,69,2,86,26,90,14,106,71],truncat:[71,53,116],compriz:37,dcmake_cxx_compil:25,"2x3x4":71,stkmaprecord:[73,88],compute_20:8,linkag:[23,45,84,50,112,79],regmappin
g_f:84,asmparsernum:115,expect:[112,86,59,78,41],atom_count:104,constindex:88,resulttyp:71,foolproof:76,ccifinreg:53,lineno:40,image_file_line_nums_strip:109,benjamin:74,isempti:16,uncommit:23,advanc:[20,69],guess:61,teach:[42,65,44,17,19],flagflat:92,thrown:[91,108,71],targetinfo:[26,53],putchar:[40,42,46,2,48,49,12,13,14,15],thread:[1,61,41,74,84,86,99,112],vararg:[42,16,84,112,71,19],toolnam:[66,51],runtimedyldelf:72,machineframeinfo:84,ccifnotvararg:53,circuit:[14,2],precal:74,libclc:26,feed:[13,104,48,41],notifi:[26,94,41,0],peculiar:29,feel:[39,69,41,42,83,30,44,26,11,50,71,17,19],cuda_success:8,add16mi8:6,summaris:78,cond_val:[13,14,15],construct:[112,86,87,41],stdlib:23,blank:[39,69,97,82,55,44,26,11,106,17,18],slower:[69,74,33,84,108,16,98],fanci:34,my_jit_tool:66,superpos:16,script:[61,54,113,20,1,87,26],interact:[72,31,61,82,74,83,20,84,86,71],gpg:23,stori:[67,23,36],gpu:[38,105,24,53,8,21,71],gpr:[28,84,71,116],luckili:74,option:[78,24,41,87,112,83],iftru:71,syncthread:8
,wswitch:69,st_gid:97,cmake_c_flag:61,mcasmpars:84,secondcondit:16,dsym:79,albeit:[15,46],kind:[31,69,33,3,37,71,6,67,65,40,97,98,46,2,14,15,16,102,74,20,104,21,57,77,60,108,30,84,86,26,88,27,66,106,90,25],assert_valid_funct:[12,13,14,15,19],doubli:[85,16],setgraphattr:16,remot:[72,23],immutablepass:41,pictur:[42,33,103,19],get_subtarget_feature_nam:21,empty_subregsset:53,dinkumwar:16,cleaner:[20,69,16],body_v:15,nnan:71,ysvn:94,astwrit:21,dedic:[84,53],"0b000100":53,violat:[69,103,74,48,26,13,71],intregsclass:53,supercomput:30,paramidx1:112,paramidx0:112,exec:[113,25,30],unsur:29,english:[23,69],reach:[91,31,69,53,74,33,88,108,27,71],flagsround:92,disttarbz2:66,shouldexpandatomicloadinir:86,image_rel_amd64_addr32nb:22,cmakefil:23,amaz:[14,2],dw_tag_enumeration_typ:[71,104],xmm7:[6,116],blockid:112,destruct:[88,39,11,47],libopag:63,sandybridg:0,arg_empti:16,rtl:84,getcol:40,area:[60,32,108,30,84,46,10,74,26,78,4,69,15,71,98],intti:71,optimizationlevel:20,inapplic:35,brtarget:53,pena
lti:[71,16],dw_apple_property_retain:104,bfd:64,create_add:19,image_file_large_address_awar:109,hash_funct:104,stackoffset:74,shlibext:[10,66],address_s:8,blockscalartrait:92,pushfq:84,"0x0001023":104,hit:[69,59],aliasopt:20,spurious:10,mydoclist:92,mydoclisttyp:92,fastest:114,sizabl:16,stdcall:[84,71],sextload:[6,53],him:33,exactmatch:71,llvmdummi:53,sk_otherspecialsquar:102,getvaluetyp:53,getpointertonamedfunct:72,"0x1234":104,use_empti:16,sk_buff:84,stump:53,dump:[40,112,42,83,25,92,46,2,48,49,76,104,21,89,37,12,13,84,16,19],cleverli:78,shared_librari:[66,51],proactiv:[26,83],mutabl:[44,71,2,48],arc:[95,82],dumb:[39,11],arg:[69,73,1,95,99,71,40,42,113,44,46,2,48,49,33,12,13,14,15,17,18,19,20,80,62,110,55,29],disadvantag:[90,20,16,57],icc_:53,unqualifi:84,arm:86,property_valu:27,setupmachinefunct:53,inconveni:[15,46,98],inst_end:16,old_valu:15,maprequir:92,pubtyp:104,condv:[40,46,2,48],extensioan:32,syntact:[12,71,5,49],unabbrev:112,sole:[26,16],aspir:[14,2],setbid:112,succeed:[76
,1,71,59],outfil:43,solv:[39,103,41,84,46,2,104,26,11,94,14,15],setindexedloadact:53,v128:[71,8],isdopcod:[65,84],interprocedur:[90,71,41],fragement:73,blissfulli:20,isomorph:98,available_extern:[71,112],context:[69,33,71,6,8,98,10,50,16,102,103,20,76,21,60,82,108,41,86,114,28,29,116],cvf:94,subclassref:29,internallinkag:16,tgt:115,getsrc:23,die_offset_bas:104,sweep:74,lbar:84,arbitrarili:[102,13,71,104,48],mistak:69,java:[91,31,39,74,71,86,11,16],due:[29,60,84,23,32,5,30,41,69,35,99,74,3,90,50,33,108,73,71,62],whom:33,brick:33,whoa:[12,49],strategi:[20,84],thunk:[31,84,71,33],dw_tag_imported_modul:71,flight:71,append_block:[12,13,14,15,19],llvm_map_components_to_librari:61,demand:[23,15,46,84,112],instructor:53,asmmatcheremitt:21,echocmd:66,eatomtypedietag:104,frozen:99,batch:36,dagtodagisel:65,abov:[91,31,92,32,33,34,69,70,55,71,6,72,39,40,84,41,42,5,44,98,9,2,48,49,10,11,50,46,12,13,14,15,16,17,18,19,53,103,74,102,20,65,104,76,78,79,59,97,23,61,73,108,25,62,85,88,51,112,113,28,10
6,90,30,116],cmp32ri:84,getlinenumb:104,int32:88,runonfunct:[83,16,53,41],image_file_machine_am33:109,"0x0000000000dc8872":99,x8b:109,rid:33,illinoi:[26,69],mioperandinfo:53,dw_lang_c:40,minim:[67,69,97,24,103,90,25,84,104,86,88,80,56,71,51],getnumel:16,dominatortreebas:16,higher:[84,26,3,41],x83:109,x87:71,x86:[61,86,87],wherea:[16,84,50,78,108,71],robust:[10,28],wherev:[69,40,16],obit:71,lower:[65,69,41,84,86,87,78,115,98],n2429:69,machineri:[34,102],discourag:[4,20,16,66],find_packag:61,"try":[84,54,113,20,41,69,86,26,78,83],searchabl:66,openmodul:49,chees:69,propos:[33,26,59],stripwarnmsg:66,targets_to_build:[9,53],succ_end:16,bpf_call:84,parse_var_init:15,xxxisellow:53,circumv:20,exposit:[44,17,49],getbinarycodeforinstr:53,lmalloc:20,filename1:67,finder:38,view_function_cfg_onli:13,complaint:[39,11],erasefrompar:[40,53,42,46,2,48,49,16],int32x4_t:78,v64:[71,8],ispoint:33,mypassnam:16,preexist:31,awaken:108,image_sym_class_bit_field:109,fbb:53,selp:8,llvm_yaml_is_flow_sequence_v
ector:92,short_wchar:71,xmm10:6,xmm11:6,xmm12:6,xmm13:6,xmm14:6,hatsiz:92,cst_code_wide_integ:112,global:[69,1,37,5,67,7,97,41,45,99,50,98,103,74,20,56,111,23,108,84,86,112],understood:[69,84,11],litter:26,unspecifi:[24,8,73,34,84,71],consciou:23,llvmgettypekind:65,surpris:[16,39,11,71,33],condition_vari:23,multmp:[40,42,46,2,48,49,12,13,14,15,19],image_scn_mem_read:109,prof:[3,59],patchset:23,proc:[23,35,53],rotl:65,n3206:69,setdatalayout:[40,30,46,2,48,49],assignvirt2stackslot:84,runtimedyld:72,lose:[76,39,11,104],mustquot:92,lhs_val:[12,13,14,15,19],ispointertyp:69,"_unwind_resum":108,testfunc:[12,49],arg_begin:[40,42,46,2,48,49,16],image_file_machine_wcemipsv2:109,registerasmprint:53,getdatalayout:[40,53,74,30,46,2,48,49],threadid:8,tok_then:[40,46,2,48],plethora:[23,98,16],branchfold:53,prec:[40,14,15,46,2],operandmap:53,question:[26,69,41],"long":[84,32,73,1,69,95,3,37,102,4,71,39,105,97,41,42,113,98,10,11,16,19,53,103,74,104,76,22,23,82,83,25,92,87,26,66,30],lldb:[27,26,69,10
4,99],"__cxa_call_unexpect":108,files:43,lto_codegen_set_pic_model:90,of_channel:[12,13,14,15,18,19],gcca:96,"0x7fffe3e864f0":25,yrc1:94,delta:62,libclang:30,consist:[84,86,112,41],caller:[31,98,53,42,33,84,85,2,48,83,76,74,78,13,14,71,19],cmpnumber:33,parsedefinit:[40,42,55,46,2,48,49],mflop:0,arm64:[23,87],tdrr:80,highlight:[67,23,40,84,21,106,16],worklist:[31,16,33],tooldir:66,src_reg:84,icc_val:53,createdatalayout:30,phieliminationid:84,cover:84,delinear:30,o32:30,numconst:88,simm13:53,cciftyp:53,bpf_neg:84,mytargetmachin:30,pat:[84,6,53],sdvalu:[84,53],remove_if:16,registerdescriptor:53,maybeoverridden:33,ecosystem:[27,16],at_decl_fil:104,storeregtostackslot:[84,53],parseprimari:[40,42,55,46,2,48,49,14],containsfoo:69,ccpromotetotyp:53,meaning:[103,74,16,75,21,73,80,106,71],thedoc:92,ccifcc:53,dllvm_default_target_tripl:9,ternari:[30,84],vice:[71,86],elementtyp:71,gr8:[84,53],spillsiz:53,scroll:82,cmpq:85,pervert:[6,100],tag_structure_typ:104,edi:[84,5,6],numfilenam:67,block_be
gin:[12,13,14,15,19],gmake:[76,34,98,87],dispel:103,int8ti:16,edx:[84,71,6,116],"2darrai":30,uphold:71,xxxiseldagtodag:53,else_bb:[13,14,15],initializenativetargetasmprint:[40,46,2,48,49],needstub:53,outgo:[71,59],attributerefer:21,formbit:6,fpformbit:6,templateparam:71,whichev:104,vadv:34,emitconstantpool:53,relev:[84,5,86,41],mandelhelp:[14,2],sk_specialsquar:102,"0x0002023":104,maxsiz:69,loop_end_bb:[13,14,15],h_inlined_into_g:79,pleas:[84,32,73,35,86,36,69,70,71,39,8,42,9,10,11,50,16,19,52,53,74,114,94,23,81,106,82,30,62,41,87,26,27,115,29,116],smaller:[31,69,82,74,16,30,84,26,50,71,34],"_main":[79,109],cfi:60,lcuda:8,memset:86,hardcod:[70,53],dllvm_binutils_incdir:64,fold:[86,41],investig:[39,11,34],ctor:[69,71,47,98],compat:[61,97,112,20,84,86,95,78,80],pointer_offset:73,image_file_machine_i386:109,compar:[45,41,108,84,3,5,59],mainlin:[26,94],smallconst:88,err_load_bio_str:25,dllvm_enable_doxygen_qt_help:61,proj_obj_root:[66,51],finishassembl:74,dllvm_targets_to_build:[61,9],c
hose:[12,32,49],sexi:[44,17],ocamlbuild_plugin:[12,13,14,15,19],destbitcodelib:66,libltdl:66,sse41:5,larger:[7,69,53,71,30,84,65,104,26,22,112,37,16],shader:[105,84,69],n2927:69,nsstring:104,unattend:83,typic:[91,31,69,94,95,37,71,72,39,97,41,102,5,10,11,16,51,53,103,74,104,76,111,23,60,61,107,108,25,84,87,88,27,66,28,90],n2928:69,apr:4,appli:[31,84,32,94,95,69,4,71,72,39,97,41,46,2,49,11,50,12,14,15,16,53,103,90,20,75,104,76,22,78,23,24,83,30,92,86,87,26,114,29,25,116],approxim:[3,36,1],inequ:84,loopcond:[40,46,2,48,13,14,15],api:[61,41],duck:16,opcod:[40,102,53,42,71,84,46,2,86,69,55,33,70,14,116,16,6,18,19],transformutil:27,gnuwin32:[36,61],sourcefil:95,emitconstpooladdress:53,fed:84,from:[78,24,41,56,86,112],stream:[84,0,93,5,69,71,67,7,96,113,12,13,14,15,16,17,18,19,53,75,65,76,111,23,107,92,112,55],ineg:84,few:[31,69,0,73,94,4,71,39,40,97,8,42,55,2,49,10,11,12,14,16,51,19,53,74,75,104,76,23,83,84,86,26,18,112,27,66],usr:[23,61,8,20,9,87,64,66],regconstraint:84,my_addit:104,sor
t:[67,69,61,20,62,86,26,111,71,98],clever:[39,11,102],ap2:71,cimag:[14,2],adc64mi8:6,llvmtooldir:66,tok_identifi:[40,42,55,44,46,2,48,49],is_zero_undef:71,localdynam:[71,112],dllc:10,augment:[14,16,2],lbb0_2:85,corpus_dir:25,annot:50,annoi:69,no_dead_strip:71,getregclass:84,proof:3,modulevector:49,quickstart:87,tar:[23,32,25,9,94,36,66],isindirectbranch:6,movapd:5,tag:[69,112],proprietari:26,xmin:[14,2],tag_apple_properti:104,predicate_stor:53,featurefparmv8:6,six:[84,1,86],linaro:35,sig:23,subdirectori:[23,61,1,87,94,27],basenamesourc:66,constantfp:[40,42,46,2,48,49,16,19],dwo:89,chri:[39,69,84,94,76,26,11],sil:6,tension:[15,46],msdn:[108,69],vehicletyp:69,hazard:60,singlethread:71,printdens:[14,2],attent:[10,26,71,53],hasiniti:16,initialize_ag_pass:76,mynewpass:113,light:[69,71],llvm_build_exampl:61,freebsd:[23,30,84,94],retainedtyp:[71,104],deoptim:73,elig:31,ouput:71,elim:[77,104],dw_tag_memb:[71,104],attrparsedattrlist:21,build_fsub:19,projlibsopt:66,reilli:16,"80x87":84,multim
ap:16,attrpchread:21,nonneg:71,devel:32,createbasictyp:40,nfc:60,trac:114,automak:[23,66],edit:[23,16,61,97],polit:84,instsp:53,forcibl:71,image_scn_align_8byt:109,mylistel:92,virtregmap:84,"__chkstk":22,our:[84,0,33,69,39,40,8,42,55,44,46,2,48,49,11,73,12,13,14,15,16,17,18,19,74,20,104,76,23,61,30,62,63,26,90],argumentlisttyp:16,const_use_iter:16,llvm_compiler_job:61,m_func:16,xzr:71,categori:69,sectalign:20,stroustrup:16,llvmbb:38,llvmconfig:61,dive:[44,17,102],proviso:26,powerpc:[61,86,87],bitset1:56,dictionari:[1,71],anyhow:71,promptli:26,my86_64flag:92,image_sym_class_undefined_label:109,tailcalle:84,lto:[56,112],libcxxabi:30,isdef:84,mrm1r:53,flaground:92,isfoo:69,ptrtoreplacedint:16,prioriti:[71,104,103],"0x580be3":25,unknown:[97,20,84,35,64,71],ntohl:84,"__nv_isnanf":8,printoperand:53,boil:[102,2,48,26,78,13,14],inner:[38,69,113,92,47,71,16],tidbit:[44,40,41],shell:[23,40,61,20,1,10,106,83,98],unabridg:[15,46],juli:74,mantain:94,protocol:[73,69,71],lea:[84,6],emac:[23,69,6,6
6],probe:84,utf:[23,21],ssl_new:25,bitcodewrit:[65,16],clip:99,favorit:[13,60,48],cohen:4,linker:[84,101,77,83,68],appel89:74,peform:78,coher:[27,71],lowerfp_to_sint:53,disjoint:[41,71,0],inform:[61,41,84,87,3,112],diverg:[14,71,2,103],rout:41,"__unwind_info":84,anyregcc:[88,71,112],which:24,movsx32rm16:84,ncsa:26,sync_timeout:25,llvmtarget:51,clash:[69,71],machine_version_major:24,safepointaddress:74,who:[67,23,39,69,53,38,33,62,46,63,10,26,11,27,4,15,71],sunwspro:23,image_file_machine_ia64:109,dw_op_addr:104,hassideeffect:6,attributelist:[21,57],dens:[71,16,112],addregfrm:53,pipe:[4,1,5],osuosl:114,determin:[1,61,97,41,75,77,112,84],nextindvar:71,const_arg_iter:16,setindexedstoreact:53,"30pm":92,mainloop:[40,42,55,46,2,48,49],filetyp:[36,77],arm_neon:[21,78],liveinterv:[80,84],mistyp:69,strtol:20,locat:[86,41],preserve_allcc:[71,112],much:[31,62,92,32,46,69,37,102,4,71,6,39,84,8,42,55,98,9,47,49,10,11,73,12,15,16,18,19,53,90,20,65,104,76,97,23,82,83,25,41,86,63,64,26,88,51,114,106
,29],mymaptyp:92,eatomtypetypeflag:104,multmp4:[12,49],local:[59,112,41],multmp1:[42,19],multmp2:[42,19],multmp3:[42,19],contribut:[52,38,16,84,76,26,31,71],pypi:98,succe:[93,7,40,96,97,107,102,113,75,46,101,115,10,77,55,37,114,108,15,5,18],buildtool:27,blarg:16,operating_system:71,selectcod:53,v1i128:30,regalloclinearscan:84,image_rel_i386_sect:22,partit:[84,77,83,35],view:[84,90,86,112],modulo:[30,84,71,104,24],knowledg:[67,31,39,69,74,84,10,26,11,112,66,28,106,71],maketir:69,objectcach:72,dw_form_xxx:104,int16_t:[92,53],terminatorinst:[69,3,16],image_sym_class_enum_tag:109,becaus:[91,31,84,0,33,34,1,47,36,69,70,4,71,6,72,39,40,97,41,42,5,44,98,9,2,48,49,11,50,46,12,13,14,15,16,17,18,19,67,53,103,74,102,20,104,76,111,78,57,94,23,82,73,83,92,86,87,26,88,55,112,108,66,90,116],gmail:[23,82],closer:[60,103],asynchron:[71,86],entranc:71,framemap:74,mainli:[33,21,71,51],divisionbyzero:71,dll:112,favor:[34,26],libsystem:69,beginassembl:74,"__apple_nam":104,rppassmanag:76,image_sym_dtype_
funct:109,disttargzip:66,amen:84,cudamodul:8,sprinkl:16,job:[61,102,25,87,76,4],mapopt:92,noalia:[103,50,112,41],externallinkag:[40,42,46,2,48,49,19],exclam:71,addit:[69,61,41,113,84,86,5,112,83],"0x00000120":104,thenbb:[13,40,46,2,48],constantint:[69,16],tgtm:23,mlimit:113,progbit:22,"__nv_truncf":8,committe:16,libtinfo:9,uint16_t:[70,92,104,53],unclear:[15,46,41],wall:[76,39,1,11],password:[114,26],wonder:[69,102,103,98,49,26,12],arriv:103,chmod:23,walk:[31,60,33,92,76,16],respect:[69,73,94,71,6,53,41,113,98,46,10,15,16,51,102,103,74,79,23,83,84,26,108,28],rpo:60,decent:[65,40,44,35,94,76,16],xxxcallingconv:53,compos:[67,66,36,71,97],compon:61,besid:[69,53,55,20,2,10,14,71,18],safepoint_token1:73,unregist:76,inbound:[67,71,50,103],presenc:[102,53,5,30,84,86,71,108,16,34],gtx:8,llparser:65,present:[91,23,62,24,103,74,71,20,1,22,112,80,79,66,84,5],xorrr:53,align:[86,24],dfpregsclass:53,constprop:20,wili:103,wild:[14,20,2],xorri:53,bb3:71,observ:[39,69,73,84,86,11,71],bb1:[71,112],d_
ctor_bas:5,layer:41,avx:[10,71,0],new_str:49,instrinfo:84,cctype:[40,42,55,46,2,48,49],eptr:71,avl:16,dual:26,add64mi32:6,operandti:84,incq:5,getattributespellinglistindex:21,uint16x4_t:78,gprof:[66,87],xxxschedul:53,member:[108,84,69,97,56],binary_preced:[14,15],largest:[71,84,22,50],f64:[84,71,53,8],expcnt:24,"0x1b":112,hasjit:53,maptag:92,ssecal:53,hardcodedsmalls:16,bcpl:29,decoupl:116,underneath:[10,23,87,51],extra_dist:66,inc4:5,immateri:33,firstli:71,"0x10":[88,104],faultingload:91,linkagetyp:16,getrawpoint:57,my_function_fast:8,getoffset:53,camel:69,obtain:[67,84],corei7:[10,0],heavili:[38,39,74,30,98,11],simultan:[0,25,87,10,78,16],tcb:85,expr1rh:67,now:[65,84,61,97,83,20,1,69,86,26,5],methodproto:53,amd64:23,eatomtypenul:104,smith:69,waypoint:83,emitobject:72,llvm_on_win32:4,agnost:[4,84,71,104,78],strconcat:[29,53,116],lightweight:[69,1,16],know:[69,1,36,71,67,41,98,99,50,84,83,74,20,78,23,61,25,62,86,26,114,90],denser:[14,2],librarynam:[74,66,76,53,51],"7e15":20,hostc:8,
hostb:8,hosta:8,incred:[26,69],bpf_class:84,repurpos:104,"0xff":[71,116],createphi:[40,46,2,48],growth:[71,84,16],"export":[23,61,41,90,30,84,2,94,64,66,71,20],superclass:[53,41,76,16,6,116],package_vers:61,add64ri32:6,not_found:[12,13,14,15,18,19],leaf:[108,104],image_sym_class_struct_tag:109,lead:[31,40,103,16,20,92,86,64,69,55,66,84,71,25,18,116],leak:[74,44,1,85,47,10,17],boolean_property_nam:27,leaq:85,leav:[23,62,82,53,8,74,33,20,1,104,64,26,31,71,98],prehead:[13,48,31],leader:69,getnam:[40,42,98,46,2,48,49,76,16],numstr:[40,42,55,44,46,2,48,49],acronym:38,"enum":[69,70,71,6,65,40,102,41,42,55,44,46,2,48,49,84,16,53,74,20,104,21,57,92,109,115],tdfile:66,xxxgencallingconv:53,obei:71,eatomtypenameflag:104,rare:[91,69,112,53,74,5,84,50,71,108,16,116],add64mi8:6,column:[67,23,40,0,5,34,92,104,69,70,71],vset_lan:78,constructor:[84,86],spiller:[80,77,84],disabl:[95,23,62,61,41,74,113,20,1,9,87,83,64,77,78,75,80,69,94,5,98],stackentri:74,desrib:67,own:[31,69,94,71,72,65,98,50,67,102,
74,20,59,23,61,82,25,84,64,26,112,27,66],automat:[24,41],warranti:[76,26],dbuilder:40,build_mod:36,val:[40,108,53,8,42,16,20,46,2,48,49,69,88,55,112,57,71,116],transfer:[85,71,47,78,108],threadsanit:71,intention:[76,55,69,71,18],appl:[38,5,84,104,99,26,71],arg1:[44,71,17],incorr:3,varexpr:[15,46,40],mailer:26,"0x7fffffff":71,codegen_expr:[12,13,14,15,19],lazyresolverfn:53,made:[91,31,84,33,94,69,71,6,38,39,40,41,42,98,46,2,48,49,11,73,13,15,16,51,102,103,100,104,76,21,78,108,92,85,26,112,66,106],temp:62,whether:[84,61,97,41,75,69,56,77,112,80,83,59],troubl:[23,20,26,36],below:[31,92,0,32,33,34,69,35,47,36,3,71,67,7,84,8,102,5,46,2,10,73,12,14,15,16,18,53,20,104,76,21,94,97,23,61,24,108,77,41,85,87,26,88,51,112,55,27,66],structtyp:16,ptrreg:84,lvm:40,targetdescript:53,llvmasmpars:51,numberexpr:[40,42,55,46,2,48,49,12,13,14,15,18,19],significantli:[91,69,71,48,76,90,55,112,37,13,16,18],entiteti:73,link_libs_in_shar:66,meaningless:16,rl5:8,create_entry_block_alloca:15,"8bit":25,rl7:8,m
utual:[42,73,20,17,44,19],targetfunc:16,minsizerel:[23,61],the_modul:[12,13,14,15,19],percent:41,constantfold:65,book:[76,38,69,60,16],bool:[92,33,69,71,65,40,102,41,42,46,2,48,49,12,13,14,15,16,19,53,20,76,61,84],llvmdisassembler_option_usemarkup:28,gline:0,neelakantam:31,inst_iter:16,keep_symbol:66,junk:[12,13,14,15,18,19],xxxsubtarget:53,indexedmap:84,add_subdirectori:61,tok_extern:[40,42,55,44,46,2,48,49],debian:[63,23,9],stringmap:[20,8],experienc:83,sass:8,reliabl:61,subregclasslist:53,pdata:22,emerg:99,auxiliari:53,invari:[23,50,41],istermin:[6,116]},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/OCamlLangImpl8","tutorial/OCamlLangImpl4","tutorial/OCamlLangImpl5","tutorial/OCamlLangImpl6","tutorial/OCamlLangImpl7","Program
mersManual","tutorial/OCamlLangImpl1","tutorial/OCamlLangImpl2","tutorial/OCamlLangImpl3","CommandLine","TableGen/BackEnds","Extensions","GettingStarted","AMDGPUUsage","LibFuzzer","DeveloperPolicy","LLVMBuild","MarkedUpDisassembly","TableGen/LangRef","ReleaseNotes","Passes","ReleaseProcess","MergeFunctions","TestSuiteMakefileGuide","HowToBuildOnARM","GettingStartedVS","CommandGuide/llvm-bcanalyzer","index","tutorial/LangImpl9","tutorial/LangImpl8","AliasAnalysis","tutorial/LangImpl3","CommandGuide/llvm-stress","tutorial/LangImpl1","CommandGuide/llvm-diff","tutorial/LangImpl7","InAlloca","tutorial/LangImpl5","tutorial/LangImpl4","Frontend/PerformanceTips","Projects","tutorial/index","WritingAnLLVMBackend","CommandGuide/llvm-build","tutorial/LangImpl2","BitSets","HowToUseAttributes","CommandGuide/llvm-readobj","BlockFrequencyTerminology","Lexicon","CMake","HowToSubmitABug","Packaging","GoldPlugin","ExtendingLLVM","MakefileGuide","CoverageMappingFormat","CommandGuide/index","CodingStan
dards","HowToUseInstrMappings","LangRef","MCJITDesignAndImplementation","Statepoints","GarbageCollection","CommandGuide/opt","WritingAnLLVMPass","CommandGuide/llc","BigEndianNEON","CommandGuide/llvm-symbolizer","CommandGuide/lli","TableGenFundamentals","Phabricator","Bugpoint","CodeGenerator","SegmentedStacks","Atomics","BuildingLLVMWithAutotools","StackMaps","CommandGuide/llvm-dwarfdump","LinkTimeOptimization","FaultMaps","YamlIO","CommandGuide/llvm-dis","HowToReleaseLLVM","CommandGuide/llvm-cov","CommandGuide/llvm-as","CommandGuide/llvm-ar","FAQ","DebuggingJITedCode","TableGen/Deficiencies","CommandGuide/llvm-config","HowToSetUpLLVMStyleRTTI","GetElementPtr","SourceLevelDebugging","CompilerWriterInfo","SphinxQuickstartTemplate","CommandGuide/llvm-link","ExceptionHandling","yaml2obj","CommandGuide/llvm-profdata","CommandGuide/llvm-nm","BitCodeFormat","CommandGuide/bugpoint","HowToAddABuilder","CommandGuide/tblgen","TableGen/LangIntro"],titles:["Auto-Vectorization in LLVM","lit - LL
VM 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","Getting Started with the LLVM System","User Guide for AMDGPU Back-end","
LibFuzzer – a library for coverage-guided fuzz testing.","LLVM Developer Policy","LLVMBuild Guide","LLVM’s Optional Rich Disassembly Output","TableGen Language Reference","LLVM 3.7 Release Notes","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: Adding Debug Information","LLVM Alias Analysis Infrastructure","3. Kaleidoscope: Code generation to LLVM IR","llvm-stress - generate random .ll files","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.
Kaleidoscope: Adding JIT and Optimizer Support","Performance Tips for Frontend Authors","Creating an LLVM Project","LLVM Tutorial: Table of Contents","Writing an LLVM Backend","llvm-build - LLVM Project Build Utility","2. Kaleidoscope: Implementing a Parser and AST","Bitsets","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","Extending LLVM: Adding instructions, intrinsics, types, etc.","LLVM Makefile Guide","LLVM Code Coverage Mapping Format","LLVM Command Guide","LLVM Coding Standards","How To Use Instruction Mappings","LLVM Language Reference Manual","MCJIT Design and Implementation","Garbage Collection Safepoints in LLVM","Garbage Collection with LLVM","opt - LLVM optimizer","Writing an LLVM Pass","llc - LLVM static compiler","Using ARM NEON instructions in big endian mode","llvm-symbolizer - convert addre
sses into source code locations","lli - directly execute programs from LLVM bitcode","TableGen 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","Building LLVM With Autotools","Stack maps and patch points in LLVM","llvm-dwarfdump - print contents of DWARF sections","LLVM Link Time Optimization: Design and Implementation","FaultMaps and implicit checks","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","Source Level Debugging with LLVM","Architecture & Platform Information fo
r Compiler Writers","Sphinx Quickstart Template","llvm-link - LLVM bitcode linker","Exception Handling in LLVM","yaml2obj","llvm-profdata - Profile data tool","llvm-nm - list LLVM bitcode and object file’s symbol table","LLVM Bitcode File Format","bugpoint - automatic test case reduction tool","How To Add Your Build Configuration To LLVM Buildbot Infrastructure","tblgen - Target Description To C++ Code Generator","TableGen Language Introduction"],objects:{"":{"--stats":[77,0,1,"cmdoption--stats"],"-D":[111,0,1,"cmdoption-llvm-nm-D"],"-A":[111,0,1,"cmdoption-llvm-nm-A"],"-name-regex":[95,0,1,"cmdoption-llvm-cov-show-name-regex"],"-B":[111,0,1,"cmdoption-llvm-nm-B"],"-":[75,0,1,"cmdoption-"],"-O":[77,0,1,"cmdoption-O"],"-seed":[43,0,1,"cmdoption-seed"],"-I":[115,0,1,"cmdoption-tblgen-I"],"-mattr":[77,0,1,"cmdoption-mattr"],"-gen-register-info":[115,0,1,"cmdoption-tblgen-gen-register-info"],"-gen-subtarget":[115,0,1,"cmdoption-tblgen-gen-subtarget"],"-S":[75,0,1,"cmdoption-S"],"-
binary":[110,0,1,"cmdoption-llvm-profdata-merge-binary"],"-verify-each":[75,0,1,"cmdoption-verify-each"],"-counts":[110,0,1,"cmdoption-llvm-profdata-show-counts"],"-region-coverage-gt":[95,0,1,"cmdoption-llvm-cov-show-region-coverage-gt"],"-d":[107,0,1,"cmdoption-d"],"-g":[111,0,1,"cmdoption-llvm-nm-g"],"--object-directory":[95,0,1,"cmdoption-llvm-cov-gcov--object-directory"],"-a":[95,0,1,"cmdoption-llvm-cov-gcov-a"],"-c":[95,0,1,"cmdoption-llvm-cov-gcov-c"],"-b":[95,0,1,"cmdoption-llvm-cov-gcov-b"],"--no-progress-bar":[1,0,1,"cmdoption--no-progress-bar"],"-l":[95,0,1,"cmdoption-llvm-cov-gcov-l"],"-o":[111,0,1,"cmdoption-llvm-nm-o"],"-n":[111,0,1,"cmdoption-llvm-nm-n"],"--long-file-names":[95,0,1,"cmdoption-llvm-cov-gcov--long-file-names"],"--defined-only":[111,0,1,"cmdoption-llvm-nm--defined-only"],"-j":[1,0,1,"cmdoption-j"],"-u":[58,0,1,"cmdoption-u"],"-t":[58,0,1,"cmdoption-t"],"-v":[111,0,1,"cmdoption-llvm-nm-v"],"-q":[1,0,1,"cmdoption-q"],"--show-tests":[1,0,1,"cmdoption--show-
tests"],"-s":[58,0,1,"cmdoption-s"],"-r":[58,0,1,"cmdoption-r"],"-gen-dag-isel":[115,0,1,"cmdoption-tblgen-gen-dag-isel"],"-show-line-counts-or-regions":[95,0,1,"cmdoption-llvm-cov-show-show-line-counts-or-regions"],"-use-symbol-table":[79,0,1,"cmdoption-use-symbol-table"],"--max-tests":[1,0,1,"cmdoption--max-tests"],"-class":[115,0,1,"cmdoption-tblgen-class"],"--max-time":[1,0,1,"cmdoption--max-time"],"-line-coverage-gt":[95,0,1,"cmdoption-llvm-cov-show-line-coverage-gt"],"-instr":[110,0,1,"cmdoption-llvm-profdata-show-instr"],"-all-functions":[110,0,1,"cmdoption-llvm-profdata-show-all-functions"],"-use-color":[95,0,1,"cmdoption-llvm-cov-report-use-color"],"--vg-leak":[1,0,1,"cmdoption--vg-leak"],"--branch-probabilities":[95,0,1,"cmdoption-llvm-cov-gcov--branch-probabilities"],"--all-blocks":[95,0,1,"cmdoption-llvm-cov-gcov--all-blocks"],"-P":[111,0,1,"cmdoption-llvm-nm-P"],"--print-file-name":[111,0,1,"cmdoption-llvm-nm--print-file-name"],"-stats":[75,0,1,"cmdoption-stats"],"-name
":[95,0,1,"cmdoption-llvm-cov-show-name"],"-gen-asm-writer":[115,0,1,"cmdoption-tblgen-gen-asm-writer"],"-symbols":[58,0,1,"cmdoption-symbols"],"-print-sets":[115,0,1,"cmdoption-tblgen-print-sets"],"-program-headers":[58,0,1,"cmdoption-program-headers"],"--disable-fp-elim":[77,0,1,"cmdoption--disable-fp-elim"],"-obj":[79,0,1,"cmdoption-obj"],"--check-prefix":[5,0,1,"cmdoption--check-prefix"],"--strict-whitespace":[5,0,1,"cmdoption--strict-whitespace"],"--x86-asm-syntax":[77,0,1,"cmdoption--x86-asm-syntax"],"--show-suites":[1,0,1,"cmdoption--show-suites"],"-relocations":[58,0,1,"cmdoption-relocations"],"-gcc":[110,0,1,"cmdoption-llvm-profdata-merge-gcc"],"-show-line-counts":[95,0,1,"cmdoption-llvm-cov-show-show-line-counts"],"-needed-libs":[58,0,1,"cmdoption-needed-libs"],"-line-coverage-lt":[95,0,1,"cmdoption-llvm-cov-show-line-coverage-lt"],"-nodetails":[37,0,1,"cmdoption-llvm-bcanalyzer-nodetails"],"--enable-no-nans-fp-math":[77,0,1,"cmdoption--enable-no-nans-fp-math"],"-asmwriter
num":[115,0,1,"cmdoption-tblgen-asmwriternum"],"-debug-dump":[89,0,1,"cmdoption-debug-dump"],"--print-machineinstrs":[77,0,1,"cmdoption--print-machineinstrs"],"-asmparsernum":[115,0,1,"cmdoption-tblgen-asmparsernum"],"-section-symbols":[58,0,1,"cmdoption-section-symbols"],"--print-size":[111,0,1,"cmdoption-llvm-nm--print-size"],"-h":[58,0,1,"cmdoption-h"],"--config-prefix":[1,0,1,"cmdoption--config-prefix"],"-gen-pseudo-lowering":[115,0,1,"cmdoption-tblgen-gen-pseudo-lowering"],"-f":[75,0,1,"cmdoption-f"],"-function":[110,0,1,"cmdoption-llvm-profdata-show-function"],"-print-records":[115,0,1,"cmdoption-tblgen-print-records"],"-gen-dfa-packetizer":[115,0,1,"cmdoption-tblgen-gen-dfa-packetizer"],"--load":[77,0,1,"cmdoption--load"],"-dump":[37,0,1,"cmdoption-llvm-bcanalyzer-dump"],"--dynamic":[111,0,1,"cmdoption-llvm-nm--dynamic"],"--quiet":[1,0,1,"cmdoption--quiet"],"-demangle":[79,0,1,"cmdoption-demangle"],"--spiller":[77,0,1,"cmdoption--spiller"],"-gen-instr-info":[115,0,1,"cmdoptio
n-tblgen-gen-instr-info"],"-gen-intrinsic":[115,0,1,"cmdoption-tblgen-gen-intrinsic"],"--enable-unsafe-fp-math":[77,0,1,"cmdoption--enable-unsafe-fp-math"],"-arch":[95,0,1,"cmdoption-llvm-cov-report-arch"],"--unconditional-branches":[95,0,1,"cmdoption-llvm-cov-gcov--unconditional-branches"],"-strip-debug":[75,0,1,"cmdoption-strip-debug"],"--size-sort":[111,0,1,"cmdoption-llvm-nm--size-sort"],"-version":[58,0,1,"cmdoption-version"],"-size":[43,0,1,"cmdoption-size"],"--enable-no-infs-fp-math":[77,0,1,"cmdoption--enable-no-infs-fp-math"],"--path":[1,0,1,"cmdoption--path"],"-text":[110,0,1,"cmdoption-llvm-profdata-merge-text"],"-time-passes":[75,0,1,"cmdoption-time-passes"],"-march":[77,0,1,"cmdoption-march"],"--show-unsupported":[1,0,1,"cmdoption--show-unsupported"],"-disable-inlining":[75,0,1,"cmdoption-disable-inlining"],"--time-passes":[77,0,1,"cmdoption--time-passes"],"-region-coverage-lt":[95,0,1,"cmdoption-llvm-cov-show-region-coverage-lt"],"--vg":[1,0,1,"cmdoption--vg"],"-p":[95
,0,1,"cmdoption-llvm-cov-gcov-p"],"--no-output":[95,0,1,"cmdoption-llvm-cov-gcov--no-output"],"--show-xfail":[1,0,1,"cmdoption--show-xfail"],"--undefined-only":[111,0,1,"cmdoption-llvm-nm--undefined-only"],"-show-regions":[95,0,1,"cmdoption-llvm-cov-show-show-regions"],"--shuffle":[1,0,1,"cmdoption--shuffle"],"--extern-only":[111,0,1,"cmdoption-llvm-nm--extern-only"],"--preserve-paths":[95,0,1,"cmdoption-llvm-cov-gcov--preserve-paths"],"--branch-counts":[95,0,1,"cmdoption-llvm-cov-gcov--branch-counts"],"-load":[75,0,1,"cmdoption-load"],"-expand-relocs":[58,0,1,"cmdoption-expand-relocs"],"--disable-excess-fp-precision":[77,0,1,"cmdoption--disable-excess-fp-precision"],"--format":[111,0,1,"cmdoption-llvm-nm--format"],"-print-enums":[115,0,1,"cmdoption-tblgen-print-enums"],"-show-instantiations":[95,0,1,"cmdoption-llvm-cov-show-show-instantiations"],"-filetype":[77,0,1,"cmdoption-filetype"],"-gen-emitter":[115,0,1,"cmdoption-tblgen-gen-emitter"],"-unwind":[58,0,1,"cmdoption-unwind"],"-
sections":[58,0,1,"cmdoption-sections"],"-verify":[37,0,1,"cmdoption-llvm-bcanalyzer-verify"],"-gen-tgt-intrinsic":[115,0,1,"cmdoption-tblgen-gen-tgt-intrinsic"],"--help":[1,0,1,"cmdoption--help"],"--implicit-check-not":[5,0,1,"cmdoption--implicit-check-not"],"-section-data":[58,0,1,"cmdoption-section-data"],"-disable-opt":[75,0,1,"cmdoption-disable-opt"],"-mcpu":[77,0,1,"cmdoption-mcpu"],"-file-headers":[58,0,1,"cmdoption-file-headers"],"--verbose":[1,0,1,"cmdoption--verbose"],"-debug":[75,0,1,"cmdoption-debug"],"--function-summaries":[95,0,1,"cmdoption-llvm-cov-gcov--function-summaries"],"-sample":[110,0,1,"cmdoption-llvm-profdata-show-sample"],"--param":[1,0,1,"cmdoption--param"],"-dynamic-table":[58,0,1,"cmdoption-dynamic-table"],"-inlining":[79,0,1,"cmdoption-inlining"],"--vg-arg":[1,0,1,"cmdoption--vg-arg"],"-functions":[79,0,1,"cmdoption-functions"],"-section-relocations":[58,0,1,"cmdoption-section-relocations"],"--debug":[1,0,1,"cmdoption--debug"],"-dyn-symbols":[58,0,1,"cmd
option-dyn-symbols"],"-mtriple":[77,0,1,"cmdoption-mtriple"],"-help":[37,0,1,"cmdoption-llvm-bcanalyzer-help"],"--numeric-sort":[111,0,1,"cmdoption-llvm-nm--numeric-sort"],"--threads":[1,0,1,"cmdoption--threads"],"--succinct":[1,0,1,"cmdoption--succinct"],"-gen-fast-isel":[115,0,1,"cmdoption-tblgen-gen-fast-isel"],"-gen-disassembler":[115,0,1,"cmdoption-tblgen-gen-disassembler"],"-gen-asm-matcher":[115,0,1,"cmdoption-tblgen-gen-asm-matcher"],"-show-expansions":[95,0,1,"cmdoption-llvm-cov-show-show-expansions"],"--time-tests":[1,0,1,"cmdoption--time-tests"],"--no-sort":[111,0,1,"cmdoption-llvm-nm--no-sort"],"--object-file":[95,0,1,"cmdoption-llvm-cov-gcov--object-file"],"-dsym-hint":[79,0,1,"cmdoption-dsym-hint"],"--input-file":[5,0,1,"cmdoption--input-file"],"-st":[58,0,1,"cmdoption-st"],"--debug-syms":[111,0,1,"cmdoption-llvm-nm--debug-syms"],"-sr":[58,0,1,"cmdoption-sr"],"-gen-enhanced-disassembly-info":[115,0,1,"cmdoption-tblgen-gen-enhanced-disassembly-info"],"--regalloc":[77,0,
1,"cmdoption--regalloc"],"-output":[110,0,1,"cmdoption-llvm-profdata-show-output"],"-sd":[58,0,1,"cmdoption-sd"],"-default-arch":[79,0,1,"cmdoption-default-arch"]}},titleterms:{callingconv:21,prefix:[71,5],undef:98,"const":33,lsda:108,globalvari:16,concret:102,everi:69,"void":[33,71],module_code_funct:112,clangattrclass:21,type_code_numentri:112,vector:[31,71,103,16,0],verif:73,x86_64:9,paramattr_block:112,bitstream:112,mcstreamer:84,direct:[24,0,71,84,22,88,5],getposit:20,ilist:16,aggreg:[31,71,50],llvmbuild:27,blockinfo:112,scalarenumerationtrait:92,hide:20,neg:103,poison:71,"new":[76,31,65,41,32,98,46,104,10,15,16],postdomin:31,hasglobalalias:33,metadata:[91,3,71,8],elimin:31,behavior:41,mem:71,copysign:71,lowerswitch:31,accur:71,studio:36,debugg:[31,71,104,83],valuemap:16,precis:[31,71],portabl:[39,69,30,98,11,4],fsub:71,unit:[84,40],tst_code_entri:112,would:33,tail:[31,84],call:[31,84,53,41,16,0,47,69,71,98],callgraph:[76,31],simplifycfg:[31,98],type:[67,31,65,69,53,0,16,92,50,
103,116,71,29,98],tell:103,relat:53,warn:[65,69],unpack:23,must:[20,41],word:112,setup:[42,40,102,19],work:[23,103,33],targetframelow:84,root:74,localrecov:71,phabric:82,give:98,coreclr:74,indic:[38,50,103],want:33,codegen:86,end:[69,24,8,16,77,62,104,21,103,71,98],turn:[69,16,98],how:[84,114,102,103,32,33,25,62,9,35,94,64,21,57,70,16,98],tbaa:71,type_symtab_block:112,verifi:[31,98,5],config:[66,101],updat:[30,94,98,41],attrdoc:21,after:[69,90,98],befor:69,wrong:98,arch:24,domin:31,opaqu:71,alias:[33,20,84,71],environ:[76,23,30],reloc:[73,22],lambda:69,order:[92,71,86,78],frontend:50,over:[69,16,50],type_code_opaqu:112,ia64:105,flexibl:5,clangstmtnod:21,fix:[33,84,16,104,112],type_code_integ:112,fadd:71,comprehens:30,erlang:74,safe:74,"break":[31,16],itanium:[108,105],spotless:66,each:31,debug:[31,40,41,104,68,99,10,16],foldingset:16,resum:71,extract:[31,7],content:[52,112,104,102,89],reader:58,inteqclass:16,dse:[31,41],umul:71,log2:71,barrier:[74,8],written:98,lto_module_t:90,recon
figur:66,filter:[108,84],pointstoconstantmemori:41,fptoui:71,regress:10,cmpvalu:33,isa:16,size:[85,16],rang:[67,71],neededsafepoint:74,independ:[39,84,11,98],restrict:108,lto_code_gen_t:90,instruct:[31,65,98,53,24,103,16,84,86,3,78,70,28,71],wrapper:112,exp2:71,top:[20,29],type_code_struct:112,evolut:31,toi:25,namespac:69,tool:[23,113,98,68,110,36,66,83],lower:[74,31,103],bpf_ind:84,removeus:33,mergereturn:31,target:[31,39,98,53,8,30,84,94,22,66,11,103,115,71,80],keyword:69,provid:69,tree:[31,98,51,18,55],project:[23,61,54,30,64,27,66,51],aapc:78,consumeaft:20,modern:23,increment:26,strength:31,aliassettrack:41,preincrement:69,simplifi:[31,69],object:[72,52,23,16,103,104,87,111,112,58,71,51],lexic:29,breakpoint:76,phase:[84,90,53],tinyptrvector:16,don:[4,69,98,103],dom:31,doc:105,flow:[13,92,48],doe:[76,25,98,103],declar:[31,29,104],caml:52,dot:31,ldc:30,random:[33,43],syntax:[29,8,5,109,22,55,73,88,71,6,18,116],freeform:20,buildbot:[114,25],dfapacket:21,getanalysisusag:76,absolut:2
0,layout:[31,84,23,16,8,104,71,51],acquir:86,machineinstr:84,configur:[23,98,34,1,9,87,77,114],ditemplatetypeparamet:71,rich:28,predecessor:16,ceil:71,smul:71,report:[32,95,62],x86_mmx:71,method:[76,4,69,16,41],basicblock:[33,16],commandlin:20,attributeset:57,bitvector:16,result:[73,1,98,41],miscompil:[62,83],respons:[31,20,41],fail:98,awar:102,hopefulli:106,discoveri:1,dicompileunit:71,diderivedtyp:71,mul:71,irc:38,approach:90,attribut:[31,20,47,104,26,57,71],extend:[65,84,46,2,48,13,14,15],extens:[20,104,48,76,22,13],lazi:[31,16],rtti:[69,102],notatom:86,cov:95,fault:91,elf:22,diff:45,guid:[31,24,8,38,20,86,68,10,34,27,66,25],assum:71,duplic:[4,31],"__nvvm_reflect":8,basic:[31,61,102,53,16,44,68,17,76,55,112,33,71,6,18],quickli:23,deeper:102,type_code_x86_fp80:112,argument:[71,20,116,16,31],multithread:76,"catch":108,smallbitvector:16,read_regist:71,bitcod:[107,98,111,112,37,80,90],dissect:[67,8],properti:[39,11,104],slp:0,scalarrepl:31,anchor:69,mcsymbol:84,dwarfdump:89,globaldc:
31,perform:[98,50,0],make:[91,69,26,16,98],complex:[71,16],codeemitt:21,disubroutinetyp:71,fragil:10,reassoci:31,tune:77,readcyclecount:71,qualif:94,bewar:69,client:41,thi:[40,103,33,25,98,46,106,50,15,30],programm:16,identifi:[74,71],languag:[52,39,69,44,29,30,98,46,2,48,104,11,13,14,15,71,17,116],expos:4,patchpoint:88,help:[20,98,16,51],els:[13,69,48],opt:[76,20,75],background:[102,99],shadow:74,linux:105,specif:[39,61,97,105,84,104,94,10,77,11,22,4],bpf:30,manual:[71,20,105,16],unnecessari:69,underli:103,right:[98,16],old:98,global_ctor:[98,71],interv:[31,84],argpromot:[31,41],type_code_fp128:112,intern:[31,20,69,66],indirect:71,global_dtor:71,functioncompar:33,subclass:[16,53],optparserdef:21,condit:31,core:16,replacedirectcal:33,memdep:31,tablegen:[81,84,21,100,29,6,116],promot:[31,53],emitt:53,chapter:[40,42,55,46,2,48,49,12,13,14,15,18,19],slightli:16,localescap:71,canonic:[31,71],commit:[26,82],looppass:76,instcombin:[31,98],"float":[71,22,80],encod:[67,84,112],bound:103,sto
rag:[71,20,16],git:[23,25],wai:[16,103],support:[69,53,25,84,49,3,12,66,71,98],transform:[31,41],type_code_half:112,"class":[29,69,102,53,41,16,20,84,76,70,71,116],avail:[74,41],width:[69,71,50,112],memorydependenceanalysi:41,sitofp:71,analysi:[31,103,41,0,84,76,29],form:[31,84],raw_ostream:69,modulepass:76,dead:31,heap:[74,16],icmp:71,profdata:110,inttoptr:[71,103],type_code_ppc_fp128:112,fundament:[65,81],sampl:[70,67],emit:[74,95],featur:[63,69,0,74,25,84,10],request:82,"abstract":[74,55,50,112,4,71,18],diagnost:0,exist:[76,15,46,98,41],nvvmreflect:8,trip:0,bswap:71,assembl:[96,24,53,74,84,22,78,71],floor:71,when:[25,69,83,50,98],test:[23,98,61,32,113,25,1,94,10,26,71,34],node:[31,65,71],stackrestor:71,intend:47,smallset:16,cmpgep:33,consid:50,pseudo:67,time:[64,69,40,90,62],offsetof:[39,11],hsa_code_object_vers:24,concept:[67,66,76,6],nearbyint:71,chain:[23,36,16,41],ptrtoint:[71,103],global:[33,31,71,104,0],lli:80,llc:77,middl:98,depend:[63,31,22,41],graph:[31,16],readabl:[66,6
9],uadd:71,sourc:[67,23,40,61,30,98,104,87,69,79,51],string:[67,71,16],administr:94,level:[67,31,69,29,20,84,104,78,4,71,98],did:98,die:31,iter:[16,0],item:23,quick:[67,76,61,74,20,87,10],round:71,paramattr_code_entri:112,sign:[112,82],scev:[31,41],sopp:24,defici:[6,100],deriv:[65,16],gener:[31,84,34,1,71,16,72,97,42,43,98,48,13,83,19,74,22,80,108,62,66,115,116],globalsmodref:[31,41],modif:3,address:[72,103,84,79,8,71],along:33,monoton:86,nondebug:31,safepoint:73,basiccg:31,overrid:[66,41],semant:[73,4,71,88,8],maxnum:71,extra:[10,103],modul:[31,7,69,16,76,66,71],prefer:[69,50],cttz:71,marker:71,instal:[66,9],should:[33,98],dagisel:21,post:31,deadtypeelim:31,memori:[31,41,16,46,15,71],univers:98,subvers:[23,98],live:84,criteria:94,scope:[71,104,116],checkout:23,share:63,enhanc:73,visual:[36,61],prototyp:31,logarithm:33,ibm:105,registerinfo:21,prepar:72,uniqu:92,can:[98,103],topic:[52,16,61],critic:31,fp16:71,alwai:[31,103],multipl:16,targetsubtarget:84,write:[76,69,53,41,74,20,84,10
,21,103,34,51,98],legalizetyp:84,foreach:29,map:[67,91,84,53,74,16,92,88,73,70,71],remap:72,armneonsema:21,memcpi:[31,71],smallstr:16,module_code_gcnam:112,mai:[31,41,33],data:[67,31,84,8,71,92,110,112,4,16],stress:43,autotool:[64,87],assici:33,ebpf:84,predic:69,inform:[31,40,105,30,69,104,10,95,26,16],"switch":[69,3,71],combin:[31,84],runonbasicblock:76,mapvector:16,callabl:16,comdat:71,microscop:69,tta:30,pointer:[71,41,16,103,0],dynam:[76,84,98],entiti:116,armneontest:21,group:[76,20,71],thumb:102,fastisel:21,polici:26,precondit:66,gen:8,platform:[10,105,98,61],jit:[53,30,84,49,12,66,99,16],cmptype:33,mail:38,main:33,non:[74,31,30],synopsi:[93,1,5,95,37,43,7,96,97,113,45,101,54,75,77,79,80,58,107,110,111,89,115],initi:[74,69,84,16,41],half:71,now:98,introduct:[31,62,92,32,33,69,35,47,3,70,71,6,72,65,40,84,8,42,55,44,9,2,48,49,46,12,13,14,15,16,17,18,19,67,53,103,74,20,100,104,76,114,21,22,78,57,94,59,61,24,108,25,41,85,86,64,26,27,66,28,106,29,30,116],name:[31,69,53,20,84,104,71]
,getanalysi:76,revers:0,sequentiallyconsist:86,sjlj:108,callsit:[31,108],compil:[23,101,40,61,30,62,9,87,49,63,77,12,105,69,71,98],replac:[31,16],individu:16,continu:69,releasememori:76,redistribut:98,operand:[73,88,53],happen:[98,103],switchinst:[31,3],armneon:21,space:[84,69,103,8],profil:[31,110],pocl:30,rational:[71,103],state:33,clangattrvisitor:21,frequenc:59,ocaml:74,motion:31,thing:[98,50],gcmetadataprint:74,frequent:[98,61],first:[71,103],oper:[97,16,46,2,14,15,71],directli:[80,41],rint:71,arrai:[67,22,16,71,103],stringref:16,fast:71,crit:31,open:[30,98],module_code_datalayout:112,convent:[84,53,8,98,47,71],type_block:112,fma:71,clangsacheck:21,copi:[69,47],specifi:[74,76,20,41],pragma:0,than:103,xcore:105,posit:20,seri:59,pre:[32,25],loweratom:31,licm:[31,41],ani:25,doiniti:76,bitcast:71,bitwis:71,engin:72,libcal:31,advic:[63,83],note:[30,84,105,35],printer:[31,53],normal:92,c99:22,insertel:71,"_global__i_a":98,cmpoper:33,runtim:[23,108,71,0],mcjit:[72,99],lexicon:60,show:
[95,98,110],atom:[31,71,86],concurr:[71,86],hack:[31,9],runonscc:76,slot:31,onli:[31,16],mergefunct:33,fenc:71,end_block:112,enough:83,analyz:37,customwritebarri:74,offici:105,gep:[50,103],variou:31,get:[23,36,98,59],clang:[23,25,9,35,94,21],ssa:[31,84,98],targetjitinfo:84,requir:[23,103,41,74,20,84,10,36,76,51],intrins:[31,65,8,74,73,104,21,88,78,108,71],cmpconstant:33,where:98,summari:[23,103,87,78,37],kernel:8,gcwrite:[74,71],postdom:31,deadargelim:31,detect:31,review:[26,82],enumer:69,label:[71,69,5],clangcommenthtmltagsproperti:21,behind:104,clangattrpchread:21,volatil:71,between:[76,90,16,103],"import":16,spars:31,sparc:105,bitset:[71,56],region:[67,31,76],contract:102,audienc:53,tutori:[52,39,8,44,11,66,5,17],doesnotaccessmemori:41,frameaddress:71,acceler:104,pow:71,exploit:20,sccp:31,sentinel:16,rebuild:98,mark:8,basicaa:[31,41],fptrunc:71,type_code_funct:112,module_code_vers:112,module_code_alia:112,trick:[39,11],cast:[16,103],invok:[31,71,16,8],tblgen:115,onlyreadsmemori:4
1,mergefunc:31,develop:[23,26,61,68,38],author:50,same:[16,5],rgpassmanag:76,binari:[55,98,2,94,14,71,18],document:[38,69,105,33,92,94,50],immutableset:16,exhaust:31,srem:71,ssub:71,preassign:84,nest:47,driver:[42,55,18,19],sreg:8,driven:41,value_symtab_block:112,setversionprint:20,extern:[31,20,30,34,52],defm:29,runonmachinefunct:76,macro:[92,16],markup:28,clobber:[84,71],without:98,model:71,dereferenc:103,customreadbarri:74,execut:[61,1,16,80,8],tip:[39,11,50],s_waitcnt:24,neon:78,rest:[55,18],gdb:[76,99],smallvector:16,asmmatch:21,struct:[69,71,103],hint:[16,0],filecheck:5,except:[31,69,71,47,108],littl:69,versa:16,overview:[67,23,69,112,8,32,38,34,41,63,87,10,70,36,108,88,74,73,27,71,51],disubprogram:71,endcatch:108,earli:69,read:[74,33,90,53,8],amd:105,va_start:71,world:76,mod:31,intel:[77,105],integ:[71,112,103],dilexicalblockfil:71,output:[92,20,1,37,28,71,34],targetinstrinfo:[84,53],deduct:69,trampolin:71,freez:98,gvn:[31,41],definit:[69,60,88,116,37],token:25,legal:[84,50,5
3],exit:[31,69,93,1,5,95,37,43,7,96,97,113,45,101,54,75,77,79,80,58,107,110,111,89,115],refer:[29,31,74,16,20,27,71],garbag:[74,71,39,11,73],inspect:16,fpmath:71,clangattrimpl:21,"throw":[4,108],comparison:33,patent:26,stacklet:85,faultmap:91,routin:16,clangdiagsdef:21,effici:[47,41],bpf_ab:84,terminolog:[23,59],strip:31,your:[76,23,61,114,102],compon:[27,25,84,101],log:[33,71],hex:92,nvvm:8,start:[67,23,61,74,20,84,76,10,36,71],interfac:[4,98,16,82,41],low:69,clear_cach:71,kaleidoscop:[52,39,40,42,55,44,46,2,48,49,11,12,13,14,15,17,18,19],resolut:90,addrequiredtransit:76,timelin:94,bundl:84,getmodrefinfo:41,epilog:84,conclus:[55,39,11,18],notat:[23,29],tripl:[84,71,8],runonregion:76,"default":[66,92,69],embed:61,loadabl:66,creat:[76,98,16,51,94],deep:106,deletevalu:41,file:[67,23,84,97,31,43,20,1,69,104,87,10,90,112,111,5,98,116],incorrect:62,collector:[74,71],multiclass:[29,116],field:33,valid:[32,92],copyright:26,you:106,architectur:105,formed:71,registri:76,sequenc:92,symbol:[79
,31,111,90],ilist_trait:16,amd_kernel_code_t:24,ilist_nod:16,reduc:31,ipsccp:31,backward:26,directori:98,type_code_float:112,smrd:24,mask:71,hello:76,calle:47,mass:59,represent:[67,98,41],all:[31,98,66],dist:66,consider:[16,47,78],forbidden:69,scc:31,scalar:[31,92],ptx:8,follow:[33,103],ptr:[71,8],clangattrspellinglistindex:21,addescapingus:41,init:71,program:[23,38,84,80,6,51],datalayout:84,"case":[113,26],consum:104,faq:[25,98],urem:71,util:[73,23,92,54,31],candid:94,mechan:69,got:62,fab:71,strang:98,induct:[31,0],list:[69,71,38,40,105,42,55,46,2,48,49,12,13,14,15,16,18,19,20,111,30,92],managedstat:16,adjust:[46,15,71],stderr:31,zero:108,design:[72,38,103,83,30,84,47,90,16],pass:[91,31,61,41,33,49,76,73,12,16],further:51,enter_subblock:112,heartble:25,type_code_point:112,what:[103,74,33,25,98,76,83],xor:71,sub:[67,30,71],polli:30,abi:[105,84,16,108],section:[91,88,106,22,89],ast:[13,48,18,55],abl:33,delet:[31,16],abbrevi:112,version:[67,99,69,98,94],subtarget:[21,53],ctpop:71,"pub
lic":[69,16,94],full:[40,42,55,46,2,48,49,12,13,14,15,71,18,19],hash:104,berkelei:84,behaviour:22,analysisusag:76,prologu:71,standard:[23,69,97,71,104,112,4,16],modifi:[20,98,71,97],valu:[29,98,103,31,33,20,92,104,66,116,71,16],trunc:71,search:33,ahead:40,shufflevector:71,pick:16,action:108,via:82,primit:[112,116],transit:73,instrmap:70,select:[83,20,1,71,84],aggress:31,hexadecim:22,liber:69,regist:[31,98,53,8,84,76,50],two:[84,103],coverag:[67,95,25],unwindless:31,va_end:71,asm:[108,84,71],metadata_block:112,minor:24,more:[69,16],flat:24,tester:1,type_code_metadata:112,statepoint:[74,73,71],flag:[63,20,71,25,0],known:100,minnum:71,abandon:82,def:[29,16],indirectbr:71,registr:[76,53],emiss:[84,40,22],addrspacecast:71,templat:[71,106,16,116],dicompositetyp:71,readobj:58,goal:74,anoth:16,immutablemap:16,reject:98,unswitch:31,simpl:[31,71,16,8],isn:83,replacewithnewvalu:41,resourc:105,mccontext:84,reflect:8,rotat:31,through:69,constants_block:112,hierarchi:[16,102],paramet:[71,8],style
:[69,102,41,22,71,51],late:84,clangcommenthtmltag:21,gcov:95,systemz:[30,105],good:25,"return":[31,69],frem:71,complain:8,module_code_sectionnam:112,diglobalvari:71,globalvalu:16,achiev:16,scalarevolut:31,fulli:69,subsystem:38,donoth:71,interleav:71,clangattrparsedattrimpl:21,weight:[3,59],branchinst:3,hard:[15,46,40],idea:[14,2],realli:98,linkag:71,expect:[3,71],sadd:71,reduct:[31,113,0],safeti:[39,11],print:[76,31,101,89,41],subsubsect:106,occurr:20,qualifi:[98,94],advanc:[67,52,25,16],base:[31,98,102,103,30,84],ask:98,begincatch:108,thread:[71,16,31],bitconvert:78,clangattrparsedattrkind:21,postdomtre:31,clangcommenthtmlnamedcharacterrefer:21,lifetim:[71,47,104],assign:[31,15,46],major:[26,24],number:[31,20,112],smallptrset:16,module_block:112,differ:[34,98,103,41],script:[32,98],interact:[76,16],construct:[31,84,98],statement:3,cfg:[31,3],store:[31,84,71,50,98],option:[93,1,95,37,5,7,96,97,43,10,16,101,54,20,75,77,79,80,58,23,61,107,110,111,113,89,28,115],relationship:16,selecto
r:53,pars:[55,20,84,18],std:[69,16],i32:103,remov:31,cost:108,valuesymbolt:16,tailcallelim:31,comput:[74,30,103,8],packag:63,"null":[74,103],built:[74,84,3,98,92],lib:23,check:[91,31,0,5,66,16],self:98,lit:1,also:[93,7,69,96,97,113,1,77,37,80,111],powi:71,build:[61,114,54,25,98,9,35,87,94,76,64,27,51],extractvalu:71,extractel:71,brace:69,coff:[109,22],distribut:94,previou:98,machinebasicblock:84,most:31,plan:76,mach:104,cover:69,libdevic:8,exp:71,rewritestatepointsforgc:73,microsoft:[36,61],visibl:71,ctag:21,runonmodul:[76,33],gold:64,clangattrparsedattrlist:21,stackprotectorcheck:71,fine:16,find:[31,98,16],write_regist:71,writer:105,solut:[33,25],unus:[4,31],express:[67,31,42,5,48,55,13,116,71,18,19],nativ:[84,112],externalfnconst:31,diloc:71,common:[23,36,66,16,8],immutablepass:76,set:[23,102,53,41,20,76,31,16],clangattrpchwrit:21,mutabl:[15,46],see:[93,7,69,96,97,113,1,77,37,80,111],close:[42,31,19],arm:[22,105,9,35,78],dwarf:[89,40,104],module_code_tripl:112,vop1:24,vop3:24,won:
106,altern:[20,90],unrol:[31,71,0],miscellan:[76,20,105,51],both:23,vopc:24,interprocedur:31,inalloca:47,debug_typ:16,context:92,let:[29,116],machinefunct:[76,84],load:[72,76,84,71,50],point:[74,71,22,88,80],schedul:[84,53],header:[67,4,69,104],alloca:[85,71],classof:102,functionpass:76,backend:[53,103,84,21,6,116],aarch64:105,diimportedent:71,strategi:[74,71],understand:98,atomicrmw:71,dequ:16,fptosi:71,passmanag:76,"while":16,unifi:31,match:[84,5],amdgpu:[105,24],error:[4,92,69,98],anonym:[31,69],loop:[31,69,0,30,48,76,13,71,59,116],prolog:84,subsect:106,propag:31,reg2mem:31,runonfunct:76,demot:31,illinoi:98,targetlow:84,minim:4,clangdiagsindexnam:21,decod:31,higher:98,x86:[105,84,22],diobjcproperti:71,optim:[31,39,75,30,62,104,49,64,11,86,12,84,90,98],va_copi:71,user:[31,24,8,38,25,92,46,2,77,14,15,16],function_block:112,specialis:71,stack:[31,39,74,73,84,85,88,22,11,71],stateless:31,travers:16,task:[16,94],entri:[31,3,88],parenthes:69,person:71,propos:104,always_inlin:31,functio
nattr:31,module_code_asm:112,ipconstprop:31,ldr:78,mubuf:24,waymark:16,input:[25,92,71],type_code_label:112,vendor:24,format:[67,84,97,73,20,1,104,69,88,112,108,27,25],big:78,bia:59,ld1:78,bit:[71,20,16,112],pcre2:25,pcmarker:71,collect:[39,105,74,73,30,11,71,20],constmerg:31,clangdeclnod:21,often:103,creation:72,back:[21,98,24,8],lowerinvok:31,mirror:23,densemap:16,sizeof:[39,11],instcount:31,addpreserv:76,scale:59,glibc:98,substitut:10,larg:50,bcanalyz:37,machin:[84,22,50,53],run:[98,8,34,1,9,76,6],step:[114,53,24],prerequisit:53,copyvalu:41,setjmp:108,bugpoint:[31,83,113],constraint:71,indirectbrinst:3,dofin:76,runonloop:76,block:[31,69,16,92,112,71,59],gcroot:71,gcread:[74,71],chang:[82,42,30,104,26,16,19],announc:94,inclus:116,question:98,submit:[26,62],custom:[53,103,74,20,92,34],arithmet:[84,71,103],includ:[4,66,69,98,23],suit:[23,61,32,34,1,87,10],fmuladd:71,aliasanalysi:41,properli:69,lint:31,link:[23,107,8,64,36,90],cmpxchg:71,line:[82,0],info:[31,16,53,116],clangattrspel:
21,consist:[4,69],fcmp:71,fdiv:71,impl:31,constant:[31,71,104,49,22,12,16],debugtrap:71,parser:[55,20,84,48,13,18],doesn:98,repres:84,clangattrlist:21,cmake:[61,9],sequenti:16,llvm:[31,62,108,0,46,34,1,69,35,68,94,95,36,3,37,102,4,71,67,38,7,96,84,8,42,43,45,9,48,49,10,11,73,12,13,15,16,98,51,19,52,101,53,54,74,77,75,39,104,76,21,22,78,89,79,80,58,111,59,97,93,23,103,60,61,107,83,25,41,85,86,87,110,63,64,26,88,112,65,114,66,28,90,30],clean:66,mismatch:98,domfronti:31,eval:[31,41],parseenvironmentopt:20,extrahelp:20,difil:71,svn:23,typeid:108,lane:78,algorithm:[84,16],vice:16,intervalmap:16,llvm_shutdown:16,llvmcontext:16,code:[31,84,69,4,99,71,72,40,42,55,98,46,2,48,49,12,13,14,15,16,51,19,67,53,74,104,76,79,80,23,82,83,25,62,87,26,18,108,115,116],partial:[31,0],edg:31,module_code_globalvar:112,queri:31,privat:69,polyhedr:30,send:23,dienumer:71,mcinst:84,probe:22,vla:103,relev:105,magic:112,"try":[108,98],udiv:71,natur:31,memset:71,jump:[31,84],fold:[12,84,53,49],instnam:31,compat:[
25,26],index:103,twine:16,memcpyopt:[31,41],compar:[33,103],asmwrit:21,access:[33,26,71,84],experiment:[73,71,88],deduc:31,targetregisterinfo:[84,53],bodi:[31,29],objects:71,sext:[71,50],sink:31,implicit:91,convert:[79,71],convers:[8,71,53,0],vbr:112,implement:[72,52,39,53,41,74,16,84,85,76,90,11,55,78,33,4,71,59,18],domtre:31,dyn_cast:16,api:[28,84,16,30,98],dinamespac:71,from:[31,7,98,103,23,20,84,9,80,71,59],commun:[38,90,94],upgrad:98,next:5,websit:94,sort:16,insertvalu:71,hierchari:16,landingpad:71,nvptx:[84,105,8],alia:[31,103,41,0,20,84,71],annot:[28,71],endian:78,scatter:[71,0],control:[13,20,48,66],quickstart:[10,64,106],process:[32,33,84,94,38],optioncategori:20,high:[67,4,69,84,71],tag:[67,92,104,94,66,16],tab:69,afl:25,gcc:98,getregisteredopt:20,usub:71,subdirectori:51,instead:69,sin:71,fpext:71,overridden:33,implicitnullcheck:91,targetdata:31,redund:31,philosophi:[90,83,104],physic:84,alloc:[85,84,16],sdiv:71,counter:67,element:103,issu:[41,69,8],pseudolow:21,allow:20,m
ove:81,stacksav:71,getanalysisifavail:76,elis:47,narr:33,define_abbrev:112,initroot:74,infrastructur:[10,114,1,41],dag:[84,5,59],crash:[62,83],handl:[31,92,71,84,108],auto:[69,0],front:[62,104,103,98],successor:16,module_code_purgev:112,mem2reg:31,fuzz:25,mode:[84,40,78],mnemon:84,basicblockpass:76,acquirereleas:86,denseset:16,postdomfronti:31,selectiondag:[65,84,53],clangcommentcommandlist:21,"static":[31,77,69],function_ref:16,patch:[23,26,88,94],dilexicalblock:71,special:[71,8],out:[61,103],variabl:[31,40,61,0,71,84,46,104,69,22,85,112,66,15,5,51],matrix:84,frontier:31,ret:71,categori:20,hardwar:[23,36,105],barrier0:8,ref:31,math:71,statist:[76,16],iostream:[69,98],lcssa:31,attrbuild:57,manipul:71,powerpc:[30,84,105],deadarghax0r:31,releas:[32,30,86,94],indent:69,could:33,lexer:[13,44,17,48],keep:[4,69,98],length:22,outsid:86,lto:64,softwar:[23,36],qualiti:26,fmul:71,lshr:71,owner:26,unknown:0,licens:[64,26,98],system:[4,36,116,71,23],messag:26,regionpass:76,termin:71,"final":[72
,94],misunderstood:103,tidbit:[39,11],deconstruct:84,debuginfo:31,uitofp:71,arrayref:16,exactli:25,steen:41,prune:31,structur:[0,33,34,45,10,71,16],charact:112,bitvalu:92,clangattrparserstringswitch:21,mergetwofunct:33,linker:[90,71,107],have:103,tabl:[52,38,108,84,104,111],need:[106,103],printvar:66,disassembl:[84,28,21,93],mix:0,builtin:20,which:[103,41],mip:[30,105],singl:[31,71],preliminari:53,segment:[84,85],why:[40,103,33,25,98,46,15],instrprof_incr:71,placement:[31,51],returnaddress:71,gather:[71,0],yaml2obj:109,stackmap:88,determin:20,linkonc:22,text:20,dbg:[31,104],findregress:32,module_code_deplib:112,trivial:[12,49],locat:[79,23,40,87],tire:[14,2],getelementptr:[98,71],type_code_void:112,ditemplatevalueparamet:71,vop2:24,stackprotector:71,local:[23,1,46,87,66,15,71],targetmachin:84,enabl:71,organ:[10,4,27],possibl:[33,20,69],stuff:98,integr:[27,31,1],partit:31,contain:[25,16],shl:71,view:[31,16],type_code_arrai:112,frame:[108,39,84,11],packet:84,polymorph:16,statu:[73,1,5
,95,37,43,7,96,97,113,45,93,101,54,75,77,79,80,58,82,107,30,110,111,89,115],pattern:5,dll:71,callgraphsccpass:76,kei:92,clangattrdump:21,isol:16,diexpress:71,noalia:71,endl:69,addit:[30,1],doxygen:69,plugin:[74,64],leb128:67,etc:[65,16],instanc:116,grain:16,comment:[66,69,116],parallel_loop_access:71,guidelin:106,hyphen:20,yaml:92,window:[105,25,22,108],va_arg:71,packedvector:16,treat:[69,16],hsa_code_object_isa:24,assert:69,ptxa:8,present:33,multi:90,align:[112,78],libfuzz:25,contextu:28,defin:[69,53,46,2,14,15],sop2:24,layer:84,sop1:24,demo:[98,94],instrinfo:21,site:16,uglygep:103,archiv:[23,97],motiv:[91,88],mutat:[25,15,46],disubrang:71,cross:[23,9,61,87],sqrt:71,member:[16,103],clangsharp:30,nightli:32,clangdiaggroup:21,phi:71,longjmp:108,effect:103,sopc:24,expand:53,mcsection:84,sparsebitvector:16,builder:114,well:71,thought:[42,19],exampl:[79,23,101,74,16,25,1,99,76,64,36,90,78,70,106,71,6],command:[95,110,82,68,0],undefin:[71,8],setvector:16,sibl:84,unari:[14,2],distanc:103,
"boolean":20,obtain:26,memmov:71,parsecommandlineopt:20,tce:30,web:82,adt:16,makefil:[10,66,34,98,51],add:[114,71,103],cleanup:[108,47],adc:[31,41],kick:[14,2],llvmsharp:30,globalopt:31,indvar:31,clangcommentnod:21,placesafepoint:73,know:33,insert:[73,84,16],like:[69,16,98],type_code_vector:112,registeranalysisgroup:76,unord:86,soft:4,page:[98,94],unreach:[98,71],unabbrev_record:112,suppli:25,guarante:[39,11],stringset:16,librari:[23,69,71,20,98,63,66,4,16,25,51],avoid:[69,50],trap:71,codegenprepar:31,dce:31,usag:[61,0,25,47,64,88,83],host:[23,98],prefetch:71,clangattrtemplateinstanti:21,about:[25,98],toolchain:23,uniquevector:16,type_code_doubl:112,lppassmanag:76,constructor:69,zext:[71,50],disabl:71,ashr:71,metadata_attach:112,own:16,dibasictyp:71,automat:[113,71,83],merg:[31,110,33],machineinstrbuild:84,fuzzer:25,"var":71,dilocalvari:71,log10:71,"function":[67,31,7,40,8,42,71,20,0,69,65,104,76,3,33,4,84,16,98,19],machinefunctionpass:76,gain:33,uninstal:66,overflow:[71,103],inlin:
[31,69,84,71],bug:[62,102,32,73,45,111],liblto:90,count:[31,3,71,41,0],whether:20,record:[67,112],limit:41,problem:[23,40,25,98,46,76,36,78,100,15],evalu:[31,69,41],descript:[93,1,5,95,37,43,7,96,97,113,45,83,101,54,75,77,79,80,58,107,84,110,111,89,115,90],dure:0,constprop:31,sparseset:16,probabl:59,detail:[69,0,85,104,94,37,28],virtual:[4,84,69,98],other:[39,69,105,103,8,71,20,41,10,3,11,50,16,98],lookup:104,futur:[76,84],branch:[31,3,59,53,94],iplist:16,stat:16,indexedmap:16,clangcommentcommandinfo:21,addrequir:76,ctlz:71,sparsemultiset:16,stringmap:16,stai:26,sphinx:106,reliabl:84,customroot:74,rule:[102,103,98,94,66,71],bcc:30,vliw:84,invari:[31,71]}})
\ No newline at end of file
Added: www-releases/trunk/3.7.0/docs/tutorial/LangImpl1.html
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/tutorial/LangImpl1.html?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/tutorial/LangImpl1.html (added)
+++ www-releases/trunk/3.7.0/docs/tutorial/LangImpl1.html Tue Sep 1 15:55:31 2015
@@ -0,0 +1,358 @@
+
+<!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.7 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.7',
+ 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.7 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>: Extending the Language: Debug
+Information - Having built a decent little programming language with
+control flow, functions and mutable variables, we consider what it
+takes to add debug information to standalone executables. This debug
+information will allow you to set breakpoints in Kaleidoscope
+functions, print out argument variables, and call functions - all
+from within the debugger!</li>
+<li><a class="reference external" href="LangImpl8.html">Chapter #9</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 1000 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-2015, LLVM Project.
+ Last updated on 2015-08-31.
+ 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.7.0/docs/tutorial/LangImpl2.html
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/tutorial/LangImpl2.html?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/tutorial/LangImpl2.html (added)
+++ www-releases/trunk/3.7.0/docs/tutorial/LangImpl2.html Tue Sep 1 15:55:31 2015
@@ -0,0 +1,1117 @@
+
+<!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>2. Kaleidoscope: Implementing a Parser and AST — LLVM 3.7 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.7',
+ 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.7 documentation" href="../index.html" />
+ <link rel="up" title="LLVM Tutorial: Table of Contents" href="index.html" />
+ <link rel="next" title="3. Kaleidoscope: Code generation to LLVM IR" href="LangImpl3.html" />
+ <link rel="prev" title="1. Kaleidoscope: Tutorial Introduction and the Lexer" href="LangImpl1.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="LangImpl3.html" title="3. Kaleidoscope: Code generation to LLVM IR"
+ accesskey="N">next</a> |</li>
+ <li class="right" >
+ <a href="LangImpl1.html" title="1. Kaleidoscope: Tutorial Introduction and the Lexer"
+ 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-implementing-a-parser-and-ast">
+<h1>2. Kaleidoscope: Implementing a Parser and AST<a class="headerlink" href="#kaleidoscope-implementing-a-parser-and-ast" title="Permalink to this headline">¶</a></h1>
+<div class="contents local topic" id="contents">
+<ul class="simple">
+<li><a class="reference internal" href="#chapter-2-introduction" id="id2">Chapter 2 Introduction</a></li>
+<li><a class="reference internal" href="#the-abstract-syntax-tree-ast" id="id3">The Abstract Syntax Tree (AST)</a></li>
+<li><a class="reference internal" href="#parser-basics" id="id4">Parser Basics</a></li>
+<li><a class="reference internal" href="#basic-expression-parsing" id="id5">Basic Expression Parsing</a></li>
+<li><a class="reference internal" href="#binary-expression-parsing" id="id6">Binary Expression Parsing</a></li>
+<li><a class="reference internal" href="#parsing-the-rest" id="id7">Parsing the Rest</a></li>
+<li><a class="reference internal" href="#the-driver" id="id8">The Driver</a></li>
+<li><a class="reference internal" href="#conclusions" id="id9">Conclusions</a></li>
+<li><a class="reference internal" href="#full-code-listing" id="id10">Full Code Listing</a></li>
+</ul>
+</div>
+<div class="section" id="chapter-2-introduction">
+<h2><a class="toc-backref" href="#id2">2.1. Chapter 2 Introduction</a><a class="headerlink" href="#chapter-2-introduction" title="Permalink to this headline">¶</a></h2>
+<p>Welcome to Chapter 2 of the “<a class="reference external" href="index.html">Implementing a language with
+LLVM</a>” tutorial. This chapter shows you how to use the
+lexer, built in <a class="reference external" href="LangImpl1.html">Chapter 1</a>, to build a full
+<a class="reference external" href="http://en.wikipedia.org/wiki/Parsing">parser</a> for our Kaleidoscope
+language. Once we have a parser, we’ll define and build an <a class="reference external" href="http://en.wikipedia.org/wiki/Abstract_syntax_tree">Abstract
+Syntax Tree</a> (AST).</p>
+<p>The parser we will build uses a combination of <a class="reference external" href="http://en.wikipedia.org/wiki/Recursive_descent_parser">Recursive Descent
+Parsing</a> and
+<a class="reference external" href="http://en.wikipedia.org/wiki/Operator-precedence_parser">Operator-Precedence
+Parsing</a> to
+parse the Kaleidoscope language (the latter for binary expressions and
+the former for everything else). Before we get to parsing though, lets
+talk about the output of the parser: the Abstract Syntax Tree.</p>
+</div>
+<div class="section" id="the-abstract-syntax-tree-ast">
+<h2><a class="toc-backref" href="#id3">2.2. The Abstract Syntax Tree (AST)</a><a class="headerlink" href="#the-abstract-syntax-tree-ast" title="Permalink to this headline">¶</a></h2>
+<p>The AST for a program captures its behavior in such a way that it is
+easy for later stages of the compiler (e.g. code generation) to
+interpret. We basically want one object for each construct in the
+language, and the AST should closely model the language. In
+Kaleidoscope, we have expressions, a prototype, and a function object.
+We’ll start with expressions first:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// ExprAST - Base class for all expression nodes.</span>
+<span class="k">class</span> <span class="nc">ExprAST</span> <span class="p">{</span>
+<span class="nl">public:</span>
+ <span class="k">virtual</span> <span class="o">~</span><span class="n">ExprAST</span><span class="p">()</span> <span class="p">{}</span>
+<span class="p">};</span>
+
+<span class="c1">/// NumberExprAST - Expression class for numeric literals like "1.0".</span>
+<span class="k">class</span> <span class="nc">NumberExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+ <span class="kt">double</span> <span class="n">Val</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">NumberExprAST</span><span class="p">(</span><span class="kt">double</span> <span class="n">val</span><span class="p">)</span> <span class="o">:</span> <span class="n">Val</span><span class="p">(</span><span class="n">val</span><span class="p">)</span> <span class="p">{}</span>
+<span class="p">};</span>
+</pre></div>
+</div>
+<p>The code above shows the definition of the base ExprAST class and one
+subclass which we use for numeric literals. The important thing to note
+about this code is that the NumberExprAST class captures the numeric
+value of the literal as an instance variable. This allows later phases
+of the compiler to know what the stored numeric value is.</p>
+<p>Right now we only create the AST, so there are no useful accessor
+methods on them. It would be very easy to add a virtual method to pretty
+print the code, for example. Here are the other expression AST node
+definitions that we’ll use in the basic form of the Kaleidoscope
+language:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// VariableExprAST - Expression class for referencing a variable, like "a".</span>
+<span class="k">class</span> <span class="nc">VariableExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">Name</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">VariableExprAST</span><span class="p">(</span><span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="o">&</span><span class="n">name</span><span class="p">)</span> <span class="o">:</span> <span class="n">Name</span><span class="p">(</span><span class="n">name</span><span class="p">)</span> <span class="p">{}</span>
+<span class="p">};</span>
+
+<span class="c1">/// BinaryExprAST - Expression class for a binary operator.</span>
+<span class="k">class</span> <span class="nc">BinaryExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+ <span class="kt">char</span> <span class="n">Op</span><span class="p">;</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">LHS</span><span class="p">,</span> <span class="o">*</span><span class="n">RHS</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">BinaryExprAST</span><span class="p">(</span><span class="kt">char</span> <span class="n">op</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">lhs</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">rhs</span><span class="p">)</span>
+ <span class="o">:</span> <span class="n">Op</span><span class="p">(</span><span class="n">op</span><span class="p">),</span> <span class="n">LHS</span><span class="p">(</span><span class="n">lhs</span><span class="p">),</span> <span class="n">RHS</span><span class="p">(</span><span class="n">rhs</span><span class="p">)</span> <span class="p">{}</span>
+<span class="p">};</span>
+
+<span class="c1">/// CallExprAST - Expression class for function calls.</span>
+<span class="k">class</span> <span class="nc">CallExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">Callee</span><span class="p">;</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">ExprAST</span><span class="o">*></span> <span class="n">Args</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">CallExprAST</span><span class="p">(</span><span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="o">&</span><span class="n">callee</span><span class="p">,</span> <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">ExprAST</span><span class="o">*></span> <span class="o">&</span><span class="n">args</span><span class="p">)</span>
+ <span class="o">:</span> <span class="n">Callee</span><span class="p">(</span><span class="n">callee</span><span class="p">),</span> <span class="n">Args</span><span class="p">(</span><span class="n">args</span><span class="p">)</span> <span class="p">{}</span>
+<span class="p">};</span>
+</pre></div>
+</div>
+<p>This is all (intentionally) rather straight-forward: variables capture
+the variable name, binary operators capture their opcode (e.g. ‘+’), and
+calls capture a function name as well as a list of any argument
+expressions. One thing that is nice about our AST is that it captures
+the language features without talking about the syntax of the language.
+Note that there is no discussion about precedence of binary operators,
+lexical structure, etc.</p>
+<p>For our basic language, these are all of the expression nodes we’ll
+define. Because it doesn’t have conditional control flow, it isn’t
+Turing-complete; we’ll fix that in a later installment. The two things
+we need next are a way to talk about the interface to a function, and a
+way to talk about functions themselves:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// PrototypeAST - This class represents the "prototype" for a function,</span>
+<span class="c1">/// which captures its name, and its argument names (thus implicitly the number</span>
+<span class="c1">/// of arguments the function takes).</span>
+<span class="k">class</span> <span class="nc">PrototypeAST</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">Name</span><span class="p">;</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span> <span class="n">Args</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">PrototypeAST</span><span class="p">(</span><span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="o">&</span><span class="n">name</span><span class="p">,</span> <span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span> <span class="o">&</span><span class="n">args</span><span class="p">)</span>
+ <span class="o">:</span> <span class="n">Name</span><span class="p">(</span><span class="n">name</span><span class="p">),</span> <span class="n">Args</span><span class="p">(</span><span class="n">args</span><span class="p">)</span> <span class="p">{}</span>
+<span class="p">};</span>
+
+<span class="c1">/// FunctionAST - This class represents a function definition itself.</span>
+<span class="k">class</span> <span class="nc">FunctionAST</span> <span class="p">{</span>
+ <span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">Proto</span><span class="p">;</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">Body</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">FunctionAST</span><span class="p">(</span><span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">proto</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">body</span><span class="p">)</span>
+ <span class="o">:</span> <span class="n">Proto</span><span class="p">(</span><span class="n">proto</span><span class="p">),</span> <span class="n">Body</span><span class="p">(</span><span class="n">body</span><span class="p">)</span> <span class="p">{}</span>
+<span class="p">};</span>
+</pre></div>
+</div>
+<p>In Kaleidoscope, functions are typed with just a count of their
+arguments. Since all values are double precision floating point, the
+type of each argument doesn’t need to be stored anywhere. In a more
+aggressive and realistic language, the “ExprAST” class would probably
+have a type field.</p>
+<p>With this scaffolding, we can now talk about parsing expressions and
+function bodies in Kaleidoscope.</p>
+</div>
+<div class="section" id="parser-basics">
+<h2><a class="toc-backref" href="#id4">2.3. Parser Basics</a><a class="headerlink" href="#parser-basics" title="Permalink to this headline">¶</a></h2>
+<p>Now that we have an AST to build, we need to define the parser code to
+build it. The idea here is that we want to parse something like “x+y”
+(which is returned as three tokens by the lexer) into an AST that could
+be generated with calls like this:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="n">ExprAST</span> <span class="o">*</span><span class="n">X</span> <span class="o">=</span> <span class="k">new</span> <span class="n">VariableExprAST</span><span class="p">(</span><span class="s">"x"</span><span class="p">);</span>
+<span class="n">ExprAST</span> <span class="o">*</span><span class="n">Y</span> <span class="o">=</span> <span class="k">new</span> <span class="n">VariableExprAST</span><span class="p">(</span><span class="s">"y"</span><span class="p">);</span>
+<span class="n">ExprAST</span> <span class="o">*</span><span class="n">Result</span> <span class="o">=</span> <span class="k">new</span> <span class="n">BinaryExprAST</span><span class="p">(</span><span class="sc">'+'</span><span class="p">,</span> <span class="n">X</span><span class="p">,</span> <span class="n">Y</span><span class="p">);</span>
+</pre></div>
+</div>
+<p>In order to do this, we’ll start by defining some basic helper routines:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// CurTok/getNextToken - Provide a simple token buffer. CurTok is the current</span>
+<span class="c1">/// token the parser is looking at. getNextToken reads another token from the</span>
+<span class="c1">/// lexer and updates CurTok with its results.</span>
+<span class="k">static</span> <span class="kt">int</span> <span class="n">CurTok</span><span class="p">;</span>
+<span class="k">static</span> <span class="kt">int</span> <span class="nf">getNextToken</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">return</span> <span class="n">CurTok</span> <span class="o">=</span> <span class="n">gettok</span><span class="p">();</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>This implements a simple token buffer around the lexer. This allows us
+to look one token ahead at what the lexer is returning. Every function
+in our parser will assume that CurTok is the current token that needs to
+be parsed.</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// Error* - These are little helper functions for error handling.</span>
+<span class="n">ExprAST</span> <span class="o">*</span><span class="nf">Error</span><span class="p">(</span><span class="k">const</span> <span class="kt">char</span> <span class="o">*</span><span class="n">Str</span><span class="p">)</span> <span class="p">{</span> <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"Error: %s</span><span class="se">\n</span><span class="s">"</span><span class="p">,</span> <span class="n">Str</span><span class="p">);</span><span class="k">return</span> <span class="mi">0</span><span class="p">;}</span>
+<span class="n">PrototypeAST</span> <span class="o">*</span><span class="nf">ErrorP</span><span class="p">(</span><span class="k">const</span> <span class="kt">char</span> <span class="o">*</span><span class="n">Str</span><span class="p">)</span> <span class="p">{</span> <span class="n">Error</span><span class="p">(</span><span class="n">Str</span><span class="p">);</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> <span class="p">}</span>
+<span class="n">FunctionAST</span> <span class="o">*</span><span class="nf">ErrorF</span><span class="p">(</span><span class="k">const</span> <span class="kt">char</span> <span class="o">*</span><span class="n">Str</span><span class="p">)</span> <span class="p">{</span> <span class="n">Error</span><span class="p">(</span><span class="n">Str</span><span class="p">);</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> <span class="p">}</span>
+</pre></div>
+</div>
+<p>The <tt class="docutils literal"><span class="pre">Error</span></tt> routines are simple helper routines that our parser will
+use to handle errors. The error recovery in our parser will not be the
+best and is not particular user-friendly, but it will be enough for our
+tutorial. These routines make it easier to handle errors in routines
+that have various return types: they always return null.</p>
+<p>With these basic helper functions, we can implement the first piece of
+our grammar: numeric literals.</p>
+</div>
+<div class="section" id="basic-expression-parsing">
+<h2><a class="toc-backref" href="#id5">2.4. Basic Expression Parsing</a><a class="headerlink" href="#basic-expression-parsing" title="Permalink to this headline">¶</a></h2>
+<p>We start with numeric literals, because they are the simplest to
+process. For each production in our grammar, we’ll define a function
+which parses that production. For numeric literals, we have:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// numberexpr ::= number</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseNumberExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">Result</span> <span class="o">=</span> <span class="k">new</span> <span class="n">NumberExprAST</span><span class="p">(</span><span class="n">NumVal</span><span class="p">);</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// consume the number</span>
+ <span class="k">return</span> <span class="n">Result</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>This routine is very simple: it expects to be called when the current
+token is a <tt class="docutils literal"><span class="pre">tok_number</span></tt> token. It takes the current number value,
+creates a <tt class="docutils literal"><span class="pre">NumberExprAST</span></tt> node, advances the lexer to the next token,
+and finally returns.</p>
+<p>There are some interesting aspects to this. The most important one is
+that this routine eats all of the tokens that correspond to the
+production and returns the lexer buffer with the next token (which is
+not part of the grammar production) ready to go. This is a fairly
+standard way to go for recursive descent parsers. For a better example,
+the parenthesis operator is defined like this:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// parenexpr ::= '(' expression ')'</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseParenExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat (.</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">V</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">V</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">')'</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">Error</span><span class="p">(</span><span class="s">"expected ')'"</span><span class="p">);</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat ).</span>
+ <span class="k">return</span> <span class="n">V</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>This function illustrates a number of interesting things about the
+parser:</p>
+<p>1) It shows how we use the Error routines. When called, this function
+expects that the current token is a ‘(‘ token, but after parsing the
+subexpression, it is possible that there is no ‘)’ waiting. For example,
+if the user types in “(4 x” instead of “(4)”, the parser should emit an
+error. Because errors can occur, the parser needs a way to indicate that
+they happened: in our parser, we return null on an error.</p>
+<p>2) Another interesting aspect of this function is that it uses recursion
+by calling <tt class="docutils literal"><span class="pre">ParseExpression</span></tt> (we will soon see that
+<tt class="docutils literal"><span class="pre">ParseExpression</span></tt> can call <tt class="docutils literal"><span class="pre">ParseParenExpr</span></tt>). This is powerful
+because it allows us to handle recursive grammars, and keeps each
+production very simple. Note that parentheses do not cause construction
+of AST nodes themselves. While we could do it this way, the most
+important role of parentheses are to guide the parser and provide
+grouping. Once the parser constructs the AST, parentheses are not
+needed.</p>
+<p>The next simple production is for handling variable references and
+function calls:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// identifierexpr</span>
+<span class="c1">/// ::= identifier</span>
+<span class="c1">/// ::= identifier '(' expression* ')'</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseIdentifierExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">IdName</span> <span class="o">=</span> <span class="n">IdentifierStr</span><span class="p">;</span>
+
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat identifier.</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">'('</span><span class="p">)</span> <span class="c1">// Simple variable ref.</span>
+ <span class="k">return</span> <span class="k">new</span> <span class="n">VariableExprAST</span><span class="p">(</span><span class="n">IdName</span><span class="p">);</span>
+
+ <span class="c1">// Call.</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat (</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">ExprAST</span><span class="o">*></span> <span class="n">Args</span><span class="p">;</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">')'</span><span class="p">)</span> <span class="p">{</span>
+ <span class="k">while</span> <span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">Arg</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">Arg</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="n">Args</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">Arg</span><span class="p">);</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">==</span> <span class="sc">')'</span><span class="p">)</span> <span class="k">break</span><span class="p">;</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">','</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">Error</span><span class="p">(</span><span class="s">"Expected ')' or ',' in argument list"</span><span class="p">);</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+ <span class="p">}</span>
+ <span class="p">}</span>
+
+ <span class="c1">// Eat the ')'.</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+
+ <span class="k">return</span> <span class="k">new</span> <span class="n">CallExprAST</span><span class="p">(</span><span class="n">IdName</span><span class="p">,</span> <span class="n">Args</span><span class="p">);</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>This routine follows the same style as the other routines. (It expects
+to be called if the current token is a <tt class="docutils literal"><span class="pre">tok_identifier</span></tt> token). It
+also has recursion and error handling. One interesting aspect of this is
+that it uses <em>look-ahead</em> to determine if the current identifier is a
+stand alone variable reference or if it is a function call expression.
+It handles this by checking to see if the token after the identifier is
+a ‘(‘ token, constructing either a <tt class="docutils literal"><span class="pre">VariableExprAST</span></tt> or
+<tt class="docutils literal"><span class="pre">CallExprAST</span></tt> node as appropriate.</p>
+<p>Now that we have all of our simple expression-parsing logic in place, we
+can define a helper function to wrap it together into one entry point.
+We call this class of expressions “primary” expressions, for reasons
+that will become more clear <a class="reference external" href="LangImpl6.html#unary">later in the
+tutorial</a>. In order to parse an arbitrary
+primary expression, we need to determine what sort of expression it is:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// primary</span>
+<span class="c1">/// ::= identifierexpr</span>
+<span class="c1">/// ::= numberexpr</span>
+<span class="c1">/// ::= parenexpr</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParsePrimary</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">switch</span> <span class="p">(</span><span class="n">CurTok</span><span class="p">)</span> <span class="p">{</span>
+ <span class="nl">default:</span> <span class="k">return</span> <span class="n">Error</span><span class="p">(</span><span class="s">"unknown token when expecting an expression"</span><span class="p">);</span>
+ <span class="k">case</span> <span class="n">tok_identifier</span>: <span class="k">return</span> <span class="n">ParseIdentifierExpr</span><span class="p">();</span>
+ <span class="k">case</span> <span class="n">tok_number</span>: <span class="k">return</span> <span class="n">ParseNumberExpr</span><span class="p">();</span>
+ <span class="k">case</span> <span class="sc">'('</span>: <span class="k">return</span> <span class="n">ParseParenExpr</span><span class="p">();</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>Now that you see the definition of this function, it is more obvious why
+we can assume the state of CurTok in the various functions. This uses
+look-ahead to determine which sort of expression is being inspected, and
+then parses it with a function call.</p>
+<p>Now that basic expressions are handled, we need to handle binary
+expressions. They are a bit more complex.</p>
+</div>
+<div class="section" id="binary-expression-parsing">
+<h2><a class="toc-backref" href="#id6">2.5. Binary Expression Parsing</a><a class="headerlink" href="#binary-expression-parsing" title="Permalink to this headline">¶</a></h2>
+<p>Binary expressions are significantly harder to parse because they are
+often ambiguous. For example, when given the string “x+y*z”, the parser
+can choose to parse it as either “(x+y)*z” or “x+(y*z)”. With common
+definitions from mathematics, we expect the later parse, because “*”
+(multiplication) has higher <em>precedence</em> than “+” (addition).</p>
+<p>There are many ways to handle this, but an elegant and efficient way is
+to use <a class="reference external" href="http://en.wikipedia.org/wiki/Operator-precedence_parser">Operator-Precedence
+Parsing</a>.
+This parsing technique uses the precedence of binary operators to guide
+recursion. To start with, we need a table of precedences:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// BinopPrecedence - This holds the precedence for each binary operator that is</span>
+<span class="c1">/// defined.</span>
+<span class="k">static</span> <span class="n">std</span><span class="o">::</span><span class="n">map</span><span class="o"><</span><span class="kt">char</span><span class="p">,</span> <span class="kt">int</span><span class="o">></span> <span class="n">BinopPrecedence</span><span class="p">;</span>
+
+<span class="c1">/// GetTokPrecedence - Get the precedence of the pending binary operator token.</span>
+<span class="k">static</span> <span class="kt">int</span> <span class="nf">GetTokPrecedence</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">isascii</span><span class="p">(</span><span class="n">CurTok</span><span class="p">))</span>
+ <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span>
+
+ <span class="c1">// Make sure it's a declared binop.</span>
+ <span class="kt">int</span> <span class="n">TokPrec</span> <span class="o">=</span> <span class="n">BinopPrecedence</span><span class="p">[</span><span class="n">CurTok</span><span class="p">];</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">TokPrec</span> <span class="o"><=</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span>
+ <span class="k">return</span> <span class="n">TokPrec</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="kt">int</span> <span class="nf">main</span><span class="p">()</span> <span class="p">{</span>
+ <span class="c1">// Install standard binary operators.</span>
+ <span class="c1">// 1 is lowest precedence.</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'<'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">10</span><span class="p">;</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'+'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">20</span><span class="p">;</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'-'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">20</span><span class="p">;</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'*'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">40</span><span class="p">;</span> <span class="c1">// highest.</span>
+ <span class="p">...</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>For the basic form of Kaleidoscope, we will only support 4 binary
+operators (this can obviously be extended by you, our brave and intrepid
+reader). The <tt class="docutils literal"><span class="pre">GetTokPrecedence</span></tt> function returns the precedence for
+the current token, or -1 if the token is not a binary operator. Having a
+map makes it easy to add new operators and makes it clear that the
+algorithm doesn’t depend on the specific operators involved, but it
+would be easy enough to eliminate the map and do the comparisons in the
+<tt class="docutils literal"><span class="pre">GetTokPrecedence</span></tt> function. (Or just use a fixed-size array).</p>
+<p>With the helper above defined, we can now start parsing binary
+expressions. The basic idea of operator precedence parsing is to break
+down an expression with potentially ambiguous binary operators into
+pieces. Consider ,for example, the expression “a+b+(c+d)*e*f+g”.
+Operator precedence parsing considers this as a stream of primary
+expressions separated by binary operators. As such, it will first parse
+the leading primary expression “a”, then it will see the pairs [+, b]
+[+, (c+d)] [*, e] [*, f] and [+, g]. Note that because parentheses are
+primary expressions, the binary expression parser doesn’t need to worry
+about nested subexpressions like (c+d) at all.</p>
+<p>To start, an expression is a primary expression potentially followed by
+a sequence of [binop,primaryexpr] pairs:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// expression</span>
+<span class="c1">/// ::= primary binoprhs</span>
+<span class="c1">///</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseExpression</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">LHS</span> <span class="o">=</span> <span class="n">ParsePrimary</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">LHS</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="k">return</span> <span class="n">ParseBinOpRHS</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">LHS</span><span class="p">);</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p><tt class="docutils literal"><span class="pre">ParseBinOpRHS</span></tt> is the function that parses the sequence of pairs for
+us. It takes a precedence and a pointer to an expression for the part
+that has been parsed so far. Note that “x” is a perfectly valid
+expression: As such, “binoprhs” is allowed to be empty, in which case it
+returns the expression that is passed into it. In our example above, the
+code passes the expression for “a” into <tt class="docutils literal"><span class="pre">ParseBinOpRHS</span></tt> and the
+current token is “+”.</p>
+<p>The precedence value passed into <tt class="docutils literal"><span class="pre">ParseBinOpRHS</span></tt> indicates the
+<em>minimal operator precedence</em> that the function is allowed to eat. For
+example, if the current pair stream is [+, x] and <tt class="docutils literal"><span class="pre">ParseBinOpRHS</span></tt> is
+passed in a precedence of 40, it will not consume any tokens (because
+the precedence of ‘+’ is only 20). With this in mind, <tt class="docutils literal"><span class="pre">ParseBinOpRHS</span></tt>
+starts with:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// binoprhs</span>
+<span class="c1">/// ::= ('+' primary)*</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseBinOpRHS</span><span class="p">(</span><span class="kt">int</span> <span class="n">ExprPrec</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">LHS</span><span class="p">)</span> <span class="p">{</span>
+ <span class="c1">// If this is a binop, find its precedence.</span>
+ <span class="k">while</span> <span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
+ <span class="kt">int</span> <span class="n">TokPrec</span> <span class="o">=</span> <span class="n">GetTokPrecedence</span><span class="p">();</span>
+
+ <span class="c1">// If this is a binop that binds at least as tightly as the current binop,</span>
+ <span class="c1">// consume it, otherwise we are done.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">TokPrec</span> <span class="o"><</span> <span class="n">ExprPrec</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">LHS</span><span class="p">;</span>
+</pre></div>
+</div>
+<p>This code gets the precedence of the current token and checks to see if
+if is too low. Because we defined invalid tokens to have a precedence of
+-1, this check implicitly knows that the pair-stream ends when the token
+stream runs out of binary operators. If this check succeeds, we know
+that the token is a binary operator and that it will be included in this
+expression:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">// Okay, we know this is a binop.</span>
+<span class="kt">int</span> <span class="n">BinOp</span> <span class="o">=</span> <span class="n">CurTok</span><span class="p">;</span>
+<span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat binop</span>
+
+<span class="c1">// Parse the primary expression after the binary operator.</span>
+<span class="n">ExprAST</span> <span class="o">*</span><span class="n">RHS</span> <span class="o">=</span> <span class="n">ParsePrimary</span><span class="p">();</span>
+<span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">RHS</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+</pre></div>
+</div>
+<p>As such, this code eats (and remembers) the binary operator and then
+parses the primary expression that follows. This builds up the whole
+pair, the first of which is [+, b] for the running example.</p>
+<p>Now that we parsed the left-hand side of an expression and one pair of
+the RHS sequence, we have to decide which way the expression associates.
+In particular, we could have “(a+b) binop unparsed” or “a + (b binop
+unparsed)”. To determine this, we look ahead at “binop” to determine its
+precedence and compare it to BinOp’s precedence (which is ‘+’ in this
+case):</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">// If BinOp binds less tightly with RHS than the operator after RHS, let</span>
+<span class="c1">// the pending operator take RHS as its LHS.</span>
+<span class="kt">int</span> <span class="n">NextPrec</span> <span class="o">=</span> <span class="n">GetTokPrecedence</span><span class="p">();</span>
+<span class="k">if</span> <span class="p">(</span><span class="n">TokPrec</span> <span class="o"><</span> <span class="n">NextPrec</span><span class="p">)</span> <span class="p">{</span>
+</pre></div>
+</div>
+<p>If the precedence of the binop to the right of “RHS” is lower or equal
+to the precedence of our current operator, then we know that the
+parentheses associate as “(a+b) binop ...”. In our example, the current
+operator is “+” and the next operator is “+”, we know that they have the
+same precedence. In this case we’ll create the AST node for “a+b”, and
+then continue parsing:</p>
+<div class="highlight-c++"><div class="highlight"><pre> <span class="p">...</span> <span class="k">if</span> <span class="n">body</span> <span class="n">omitted</span> <span class="p">...</span>
+ <span class="p">}</span>
+
+ <span class="c1">// Merge LHS/RHS.</span>
+ <span class="n">LHS</span> <span class="o">=</span> <span class="k">new</span> <span class="n">BinaryExprAST</span><span class="p">(</span><span class="n">BinOp</span><span class="p">,</span> <span class="n">LHS</span><span class="p">,</span> <span class="n">RHS</span><span class="p">);</span>
+ <span class="p">}</span> <span class="c1">// loop around to the top of the while loop.</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>In our example above, this will turn “a+b+” into “(a+b)” and execute the
+next iteration of the loop, with “+” as the current token. The code
+above will eat, remember, and parse “(c+d)” as the primary expression,
+which makes the current pair equal to [+, (c+d)]. It will then evaluate
+the ‘if’ conditional above with “*” as the binop to the right of the
+primary. In this case, the precedence of “*” is higher than the
+precedence of “+” so the if condition will be entered.</p>
+<p>The critical question left here is “how can the if condition parse the
+right hand side in full”? In particular, to build the AST correctly for
+our example, it needs to get all of “(c+d)*e*f” as the RHS expression
+variable. The code to do this is surprisingly simple (code from the
+above two blocks duplicated for context):</p>
+<div class="highlight-c++"><div class="highlight"><pre> <span class="c1">// If BinOp binds less tightly with RHS than the operator after RHS, let</span>
+ <span class="c1">// the pending operator take RHS as its LHS.</span>
+ <span class="kt">int</span> <span class="n">NextPrec</span> <span class="o">=</span> <span class="n">GetTokPrecedence</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">TokPrec</span> <span class="o"><</span> <span class="n">NextPrec</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">RHS</span> <span class="o">=</span> <span class="n">ParseBinOpRHS</span><span class="p">(</span><span class="n">TokPrec</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span> <span class="n">RHS</span><span class="p">);</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">RHS</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="p">}</span>
+ <span class="c1">// Merge LHS/RHS.</span>
+ <span class="n">LHS</span> <span class="o">=</span> <span class="k">new</span> <span class="n">BinaryExprAST</span><span class="p">(</span><span class="n">BinOp</span><span class="p">,</span> <span class="n">LHS</span><span class="p">,</span> <span class="n">RHS</span><span class="p">);</span>
+ <span class="p">}</span> <span class="c1">// loop around to the top of the while loop.</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>At this point, we know that the binary operator to the RHS of our
+primary has higher precedence than the binop we are currently parsing.
+As such, we know that any sequence of pairs whose operators are all
+higher precedence than “+” should be parsed together and returned as
+“RHS”. To do this, we recursively invoke the <tt class="docutils literal"><span class="pre">ParseBinOpRHS</span></tt> function
+specifying “TokPrec+1” as the minimum precedence required for it to
+continue. In our example above, this will cause it to return the AST
+node for “(c+d)*e*f” as RHS, which is then set as the RHS of the ‘+’
+expression.</p>
+<p>Finally, on the next iteration of the while loop, the “+g” piece is
+parsed and added to the AST. With this little bit of code (14
+non-trivial lines), we correctly handle fully general binary expression
+parsing in a very elegant way. This was a whirlwind tour of this code,
+and it is somewhat subtle. I recommend running through it with a few
+tough examples to see how it works.</p>
+<p>This wraps up handling of expressions. At this point, we can point the
+parser at an arbitrary token stream and build an expression from it,
+stopping at the first token that is not part of the expression. Next up
+we need to handle function definitions, etc.</p>
+</div>
+<div class="section" id="parsing-the-rest">
+<h2><a class="toc-backref" href="#id7">2.6. Parsing the Rest</a><a class="headerlink" href="#parsing-the-rest" title="Permalink to this headline">¶</a></h2>
+<p>The next thing missing is handling of function prototypes. In
+Kaleidoscope, these are used both for ‘extern’ function declarations as
+well as function body definitions. The code to do this is
+straight-forward and not very interesting (once you’ve survived
+expressions):</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// prototype</span>
+<span class="c1">/// ::= id '(' id* ')'</span>
+<span class="k">static</span> <span class="n">PrototypeAST</span> <span class="o">*</span><span class="nf">ParsePrototype</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="n">tok_identifier</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">ErrorP</span><span class="p">(</span><span class="s">"Expected function name in prototype"</span><span class="p">);</span>
+
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">FnName</span> <span class="o">=</span> <span class="n">IdentifierStr</span><span class="p">;</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">'('</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">ErrorP</span><span class="p">(</span><span class="s">"Expected '(' in prototype"</span><span class="p">);</span>
+
+ <span class="c1">// Read the list of argument names.</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span> <span class="n">ArgNames</span><span class="p">;</span>
+ <span class="k">while</span> <span class="p">(</span><span class="n">getNextToken</span><span class="p">()</span> <span class="o">==</span> <span class="n">tok_identifier</span><span class="p">)</span>
+ <span class="n">ArgNames</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">IdentifierStr</span><span class="p">);</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">')'</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">ErrorP</span><span class="p">(</span><span class="s">"Expected ')' in prototype"</span><span class="p">);</span>
+
+ <span class="c1">// success.</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat ')'.</span>
+
+ <span class="k">return</span> <span class="k">new</span> <span class="n">PrototypeAST</span><span class="p">(</span><span class="n">FnName</span><span class="p">,</span> <span class="n">ArgNames</span><span class="p">);</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>Given this, a function definition is very simple, just a prototype plus
+an expression to implement the body:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// definition ::= 'def' prototype expression</span>
+<span class="k">static</span> <span class="n">FunctionAST</span> <span class="o">*</span><span class="nf">ParseDefinition</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat def.</span>
+ <span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">Proto</span> <span class="o">=</span> <span class="n">ParsePrototype</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">Proto</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">ExprAST</span> <span class="o">*</span><span class="n">E</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">())</span>
+ <span class="k">return</span> <span class="k">new</span> <span class="n">FunctionAST</span><span class="p">(</span><span class="n">Proto</span><span class="p">,</span> <span class="n">E</span><span class="p">);</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>In addition, we support ‘extern’ to declare functions like ‘sin’ and
+‘cos’ as well as to support forward declaration of user functions. These
+‘extern’s are just prototypes with no body:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// external ::= 'extern' prototype</span>
+<span class="k">static</span> <span class="n">PrototypeAST</span> <span class="o">*</span><span class="nf">ParseExtern</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat extern.</span>
+ <span class="k">return</span> <span class="n">ParsePrototype</span><span class="p">();</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>Finally, we’ll also let the user type in arbitrary top-level expressions
+and evaluate them on the fly. We will handle this by defining anonymous
+nullary (zero argument) functions for them:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// toplevelexpr ::= expression</span>
+<span class="k">static</span> <span class="n">FunctionAST</span> <span class="o">*</span><span class="nf">ParseTopLevelExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">ExprAST</span> <span class="o">*</span><span class="n">E</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">())</span> <span class="p">{</span>
+ <span class="c1">// Make an anonymous proto.</span>
+ <span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">Proto</span> <span class="o">=</span> <span class="k">new</span> <span class="n">PrototypeAST</span><span class="p">(</span><span class="s">""</span><span class="p">,</span> <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span><span class="p">());</span>
+ <span class="k">return</span> <span class="k">new</span> <span class="n">FunctionAST</span><span class="p">(</span><span class="n">Proto</span><span class="p">,</span> <span class="n">E</span><span class="p">);</span>
+ <span class="p">}</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>Now that we have all the pieces, let’s build a little driver that will
+let us actually <em>execute</em> this code we’ve built!</p>
+</div>
+<div class="section" id="the-driver">
+<h2><a class="toc-backref" href="#id8">2.7. The Driver</a><a class="headerlink" href="#the-driver" title="Permalink to this headline">¶</a></h2>
+<p>The driver for this simply invokes all of the parsing pieces with a
+top-level dispatch loop. There isn’t much interesting here, so I’ll just
+include the top-level loop. See <a class="reference external" href="#code">below</a> for full code in the
+“Top-Level Parsing” section.</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// top ::= definition | external | expression | ';'</span>
+<span class="k">static</span> <span class="kt">void</span> <span class="nf">MainLoop</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">while</span> <span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"ready> "</span><span class="p">);</span>
+ <span class="k">switch</span> <span class="p">(</span><span class="n">CurTok</span><span class="p">)</span> <span class="p">{</span>
+ <span class="k">case</span> <span class="n">tok_eof</span>: <span class="k">return</span><span class="p">;</span>
+ <span class="k">case</span> <span class="sc">';'</span>: <span class="n">getNextToken</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span> <span class="c1">// ignore top-level semicolons.</span>
+ <span class="k">case</span> <span class="n">tok_def</span>: <span class="n">HandleDefinition</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span>
+ <span class="k">case</span> <span class="n">tok_extern</span>: <span class="n">HandleExtern</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span>
+ <span class="nl">default:</span> <span class="n">HandleTopLevelExpression</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span>
+ <span class="p">}</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>The most interesting part of this is that we ignore top-level
+semicolons. Why is this, you ask? The basic reason is that if you type
+“4 + 5” at the command line, the parser doesn’t know whether that is the
+end of what you will type or not. For example, on the next line you
+could type “def foo...” in which case 4+5 is the end of a top-level
+expression. Alternatively you could type “* 6”, which would continue
+the expression. Having top-level semicolons allows you to type “4+5;”,
+and the parser will know you are done.</p>
+</div>
+<div class="section" id="conclusions">
+<h2><a class="toc-backref" href="#id9">2.8. Conclusions</a><a class="headerlink" href="#conclusions" title="Permalink to this headline">¶</a></h2>
+<p>With just under 400 lines of commented code (240 lines of non-comment,
+non-blank code), we fully defined our minimal language, including a
+lexer, parser, and AST builder. With this done, the executable will
+validate Kaleidoscope code and tell us if it is grammatically invalid.
+For example, here is a sample interaction:</p>
+<div class="highlight-bash"><div class="highlight"><pre>$ ./a.out
+ready> def foo(x y) x+foo(y, 4.0);
+Parsed a function definition.
+ready> def foo(x y) x+y y;
+Parsed a function definition.
+Parsed a top-level expr
+ready> def foo(x y) x+y );
+Parsed a function definition.
+Error: unknown token when expecting an expression
+ready> extern sin(a);
+ready> Parsed an extern
+ready> ^D
+$
+</pre></div>
+</div>
+<p>There is a lot of room for extension here. You can define new AST nodes,
+extend the language in many ways, etc. In the <a class="reference external" href="LangImpl3.html">next
+installment</a>, we will describe how to generate LLVM
+Intermediate Representation (IR) from the AST.</p>
+</div>
+<div class="section" id="full-code-listing">
+<h2><a class="toc-backref" href="#id10">2.9. Full Code Listing</a><a class="headerlink" href="#full-code-listing" title="Permalink to this headline">¶</a></h2>
+<p>Here is the complete code listing for this and the previous chapter.
+Note that it is fully self-contained: you don’t need LLVM or any
+external libraries at all for this. (Besides the C and C++ standard
+libraries, of course.) To build this, just compile with:</p>
+<div class="highlight-bash"><div class="highlight"><pre><span class="c"># Compile</span>
+clang++ -g -O3 toy.cpp
+<span class="c"># Run</span>
+./a.out
+</pre></div>
+</div>
+<p>Here is the code:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="cp">#include <cctype></span>
+<span class="cp">#include <cstdio></span>
+<span class="cp">#include <cstdlib></span>
+<span class="cp">#include <map></span>
+<span class="cp">#include <string></span>
+<span class="cp">#include <vector></span>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// Lexer</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+
+<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="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>
+
+<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>
+
+ <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>
+
+ <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>
+
+ <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>
+
+ <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>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// Abstract Syntax Tree (aka Parse Tree)</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="k">namespace</span> <span class="p">{</span>
+<span class="c1">/// ExprAST - Base class for all expression nodes.</span>
+<span class="k">class</span> <span class="nc">ExprAST</span> <span class="p">{</span>
+<span class="nl">public:</span>
+ <span class="k">virtual</span> <span class="o">~</span><span class="n">ExprAST</span><span class="p">()</span> <span class="p">{}</span>
+<span class="p">};</span>
+
+<span class="c1">/// NumberExprAST - Expression class for numeric literals like "1.0".</span>
+<span class="k">class</span> <span class="nc">NumberExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+<span class="nl">public:</span>
+ <span class="n">NumberExprAST</span><span class="p">(</span><span class="kt">double</span> <span class="n">val</span><span class="p">)</span> <span class="p">{}</span>
+<span class="p">};</span>
+
+<span class="c1">/// VariableExprAST - Expression class for referencing a variable, like "a".</span>
+<span class="k">class</span> <span class="nc">VariableExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">Name</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">VariableExprAST</span><span class="p">(</span><span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="o">&</span><span class="n">name</span><span class="p">)</span> <span class="o">:</span> <span class="n">Name</span><span class="p">(</span><span class="n">name</span><span class="p">)</span> <span class="p">{}</span>
+<span class="p">};</span>
+
+<span class="c1">/// BinaryExprAST - Expression class for a binary operator.</span>
+<span class="k">class</span> <span class="nc">BinaryExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+<span class="nl">public:</span>
+ <span class="n">BinaryExprAST</span><span class="p">(</span><span class="kt">char</span> <span class="n">op</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">lhs</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">rhs</span><span class="p">)</span> <span class="p">{}</span>
+<span class="p">};</span>
+
+<span class="c1">/// CallExprAST - Expression class for function calls.</span>
+<span class="k">class</span> <span class="nc">CallExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">Callee</span><span class="p">;</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">ExprAST</span><span class="o">*></span> <span class="n">Args</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">CallExprAST</span><span class="p">(</span><span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="o">&</span><span class="n">callee</span><span class="p">,</span> <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">ExprAST</span><span class="o">*></span> <span class="o">&</span><span class="n">args</span><span class="p">)</span>
+ <span class="o">:</span> <span class="n">Callee</span><span class="p">(</span><span class="n">callee</span><span class="p">),</span> <span class="n">Args</span><span class="p">(</span><span class="n">args</span><span class="p">)</span> <span class="p">{}</span>
+<span class="p">};</span>
+
+<span class="c1">/// PrototypeAST - This class represents the "prototype" for a function,</span>
+<span class="c1">/// which captures its name, and its argument names (thus implicitly the number</span>
+<span class="c1">/// of arguments the function takes).</span>
+<span class="k">class</span> <span class="nc">PrototypeAST</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">Name</span><span class="p">;</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span> <span class="n">Args</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">PrototypeAST</span><span class="p">(</span><span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="o">&</span><span class="n">name</span><span class="p">,</span> <span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span> <span class="o">&</span><span class="n">args</span><span class="p">)</span>
+ <span class="o">:</span> <span class="n">Name</span><span class="p">(</span><span class="n">name</span><span class="p">),</span> <span class="n">Args</span><span class="p">(</span><span class="n">args</span><span class="p">)</span> <span class="p">{}</span>
+
+<span class="p">};</span>
+
+<span class="c1">/// FunctionAST - This class represents a function definition itself.</span>
+<span class="k">class</span> <span class="nc">FunctionAST</span> <span class="p">{</span>
+<span class="nl">public:</span>
+ <span class="n">FunctionAST</span><span class="p">(</span><span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">proto</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">body</span><span class="p">)</span> <span class="p">{}</span>
+<span class="p">};</span>
+<span class="p">}</span> <span class="c1">// end anonymous namespace</span>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// Parser</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+
+<span class="c1">/// CurTok/getNextToken - Provide a simple token buffer. CurTok is the current</span>
+<span class="c1">/// token the parser is looking at. getNextToken reads another token from the</span>
+<span class="c1">/// lexer and updates CurTok with its results.</span>
+<span class="k">static</span> <span class="kt">int</span> <span class="n">CurTok</span><span class="p">;</span>
+<span class="k">static</span> <span class="kt">int</span> <span class="nf">getNextToken</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">return</span> <span class="n">CurTok</span> <span class="o">=</span> <span class="n">gettok</span><span class="p">();</span>
+<span class="p">}</span>
+
+<span class="c1">/// BinopPrecedence - This holds the precedence for each binary operator that is</span>
+<span class="c1">/// defined.</span>
+<span class="k">static</span> <span class="n">std</span><span class="o">::</span><span class="n">map</span><span class="o"><</span><span class="kt">char</span><span class="p">,</span> <span class="kt">int</span><span class="o">></span> <span class="n">BinopPrecedence</span><span class="p">;</span>
+
+<span class="c1">/// GetTokPrecedence - Get the precedence of the pending binary operator token.</span>
+<span class="k">static</span> <span class="kt">int</span> <span class="nf">GetTokPrecedence</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">isascii</span><span class="p">(</span><span class="n">CurTok</span><span class="p">))</span>
+ <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span>
+
+ <span class="c1">// Make sure it's a declared binop.</span>
+ <span class="kt">int</span> <span class="n">TokPrec</span> <span class="o">=</span> <span class="n">BinopPrecedence</span><span class="p">[</span><span class="n">CurTok</span><span class="p">];</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">TokPrec</span> <span class="o"><=</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span>
+ <span class="k">return</span> <span class="n">TokPrec</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">/// Error* - These are little helper functions for error handling.</span>
+<span class="n">ExprAST</span> <span class="o">*</span><span class="nf">Error</span><span class="p">(</span><span class="k">const</span> <span class="kt">char</span> <span class="o">*</span><span class="n">Str</span><span class="p">)</span> <span class="p">{</span> <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"Error: %s</span><span class="se">\n</span><span class="s">"</span><span class="p">,</span> <span class="n">Str</span><span class="p">);</span><span class="k">return</span> <span class="mi">0</span><span class="p">;}</span>
+<span class="n">PrototypeAST</span> <span class="o">*</span><span class="nf">ErrorP</span><span class="p">(</span><span class="k">const</span> <span class="kt">char</span> <span class="o">*</span><span class="n">Str</span><span class="p">)</span> <span class="p">{</span> <span class="n">Error</span><span class="p">(</span><span class="n">Str</span><span class="p">);</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> <span class="p">}</span>
+
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseExpression</span><span class="p">();</span>
+
+<span class="c1">/// identifierexpr</span>
+<span class="c1">/// ::= identifier</span>
+<span class="c1">/// ::= identifier '(' expression* ')'</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseIdentifierExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">IdName</span> <span class="o">=</span> <span class="n">IdentifierStr</span><span class="p">;</span>
+
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat identifier.</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">'('</span><span class="p">)</span> <span class="c1">// Simple variable ref.</span>
+ <span class="k">return</span> <span class="k">new</span> <span class="n">VariableExprAST</span><span class="p">(</span><span class="n">IdName</span><span class="p">);</span>
+
+ <span class="c1">// Call.</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat (</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">ExprAST</span><span class="o">*></span> <span class="n">Args</span><span class="p">;</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">')'</span><span class="p">)</span> <span class="p">{</span>
+ <span class="k">while</span> <span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">Arg</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">Arg</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="n">Args</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">Arg</span><span class="p">);</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">==</span> <span class="sc">')'</span><span class="p">)</span> <span class="k">break</span><span class="p">;</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">','</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">Error</span><span class="p">(</span><span class="s">"Expected ')' or ',' in argument list"</span><span class="p">);</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+ <span class="p">}</span>
+ <span class="p">}</span>
+
+ <span class="c1">// Eat the ')'.</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+
+ <span class="k">return</span> <span class="k">new</span> <span class="n">CallExprAST</span><span class="p">(</span><span class="n">IdName</span><span class="p">,</span> <span class="n">Args</span><span class="p">);</span>
+<span class="p">}</span>
+
+<span class="c1">/// numberexpr ::= number</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseNumberExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">Result</span> <span class="o">=</span> <span class="k">new</span> <span class="n">NumberExprAST</span><span class="p">(</span><span class="n">NumVal</span><span class="p">);</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// consume the number</span>
+ <span class="k">return</span> <span class="n">Result</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">/// parenexpr ::= '(' expression ')'</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseParenExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat (.</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">V</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">V</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">')'</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">Error</span><span class="p">(</span><span class="s">"expected ')'"</span><span class="p">);</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat ).</span>
+ <span class="k">return</span> <span class="n">V</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">/// primary</span>
+<span class="c1">/// ::= identifierexpr</span>
+<span class="c1">/// ::= numberexpr</span>
+<span class="c1">/// ::= parenexpr</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParsePrimary</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">switch</span> <span class="p">(</span><span class="n">CurTok</span><span class="p">)</span> <span class="p">{</span>
+ <span class="nl">default:</span> <span class="k">return</span> <span class="n">Error</span><span class="p">(</span><span class="s">"unknown token when expecting an expression"</span><span class="p">);</span>
+ <span class="k">case</span> <span class="n">tok_identifier</span>: <span class="k">return</span> <span class="n">ParseIdentifierExpr</span><span class="p">();</span>
+ <span class="k">case</span> <span class="n">tok_number</span>: <span class="k">return</span> <span class="n">ParseNumberExpr</span><span class="p">();</span>
+ <span class="k">case</span> <span class="sc">'('</span>: <span class="k">return</span> <span class="n">ParseParenExpr</span><span class="p">();</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="c1">/// binoprhs</span>
+<span class="c1">/// ::= ('+' primary)*</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseBinOpRHS</span><span class="p">(</span><span class="kt">int</span> <span class="n">ExprPrec</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">LHS</span><span class="p">)</span> <span class="p">{</span>
+ <span class="c1">// If this is a binop, find its precedence.</span>
+ <span class="k">while</span> <span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
+ <span class="kt">int</span> <span class="n">TokPrec</span> <span class="o">=</span> <span class="n">GetTokPrecedence</span><span class="p">();</span>
+
+ <span class="c1">// If this is a binop that binds at least as tightly as the current binop,</span>
+ <span class="c1">// consume it, otherwise we are done.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">TokPrec</span> <span class="o"><</span> <span class="n">ExprPrec</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">LHS</span><span class="p">;</span>
+
+ <span class="c1">// Okay, we know this is a binop.</span>
+ <span class="kt">int</span> <span class="n">BinOp</span> <span class="o">=</span> <span class="n">CurTok</span><span class="p">;</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat binop</span>
+
+ <span class="c1">// Parse the primary expression after the binary operator.</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">RHS</span> <span class="o">=</span> <span class="n">ParsePrimary</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">RHS</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="c1">// If BinOp binds less tightly with RHS than the operator after RHS, let</span>
+ <span class="c1">// the pending operator take RHS as its LHS.</span>
+ <span class="kt">int</span> <span class="n">NextPrec</span> <span class="o">=</span> <span class="n">GetTokPrecedence</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">TokPrec</span> <span class="o"><</span> <span class="n">NextPrec</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">RHS</span> <span class="o">=</span> <span class="n">ParseBinOpRHS</span><span class="p">(</span><span class="n">TokPrec</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span> <span class="n">RHS</span><span class="p">);</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">RHS</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="p">}</span>
+
+ <span class="c1">// Merge LHS/RHS.</span>
+ <span class="n">LHS</span> <span class="o">=</span> <span class="k">new</span> <span class="n">BinaryExprAST</span><span class="p">(</span><span class="n">BinOp</span><span class="p">,</span> <span class="n">LHS</span><span class="p">,</span> <span class="n">RHS</span><span class="p">);</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="c1">/// expression</span>
+<span class="c1">/// ::= primary binoprhs</span>
+<span class="c1">///</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseExpression</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">LHS</span> <span class="o">=</span> <span class="n">ParsePrimary</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">LHS</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="k">return</span> <span class="n">ParseBinOpRHS</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">LHS</span><span class="p">);</span>
+<span class="p">}</span>
+
+<span class="c1">/// prototype</span>
+<span class="c1">/// ::= id '(' id* ')'</span>
+<span class="k">static</span> <span class="n">PrototypeAST</span> <span class="o">*</span><span class="nf">ParsePrototype</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="n">tok_identifier</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">ErrorP</span><span class="p">(</span><span class="s">"Expected function name in prototype"</span><span class="p">);</span>
+
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">FnName</span> <span class="o">=</span> <span class="n">IdentifierStr</span><span class="p">;</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">'('</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">ErrorP</span><span class="p">(</span><span class="s">"Expected '(' in prototype"</span><span class="p">);</span>
+
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span> <span class="n">ArgNames</span><span class="p">;</span>
+ <span class="k">while</span> <span class="p">(</span><span class="n">getNextToken</span><span class="p">()</span> <span class="o">==</span> <span class="n">tok_identifier</span><span class="p">)</span>
+ <span class="n">ArgNames</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">IdentifierStr</span><span class="p">);</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">')'</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">ErrorP</span><span class="p">(</span><span class="s">"Expected ')' in prototype"</span><span class="p">);</span>
+
+ <span class="c1">// success.</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat ')'.</span>
+
+ <span class="k">return</span> <span class="k">new</span> <span class="n">PrototypeAST</span><span class="p">(</span><span class="n">FnName</span><span class="p">,</span> <span class="n">ArgNames</span><span class="p">);</span>
+<span class="p">}</span>
+
+<span class="c1">/// definition ::= 'def' prototype expression</span>
+<span class="k">static</span> <span class="n">FunctionAST</span> <span class="o">*</span><span class="nf">ParseDefinition</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat def.</span>
+ <span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">Proto</span> <span class="o">=</span> <span class="n">ParsePrototype</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">Proto</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">ExprAST</span> <span class="o">*</span><span class="n">E</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">())</span>
+ <span class="k">return</span> <span class="k">new</span> <span class="n">FunctionAST</span><span class="p">(</span><span class="n">Proto</span><span class="p">,</span> <span class="n">E</span><span class="p">);</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">/// toplevelexpr ::= expression</span>
+<span class="k">static</span> <span class="n">FunctionAST</span> <span class="o">*</span><span class="nf">ParseTopLevelExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">ExprAST</span> <span class="o">*</span><span class="n">E</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">())</span> <span class="p">{</span>
+ <span class="c1">// Make an anonymous proto.</span>
+ <span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">Proto</span> <span class="o">=</span> <span class="k">new</span> <span class="n">PrototypeAST</span><span class="p">(</span><span class="s">""</span><span class="p">,</span> <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span><span class="p">());</span>
+ <span class="k">return</span> <span class="k">new</span> <span class="n">FunctionAST</span><span class="p">(</span><span class="n">Proto</span><span class="p">,</span> <span class="n">E</span><span class="p">);</span>
+ <span class="p">}</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">/// external ::= 'extern' prototype</span>
+<span class="k">static</span> <span class="n">PrototypeAST</span> <span class="o">*</span><span class="nf">ParseExtern</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat extern.</span>
+ <span class="k">return</span> <span class="n">ParsePrototype</span><span class="p">();</span>
+<span class="p">}</span>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// Top-Level parsing</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+
+<span class="k">static</span> <span class="kt">void</span> <span class="nf">HandleDefinition</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">ParseDefinition</span><span class="p">())</span> <span class="p">{</span>
+ <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"Parsed a function definition.</span><span class="se">\n</span><span class="s">"</span><span class="p">);</span>
+ <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
+ <span class="c1">// Skip token for error recovery.</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="k">static</span> <span class="kt">void</span> <span class="nf">HandleExtern</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">ParseExtern</span><span class="p">())</span> <span class="p">{</span>
+ <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"Parsed an extern</span><span class="se">\n</span><span class="s">"</span><span class="p">);</span>
+ <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
+ <span class="c1">// Skip token for error recovery.</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="k">static</span> <span class="kt">void</span> <span class="nf">HandleTopLevelExpression</span><span class="p">()</span> <span class="p">{</span>
+ <span class="c1">// Evaluate a top-level expression into an anonymous function.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">ParseTopLevelExpr</span><span class="p">())</span> <span class="p">{</span>
+ <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"Parsed a top-level expr</span><span class="se">\n</span><span class="s">"</span><span class="p">);</span>
+ <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
+ <span class="c1">// Skip token for error recovery.</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="c1">/// top ::= definition | external | expression | ';'</span>
+<span class="k">static</span> <span class="kt">void</span> <span class="nf">MainLoop</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">while</span> <span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"ready> "</span><span class="p">);</span>
+ <span class="k">switch</span> <span class="p">(</span><span class="n">CurTok</span><span class="p">)</span> <span class="p">{</span>
+ <span class="k">case</span> <span class="n">tok_eof</span>: <span class="k">return</span><span class="p">;</span>
+ <span class="k">case</span> <span class="sc">';'</span>: <span class="n">getNextToken</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span> <span class="c1">// ignore top-level semicolons.</span>
+ <span class="k">case</span> <span class="n">tok_def</span>: <span class="n">HandleDefinition</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span>
+ <span class="k">case</span> <span class="n">tok_extern</span>: <span class="n">HandleExtern</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span>
+ <span class="nl">default:</span> <span class="n">HandleTopLevelExpression</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span>
+ <span class="p">}</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// Main driver code.</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+
+<span class="kt">int</span> <span class="nf">main</span><span class="p">()</span> <span class="p">{</span>
+ <span class="c1">// Install standard binary operators.</span>
+ <span class="c1">// 1 is lowest precedence.</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'<'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">10</span><span class="p">;</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'+'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">20</span><span class="p">;</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'-'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">20</span><span class="p">;</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'*'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">40</span><span class="p">;</span> <span class="c1">// highest.</span>
+
+ <span class="c1">// Prime the first token.</span>
+ <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"ready> "</span><span class="p">);</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+
+ <span class="c1">// Run the main "interpreter loop" now.</span>
+ <span class="n">MainLoop</span><span class="p">();</span>
+
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p><a class="reference external" href="LangImpl3.html">Next: Implementing Code Generation to LLVM IR</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="LangImpl3.html" title="3. Kaleidoscope: Code generation to LLVM IR"
+ >next</a> |</li>
+ <li class="right" >
+ <a href="LangImpl1.html" title="1. Kaleidoscope: Tutorial Introduction and the Lexer"
+ >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-2015, LLVM Project.
+ Last updated on 2015-08-31.
+ 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.7.0/docs/tutorial/LangImpl3.html
URL: http://llvm.org/viewvc/llvm-project/www-releases/trunk/3.7.0/docs/tutorial/LangImpl3.html?rev=246586&view=auto
==============================================================================
--- www-releases/trunk/3.7.0/docs/tutorial/LangImpl3.html (added)
+++ www-releases/trunk/3.7.0/docs/tutorial/LangImpl3.html Tue Sep 1 15:55:31 2015
@@ -0,0 +1,1193 @@
+
+<!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>3. Kaleidoscope: Code generation to LLVM IR — LLVM 3.7 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.7',
+ 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.7 documentation" href="../index.html" />
+ <link rel="up" title="LLVM Tutorial: Table of Contents" href="index.html" />
+ <link rel="next" title="4. Kaleidoscope: Adding JIT and Optimizer Support" href="LangImpl4.html" />
+ <link rel="prev" title="2. Kaleidoscope: Implementing a Parser and AST" href="LangImpl2.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="LangImpl4.html" title="4. Kaleidoscope: Adding JIT and Optimizer Support"
+ accesskey="N">next</a> |</li>
+ <li class="right" >
+ <a href="LangImpl2.html" title="2. Kaleidoscope: Implementing a Parser and AST"
+ 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-code-generation-to-llvm-ir">
+<h1>3. Kaleidoscope: Code generation to LLVM IR<a class="headerlink" href="#kaleidoscope-code-generation-to-llvm-ir" title="Permalink to this headline">¶</a></h1>
+<div class="contents local topic" id="contents">
+<ul class="simple">
+<li><a class="reference internal" href="#chapter-3-introduction" id="id1">Chapter 3 Introduction</a></li>
+<li><a class="reference internal" href="#code-generation-setup" id="id2">Code Generation Setup</a></li>
+<li><a class="reference internal" href="#expression-code-generation" id="id3">Expression Code Generation</a></li>
+<li><a class="reference internal" href="#function-code-generation" id="id4">Function Code Generation</a></li>
+<li><a class="reference internal" href="#driver-changes-and-closing-thoughts" id="id5">Driver Changes and Closing Thoughts</a></li>
+<li><a class="reference internal" href="#full-code-listing" id="id6">Full Code Listing</a></li>
+</ul>
+</div>
+<div class="section" id="chapter-3-introduction">
+<h2><a class="toc-backref" href="#id1">3.1. Chapter 3 Introduction</a><a class="headerlink" href="#chapter-3-introduction" title="Permalink to this headline">¶</a></h2>
+<p>Welcome to Chapter 3 of the “<a class="reference external" href="index.html">Implementing a language with
+LLVM</a>” tutorial. This chapter shows you how to transform
+the <a class="reference external" href="LangImpl2.html">Abstract Syntax Tree</a>, built in Chapter 2, into
+LLVM IR. This will teach you a little bit about how LLVM does things, as
+well as demonstrate how easy it is to use. It’s much more work to build
+a lexer and parser than it is to generate LLVM IR code. :)</p>
+<p><strong>Please note</strong>: the code in this chapter and later require LLVM 2.2 or
+later. LLVM 2.1 and before will not work with it. Also note that you
+need to use a version of this tutorial that matches your LLVM release:
+If you are using an official LLVM release, use the version of the
+documentation included with your release or on the <a class="reference external" href="http://llvm.org/releases/">llvm.org releases
+page</a>.</p>
+</div>
+<div class="section" id="code-generation-setup">
+<h2><a class="toc-backref" href="#id2">3.2. Code Generation Setup</a><a class="headerlink" href="#code-generation-setup" title="Permalink to this headline">¶</a></h2>
+<p>In order to generate LLVM IR, we want some simple setup to get started.
+First we define virtual code generation (codegen) methods in each AST
+class:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">/// ExprAST - Base class for all expression nodes.</span>
+<span class="k">class</span> <span class="nc">ExprAST</span> <span class="p">{</span>
+<span class="nl">public:</span>
+ <span class="k">virtual</span> <span class="o">~</span><span class="n">ExprAST</span><span class="p">()</span> <span class="p">{}</span>
+ <span class="k">virtual</span> <span class="n">Value</span> <span class="o">*</span><span class="n">Codegen</span><span class="p">()</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">};</span>
+
+<span class="c1">/// NumberExprAST - Expression class for numeric literals like "1.0".</span>
+<span class="k">class</span> <span class="nc">NumberExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+ <span class="kt">double</span> <span class="n">Val</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">NumberExprAST</span><span class="p">(</span><span class="kt">double</span> <span class="n">val</span><span class="p">)</span> <span class="o">:</span> <span class="n">Val</span><span class="p">(</span><span class="n">val</span><span class="p">)</span> <span class="p">{}</span>
+ <span class="k">virtual</span> <span class="n">Value</span> <span class="o">*</span><span class="n">Codegen</span><span class="p">();</span>
+<span class="p">};</span>
+<span class="p">...</span>
+</pre></div>
+</div>
+<p>The Codegen() method says to emit IR for that AST node along with all
+the things it depends on, and they all return an LLVM Value object.
+“Value” is the class used to represent a “<a class="reference external" href="http://en.wikipedia.org/wiki/Static_single_assignment_form">Static Single Assignment
+(SSA)</a>
+register” or “SSA value” in LLVM. The most distinct aspect of SSA values
+is that their value is computed as the related instruction executes, and
+it does not get a new value until (and if) the instruction re-executes.
+In other words, there is no way to “change” an SSA value. For more
+information, please read up on <a class="reference external" href="http://en.wikipedia.org/wiki/Static_single_assignment_form">Static Single
+Assignment</a>
+- the concepts are really quite natural once you grok them.</p>
+<p>Note that instead of adding virtual methods to the ExprAST class
+hierarchy, it could also make sense to use a <a class="reference external" href="http://en.wikipedia.org/wiki/Visitor_pattern">visitor
+pattern</a> or some other
+way to model this. Again, this tutorial won’t dwell on good software
+engineering practices: for our purposes, adding a virtual method is
+simplest.</p>
+<p>The second thing we want is an “Error” method like we used for the
+parser, which will be used to report errors found during code generation
+(for example, use of an undeclared parameter):</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="n">Value</span> <span class="o">*</span><span class="nf">ErrorV</span><span class="p">(</span><span class="k">const</span> <span class="kt">char</span> <span class="o">*</span><span class="n">Str</span><span class="p">)</span> <span class="p">{</span> <span class="n">Error</span><span class="p">(</span><span class="n">Str</span><span class="p">);</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> <span class="p">}</span>
+
+<span class="k">static</span> <span class="n">Module</span> <span class="o">*</span><span class="n">TheModule</span><span class="p">;</span>
+<span class="k">static</span> <span class="n">IRBuilder</span><span class="o"><></span> <span class="n">Builder</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">());</span>
+<span class="k">static</span> <span class="n">std</span><span class="o">::</span><span class="n">map</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="p">,</span> <span class="n">Value</span><span class="o">*></span> <span class="n">NamedValues</span><span class="p">;</span>
+</pre></div>
+</div>
+<p>The static variables will be used during code generation. <tt class="docutils literal"><span class="pre">TheModule</span></tt>
+is the LLVM construct that contains all of the functions and global
+variables in a chunk of code. In many ways, it is the top-level
+structure that the LLVM IR uses to contain code.</p>
+<p>The <tt class="docutils literal"><span class="pre">Builder</span></tt> object is a helper object that makes it easy to generate
+LLVM instructions. Instances of the
+<a class="reference external" href="http://llvm.org/doxygen/IRBuilder_8h-source.html">IRBuilder</a>
+class template keep track of the current place to insert instructions
+and has methods to create new instructions.</p>
+<p>The <tt class="docutils literal"><span class="pre">NamedValues</span></tt> map keeps track of which values are defined in the
+current scope and what their LLVM representation is. (In other words, it
+is a symbol table for the code). In this form of Kaleidoscope, the only
+things that can be referenced are function parameters. As such, function
+parameters will be in this map when generating code for their function
+body.</p>
+<p>With these basics in place, we can start talking about how to generate
+code for each expression. Note that this assumes that the <tt class="docutils literal"><span class="pre">Builder</span></tt>
+has been set up to generate code <em>into</em> something. For now, we’ll assume
+that this has already been done, and we’ll just use it to emit code.</p>
+</div>
+<div class="section" id="expression-code-generation">
+<h2><a class="toc-backref" href="#id3">3.3. Expression Code Generation</a><a class="headerlink" href="#expression-code-generation" title="Permalink to this headline">¶</a></h2>
+<p>Generating LLVM code for expression nodes is very straightforward: less
+than 45 lines of commented code for all four of our expression nodes.
+First we’ll do numeric literals:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="n">Value</span> <span class="o">*</span><span class="n">NumberExprAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">return</span> <span class="n">ConstantFP</span><span class="o">::</span><span class="n">get</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">(),</span> <span class="n">APFloat</span><span class="p">(</span><span class="n">Val</span><span class="p">));</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>In the LLVM IR, numeric constants are represented with the
+<tt class="docutils literal"><span class="pre">ConstantFP</span></tt> class, which holds the numeric value in an <tt class="docutils literal"><span class="pre">APFloat</span></tt>
+internally (<tt class="docutils literal"><span class="pre">APFloat</span></tt> has the capability of holding floating point
+constants of Arbitrary Precision). This code basically just creates
+and returns a <tt class="docutils literal"><span class="pre">ConstantFP</span></tt>. Note that in the LLVM IR that constants
+are all uniqued together and shared. For this reason, the API uses the
+“foo::get(...)” idiom instead of “new foo(..)” or “foo::Create(..)”.</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="n">Value</span> <span class="o">*</span><span class="n">VariableExprAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="c1">// Look this variable up in the function.</span>
+ <span class="n">Value</span> <span class="o">*</span><span class="n">V</span> <span class="o">=</span> <span class="n">NamedValues</span><span class="p">[</span><span class="n">Name</span><span class="p">];</span>
+ <span class="k">return</span> <span class="n">V</span> <span class="o">?</span> <span class="n">V</span> <span class="o">:</span> <span class="n">ErrorV</span><span class="p">(</span><span class="s">"Unknown variable name"</span><span class="p">);</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>References to variables are also quite simple using LLVM. In the simple
+version of Kaleidoscope, we assume that the variable has already been
+emitted somewhere and its value is available. In practice, the only
+values that can be in the <tt class="docutils literal"><span class="pre">NamedValues</span></tt> map are function arguments.
+This code simply checks to see that the specified name is in the map (if
+not, an unknown variable is being referenced) and returns the value for
+it. In future chapters, we’ll add support for <a class="reference external" href="LangImpl5.html#for">loop induction
+variables</a> in the symbol table, and for <a class="reference external" href="LangImpl7.html#localvars">local
+variables</a>.</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="n">Value</span> <span class="o">*</span><span class="n">BinaryExprAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">Value</span> <span class="o">*</span><span class="n">L</span> <span class="o">=</span> <span class="n">LHS</span><span class="o">-></span><span class="n">Codegen</span><span class="p">();</span>
+ <span class="n">Value</span> <span class="o">*</span><span class="n">R</span> <span class="o">=</span> <span class="n">RHS</span><span class="o">-></span><span class="n">Codegen</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">L</span> <span class="o">==</span> <span class="mi">0</span> <span class="o">||</span> <span class="n">R</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="k">switch</span> <span class="p">(</span><span class="n">Op</span><span class="p">)</span> <span class="p">{</span>
+ <span class="k">case</span> <span class="sc">'+'</span>: <span class="k">return</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateFAdd</span><span class="p">(</span><span class="n">L</span><span class="p">,</span> <span class="n">R</span><span class="p">,</span> <span class="s">"addtmp"</span><span class="p">);</span>
+ <span class="k">case</span> <span class="sc">'-'</span>: <span class="k">return</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateFSub</span><span class="p">(</span><span class="n">L</span><span class="p">,</span> <span class="n">R</span><span class="p">,</span> <span class="s">"subtmp"</span><span class="p">);</span>
+ <span class="k">case</span> <span class="sc">'*'</span>: <span class="k">return</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateFMul</span><span class="p">(</span><span class="n">L</span><span class="p">,</span> <span class="n">R</span><span class="p">,</span> <span class="s">"multmp"</span><span class="p">);</span>
+ <span class="k">case</span> <span class="sc">'<'</span>:
+ <span class="n">L</span> <span class="o">=</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateFCmpULT</span><span class="p">(</span><span class="n">L</span><span class="p">,</span> <span class="n">R</span><span class="p">,</span> <span class="s">"cmptmp"</span><span class="p">);</span>
+ <span class="c1">// Convert bool 0/1 to double 0.0 or 1.0</span>
+ <span class="k">return</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateUIToFP</span><span class="p">(</span><span class="n">L</span><span class="p">,</span> <span class="n">Type</span><span class="o">::</span><span class="n">getDoubleTy</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">()),</span>
+ <span class="s">"booltmp"</span><span class="p">);</span>
+ <span class="nl">default:</span> <span class="k">return</span> <span class="nf">ErrorV</span><span class="p">(</span><span class="s">"invalid binary operator"</span><span class="p">);</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>Binary operators start to get more interesting. The basic idea here is
+that we recursively emit code for the left-hand side of the expression,
+then the right-hand side, then we compute the result of the binary
+expression. In this code, we do a simple switch on the opcode to create
+the right LLVM instruction.</p>
+<p>In the example above, the LLVM builder class is starting to show its
+value. IRBuilder knows where to insert the newly created instruction,
+all you have to do is specify what instruction to create (e.g. with
+<tt class="docutils literal"><span class="pre">CreateFAdd</span></tt>), which operands to use (<tt class="docutils literal"><span class="pre">L</span></tt> and <tt class="docutils literal"><span class="pre">R</span></tt> here) and
+optionally provide a name for the generated instruction.</p>
+<p>One nice thing about LLVM is that the name is just a hint. For instance,
+if the code above emits multiple “addtmp” variables, LLVM will
+automatically provide each one with an increasing, unique numeric
+suffix. Local value names for instructions are purely optional, but it
+makes it much easier to read the IR dumps.</p>
+<p><a class="reference external" href="../LangRef.html#instref">LLVM instructions</a> are constrained by strict
+rules: for example, the Left and Right operators of an <a class="reference external" href="../LangRef.html#i_add">add
+instruction</a> must have the same type, and the
+result type of the add must match the operand types. Because all values
+in Kaleidoscope are doubles, this makes for very simple code for add,
+sub and mul.</p>
+<p>On the other hand, LLVM specifies that the <a class="reference external" href="../LangRef.html#i_fcmp">fcmp
+instruction</a> always returns an ‘i1’ value (a
+one bit integer). The problem with this is that Kaleidoscope wants the
+value to be a 0.0 or 1.0 value. In order to get these semantics, we
+combine the fcmp instruction with a <a class="reference external" href="../LangRef.html#i_uitofp">uitofp
+instruction</a>. This instruction converts its
+input integer into a floating point value by treating the input as an
+unsigned value. In contrast, if we used the <a class="reference external" href="../LangRef.html#i_sitofp">sitofp
+instruction</a>, the Kaleidoscope ‘<’ operator
+would return 0.0 and -1.0, depending on the input value.</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="n">Value</span> <span class="o">*</span><span class="n">CallExprAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="c1">// Look up the name in the global module table.</span>
+ <span class="n">Function</span> <span class="o">*</span><span class="n">CalleeF</span> <span class="o">=</span> <span class="n">TheModule</span><span class="o">-></span><span class="n">getFunction</span><span class="p">(</span><span class="n">Callee</span><span class="p">);</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CalleeF</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">ErrorV</span><span class="p">(</span><span class="s">"Unknown function referenced"</span><span class="p">);</span>
+
+ <span class="c1">// If argument mismatch error.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CalleeF</span><span class="o">-></span><span class="n">arg_size</span><span class="p">()</span> <span class="o">!=</span> <span class="n">Args</span><span class="p">.</span><span class="n">size</span><span class="p">())</span>
+ <span class="k">return</span> <span class="n">ErrorV</span><span class="p">(</span><span class="s">"Incorrect # arguments passed"</span><span class="p">);</span>
+
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">Value</span><span class="o">*></span> <span class="n">ArgsV</span><span class="p">;</span>
+ <span class="k">for</span> <span class="p">(</span><span class="kt">unsigned</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">,</span> <span class="n">e</span> <span class="o">=</span> <span class="n">Args</span><span class="p">.</span><span class="n">size</span><span class="p">();</span> <span class="n">i</span> <span class="o">!=</span> <span class="n">e</span><span class="p">;</span> <span class="o">++</span><span class="n">i</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">ArgsV</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">Args</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">-></span><span class="n">Codegen</span><span class="p">());</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">ArgsV</span><span class="p">.</span><span class="n">back</span><span class="p">()</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="p">}</span>
+
+ <span class="k">return</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateCall</span><span class="p">(</span><span class="n">CalleeF</span><span class="p">,</span> <span class="n">ArgsV</span><span class="p">,</span> <span class="s">"calltmp"</span><span class="p">);</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>Code generation for function calls is quite straightforward with LLVM.
+The code above initially does a function name lookup in the LLVM
+Module’s symbol table. Recall that the LLVM Module is the container that
+holds all of the functions we are JIT’ing. By giving each function the
+same name as what the user specifies, we can use the LLVM symbol table
+to resolve function names for us.</p>
+<p>Once we have the function to call, we recursively codegen each argument
+that is to be passed in, and create an LLVM <a class="reference external" href="../LangRef.html#i_call">call
+instruction</a>. Note that LLVM uses the native C
+calling conventions by default, allowing these calls to also call into
+standard library functions like “sin” and “cos”, with no additional
+effort.</p>
+<p>This wraps up our handling of the four basic expressions that we have so
+far in Kaleidoscope. Feel free to go in and add some more. For example,
+by browsing the <a class="reference external" href="../LangRef.html">LLVM language reference</a> you’ll find
+several other interesting instructions that are really easy to plug into
+our basic framework.</p>
+</div>
+<div class="section" id="function-code-generation">
+<h2><a class="toc-backref" href="#id4">3.4. Function Code Generation</a><a class="headerlink" href="#function-code-generation" title="Permalink to this headline">¶</a></h2>
+<p>Code generation for prototypes and functions must handle a number of
+details, which make their code less beautiful than expression code
+generation, but allows us to illustrate some important points. First,
+lets talk about code generation for prototypes: they are used both for
+function bodies and external function declarations. The code starts
+with:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="n">Function</span> <span class="o">*</span><span class="n">PrototypeAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="c1">// Make the function type: double(double,double) etc.</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">Type</span><span class="o">*></span> <span class="n">Doubles</span><span class="p">(</span><span class="n">Args</span><span class="p">.</span><span class="n">size</span><span class="p">(),</span>
+ <span class="n">Type</span><span class="o">::</span><span class="n">getDoubleTy</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">()));</span>
+ <span class="n">FunctionType</span> <span class="o">*</span><span class="n">FT</span> <span class="o">=</span> <span class="n">FunctionType</span><span class="o">::</span><span class="n">get</span><span class="p">(</span><span class="n">Type</span><span class="o">::</span><span class="n">getDoubleTy</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">()),</span>
+ <span class="n">Doubles</span><span class="p">,</span> <span class="nb">false</span><span class="p">);</span>
+
+ <span class="n">Function</span> <span class="o">*</span><span class="n">F</span> <span class="o">=</span> <span class="n">Function</span><span class="o">::</span><span class="n">Create</span><span class="p">(</span><span class="n">FT</span><span class="p">,</span> <span class="n">Function</span><span class="o">::</span><span class="n">ExternalLinkage</span><span class="p">,</span> <span class="n">Name</span><span class="p">,</span> <span class="n">TheModule</span><span class="p">);</span>
+</pre></div>
+</div>
+<p>This code packs a lot of power into a few lines. Note first that this
+function returns a “Function*” instead of a “Value*”. Because a
+“prototype” really talks about the external interface for a function
+(not the value computed by an expression), it makes sense for it to
+return the LLVM Function it corresponds to when codegen’d.</p>
+<p>The call to <tt class="docutils literal"><span class="pre">FunctionType::get</span></tt> creates the <tt class="docutils literal"><span class="pre">FunctionType</span></tt> that
+should be used for a given Prototype. Since all function arguments in
+Kaleidoscope are of type double, the first line creates a vector of “N”
+LLVM double types. It then uses the <tt class="docutils literal"><span class="pre">Functiontype::get</span></tt> method to
+create a function type that takes “N” doubles as arguments, returns one
+double as a result, and that is not vararg (the false parameter
+indicates this). Note that Types in LLVM are uniqued just like Constants
+are, so you don’t “new” a type, you “get” it.</p>
+<p>The final line above actually creates the function that the prototype
+will correspond to. This indicates the type, linkage and name to use, as
+well as which module to insert into. “<a class="reference external" href="../LangRef.html#linkage">external
+linkage</a>” means that the function may be
+defined outside the current module and/or that it is callable by
+functions outside the module. The Name passed in is the name the user
+specified: since “<tt class="docutils literal"><span class="pre">TheModule</span></tt>” is specified, this name is registered
+in “<tt class="docutils literal"><span class="pre">TheModule</span></tt>“s symbol table, which is used by the function call
+code above.</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">// If F conflicted, there was already something named 'Name'. If it has a</span>
+<span class="c1">// body, don't allow redefinition or reextern.</span>
+<span class="k">if</span> <span class="p">(</span><span class="n">F</span><span class="o">-></span><span class="n">getName</span><span class="p">()</span> <span class="o">!=</span> <span class="n">Name</span><span class="p">)</span> <span class="p">{</span>
+ <span class="c1">// Delete the one we just made and get the existing one.</span>
+ <span class="n">F</span><span class="o">-></span><span class="n">eraseFromParent</span><span class="p">();</span>
+ <span class="n">F</span> <span class="o">=</span> <span class="n">TheModule</span><span class="o">-></span><span class="n">getFunction</span><span class="p">(</span><span class="n">Name</span><span class="p">);</span>
+</pre></div>
+</div>
+<p>The Module symbol table works just like the Function symbol table when
+it comes to name conflicts: if a new function is created with a name
+that was previously added to the symbol table, the new function will get
+implicitly renamed when added to the Module. The code above exploits
+this fact to determine if there was a previous definition of this
+function.</p>
+<p>In Kaleidoscope, I choose to allow redefinitions of functions in two
+cases: first, we want to allow ‘extern’ing a function more than once, as
+long as the prototypes for the externs match (since all arguments have
+the same type, we just have to check that the number of arguments
+match). Second, we want to allow ‘extern’ing a function and then
+defining a body for it. This is useful when defining mutually recursive
+functions.</p>
+<p>In order to implement this, the code above first checks to see if there
+is a collision on the name of the function. If so, it deletes the
+function we just created (by calling <tt class="docutils literal"><span class="pre">eraseFromParent</span></tt>) and then
+calling <tt class="docutils literal"><span class="pre">getFunction</span></tt> to get the existing function with the specified
+name. Note that many APIs in LLVM have “erase” forms and “remove” forms.
+The “remove” form unlinks the object from its parent (e.g. a Function
+from a Module) and returns it. The “erase” form unlinks the object and
+then deletes it.</p>
+<div class="highlight-c++"><div class="highlight"><pre> <span class="c1">// If F already has a body, reject this.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">F</span><span class="o">-></span><span class="n">empty</span><span class="p">())</span> <span class="p">{</span>
+ <span class="n">ErrorF</span><span class="p">(</span><span class="s">"redefinition of function"</span><span class="p">);</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="p">}</span>
+
+ <span class="c1">// If F took a different number of args, reject.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">F</span><span class="o">-></span><span class="n">arg_size</span><span class="p">()</span> <span class="o">!=</span> <span class="n">Args</span><span class="p">.</span><span class="n">size</span><span class="p">())</span> <span class="p">{</span>
+ <span class="n">ErrorF</span><span class="p">(</span><span class="s">"redefinition of function with different # args"</span><span class="p">);</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>In order to verify the logic above, we first check to see if the
+pre-existing function is “empty”. In this case, empty means that it has
+no basic blocks in it, which means it has no body. If it has no body, it
+is a forward declaration. Since we don’t allow anything after a full
+definition of the function, the code rejects this case. If the previous
+reference to a function was an ‘extern’, we simply verify that the
+number of arguments for that definition and this one match up. If not,
+we emit an error.</p>
+<div class="highlight-c++"><div class="highlight"><pre> <span class="c1">// Set names for all arguments.</span>
+ <span class="kt">unsigned</span> <span class="n">Idx</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="k">for</span> <span class="p">(</span><span class="n">Function</span><span class="o">::</span><span class="n">arg_iterator</span> <span class="n">AI</span> <span class="o">=</span> <span class="n">F</span><span class="o">-></span><span class="n">arg_begin</span><span class="p">();</span> <span class="n">Idx</span> <span class="o">!=</span> <span class="n">Args</span><span class="p">.</span><span class="n">size</span><span class="p">();</span>
+ <span class="o">++</span><span class="n">AI</span><span class="p">,</span> <span class="o">++</span><span class="n">Idx</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">AI</span><span class="o">-></span><span class="n">setName</span><span class="p">(</span><span class="n">Args</span><span class="p">[</span><span class="n">Idx</span><span class="p">]);</span>
+
+ <span class="c1">// Add arguments to variable symbol table.</span>
+ <span class="n">NamedValues</span><span class="p">[</span><span class="n">Args</span><span class="p">[</span><span class="n">Idx</span><span class="p">]]</span> <span class="o">=</span> <span class="n">AI</span><span class="p">;</span>
+ <span class="p">}</span>
+ <span class="k">return</span> <span class="n">F</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>The last bit of code for prototypes loops over all of the arguments in
+the function, setting the name of the LLVM Argument objects to match,
+and registering the arguments in the <tt class="docutils literal"><span class="pre">NamedValues</span></tt> map for future use
+by the <tt class="docutils literal"><span class="pre">VariableExprAST</span></tt> AST node. Once this is set up, it returns the
+Function object to the caller. Note that we don’t check for conflicting
+argument names here (e.g. “extern foo(a b a)”). Doing so would be very
+straight-forward with the mechanics we have already used above.</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="n">Function</span> <span class="o">*</span><span class="n">FunctionAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">NamedValues</span><span class="p">.</span><span class="n">clear</span><span class="p">();</span>
+
+ <span class="n">Function</span> <span class="o">*</span><span class="n">TheFunction</span> <span class="o">=</span> <span class="n">Proto</span><span class="o">-></span><span class="n">Codegen</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">TheFunction</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+</pre></div>
+</div>
+<p>Code generation for function definitions starts out simply enough: we
+just codegen the prototype (Proto) and verify that it is ok. We then
+clear out the <tt class="docutils literal"><span class="pre">NamedValues</span></tt> map to make sure that there isn’t anything
+in it from the last function we compiled. Code generation of the
+prototype ensures that there is an LLVM Function object that is ready to
+go for us.</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="c1">// Create a new basic block to start insertion into.</span>
+<span class="n">BasicBlock</span> <span class="o">*</span><span class="n">BB</span> <span class="o">=</span> <span class="n">BasicBlock</span><span class="o">::</span><span class="n">Create</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">(),</span> <span class="s">"entry"</span><span class="p">,</span> <span class="n">TheFunction</span><span class="p">);</span>
+<span class="n">Builder</span><span class="p">.</span><span class="n">SetInsertPoint</span><span class="p">(</span><span class="n">BB</span><span class="p">);</span>
+
+<span class="k">if</span> <span class="p">(</span><span class="n">Value</span> <span class="o">*</span><span class="n">RetVal</span> <span class="o">=</span> <span class="n">Body</span><span class="o">-></span><span class="n">Codegen</span><span class="p">())</span> <span class="p">{</span>
+</pre></div>
+</div>
+<p>Now we get to the point where the <tt class="docutils literal"><span class="pre">Builder</span></tt> is set up. The first line
+creates a new <a class="reference external" href="http://en.wikipedia.org/wiki/Basic_block">basic block</a>
+(named “entry”), which is inserted into <tt class="docutils literal"><span class="pre">TheFunction</span></tt>. The second line
+then tells the builder that new instructions should be inserted into the
+end of the new basic block. Basic blocks in LLVM are an important part
+of functions that define the <a class="reference external" href="http://en.wikipedia.org/wiki/Control_flow_graph">Control Flow
+Graph</a>. Since we
+don’t have any control flow, our functions will only contain one block
+at this point. We’ll fix this in <a class="reference external" href="LangImpl5.html">Chapter 5</a> :).</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="k">if</span> <span class="p">(</span><span class="n">Value</span> <span class="o">*</span><span class="n">RetVal</span> <span class="o">=</span> <span class="n">Body</span><span class="o">-></span><span class="n">Codegen</span><span class="p">())</span> <span class="p">{</span>
+ <span class="c1">// Finish off the function.</span>
+ <span class="n">Builder</span><span class="p">.</span><span class="n">CreateRet</span><span class="p">(</span><span class="n">RetVal</span><span class="p">);</span>
+
+ <span class="c1">// Validate the generated code, checking for consistency.</span>
+ <span class="n">verifyFunction</span><span class="p">(</span><span class="o">*</span><span class="n">TheFunction</span><span class="p">);</span>
+
+ <span class="k">return</span> <span class="n">TheFunction</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>Once the insertion point is set up, we call the <tt class="docutils literal"><span class="pre">CodeGen()</span></tt> method for
+the root expression of the function. If no error happens, this emits
+code to compute the expression into the entry block and returns the
+value that was computed. Assuming no error, we then create an LLVM <a class="reference external" href="../LangRef.html#i_ret">ret
+instruction</a>, which completes the function.
+Once the function is built, we call <tt class="docutils literal"><span class="pre">verifyFunction</span></tt>, which is
+provided by LLVM. This function does a variety of consistency checks on
+the generated code, to determine if our compiler is doing everything
+right. Using this is important: it can catch a lot of bugs. Once the
+function is finished and validated, we return it.</p>
+<div class="highlight-c++"><div class="highlight"><pre> <span class="c1">// Error reading body, remove function.</span>
+ <span class="n">TheFunction</span><span class="o">-></span><span class="n">eraseFromParent</span><span class="p">();</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p>The only piece left here is handling of the error case. For simplicity,
+we handle this by merely deleting the function we produced with the
+<tt class="docutils literal"><span class="pre">eraseFromParent</span></tt> method. This allows the user to redefine a function
+that they incorrectly typed in before: if we didn’t delete it, it would
+live in the symbol table, with a body, preventing future redefinition.</p>
+<p>This code does have a bug, though. Since the <tt class="docutils literal"><span class="pre">PrototypeAST::Codegen</span></tt>
+can return a previously defined forward declaration, our code can
+actually delete a forward declaration. There are a number of ways to fix
+this bug, see what you can come up with! Here is a testcase:</p>
+<div class="highlight-python"><div class="highlight"><pre>extern foo(a b); # ok, defines foo.
+def foo(a b) c; # error, 'c' is invalid.
+def bar() foo(1, 2); # error, unknown function "foo"
+</pre></div>
+</div>
+</div>
+<div class="section" id="driver-changes-and-closing-thoughts">
+<h2><a class="toc-backref" href="#id5">3.5. Driver Changes and Closing Thoughts</a><a class="headerlink" href="#driver-changes-and-closing-thoughts" title="Permalink to this headline">¶</a></h2>
+<p>For now, code generation to LLVM doesn’t really get us much, except that
+we can look at the pretty IR calls. The sample code inserts calls to
+Codegen into the “<tt class="docutils literal"><span class="pre">HandleDefinition</span></tt>”, “<tt class="docutils literal"><span class="pre">HandleExtern</span></tt>” etc
+functions, and then dumps out the LLVM IR. This gives a nice way to look
+at the LLVM IR for simple functions. For example:</p>
+<div class="highlight-python"><div class="highlight"><pre>ready> 4+5;
+Read top-level expression:
+define double @0() {
+entry:
+ ret double 9.000000e+00
+}
+</pre></div>
+</div>
+<p>Note how the parser turns the top-level expression into anonymous
+functions for us. This will be handy when we add <a class="reference external" href="LangImpl4.html#jit">JIT
+support</a> in the next chapter. Also note that the
+code is very literally transcribed, no optimizations are being performed
+except simple constant folding done by IRBuilder. We will <a class="reference external" href="LangImpl4.html#trivialconstfold">add
+optimizations</a> explicitly in the next
+chapter.</p>
+<div class="highlight-python"><div class="highlight"><pre>ready> def foo(a b) a*a + 2*a*b + b*b;
+Read function definition:
+define double @foo(double %a, double %b) {
+entry:
+ %multmp = fmul double %a, %a
+ %multmp1 = fmul double 2.000000e+00, %a
+ %multmp2 = fmul double %multmp1, %b
+ %addtmp = fadd double %multmp, %multmp2
+ %multmp3 = fmul double %b, %b
+ %addtmp4 = fadd double %addtmp, %multmp3
+ ret double %addtmp4
+}
+</pre></div>
+</div>
+<p>This shows some simple arithmetic. Notice the striking similarity to the
+LLVM builder calls that we use to create the instructions.</p>
+<div class="highlight-python"><div class="highlight"><pre>ready> def bar(a) foo(a, 4.0) + bar(31337);
+Read function definition:
+define double @bar(double %a) {
+entry:
+ %calltmp = call double @foo(double %a, double 4.000000e+00)
+ %calltmp1 = call double @bar(double 3.133700e+04)
+ %addtmp = fadd double %calltmp, %calltmp1
+ ret double %addtmp
+}
+</pre></div>
+</div>
+<p>This shows some function calls. Note that this function will take a long
+time to execute if you call it. In the future we’ll add conditional
+control flow to actually make recursion useful :).</p>
+<div class="highlight-python"><div class="highlight"><pre>ready> extern cos(x);
+Read extern:
+declare double @cos(double)
+
+ready> cos(1.234);
+Read top-level expression:
+define double @1() {
+entry:
+ %calltmp = call double @cos(double 1.234000e+00)
+ ret double %calltmp
+}
+</pre></div>
+</div>
+<p>This shows an extern for the libm “cos” function, and a call to it.</p>
+<div class="highlight-python"><div class="highlight"><pre>ready> ^D
+; ModuleID = 'my cool jit'
+
+define double @0() {
+entry:
+ %addtmp = fadd double 4.000000e+00, 5.000000e+00
+ ret double %addtmp
+}
+
+define double @foo(double %a, double %b) {
+entry:
+ %multmp = fmul double %a, %a
+ %multmp1 = fmul double 2.000000e+00, %a
+ %multmp2 = fmul double %multmp1, %b
+ %addtmp = fadd double %multmp, %multmp2
+ %multmp3 = fmul double %b, %b
+ %addtmp4 = fadd double %addtmp, %multmp3
+ ret double %addtmp4
+}
+
+define double @bar(double %a) {
+entry:
+ %calltmp = call double @foo(double %a, double 4.000000e+00)
+ %calltmp1 = call double @bar(double 3.133700e+04)
+ %addtmp = fadd double %calltmp, %calltmp1
+ ret double %addtmp
+}
+
+declare double @cos(double)
+
+define double @1() {
+entry:
+ %calltmp = call double @cos(double 1.234000e+00)
+ ret double %calltmp
+}
+</pre></div>
+</div>
+<p>When you quit the current demo, it dumps out the IR for the entire
+module generated. Here you can see the big picture with all the
+functions referencing each other.</p>
+<p>This wraps up the third chapter of the Kaleidoscope tutorial. Up next,
+we’ll describe how to <a class="reference external" href="LangImpl4.html">add JIT codegen and optimizer
+support</a> to this so we can actually start running
+code!</p>
+</div>
+<div class="section" id="full-code-listing">
+<h2><a class="toc-backref" href="#id6">3.6. Full Code Listing</a><a class="headerlink" href="#full-code-listing" title="Permalink to this headline">¶</a></h2>
+<p>Here is the complete code listing for our running example, enhanced with
+the LLVM code generator. Because this uses the LLVM libraries, we need
+to link them in. To do this, we use the
+<a class="reference external" href="http://llvm.org/cmds/llvm-config.html">llvm-config</a> tool to inform
+our makefile/command line about which options to use:</p>
+<div class="highlight-bash"><div class="highlight"><pre><span class="c"># Compile</span>
+clang++ -g -O3 toy.cpp <span class="sb">`</span>llvm-config --cxxflags --ldflags --system-libs --libs core<span class="sb">`</span> -o toy
+<span class="c"># Run</span>
+./toy
+</pre></div>
+</div>
+<p>Here is the code:</p>
+<div class="highlight-c++"><div class="highlight"><pre><span class="cp">#include "llvm/IR/Verifier.h"</span>
+<span class="cp">#include "llvm/IR/DerivedTypes.h"</span>
+<span class="cp">#include "llvm/IR/IRBuilder.h"</span>
+<span class="cp">#include "llvm/IR/LLVMContext.h"</span>
+<span class="cp">#include "llvm/IR/Module.h"</span>
+<span class="cp">#include <cctype></span>
+<span class="cp">#include <cstdio></span>
+<span class="cp">#include <map></span>
+<span class="cp">#include <string></span>
+<span class="cp">#include <vector></span>
+<span class="k">using</span> <span class="k">namespace</span> <span class="n">llvm</span><span class="p">;</span>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// Lexer</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+
+<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="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>
+
+<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>
+
+ <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>
+
+ <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>
+
+ <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>
+
+ <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>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// Abstract Syntax Tree (aka Parse Tree)</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="k">namespace</span> <span class="p">{</span>
+<span class="c1">/// ExprAST - Base class for all expression nodes.</span>
+<span class="k">class</span> <span class="nc">ExprAST</span> <span class="p">{</span>
+<span class="nl">public:</span>
+ <span class="k">virtual</span> <span class="o">~</span><span class="n">ExprAST</span><span class="p">()</span> <span class="p">{}</span>
+ <span class="k">virtual</span> <span class="n">Value</span> <span class="o">*</span><span class="n">Codegen</span><span class="p">()</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">};</span>
+
+<span class="c1">/// NumberExprAST - Expression class for numeric literals like "1.0".</span>
+<span class="k">class</span> <span class="nc">NumberExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+ <span class="kt">double</span> <span class="n">Val</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">NumberExprAST</span><span class="p">(</span><span class="kt">double</span> <span class="n">val</span><span class="p">)</span> <span class="o">:</span> <span class="n">Val</span><span class="p">(</span><span class="n">val</span><span class="p">)</span> <span class="p">{}</span>
+ <span class="n">Value</span> <span class="o">*</span><span class="n">Codegen</span><span class="p">()</span> <span class="n">override</span><span class="p">;</span>
+<span class="p">};</span>
+
+<span class="c1">/// VariableExprAST - Expression class for referencing a variable, like "a".</span>
+<span class="k">class</span> <span class="nc">VariableExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">Name</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">VariableExprAST</span><span class="p">(</span><span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="o">&</span><span class="n">name</span><span class="p">)</span> <span class="o">:</span> <span class="n">Name</span><span class="p">(</span><span class="n">name</span><span class="p">)</span> <span class="p">{}</span>
+ <span class="n">Value</span> <span class="o">*</span><span class="n">Codegen</span><span class="p">()</span> <span class="n">override</span><span class="p">;</span>
+<span class="p">};</span>
+
+<span class="c1">/// BinaryExprAST - Expression class for a binary operator.</span>
+<span class="k">class</span> <span class="nc">BinaryExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+ <span class="kt">char</span> <span class="n">Op</span><span class="p">;</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">LHS</span><span class="p">,</span> <span class="o">*</span><span class="n">RHS</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">BinaryExprAST</span><span class="p">(</span><span class="kt">char</span> <span class="n">op</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">lhs</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">rhs</span><span class="p">)</span>
+ <span class="o">:</span> <span class="n">Op</span><span class="p">(</span><span class="n">op</span><span class="p">),</span> <span class="n">LHS</span><span class="p">(</span><span class="n">lhs</span><span class="p">),</span> <span class="n">RHS</span><span class="p">(</span><span class="n">rhs</span><span class="p">)</span> <span class="p">{}</span>
+ <span class="n">Value</span> <span class="o">*</span><span class="n">Codegen</span><span class="p">()</span> <span class="n">override</span><span class="p">;</span>
+<span class="p">};</span>
+
+<span class="c1">/// CallExprAST - Expression class for function calls.</span>
+<span class="k">class</span> <span class="nc">CallExprAST</span> <span class="o">:</span> <span class="k">public</span> <span class="n">ExprAST</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">Callee</span><span class="p">;</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">ExprAST</span><span class="o">*></span> <span class="n">Args</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">CallExprAST</span><span class="p">(</span><span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="o">&</span><span class="n">callee</span><span class="p">,</span> <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">ExprAST</span><span class="o">*></span> <span class="o">&</span><span class="n">args</span><span class="p">)</span>
+ <span class="o">:</span> <span class="n">Callee</span><span class="p">(</span><span class="n">callee</span><span class="p">),</span> <span class="n">Args</span><span class="p">(</span><span class="n">args</span><span class="p">)</span> <span class="p">{}</span>
+ <span class="n">Value</span> <span class="o">*</span><span class="n">Codegen</span><span class="p">()</span> <span class="n">override</span><span class="p">;</span>
+<span class="p">};</span>
+
+<span class="c1">/// PrototypeAST - This class represents the "prototype" for a function,</span>
+<span class="c1">/// which captures its name, and its argument names (thus implicitly the number</span>
+<span class="c1">/// of arguments the function takes).</span>
+<span class="k">class</span> <span class="nc">PrototypeAST</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">Name</span><span class="p">;</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span> <span class="n">Args</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">PrototypeAST</span><span class="p">(</span><span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="o">&</span><span class="n">name</span><span class="p">,</span> <span class="k">const</span> <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span> <span class="o">&</span><span class="n">args</span><span class="p">)</span>
+ <span class="o">:</span> <span class="n">Name</span><span class="p">(</span><span class="n">name</span><span class="p">),</span> <span class="n">Args</span><span class="p">(</span><span class="n">args</span><span class="p">)</span> <span class="p">{}</span>
+
+ <span class="n">Function</span> <span class="o">*</span><span class="n">Codegen</span><span class="p">();</span>
+<span class="p">};</span>
+
+<span class="c1">/// FunctionAST - This class represents a function definition itself.</span>
+<span class="k">class</span> <span class="nc">FunctionAST</span> <span class="p">{</span>
+ <span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">Proto</span><span class="p">;</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">Body</span><span class="p">;</span>
+<span class="nl">public:</span>
+ <span class="n">FunctionAST</span><span class="p">(</span><span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">proto</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">body</span><span class="p">)</span>
+ <span class="o">:</span> <span class="n">Proto</span><span class="p">(</span><span class="n">proto</span><span class="p">),</span> <span class="n">Body</span><span class="p">(</span><span class="n">body</span><span class="p">)</span> <span class="p">{}</span>
+
+ <span class="n">Function</span> <span class="o">*</span><span class="n">Codegen</span><span class="p">();</span>
+<span class="p">};</span>
+<span class="p">}</span> <span class="c1">// end anonymous namespace</span>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// Parser</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+
+<span class="c1">/// CurTok/getNextToken - Provide a simple token buffer. CurTok is the current</span>
+<span class="c1">/// token the parser is looking at. getNextToken reads another token from the</span>
+<span class="c1">/// lexer and updates CurTok with its results.</span>
+<span class="k">static</span> <span class="kt">int</span> <span class="n">CurTok</span><span class="p">;</span>
+<span class="k">static</span> <span class="kt">int</span> <span class="nf">getNextToken</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">return</span> <span class="n">CurTok</span> <span class="o">=</span> <span class="n">gettok</span><span class="p">();</span>
+<span class="p">}</span>
+
+<span class="c1">/// BinopPrecedence - This holds the precedence for each binary operator that is</span>
+<span class="c1">/// defined.</span>
+<span class="k">static</span> <span class="n">std</span><span class="o">::</span><span class="n">map</span><span class="o"><</span><span class="kt">char</span><span class="p">,</span> <span class="kt">int</span><span class="o">></span> <span class="n">BinopPrecedence</span><span class="p">;</span>
+
+<span class="c1">/// GetTokPrecedence - Get the precedence of the pending binary operator token.</span>
+<span class="k">static</span> <span class="kt">int</span> <span class="nf">GetTokPrecedence</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">isascii</span><span class="p">(</span><span class="n">CurTok</span><span class="p">))</span>
+ <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span>
+
+ <span class="c1">// Make sure it's a declared binop.</span>
+ <span class="kt">int</span> <span class="n">TokPrec</span> <span class="o">=</span> <span class="n">BinopPrecedence</span><span class="p">[</span><span class="n">CurTok</span><span class="p">];</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">TokPrec</span> <span class="o"><=</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="o">-</span><span class="mi">1</span><span class="p">;</span>
+ <span class="k">return</span> <span class="n">TokPrec</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">/// Error* - These are little helper functions for error handling.</span>
+<span class="n">ExprAST</span> <span class="o">*</span><span class="nf">Error</span><span class="p">(</span><span class="k">const</span> <span class="kt">char</span> <span class="o">*</span><span class="n">Str</span><span class="p">)</span> <span class="p">{</span> <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"Error: %s</span><span class="se">\n</span><span class="s">"</span><span class="p">,</span> <span class="n">Str</span><span class="p">);</span><span class="k">return</span> <span class="mi">0</span><span class="p">;}</span>
+<span class="n">PrototypeAST</span> <span class="o">*</span><span class="nf">ErrorP</span><span class="p">(</span><span class="k">const</span> <span class="kt">char</span> <span class="o">*</span><span class="n">Str</span><span class="p">)</span> <span class="p">{</span> <span class="n">Error</span><span class="p">(</span><span class="n">Str</span><span class="p">);</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> <span class="p">}</span>
+<span class="n">FunctionAST</span> <span class="o">*</span><span class="nf">ErrorF</span><span class="p">(</span><span class="k">const</span> <span class="kt">char</span> <span class="o">*</span><span class="n">Str</span><span class="p">)</span> <span class="p">{</span> <span class="n">Error</span><span class="p">(</span><span class="n">Str</span><span class="p">);</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> <span class="p">}</span>
+
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseExpression</span><span class="p">();</span>
+
+<span class="c1">/// identifierexpr</span>
+<span class="c1">/// ::= identifier</span>
+<span class="c1">/// ::= identifier '(' expression* ')'</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseIdentifierExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">IdName</span> <span class="o">=</span> <span class="n">IdentifierStr</span><span class="p">;</span>
+
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat identifier.</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">'('</span><span class="p">)</span> <span class="c1">// Simple variable ref.</span>
+ <span class="k">return</span> <span class="k">new</span> <span class="n">VariableExprAST</span><span class="p">(</span><span class="n">IdName</span><span class="p">);</span>
+
+ <span class="c1">// Call.</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat (</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">ExprAST</span><span class="o">*></span> <span class="n">Args</span><span class="p">;</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">')'</span><span class="p">)</span> <span class="p">{</span>
+ <span class="k">while</span> <span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">Arg</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">Arg</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="n">Args</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">Arg</span><span class="p">);</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">==</span> <span class="sc">')'</span><span class="p">)</span> <span class="k">break</span><span class="p">;</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">','</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">Error</span><span class="p">(</span><span class="s">"Expected ')' or ',' in argument list"</span><span class="p">);</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+ <span class="p">}</span>
+ <span class="p">}</span>
+
+ <span class="c1">// Eat the ')'.</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+
+ <span class="k">return</span> <span class="k">new</span> <span class="n">CallExprAST</span><span class="p">(</span><span class="n">IdName</span><span class="p">,</span> <span class="n">Args</span><span class="p">);</span>
+<span class="p">}</span>
+
+<span class="c1">/// numberexpr ::= number</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseNumberExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">Result</span> <span class="o">=</span> <span class="k">new</span> <span class="n">NumberExprAST</span><span class="p">(</span><span class="n">NumVal</span><span class="p">);</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// consume the number</span>
+ <span class="k">return</span> <span class="n">Result</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">/// parenexpr ::= '(' expression ')'</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseParenExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat (.</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">V</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">V</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">')'</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">Error</span><span class="p">(</span><span class="s">"expected ')'"</span><span class="p">);</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat ).</span>
+ <span class="k">return</span> <span class="n">V</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">/// primary</span>
+<span class="c1">/// ::= identifierexpr</span>
+<span class="c1">/// ::= numberexpr</span>
+<span class="c1">/// ::= parenexpr</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParsePrimary</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">switch</span> <span class="p">(</span><span class="n">CurTok</span><span class="p">)</span> <span class="p">{</span>
+ <span class="nl">default:</span> <span class="k">return</span> <span class="n">Error</span><span class="p">(</span><span class="s">"unknown token when expecting an expression"</span><span class="p">);</span>
+ <span class="k">case</span> <span class="n">tok_identifier</span>: <span class="k">return</span> <span class="n">ParseIdentifierExpr</span><span class="p">();</span>
+ <span class="k">case</span> <span class="n">tok_number</span>: <span class="k">return</span> <span class="n">ParseNumberExpr</span><span class="p">();</span>
+ <span class="k">case</span> <span class="sc">'('</span>: <span class="k">return</span> <span class="n">ParseParenExpr</span><span class="p">();</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="c1">/// binoprhs</span>
+<span class="c1">/// ::= ('+' primary)*</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseBinOpRHS</span><span class="p">(</span><span class="kt">int</span> <span class="n">ExprPrec</span><span class="p">,</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="n">LHS</span><span class="p">)</span> <span class="p">{</span>
+ <span class="c1">// If this is a binop, find its precedence.</span>
+ <span class="k">while</span> <span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
+ <span class="kt">int</span> <span class="n">TokPrec</span> <span class="o">=</span> <span class="n">GetTokPrecedence</span><span class="p">();</span>
+
+ <span class="c1">// If this is a binop that binds at least as tightly as the current binop,</span>
+ <span class="c1">// consume it, otherwise we are done.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">TokPrec</span> <span class="o"><</span> <span class="n">ExprPrec</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">LHS</span><span class="p">;</span>
+
+ <span class="c1">// Okay, we know this is a binop.</span>
+ <span class="kt">int</span> <span class="n">BinOp</span> <span class="o">=</span> <span class="n">CurTok</span><span class="p">;</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat binop</span>
+
+ <span class="c1">// Parse the primary expression after the binary operator.</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">RHS</span> <span class="o">=</span> <span class="n">ParsePrimary</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">RHS</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="c1">// If BinOp binds less tightly with RHS than the operator after RHS, let</span>
+ <span class="c1">// the pending operator take RHS as its LHS.</span>
+ <span class="kt">int</span> <span class="n">NextPrec</span> <span class="o">=</span> <span class="n">GetTokPrecedence</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">TokPrec</span> <span class="o"><</span> <span class="n">NextPrec</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">RHS</span> <span class="o">=</span> <span class="n">ParseBinOpRHS</span><span class="p">(</span><span class="n">TokPrec</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span> <span class="n">RHS</span><span class="p">);</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">RHS</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="p">}</span>
+
+ <span class="c1">// Merge LHS/RHS.</span>
+ <span class="n">LHS</span> <span class="o">=</span> <span class="k">new</span> <span class="n">BinaryExprAST</span><span class="p">(</span><span class="n">BinOp</span><span class="p">,</span> <span class="n">LHS</span><span class="p">,</span> <span class="n">RHS</span><span class="p">);</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="c1">/// expression</span>
+<span class="c1">/// ::= primary binoprhs</span>
+<span class="c1">///</span>
+<span class="k">static</span> <span class="n">ExprAST</span> <span class="o">*</span><span class="nf">ParseExpression</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">ExprAST</span> <span class="o">*</span><span class="n">LHS</span> <span class="o">=</span> <span class="n">ParsePrimary</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">LHS</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="k">return</span> <span class="n">ParseBinOpRHS</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">LHS</span><span class="p">);</span>
+<span class="p">}</span>
+
+<span class="c1">/// prototype</span>
+<span class="c1">/// ::= id '(' id* ')'</span>
+<span class="k">static</span> <span class="n">PrototypeAST</span> <span class="o">*</span><span class="nf">ParsePrototype</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="n">tok_identifier</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">ErrorP</span><span class="p">(</span><span class="s">"Expected function name in prototype"</span><span class="p">);</span>
+
+ <span class="n">std</span><span class="o">::</span><span class="n">string</span> <span class="n">FnName</span> <span class="o">=</span> <span class="n">IdentifierStr</span><span class="p">;</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">'('</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">ErrorP</span><span class="p">(</span><span class="s">"Expected '(' in prototype"</span><span class="p">);</span>
+
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span> <span class="n">ArgNames</span><span class="p">;</span>
+ <span class="k">while</span> <span class="p">(</span><span class="n">getNextToken</span><span class="p">()</span> <span class="o">==</span> <span class="n">tok_identifier</span><span class="p">)</span>
+ <span class="n">ArgNames</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">IdentifierStr</span><span class="p">);</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CurTok</span> <span class="o">!=</span> <span class="sc">')'</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">ErrorP</span><span class="p">(</span><span class="s">"Expected ')' in prototype"</span><span class="p">);</span>
+
+ <span class="c1">// success.</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat ')'.</span>
+
+ <span class="k">return</span> <span class="k">new</span> <span class="n">PrototypeAST</span><span class="p">(</span><span class="n">FnName</span><span class="p">,</span> <span class="n">ArgNames</span><span class="p">);</span>
+<span class="p">}</span>
+
+<span class="c1">/// definition ::= 'def' prototype expression</span>
+<span class="k">static</span> <span class="n">FunctionAST</span> <span class="o">*</span><span class="nf">ParseDefinition</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat def.</span>
+ <span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">Proto</span> <span class="o">=</span> <span class="n">ParsePrototype</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">Proto</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">ExprAST</span> <span class="o">*</span><span class="n">E</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">())</span>
+ <span class="k">return</span> <span class="k">new</span> <span class="n">FunctionAST</span><span class="p">(</span><span class="n">Proto</span><span class="p">,</span> <span class="n">E</span><span class="p">);</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">/// toplevelexpr ::= expression</span>
+<span class="k">static</span> <span class="n">FunctionAST</span> <span class="o">*</span><span class="nf">ParseTopLevelExpr</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">ExprAST</span> <span class="o">*</span><span class="n">E</span> <span class="o">=</span> <span class="n">ParseExpression</span><span class="p">())</span> <span class="p">{</span>
+ <span class="c1">// Make an anonymous proto.</span>
+ <span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">Proto</span> <span class="o">=</span> <span class="k">new</span> <span class="n">PrototypeAST</span><span class="p">(</span><span class="s">""</span><span class="p">,</span> <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="o">></span><span class="p">());</span>
+ <span class="k">return</span> <span class="k">new</span> <span class="n">FunctionAST</span><span class="p">(</span><span class="n">Proto</span><span class="p">,</span> <span class="n">E</span><span class="p">);</span>
+ <span class="p">}</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">/// external ::= 'extern' prototype</span>
+<span class="k">static</span> <span class="n">PrototypeAST</span> <span class="o">*</span><span class="nf">ParseExtern</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">getNextToken</span><span class="p">();</span> <span class="c1">// eat extern.</span>
+ <span class="k">return</span> <span class="n">ParsePrototype</span><span class="p">();</span>
+<span class="p">}</span>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// Code Generation</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+
+<span class="k">static</span> <span class="n">Module</span> <span class="o">*</span><span class="n">TheModule</span><span class="p">;</span>
+<span class="k">static</span> <span class="n">IRBuilder</span><span class="o"><></span> <span class="n">Builder</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">());</span>
+<span class="k">static</span> <span class="n">std</span><span class="o">::</span><span class="n">map</span><span class="o"><</span><span class="n">std</span><span class="o">::</span><span class="n">string</span><span class="p">,</span> <span class="n">Value</span><span class="o">*></span> <span class="n">NamedValues</span><span class="p">;</span>
+
+<span class="n">Value</span> <span class="o">*</span><span class="nf">ErrorV</span><span class="p">(</span><span class="k">const</span> <span class="kt">char</span> <span class="o">*</span><span class="n">Str</span><span class="p">)</span> <span class="p">{</span> <span class="n">Error</span><span class="p">(</span><span class="n">Str</span><span class="p">);</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> <span class="p">}</span>
+
+<span class="n">Value</span> <span class="o">*</span><span class="n">NumberExprAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">return</span> <span class="n">ConstantFP</span><span class="o">::</span><span class="n">get</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">(),</span> <span class="n">APFloat</span><span class="p">(</span><span class="n">Val</span><span class="p">));</span>
+<span class="p">}</span>
+
+<span class="n">Value</span> <span class="o">*</span><span class="n">VariableExprAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="c1">// Look this variable up in the function.</span>
+ <span class="n">Value</span> <span class="o">*</span><span class="n">V</span> <span class="o">=</span> <span class="n">NamedValues</span><span class="p">[</span><span class="n">Name</span><span class="p">];</span>
+ <span class="k">return</span> <span class="n">V</span> <span class="o">?</span> <span class="n">V</span> <span class="o">:</span> <span class="n">ErrorV</span><span class="p">(</span><span class="s">"Unknown variable name"</span><span class="p">);</span>
+<span class="p">}</span>
+
+<span class="n">Value</span> <span class="o">*</span><span class="n">BinaryExprAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">Value</span> <span class="o">*</span><span class="n">L</span> <span class="o">=</span> <span class="n">LHS</span><span class="o">-></span><span class="n">Codegen</span><span class="p">();</span>
+ <span class="n">Value</span> <span class="o">*</span><span class="n">R</span> <span class="o">=</span> <span class="n">RHS</span><span class="o">-></span><span class="n">Codegen</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">L</span> <span class="o">==</span> <span class="mi">0</span> <span class="o">||</span> <span class="n">R</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="k">switch</span> <span class="p">(</span><span class="n">Op</span><span class="p">)</span> <span class="p">{</span>
+ <span class="k">case</span> <span class="sc">'+'</span>: <span class="k">return</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateFAdd</span><span class="p">(</span><span class="n">L</span><span class="p">,</span> <span class="n">R</span><span class="p">,</span> <span class="s">"addtmp"</span><span class="p">);</span>
+ <span class="k">case</span> <span class="sc">'-'</span>: <span class="k">return</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateFSub</span><span class="p">(</span><span class="n">L</span><span class="p">,</span> <span class="n">R</span><span class="p">,</span> <span class="s">"subtmp"</span><span class="p">);</span>
+ <span class="k">case</span> <span class="sc">'*'</span>: <span class="k">return</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateFMul</span><span class="p">(</span><span class="n">L</span><span class="p">,</span> <span class="n">R</span><span class="p">,</span> <span class="s">"multmp"</span><span class="p">);</span>
+ <span class="k">case</span> <span class="sc">'<'</span>:
+ <span class="n">L</span> <span class="o">=</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateFCmpULT</span><span class="p">(</span><span class="n">L</span><span class="p">,</span> <span class="n">R</span><span class="p">,</span> <span class="s">"cmptmp"</span><span class="p">);</span>
+ <span class="c1">// Convert bool 0/1 to double 0.0 or 1.0</span>
+ <span class="k">return</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateUIToFP</span><span class="p">(</span><span class="n">L</span><span class="p">,</span> <span class="n">Type</span><span class="o">::</span><span class="n">getDoubleTy</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">()),</span>
+ <span class="s">"booltmp"</span><span class="p">);</span>
+ <span class="nl">default:</span> <span class="k">return</span> <span class="nf">ErrorV</span><span class="p">(</span><span class="s">"invalid binary operator"</span><span class="p">);</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="n">Value</span> <span class="o">*</span><span class="n">CallExprAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="c1">// Look up the name in the global module table.</span>
+ <span class="n">Function</span> <span class="o">*</span><span class="n">CalleeF</span> <span class="o">=</span> <span class="n">TheModule</span><span class="o">-></span><span class="n">getFunction</span><span class="p">(</span><span class="n">Callee</span><span class="p">);</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CalleeF</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span>
+ <span class="k">return</span> <span class="n">ErrorV</span><span class="p">(</span><span class="s">"Unknown function referenced"</span><span class="p">);</span>
+
+ <span class="c1">// If argument mismatch error.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">CalleeF</span><span class="o">-></span><span class="n">arg_size</span><span class="p">()</span> <span class="o">!=</span> <span class="n">Args</span><span class="p">.</span><span class="n">size</span><span class="p">())</span>
+ <span class="k">return</span> <span class="n">ErrorV</span><span class="p">(</span><span class="s">"Incorrect # arguments passed"</span><span class="p">);</span>
+
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">Value</span><span class="o">*></span> <span class="n">ArgsV</span><span class="p">;</span>
+ <span class="k">for</span> <span class="p">(</span><span class="kt">unsigned</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">,</span> <span class="n">e</span> <span class="o">=</span> <span class="n">Args</span><span class="p">.</span><span class="n">size</span><span class="p">();</span> <span class="n">i</span> <span class="o">!=</span> <span class="n">e</span><span class="p">;</span> <span class="o">++</span><span class="n">i</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">ArgsV</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">Args</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">-></span><span class="n">Codegen</span><span class="p">());</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">ArgsV</span><span class="p">.</span><span class="n">back</span><span class="p">()</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="p">}</span>
+
+ <span class="k">return</span> <span class="n">Builder</span><span class="p">.</span><span class="n">CreateCall</span><span class="p">(</span><span class="n">CalleeF</span><span class="p">,</span> <span class="n">ArgsV</span><span class="p">,</span> <span class="s">"calltmp"</span><span class="p">);</span>
+<span class="p">}</span>
+
+<span class="n">Function</span> <span class="o">*</span><span class="n">PrototypeAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="c1">// Make the function type: double(double,double) etc.</span>
+ <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o"><</span><span class="n">Type</span><span class="o">*></span> <span class="n">Doubles</span><span class="p">(</span><span class="n">Args</span><span class="p">.</span><span class="n">size</span><span class="p">(),</span>
+ <span class="n">Type</span><span class="o">::</span><span class="n">getDoubleTy</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">()));</span>
+ <span class="n">FunctionType</span> <span class="o">*</span><span class="n">FT</span> <span class="o">=</span> <span class="n">FunctionType</span><span class="o">::</span><span class="n">get</span><span class="p">(</span><span class="n">Type</span><span class="o">::</span><span class="n">getDoubleTy</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">()),</span>
+ <span class="n">Doubles</span><span class="p">,</span> <span class="nb">false</span><span class="p">);</span>
+
+ <span class="n">Function</span> <span class="o">*</span><span class="n">F</span> <span class="o">=</span> <span class="n">Function</span><span class="o">::</span><span class="n">Create</span><span class="p">(</span><span class="n">FT</span><span class="p">,</span> <span class="n">Function</span><span class="o">::</span><span class="n">ExternalLinkage</span><span class="p">,</span> <span class="n">Name</span><span class="p">,</span> <span class="n">TheModule</span><span class="p">);</span>
+
+ <span class="c1">// If F conflicted, there was already something named 'Name'. If it has a</span>
+ <span class="c1">// body, don't allow redefinition or reextern.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">F</span><span class="o">-></span><span class="n">getName</span><span class="p">()</span> <span class="o">!=</span> <span class="n">Name</span><span class="p">)</span> <span class="p">{</span>
+ <span class="c1">// Delete the one we just made and get the existing one.</span>
+ <span class="n">F</span><span class="o">-></span><span class="n">eraseFromParent</span><span class="p">();</span>
+ <span class="n">F</span> <span class="o">=</span> <span class="n">TheModule</span><span class="o">-></span><span class="n">getFunction</span><span class="p">(</span><span class="n">Name</span><span class="p">);</span>
+
+ <span class="c1">// If F already has a body, reject this.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">F</span><span class="o">-></span><span class="n">empty</span><span class="p">())</span> <span class="p">{</span>
+ <span class="n">ErrorF</span><span class="p">(</span><span class="s">"redefinition of function"</span><span class="p">);</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="p">}</span>
+
+ <span class="c1">// If F took a different number of args, reject.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">F</span><span class="o">-></span><span class="n">arg_size</span><span class="p">()</span> <span class="o">!=</span> <span class="n">Args</span><span class="p">.</span><span class="n">size</span><span class="p">())</span> <span class="p">{</span>
+ <span class="n">ErrorF</span><span class="p">(</span><span class="s">"redefinition of function with different # args"</span><span class="p">);</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="p">}</span>
+ <span class="p">}</span>
+
+ <span class="c1">// Set names for all arguments.</span>
+ <span class="kt">unsigned</span> <span class="n">Idx</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span>
+ <span class="k">for</span> <span class="p">(</span><span class="n">Function</span><span class="o">::</span><span class="n">arg_iterator</span> <span class="n">AI</span> <span class="o">=</span> <span class="n">F</span><span class="o">-></span><span class="n">arg_begin</span><span class="p">();</span> <span class="n">Idx</span> <span class="o">!=</span> <span class="n">Args</span><span class="p">.</span><span class="n">size</span><span class="p">();</span>
+ <span class="o">++</span><span class="n">AI</span><span class="p">,</span> <span class="o">++</span><span class="n">Idx</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">AI</span><span class="o">-></span><span class="n">setName</span><span class="p">(</span><span class="n">Args</span><span class="p">[</span><span class="n">Idx</span><span class="p">]);</span>
+
+ <span class="c1">// Add arguments to variable symbol table.</span>
+ <span class="n">NamedValues</span><span class="p">[</span><span class="n">Args</span><span class="p">[</span><span class="n">Idx</span><span class="p">]]</span> <span class="o">=</span> <span class="n">AI</span><span class="p">;</span>
+ <span class="p">}</span>
+
+ <span class="k">return</span> <span class="n">F</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="n">Function</span> <span class="o">*</span><span class="n">FunctionAST</span><span class="o">::</span><span class="n">Codegen</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">NamedValues</span><span class="p">.</span><span class="n">clear</span><span class="p">();</span>
+
+ <span class="n">Function</span> <span class="o">*</span><span class="n">TheFunction</span> <span class="o">=</span> <span class="n">Proto</span><span class="o">-></span><span class="n">Codegen</span><span class="p">();</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">TheFunction</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+
+ <span class="c1">// Create a new basic block to start insertion into.</span>
+ <span class="n">BasicBlock</span> <span class="o">*</span><span class="n">BB</span> <span class="o">=</span> <span class="n">BasicBlock</span><span class="o">::</span><span class="n">Create</span><span class="p">(</span><span class="n">getGlobalContext</span><span class="p">(),</span> <span class="s">"entry"</span><span class="p">,</span> <span class="n">TheFunction</span><span class="p">);</span>
+ <span class="n">Builder</span><span class="p">.</span><span class="n">SetInsertPoint</span><span class="p">(</span><span class="n">BB</span><span class="p">);</span>
+
+ <span class="k">if</span> <span class="p">(</span><span class="n">Value</span> <span class="o">*</span><span class="n">RetVal</span> <span class="o">=</span> <span class="n">Body</span><span class="o">-></span><span class="n">Codegen</span><span class="p">())</span> <span class="p">{</span>
+ <span class="c1">// Finish off the function.</span>
+ <span class="n">Builder</span><span class="p">.</span><span class="n">CreateRet</span><span class="p">(</span><span class="n">RetVal</span><span class="p">);</span>
+
+ <span class="c1">// Validate the generated code, checking for consistency.</span>
+ <span class="n">verifyFunction</span><span class="p">(</span><span class="o">*</span><span class="n">TheFunction</span><span class="p">);</span>
+
+ <span class="k">return</span> <span class="n">TheFunction</span><span class="p">;</span>
+ <span class="p">}</span>
+
+ <span class="c1">// Error reading body, remove function.</span>
+ <span class="n">TheFunction</span><span class="o">-></span><span class="n">eraseFromParent</span><span class="p">();</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// Top-Level parsing and JIT Driver</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+
+<span class="k">static</span> <span class="kt">void</span> <span class="n">HandleDefinition</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">FunctionAST</span> <span class="o">*</span><span class="n">F</span> <span class="o">=</span> <span class="n">ParseDefinition</span><span class="p">())</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">Function</span> <span class="o">*</span><span class="n">LF</span> <span class="o">=</span> <span class="n">F</span><span class="o">-></span><span class="n">Codegen</span><span class="p">())</span> <span class="p">{</span>
+ <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"Read function definition:"</span><span class="p">);</span>
+ <span class="n">LF</span><span class="o">-></span><span class="n">dump</span><span class="p">();</span>
+ <span class="p">}</span>
+ <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
+ <span class="c1">// Skip token for error recovery.</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="k">static</span> <span class="kt">void</span> <span class="n">HandleExtern</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">PrototypeAST</span> <span class="o">*</span><span class="n">P</span> <span class="o">=</span> <span class="n">ParseExtern</span><span class="p">())</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">Function</span> <span class="o">*</span><span class="n">F</span> <span class="o">=</span> <span class="n">P</span><span class="o">-></span><span class="n">Codegen</span><span class="p">())</span> <span class="p">{</span>
+ <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"Read extern: "</span><span class="p">);</span>
+ <span class="n">F</span><span class="o">-></span><span class="n">dump</span><span class="p">();</span>
+ <span class="p">}</span>
+ <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
+ <span class="c1">// Skip token for error recovery.</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="k">static</span> <span class="kt">void</span> <span class="n">HandleTopLevelExpression</span><span class="p">()</span> <span class="p">{</span>
+ <span class="c1">// Evaluate a top-level expression into an anonymous function.</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">FunctionAST</span> <span class="o">*</span><span class="n">F</span> <span class="o">=</span> <span class="n">ParseTopLevelExpr</span><span class="p">())</span> <span class="p">{</span>
+ <span class="k">if</span> <span class="p">(</span><span class="n">Function</span> <span class="o">*</span><span class="n">LF</span> <span class="o">=</span> <span class="n">F</span><span class="o">-></span><span class="n">Codegen</span><span class="p">())</span> <span class="p">{</span>
+ <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"Read top-level expression:"</span><span class="p">);</span>
+ <span class="n">LF</span><span class="o">-></span><span class="n">dump</span><span class="p">();</span>
+ <span class="p">}</span>
+ <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
+ <span class="c1">// Skip token for error recovery.</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="c1">/// top ::= definition | external | expression | ';'</span>
+<span class="k">static</span> <span class="kt">void</span> <span class="n">MainLoop</span><span class="p">()</span> <span class="p">{</span>
+ <span class="k">while</span> <span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"ready> "</span><span class="p">);</span>
+ <span class="k">switch</span> <span class="p">(</span><span class="n">CurTok</span><span class="p">)</span> <span class="p">{</span>
+ <span class="k">case</span> <span class="n">tok_eof</span>: <span class="k">return</span><span class="p">;</span>
+ <span class="k">case</span> <span class="sc">';'</span>: <span class="n">getNextToken</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span> <span class="c1">// ignore top-level semicolons.</span>
+ <span class="k">case</span> <span class="n">tok_def</span>: <span class="n">HandleDefinition</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span>
+ <span class="k">case</span> <span class="n">tok_extern</span>: <span class="n">HandleExtern</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span>
+ <span class="nl">default:</span> <span class="n">HandleTopLevelExpression</span><span class="p">();</span> <span class="k">break</span><span class="p">;</span>
+ <span class="p">}</span>
+ <span class="p">}</span>
+<span class="p">}</span>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// "Library" functions that can be "extern'd" from user code.</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+
+<span class="c1">/// putchard - putchar that takes a double and returns 0.</span>
+<span class="k">extern</span> <span class="s">"C"</span>
+<span class="kt">double</span> <span class="n">putchard</span><span class="p">(</span><span class="kt">double</span> <span class="n">X</span><span class="p">)</span> <span class="p">{</span>
+ <span class="n">putchar</span><span class="p">((</span><span class="kt">char</span><span class="p">)</span><span class="n">X</span><span class="p">);</span>
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">}</span>
+
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+<span class="c1">// Main driver code.</span>
+<span class="c1">//===----------------------------------------------------------------------===//</span>
+
+<span class="kt">int</span> <span class="n">main</span><span class="p">()</span> <span class="p">{</span>
+ <span class="n">LLVMContext</span> <span class="o">&</span><span class="n">Context</span> <span class="o">=</span> <span class="n">getGlobalContext</span><span class="p">();</span>
+
+ <span class="c1">// Install standard binary operators.</span>
+ <span class="c1">// 1 is lowest precedence.</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'<'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">10</span><span class="p">;</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'+'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">20</span><span class="p">;</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'-'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">20</span><span class="p">;</span>
+ <span class="n">BinopPrecedence</span><span class="p">[</span><span class="sc">'*'</span><span class="p">]</span> <span class="o">=</span> <span class="mi">40</span><span class="p">;</span> <span class="c1">// highest.</span>
+
+ <span class="c1">// Prime the first token.</span>
+ <span class="n">fprintf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="s">"ready> "</span><span class="p">);</span>
+ <span class="n">getNextToken</span><span class="p">();</span>
+
+ <span class="c1">// Make the module, which holds all the code.</span>
+ <span class="n">TheModule</span> <span class="o">=</span> <span class="k">new</span> <span class="n">Module</span><span class="p">(</span><span class="s">"my cool jit"</span><span class="p">,</span> <span class="n">Context</span><span class="p">);</span>
+
+ <span class="c1">// Run the main "interpreter loop" now.</span>
+ <span class="n">MainLoop</span><span class="p">();</span>
+
+ <span class="c1">// Print out all of the generated code.</span>
+ <span class="n">TheModule</span><span class="o">-></span><span class="n">dump</span><span class="p">();</span>
+
+ <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
+<span class="p">}</span>
+</pre></div>
+</div>
+<p><a class="reference external" href="LangImpl4.html">Next: Adding JIT and Optimizer Support</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="LangImpl4.html" title="4. Kaleidoscope: Adding JIT and Optimizer Support"
+ >next</a> |</li>
+ <li class="right" >
+ <a href="LangImpl2.html" title="2. Kaleidoscope: Implementing a Parser and AST"
+ >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-2015, LLVM Project.
+ Last updated on 2015-08-31.
+ 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